Hostname: page-component-78c5997874-8bhkd Total loading time: 0 Render date: 2024-11-16T18:00:32.899Z Has data issue: false hasContentIssue false

Path planning by fractional differentiation

Published online by Cambridge University Press:  28 January 2003

A. Oustaloup
Affiliation:
Laboratoire d'Automatique et de Productique (LAP - UMR 5131 CNRS - Université Bordeaux 1 - ENSEIRB), 351 cours de la Libération, F 33405 Talence cedex (France) E-mail: melchior@lap.u-bordeaux.fr
B. Orsoni
Affiliation:
Laboratoire d'Automatique et de Productique (LAP - UMR 5131 CNRS - Université Bordeaux 1 - ENSEIRB), 351 cours de la Libération, F 33405 Talence cedex (France) E-mail: melchior@lap.u-bordeaux.fr
P. Melchior
Affiliation:
Laboratoire d'Automatique et de Productique (LAP - UMR 5131 CNRS - Université Bordeaux 1 - ENSEIRB), 351 cours de la Libération, F 33405 Talence cedex (France) E-mail: melchior@lap.u-bordeaux.fr
H. Linarès
Affiliation:
Laboratoire d'Automatique et de Productique (LAP - UMR 5131 CNRS - Université Bordeaux 1 - ENSEIRB), 351 cours de la Libération, F 33405 Talence cedex (France) E-mail: melchior@lap.u-bordeaux.fr

Abstract

In path planning design, potential fields can introduce force constraints to ensure curvature continuity of trajectories and thus facilitate path-tracking design. The parametric thrift of fractional potentials permits smooth variations of the potential in function of the distance to obstacles without requiring design of geometric charge distribution. In the approach we use, the fractional order of differentiation is the risk coefficient associated to obstacles. A convex danger map towards a target and a convex geodesic distance map are defined. Real-time computation can also lead to the shortest minimum danger trajectory, or to the least dangerous of minimum length trajectories.

Type
Research Article
Copyright
© 2003 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)