Multiple-Robot Motion Planning = Parallel Processing + Geometry

We present two problems in multiple-robot motion planning that can be quite naturally solved using techniques from the parallel processing community to dictate how the robots interact with each other and techniques from computational geometry to apply these techniques in the geometric environment in which the robots operate. The first problem we consider is a load-balancing problem in which a pool of work must be divided among a set of processors in order to minimize the amount of time required to complete all the work. We describe a simple polygon partitioning algorithm that allows techniques from parallel processor scheduling to be applied in the multiple-robot setting in order to achieve a good balance of the work. The second problem is that of collision avoidance, where one must avoid that two (or more) processors occupy the same resource at the same time. For this problem, we describe a procedure for robot interaction that is derived from procedures used in shared-memory computers along with a geometric data structure that can efficiently determine when there are potential robot collisions.

[1]  S. Sitharama Iyengar,et al.  Robot navigation in unknown terrains using learned visibility graphs. Part I: The disjoint convex obstacle case , 1987, IEEE Journal on Robotics and Automation.

[2]  Alan E. Middleditch,et al.  Convex Decomposition of Simple Polygons , 1984, TOGS.

[3]  Nageswara S. V. Rao,et al.  Cooperative terrain model acquisition by a team of two or three point-robots , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[4]  Thomas C. Shermer.  A Linear Algorithm for Bisecting a Polygon , 1992, Inf. Process. Lett..

[5]  Charles W. Warren,et al.  Multiple robot path coordination using artificial potential fields , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[6]  Vladimir J. Lumelsky,et al.  A terrain-covering algorithm for an AUV , 1996, Auton. Robots.

[7]  Edith Schonberg,et al.  Factoring: a method for scheduling parallel loops , 1992 .

[8]  Nasser M. Nasrabadi,et al.  Terrain acquisition algorithm for an autonomous mobile robot with finite-range sensors , 1991, Defense, Security, and Sensing.

[9]  Kurt Mehlhorn,et al.  Fast Triangulation of Simple Polygons , 1983, FCT.

[10]  Ivan Stojmenovic,et al.  Bisections and Ham-Sandwich Cuts of Convex Polygons and Polyhedra , 1991, Inf. Process. Lett..

[11]  Stephen J. Buckley,et al.  Fast motion planning for multiple moving robots , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[12]  S. Sitharama Iyengar,et al.  On terrain acquisition by a point robot amidst polyhedral obstacles , 1988, IEEE J. Robotics Autom..

[13]  Prosenjit Bose,et al.  Near optimal-partitioning of rectangles and prisms , 1999, CCCG.

[14]  Thierry Siméon,et al.  A collision checker for car-like robots coordination , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).

[15]  Thierry Siméon,et al.  Multiple Path Coordination for Mobile Robots: A Geometric Algorithm , 1999, IJCAI.

[16]  Esther M. Arkin,et al.  Angewandte Mathematik Und Informatik Universit at Zu K Oln Approximation Algorithms for Lawn Mowing and Milling Ss Andor P.fekete Center for Parallel Computing Universitt at Zu Kk Oln D{50923 Kk Oln Germany Approximation Algorithms for Lawn Mowing and Milling , 2022 .

[17]  Tomás Lozano-Pérez,et al.  Deadlock-free and collision-free coordination of two robot manipulators , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[18]  CONSTANTINE D. POLYCHRONOPOULOS,et al.  Guided Self-Scheduling: A Practical Scheduling Scheme for Parallel Supercomputers , 1987, IEEE Transactions on Computers.

[19]  Rachid Alami,et al.  Multi-robot cooperation through incremental plan-merging , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[20]  Bruce Randall Donald,et al.  On the Area Bisectors of a Polygon , 1999, Discret. Comput. Geom..

[21]  Ferran Hurtado,et al.  On the Equipartitions of Convex Bodies and Convex Polygons , 2000, EuroCG.

[22]  J. Mark Keil,et al.  Decomposing a Polygon into Simpler Components , 1985, SIAM J. Comput..

[23]  Vladimir J. Lumelsky,et al.  Polygon Area Decomposition for Multiple-Robot Workspace Division , 1998, Int. J. Comput. Geom. Appl..

[24]  John F. Canny,et al.  A motion planner for multiple mobile robots , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[25]  Hannah Bast,et al.  The Area Partitioning Problem , 2000, CCCG.

[26]  S. Zucker,et al.  Toward Efficient Trajectory Planning: The Path-Velocity Decomposition , 1986 .