| Summary: | Recent work has developed a theory of motion-planning gadgets, which are a useful tool for proving hardness for a variety of problems that can be thought of in terms of an agent navigating a dynamic environment. We introduce formal objects representing motion-planning gadgets, which we call gizmos, and ask which gizmos simulate each other—simulations between gizmos yield reductions between natural decision problems, so this has consequences for complexity.
We define several classes of gizmos, and prove that they are closed under simulation: gizmos with some property cannot simulate gizmos without it. For several of these classes, we also find a gizmo which can simulate every gizmo in the class; this is analogous to completeness for a complexity class. We consider gizmo simulation and prove unsimulability and universality in two restricted settings: planar simulation, where the simulation must embed in the plane without crossings, and input/output simulation, which is a model for fully deterministic settings. We mostly focus on simulations with finitely many gizmos and gizmos with finitely many states (called regular), but many of our results carry over to more exotic infinite gizmos.
|
|---|