Skip to Main content Skip to Navigation
Conference papers

Time-optimal Coordination of Mobile Robots along Specified Paths

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 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download
Contributor : Florent Altché Connect in order to contact the contributor
Submitted on : Monday, September 5, 2016 - 2:35:23 PM
Last modification on : Wednesday, November 17, 2021 - 12:31:03 PM
Long-term archiving on: : Tuesday, December 6, 2016 - 1:36:58 PM


Files produced by the author(s)


  • HAL Id : hal-01360141, version 1


Florent Altché, Xiangjun Qian, Arnaud de La Fortelle. Time-optimal Coordination of Mobile Robots along Specified Paths. 2016 IEEE/RSJ International Conference on Intelligent Robots and Systems, Oct 2016, Daejeon, South Korea. ⟨hal-01360141⟩



Record views


Files downloads