A Caltech Library Service

Roadmaps using gradient extremal paths

Filippidis, Ioannis and Kyriakopoulos, Kostas J. (2013) Roadmaps using gradient extremal paths. In: 2013 IEEE International Conference on Robotics and Automation (ICRA). IEEE , Piscataway, NJ, pp. 370-375. ISBN 978-1-4673-5641-1.

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item:


This work proposes a motion planning method based on the construction of a roadmap connecting the critical points of a potential field or a distance function. It aims to overcome the limitation of potential field methods due to local minima caused by concave obstacles. The roadmap is incrementally constructed by a two-step procedure. Starting from a minimum, adjacent saddle-points are found using a local saddle-point search method. Then, the new saddle-points are connected to the minima by gradient descent. A numerical continuation algorithm from the computational chemistry literature is used to find saddle-points. It traces the valleys of the potential field, which are gradient extremal paths, defined as the points where the gradient is an eigenvector of the Hessian matrix. The definition of gradient bisectors is also discussed. The presentation conclude simulations in cluttered environments.

Item Type:Book Section
Related URLs:
URLURL TypeDescription DOIArticle
Filippidis, Ioannis0000-0003-4704-3334
Additional Information:© 2013 IEEE.
Record Number:CaltechAUTHORS:20140724-091440057
Persistent URL:
Official Citation:Filippidis, I; Kyriakopoulos, K.J., "Roadmaps using gradient extremal paths," Robotics and Automation (ICRA), 2013 IEEE International Conference on , vol., no., pp.370,375, 6-10 May 2013 doi: 10.1109/ICRA.2013.6630602 URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:47457
Deposited By: Tony Diaz
Deposited On:24 Jul 2014 19:53
Last Modified:03 Oct 2019 06:53

Repository Staff Only: item control page