Linear Planar 3-SAT is NP-complete, its reconfiguration is PSPACE-complete, and these results imply NP-completeness of bounded 2D connected multi-agent pathfinding and PSPACE-completeness of the unbounded version.
Yu, Intractability of optimal multirobot path planning on planar graphs, IEEE Robotics and Automation Letters 1 (1) (2015) 33–40
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.CC 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Linear Planar 3-SAT and Its Applications in Planning
Linear Planar 3-SAT is NP-complete, its reconfiguration is PSPACE-complete, and these results imply NP-completeness of bounded 2D connected multi-agent pathfinding and PSPACE-completeness of the unbounded version.