(Created page with " == Abstract == In this paper, we address the problem of time-optimal coordination of mobile robots under kinodynamic constraints along specified paths. We propose a novel ap...") |
m (Scipediacontent moved page Draft Content 498395308 to Fortelle et al 2016a) |
(No difference)
|
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.
Comment: Published in 2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)
The different versions of the original document can be found in:
Published on 01/01/2016
Volume 2016, 2016
DOI: 10.1109/iros.2016.7759737
Licence: CC BY-NC-SA license
Are you one of the authors of this document?