Guaranteed Computation of Constraints for Safe path Planning - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2007

Guaranteed Computation of Constraints for Safe path Planning

Nacim Ramdani
Philippe Fraisse


Path planning issues are often solved via constrained optimization methods but with constraints which must be satisfied over a whole interval of time or space. The use of fast numerical toolboxes implementing state-of-the-art constrained needs to discretize the continous constraints over a time grid. Thus, the obtained solution, in this way, will satisfy the constraints only for time values corresponding to the time grid. Obviously, some constraints could be violated with catastrophic consequences when dealing with, for instance, the balance of humanoid robots. In this paper we introduce a guaranteed discretization method which uses interval analysis to ensure that the constraints are satisfied over the whole time interval. We analyze numerically this method by performing a trajectory generation under constraints dedicated to the motion of the HOAP-3 humanoid robot.
Fichier principal
Vignette du fichier
main.pdf (231.95 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

lirmm-00193965 , version 1 (05-12-2007)
lirmm-00193965 , version 2 (13-12-2007)
lirmm-00193965 , version 3 (12-11-2009)


  • HAL Id : lirmm-00193965 , version 3


Sebastien Lengagne, Nacim Ramdani, Philippe Fraisse. Guaranteed Computation of Constraints for Safe path Planning. Humanoids, Nov 2007, Pittsburgh, PA, United States. ⟨lirmm-00193965v3⟩
238 View
391 Download


Gmail Mastodon Facebook X LinkedIn More