Time-optimal coordination of mobile robots along specified paths

In this paper, we address the problem of time-optimal coordination of mobile robots under kinodynamic constraints along specified paths. We propose a novel approach based on time discretization that leads to a mixed-integer linear programming (MILP) formulation. This problem can be solved using general-purpose MILP solvers in a reasonable time, resulting in a resolution-optimal solution. Moreover, unlike previous work found in the literature, our formulation allows an exact linear modeling (up to the discretization resolution) of second-order dynamic constraints. Extensive simulations are performed to demonstrate the effectiveness of our approach.

[1]  Tomás Lozano-Pérez,et al.  Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.

[2]  Federico Pecora,et al.  Integrated Motion Planning and Coordination for Industrial Vehicles , 2014, ICAPS.

[3]  Daniel Krajzewicz,et al.  Recent Development and Applications of SUMO - Simulation of Urban MObility , 2012 .

[4]  Bart De Schutter,et al.  Optimal trajectory planning for trains using mixed integer linear programming , 2011, 2011 14th International IEEE Conference on Intelligent Transportation Systems (ITSC).

[5]  Jean Gregoire,et al.  Priority-based coordination of mobile robots , 2014, ArXiv.

[6]  Federico Pecora,et al.  On mission-dependent coordination of multiple vehicles under spatial and temporal constraints , 2012, 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[7]  Donald Goldfarb,et al.  Second-order cone programming , 2003, Math. Program..

[8]  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.

[9]  Srinivas Akella,et al.  Coordinating Multiple Robots with Kinodynamic Constraints Along Specified Paths , 2005, Int. J. Robotics Res..

[10]  Jean Gregoire,et al.  Robust multirobot coordination using priority encoded homotopic constraints , 2013 .

[11]  David M. Mount,et al.  On the Complexity of an Unregulated Traffic Crossing , 2015, WADS.

[12]  Kris K. Hauser,et al.  Optimal acceleration-bounded trajectory planning in dynamic environments along a specified path , 2012, 2012 IEEE International Conference on Robotics and Automation.

[13]  Sonia Cafieri,et al.  Aircraft deconfliction with speed regulation: new models from mixed-integer optimization , 2014, J. Glob. Optim..

[14]  Jonas Sjöberg,et al.  Convex modeling of conflict resolution at traffic intersections , 2015, 2015 54th IEEE Conference on Decision and Control (CDC).

[15]  G. Swaminathan.  Robot Motion Planning , 2006 .

[16]  Jonathan P. How,et al.  Spacecraft trajectory planning with avoidance constraints using mixed-integer linear programming , 2002 .

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

[18]  J. How,et al.  Mixed-integer programming for control , 2005, Proceedings of the 2005, American Control Conference, 2005..