Hostname: page-component-74656f9884-j7cmm Total loading time: 0 Render date: 2026-11-08T17:34:09.168Z Has data issue: false hasContentIssue false

Piecewise smooth and safe trajectory planning *

Published online by Cambridge University Press:  09 March 2009

Ashraf Elnagar
Affiliation:
Alberta Center for Machine Intelligence and Robotics, Department of Computing Science, University of Alberta, Edmonton, Alberta (Canada) T6G 2H1
Anup Basu
Affiliation:
Alberta Center for Machine Intelligence and Robotics, Department of Computing Science, University of Alberta, Edmonton, Alberta (Canada) T6G 2H1

Summary

A new approach to generating smooth piecewise local trajectories for mobile robots is proposed in this paper. Given the configurations (position and direction) of two points, we search for the trajectory that minimizes the integral of acceleration (tangential and normal). The resulting trajectory should not only be smooth but also safe in order to be applicable in real-life situations. Therefore, we investigate two different obstacle-avoidance constraints that satisfy the minimization problem. Unfortunately, in this case the problem becomes more complex and not suitable for real time implementations. Therefore, we introduce two simple solutions, based on the idea of polynomial fitting, to generate safe trajectories once a collision is detected with the original smooth trajectory. Simulation results of the different algorithms are presented.

Information

Type
Article
Copyright
Copyright © Cambridge University Press 1994

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.)

Article purchase

Temporarily unavailable