Uniform Robot Relocation Is Hard in only Two Directions Even Without Obstacles

Authors

David Caballero, The University of Texas Rio Grande Valley
Angel A. Cantu
Timothy Gomez
Austin Luchsinger
Robert Schweller, The University of Texas Rio Grande Valley
Tim Wylie, The University of Texas Rio Grande Valley

Document Type

Book

Publication Date

6-2023

Abstract

Given n robots contained within a square grid surrounded by four walls, we ask the question of whether it is possible to move a particular robot a to a particular grid location b by performing a sequence of global step operations in which all robots move one grid step in the same cardinal direction (if not blocked by a wall or other blocked robots). We show this problem is NP-complete when restricted to just two directions (south and west). This answers the simplest fundamental problem in uniform global unit tilt swarm robotics.

Comments

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

Reprints and Permissions

https://rdcu.be/djR0J

Recommended Citation

Caballero, D., Cantu, A.A., Gomez, T., Luchsinger, A., Schweller, R., Wylie, T. (2023). Uniform Robot Relocation Is Hard in only Two Directions Even Without Obstacles. In: Genova, D., Kari, J. (eds) Unconventional Computation and Natural Computation. UCNC 2023. Lecture Notes in Computer Science, vol 14003. Springer, Cham. https://doi.org/10.1007/978-3-031-34034-5_2

Publication Title

UCNC 2023. Lecture Notes in Computer Science, vol 14003

DOI

https://doi.org/10.1007/978-3-031-34034-5_2