Randolphs Robot Game is NP-hard!

DOI10.1016/J.ENDM.2006.06.062zbMath1134.68370OpenAlexW1997401612MaRDI QIDQ3439467

Birgit Engels, Tom Kamphans

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2006.06.062

zbMATH Keywords

NP-hardnessrobot navigationrobot swarms

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Artificial intelligence for robotics (68T40)

Related Items (4)

Generalized Pete's Pike is PSPACE-complete ⋮ Quell ⋮ Ricochet Robots Reloaded: A Case-Study in Multi-shot ASP Solving ⋮ Randolphs Robot Game is NP-hard!

Cites Work

• Randolphs Robot Game is NP-hard!
• Unnamed Item
• Unnamed Item

This page was built for publication: Randolphs Robot Game is NP-hard!