Conflict-free route planning in dynamic environments

Motion planning for multiple robots is tractable in case we can assume a roadmap on which all the robots travel, which is often the case in many automated guided vehicle domains, such as factory floors or container terminals. We present an O(nv log(nv) + n2v) (n the number of nodes, v the number of vehicles) route planning algorithm for a single robot, which can find the minimum-time route given a set of existing route plans that it may not interfere with. In addition, we present an algorithm that can propagate delay through the plans of the robots in case one or more robots are delayed. This delay-propagation algorithm allows us to implement a Pareto-optimal plan repair scheme, in which one robot can improve its route plan without adversely affecting the other robots. We compare this approach to several plan repair schemes from the literature, which are based on the idea of giving a higher priority to non-delayed agents.

[1]  Lydia E. Kavraki,et al.  Probabilistic roadmaps for path planning in high-dimensional configuration spaces , 1996, IEEE Trans. Robotics Autom..

[2]  B. Faverjon,et al.  Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces , 1996 .

[3]  J. Schwartz,et al.  On the Complexity of Motion Planning for Multiple Independent Objects; PSPACE- Hardness of the "Warehouseman's Problem" , 1984 .

[4]  Tomás Lozano-Pérez,et al.  On multiple moving objects , 2005, Algorithmica.

[5]  Erik D. Demaine,et al.  PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation , 2002, Theor. Comput. Sci..

[6]  Adriaan ter Mors,et al.  The world according to MARP , 2010 .

[7]  Pierre Castagna,et al.  A performance-based structural policy for conflict-free routing of bi-directional automated guided vehicles , 2005, Comput. Ind..

[8]  Cees Witteveen,et al.  Context-Aware Route Planning , 2010, MATES.

[9]  Thierry Siméon,et al.  Path coordination for multiple mobile robots: a resolution-complete algorithm , 2002, IEEE Trans. Robotics Autom..

[10]  Mark H. Overmars,et al.  Prioritized motion planning for multiple robots , 2005, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[11]  Steven M. LaValle,et al.  Optimal motion planning for multiple robots having independent goals , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[12]  Jason M. O'Kane,et al.  Exact Pareto-optimal coordination of two translating polygonal robots on an acyclic roadmap , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[13]  Cees Witteveen,et al.  Plan Repair in Conflict-Free Routing , 2009, IEA/AIE.

[14]  A. W. ter Mors.  Conflict-free route planning in dynamic environments , 2011, 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems.