From Discrete Mission Schedule to Continuous Implicit Trajectory using Optimal Time Warping - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Poster Year : 2009

From Discrete Mission Schedule to Continuous Implicit Trajectory using Optimal Time Warping

Abstract

This paper presents a generic solution to apply a mission described by a sequence of task on a robot while accounting for its physical constraints, without computing explicitly a reference trajectory. A naive solution to this problem would be to schedule the execution of the tasks sequentially, avoiding concurrency. This solution does not exploit fully the robot capabilities such as redundancy and have poor performance in terms of execution time or energy. Our contribution is to determine the time-optimal realization of the mission taking into account robotic constraints that may be as complex as collision avoidance. Our approach achieves more than a simple scheduling; its originality lies in maintaining the task approach in the formulated optimization of the task sequencing problem. This theory is exemplified through a complete experiment on the real HRP-2 robot.
Fichier principal
Vignette du fichier
2009_icaps_keith-From_Discrete_Mission_Schedule_to_Continuous_Implicit_Trajectory_using_Optimal_Time_Warping.pdf (136.26 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-00780894 , version 1 (25-01-2013)

Identifiers

  • HAL Id : lirmm-00780894 , version 1

Cite

François Keith, Nicolas Mansard, Sylvain Miossec, Abderrahmane Kheddar. From Discrete Mission Schedule to Continuous Implicit Trajectory using Optimal Time Warping. ICAPS'09: 19th International Conference on Automated Planning and Scheduling, Sep 2009, Thessaloniki, Greece. , 1, pp.366-369, 2009. ⟨lirmm-00780894⟩
231 View
435 Download

Share

Gmail Facebook X LinkedIn More