Document Open Access Logo

On the Parameterized Complexity of Motion Planning for Rectangular Robots

Authors Iyad Kanj , Salman Parsa

PDF
Thumbnail PDF

File

LIPIcs.SoCG.2024.65.pdf
  • Filesize: 0.74 MB
  • 15 pages

Document Identifiers

Author Details

Iyad Kanj
  • School of Computing, DePaul University, Chicago, IL, USA
Salman Parsa
  • School of Computing, DePaul University, Chicago, IL, USA

Funding

  • Kanj, Iyad: Supported by a Jarvis College of Computing and Digital Media Summer Stipend.

Cite AsGet BibTex

Iyad Kanj and Salman Parsa. On the Parameterized Complexity of Motion Planning for Rectangular Robots. In 40th International Symposium on Computational Geometry (SoCG 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 293, pp. 65:1-65:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.SoCG.2024.65

Abstract

We study computationally-hard fundamental motion planning problems where the goal is to translate k axis-aligned rectangular robots from their initial positions to their final positions without collision, and with the minimum number of translation moves. Our aim is to understand the interplay between the number of robots and the geometric complexity of the input instance measured by the input size, which is the number of bits needed to encode the coordinates of the rectangles' vertices. We focus on axis-aligned translations, and more generally, translations restricted to a given set of directions, and we study the two settings where the robots move in the free plane, and where they are confined to a bounding box. We also consider two modes of motion: serial and parallel. We obtain fixed-parameter tractable (FPT) algorithms parameterized by k for all the settings under consideration. In the case where the robots move serially (i.e., one in each time step) and axis-aligned, we prove a structural result stating that every problem instance admits an optimal solution in which the moves are along a grid, whose size is a function of k, that can be defined based on the input instance. This structural result implies that the problem is fixed-parameter tractable parameterized by k. We also consider the case in which the robots move in parallel (i.e., multiple robots can move during the same time step), and which falls under the category of Coordinated Motion Planning problems. Our techniques for the axis-aligned motion here differ from those for the case of serial motion. We employ a search tree approach and perform a careful examination of the relative geometric positions of the robots that allow us to reduce the problem to FPT-many Linear Programming instances, thus obtaining an FPT algorithm. Finally, we show that, when the robots move in the free plane, the FPT results for the serial motion case carry over to the case where the translations are restricted to any given set of directions.

Subject Classification

ACM Subject Classification
  • Theory of computation → Parameterized complexity and exact algorithms
Keywords
  • motion planning of rectangular robots
  • coordinated motion planing of rectangular robots
  • parameterized complexity

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Manuel Abellanas, Sergey Bereg, Ferran Hurtado, Alfredo García Olaverri, David Rappaport, and Javier Tejel. Moving coins. Computational Geometry, 34(1):35-48, 2006. Google Scholar
  2. Pankaj K. Agarwal, Dan Halperin, Micha Sharir, and Alex Steiger. Near-optimal min-sum motion planning for two square robots in a polygonal environment. arXiv preprint, 2023. URL: https://arxiv.org/abs/2310.20615.
  3. Marek Cygan, Fedor V. Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh. Parameterized Algorithms. Springer, 2015. Google Scholar
  4. Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Henk Meijer, and Christian Scheffer. Coordinated motion planning: Reconfiguring a swarm of labeled robots with bounded stretch. SIAM Journal on Computing, 48(6):1727-1762, 2019. Google Scholar
  5. Erik D. Demaine and Mikhail Rudoy. A simple proof that the (n²-1)-puzzle is hard. Theoretical Computer Science, 732:80-84, 2018. Google Scholar
  6. Rodney G. Downey and Michael R. Fellows. Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, 2013. Google Scholar
  7. Adrian Dumitrescu. Mover problems. In János Pach, editor, Thirty Essays on Geometric Graph Theory, pages 185-211, New York, NY, 2013. Springer New York. Google Scholar
  8. Adrian Dumitrescu and Minghui Jiang. On reconfiguration of disks in the plane and related problems. Computational Geometry, 46(3):191-202, 2013. Google Scholar
  9. Eduard Eiben, Robert Ganian, and Iyad Kanj. The parameterized complexity of coordinated motion planning. In Proceedings of the 39th International Symposium on Computational Geometry, volume 258 of LIPIcs, pages 28:1-28:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. Google Scholar
  10. Guillermo Esteban, Dan Halperin, Víctor Ruíz, Vera Sacristán, and Rodrigo I Silveira. Shortest coordinated motion for square robots. In Proceedings of the 18th International Symposium on Algorithms and Data Structures, volume 14079 of Lecture Notes in Computer Science, pages 430-443. Springer, 2023. Google Scholar
  11. Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, and Joseph S. B. Mitchell. Computing coordinated motion plans for robot swarms: The CG: SHOP challenge 2021. ACM J. Exp. Algorithmics, 27:3.1:1-3.1:12, 2022. Google Scholar
  12. Henning Fernau, Torben Hagerup, Naomi Nishimura, Prabhakar Ragde, and Klaus Reinhardt. On the parameterized complexity of the generalized rush hour puzzle. In Proceedings of the 15th Canadian Conference on Computational Geometry, pages 6-9, 2003. Google Scholar
  13. Gary W. Flake and Eric B. Baum. Rush hour is PSPACE-complete, or “Why you should generously tip parking lot attendants”. Theoretical Computer Science, 270(1-2):895-911, 2002. Google Scholar
  14. John E. Hopcroft, Jacob T. Schwartz, and Micha Sharir. On the complexity of motion planning for multiple independent objects; PSPACE-hardness of the "Warehouseman’s Problem. The International Journal of Robotics Research, 3(4):76-88, 1984. Google Scholar
  15. John E. Hopcroft and Gordon T. Wilfong. Reducing multiple object motion planning to graph searching. SIAM Journal on Computing, 15(3):768-785, 1986. Google Scholar
  16. Daniel Kornhauser, Gary Miller, and Paul Spirakis. Coordinating pebble motion on graphs, the diameter of permutation groups, and applications. In Proceedings of the 25th Annual Symposium on Foundations of Computer Science, pages 241-250, 1984. Google Scholar
  17. Geetha Ramanathan and Vangalur S. Alagar. Algorithmic motion planning in robotics: Coordinated motion of several disks amidst polygonal obstacles. In Proceedings of the IEEE International Conference on Robotics and Automation, volume 2, pages 514-522, 1985. Google Scholar
  18. Daniel Ratner and Manfred Warmuth. The (n²-1)-puzzle and related relocation problems. Journal of Symbolic Computation, 10(2):111-137, 1990. Google Scholar
  19. James Renegar. On the computational complexity and geometry of the first-order theory of the reals. Part I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals. Journal of symbolic computation, 13(3):255-299, 1992. Google Scholar
  20. James Renegar. On the computational complexity and geometry of the first-order theory of the reals. Part II: The general decision problem. Preliminaries for quantifier elimination. Journal of Symbolic Computation, 13(3):301-327, 1992. Google Scholar
  21. James Renegar. On the computational complexity and geometry of the first-order theory of the reals. Part III: Quantifier elimination. Journal of Symbolic Computation, 13(3):329-352, 1992. Google Scholar
  22. Jacob T. Schwartz and Micha Sharir. On the piano movers' problem: III. coordinating the motion of several independent bodies: The special case of circular bodies moving amidst polygonal barriers. The International Journal of Robotics Research, 2:46-75, 1983. Google Scholar
  23. Jacob T. Schwartz and Micha Sharir. On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers. Communications on pure and applied mathematics, 36(3):345-398, 1983. Google Scholar
  24. Jacob T. Schwartz and Micha Sharir. On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds. Advances in applied Mathematics, 4(3):298-351, 1983. Google Scholar
  25. Michael Ian Shamos. Computational geometry. PhD thesis, Yale University, USA, 1978. Google Scholar
  26. Kiril Solovey and Dan Halperin. On the hardness of unlabeled multi-robot motion planning. The International Journal of Robotics Research, 35(14):1750-1759, 2016. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact