Time-optimal Coordination of Mobile Robots along Specified Paths - Mines Paris Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Time-optimal Coordination of Mobile Robots along Specified Paths

Arnaud de La Fortelle

Résumé

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.
Fichier principal
Vignette du fichier
iros2016.pdf (347.55 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01360141 , version 1 (05-09-2016)

Identifiants

  • HAL Id : hal-01360141 , version 1

Citer

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⟩
140 Consultations
193 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More