Publisher: Cambridge University Press
E-ISSN: 1469-8668|12|4|299-307
ISSN: 0263-5747
Source: Robotica, Vol.12, Iss.4, 1994-07, pp. : 299-307
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
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.
Related content
Multi-waypoint visual homing in piecewise linear trajectory
Robotica, Vol. 31, Iss. 3, 2013-05 ,pp. :
Minimum jerk for trajectory planning and control
Robotica, Vol. 12, Iss. 2, 1994-03 ,pp. :
Trajectory planning for coordinately operating robots
AI EDAM, Vol. 4, Iss. 3, 1990-08 ,pp. :
Delaunay Meshing of Piecewise Smooth Complexes without Expensive Predicates
By Dey Tamal K. Levine Joshua A.
Algorithms, Vol. 2, Iss. 4, 2009-11 ,pp. :
Trajectory planning for a 1-DOF clutched robotic arm
Robotica, Vol. 29, Iss. 5, 2011-09 ,pp. :