Generation of Dynamic Motions Under Continuous Constraints: Efficient Computation Using B-Splines and Taylor polynomials - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Poster Year : 2010

Generation of Dynamic Motions Under Continuous Constraints: Efficient Computation Using B-Splines and Taylor polynomials

Sébastien Lengagne
Eiichi Yoshida
  • Function : Author
  • PersonId : 841545

Abstract

This paper proposes a new computation method to solve semi-infinite optimization problems for motion planning of robotic systems. Usually, this problem is solved by means of time-grid discretization of the continuous constraints. Unfortunately, discretization may lead to unsafe motions since there is no guarantee of constraint satisfaction between time samples. First, we show that constraints such as joint position and velocity do not need time-discretization to be checked. Then, we present the computation method based on Taylor polynomials to evaluate more complex constraints over time-intervals. This method also applies to continuous equality constraints, to continuous maximum derivative constraint, and to compute the cost function.
Fichier principal
Vignette du fichier
2010_iros_lengagne.pdf (520.07 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-00781557 , version 1 (27-01-2013)

Identifiers

Cite

Sébastien Lengagne, Paul Mathieu, Abderrahmane Kheddar, Eiichi Yoshida. Generation of Dynamic Motions Under Continuous Constraints: Efficient Computation Using B-Splines and Taylor polynomials. IROS'10: International Conference on Intelligent Robots and Systems, Oct 2010, Taipei, Taiwan. IEEE/RSJ, pp.698-703, 2010, ⟨10.1109/IROS.2010.5649233⟩. ⟨lirmm-00781557⟩
107 View
497 Download

Altmetric

Share

Gmail Facebook X LinkedIn More