Computational complexity of motion planning of a robot through simple gadgets
© Erik D. Demaine, Isaac Grosof, Jayson Lynch, and Mikhail Rudoy; licensed under Creative Commons License CC-BY 9th International Conference on Fun with Algorithms (FUN 2018). We initiate a general theory for analyzing the complexity of motion planning of a single robot through a graph of "gadg...
Main Author: | Demaine, Erik (Author) |
---|---|
Format: | Article |
Language: | English |
Published: |
2021-11-08T17:42:14Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Toward a general complexity theory of motion planning: Characterizing which gadgets make games hard
by: Demaine, Erik D, et al.
Published: (2020) -
Coordinated motion planning: Reconfiguring a swarm of labeled robots with bounded stretch
by: Demaine, Erik
Published: (2021) -
A Framework for Inter-Gadget Communication and Profile-aware Gadget Rendering
by: Lu, Yu-Hua, et al.
Published: (2010) -
Walking through doors is hard, even without staircases: Proving PSPACE-hardness via planar assemblies of door gadgets
by: Ani, Joshua, et al.
Published: (2020) -
Classification of ROP gadgets
by: A. V. Vishnyakov
Published: (2018-10-01)