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.
Type de document :
Communication dans un congrès
2016 IEEE/RSJ International Conference on Intelligent Robots and Systems, Oct 2016, Daejeon, South Korea. Intelligent Robots and Systems (IROS), IEEE International Workshop on
Liste complète des métadonnées

Littérature citée [18 références]  Voir  Masquer  Télécharger

https://hal-mines-paristech.archives-ouvertes.fr/hal-01360141
Contributeur : Florent Altché <>
Soumis le : lundi 5 septembre 2016 - 14:35:23
Dernière modification le : lundi 12 novembre 2018 - 11:01:05
Document(s) archivé(s) le : mardi 6 décembre 2016 - 13:36:58

Fichier

iros2016.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01360141, version 1

Collections

Citation

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. Intelligent Robots and Systems (IROS), IEEE International Workshop on. 〈hal-01360141〉

Partager

Métriques

Consultations de la notice

174

Téléchargements de fichiers

124