Pebble Motion on Graphs with Rotations: Efficient Feasibility Tests and Planning Algorithms

We study the problem of planning paths for \(p\) distinguishable pebbles (robots) residing on the vertices of an \(n\)-vertex connected graph with \(p \le n\). A pebble may move from a vertex to an adjacent one in a time step provided that it does not collide with other pebbles. When \(p = n\), the only collision free moves are synchronous rotations of pebbles on disjoint cycles of the graph. We show that the feasibility of such problems is intrinsically determined by the diameter of a (unique) permutation group induced by the underlying graph. Roughly speaking, the diameter of a group \(\mathbf G\) is the minimum length of the generator product required to reach an arbitrary element of \(\mathbf G\) from the identity element. Through bounding the diameter of this associated permutation group, which assumes a maximum value of \(O(n^2)\), we establish a linear time algorithm for deciding the feasibility of such problems and an \(O(n^3)\) algorithm for planning complete paths.

[1]  H. T. Kung,et al.  Sorting on a mesh-connected parallel computer , 1977, CACM.

[2]  Srinivas Akella,et al.  Coordinating Multiple Droplets in Planar Array Digital Microfluidic Systems , 2005, Int. J. Robotics Res..

[3]  James R. Driscoll,et al.  Computing Short Generator Sequences , 1987, Inf. Comput..

[4]  Richard M. Wilson,et al.  Graph puzzles, homotopy, and the alternating group☆ , 1974 .

[5]  John H. Reif,et al.  Optimal Kinodynamic Motion Planning for 2D Reconfiguration of Self-Reconfigurable Robots , 2007, Robotics: Science and Systems.

[6]  Howie Choset,et al.  M*: A complete multirobot path planning algorithm with performance bounds , 2011, 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[7]  Dan Halperin,et al.  k-color multi-robot motion planning , 2012, Int. J. Robotics Res..

[8]  John H. Reif,et al.  Asymptotically Optimal Kinodynamic Motion Planning for Self-reconfigurable Robots , 2006, WAFR.

[9]  Manfred K. Warmuth,et al.  NxN Puzzle and Related Relocation Problem , 1990, J. Symb. Comput..

[10]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[11]  Mimmo Parente,et al.  A Linear-Time Algorithm for the Feasibility of Pebble Motion on Trees , 1999, Algorithmica.

[12]  Dinesh Manocha,et al.  Centralized path planning for multiple robots: Optimal decoupling into sequential plans , 2009, Robotics: Science and Systems.

[13]  Assaf Schuster,et al.  Hot-Potato Algorithms for Permutation Routing , 1995, IEEE Trans. Parallel Distributed Syst..

[14]  Kostas E. Bekris,et al.  From Feasibility Tests to Path Planners for Multi-Agent Pathfinding , 2013, SOCS.

[15]  Pavel Surynek,et al.  An Optimization Variant of Multi-Robot Path Planning Is Intractable , 2010, AAAI.

[16]  William E. Story.  Note on the Preceding Paper: [On the Geographical Problem of the Four Colours] , 1879 .

[17]  Samuel Loyd,et al.  Mathematical Puzzles of Sam Loyd , 1959 .

[18]  Oded Goldreich.  Finding the Shortest Move-Sequence in the Graph-Generalized 15-Puzzle Is NP-Hard , 2011, Studies in Complexity and Cryptography.

[19]  Refael Hassin,et al.  Multi-Color Pebble Motion on Graphs , 2009, Algorithmica.

[20]  Steven M. LaValle,et al.  Structure and Intractability of Optimal Multi-Robot Path Planning on Graphs , 2013, AAAI.

[21]  D A N I E L R A T N E R A N D M A N F R E D W A R M,et al.  The ( n 2-1 )-Puzzle and Related Relocation Problems , 2008 .

[22]  Jingjin Yu.  A Linear Time Algorithm for the Feasibility of Pebble Motion on Graphs , 2013, ArXiv.

[23]  James R. Driscoll,et al.  On the diameter of permutation groups , 1983, STOC.

[24]  Kenneth E. Batcher,et al.  Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

[25]  Richard E. Korf,et al.  Complete Algorithms for Cooperative Pathfinding Problems , 2011, IJCAI.

[26]  Paul G. Spirakis,et al.  Coordinating Pebble Motion on Graphs, the Diameter of Permutation Groups, and Applications , 2015, FOCS.

[27]  László Babai,et al.  On the diameter of the symmetric group: polynomial bounds , 2004, SODA '04.