PIECEWISE-SMOOTH AND SAFE TRAJECTORY PLANNING

被引:1
作者
ELNAGAR, A
BASU, A
机构
[1] Alberta Center for Machine Intelligence and Robotics, Department of Computing Science, University of Alberta, T6G 2H1 Edmonton, Alberta
基金
加拿大自然科学与工程研究理事会;
关键词
TRAJECTORY; PIECEWISE SMOOTH PLANNING; MOBILE ROBOTS; OBSTACLE AVOIDANCE;
D O I
10.1017/S026357470001732X
中图分类号
TP24 [机器人技术];
学科分类号
080202 ; 1405 ;
摘要
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.
引用
收藏
页码:299 / 307
页数:9
相关论文
共 14 条
  • [1] Dubins L., On curves of minimal length with constraint on average curvature and with prescribed initial and terminal positions and tangents, Amer. J. Mathematics, 79, pp. 497-516, (1957)
  • [2] Laumond J., Finding collision-free smooth trajectories for a non-holonomic mobile robot, Proceedings of the Tenth International Joint Conference on Artificial Intelligence, pp. 1120-1123, (1987)
  • [3] Jacobs P., Canny C., Robust motion planning for mobile robots, Proceedings of the IEEE International Conference on Robotics and Automation, pp. 2-7, (1990)
  • [4] Donald D., Xavier P., A provably good approximation algorithm for optimal time trajectory planning, Proceedings of the IEEE International Conference on Robotics and Automation, pp. 958-963, (1989)
  • [5] Horn B., The curve of least energy, ACM Transactions on Mathematical Software, 9, pp. 441-460, (1983)
  • [6] Kallay M., Plane curves of minimal energy, ACM Transactions on Mathematical Software, 12, pp. 219-222, (1986)
  • [7] Bruckstein A., Netravali A., On minimal energy trajectories, Computer Vision, Graphics and Image Processing, 49, pp. 283-296, (1990)
  • [8] Kanayama Y., Hartman B., Smooth local path planning for autonomous vehicles, Proceedings of the IEEE International Conference on Robotics and Automation, pp. 1265-1270, (1980)
  • [9] Elnagar A., Basu A., Heuristics for local path planning, Proceedings of the IEEE International Conference of Robotics and Automation, pp. 2481-2486, (1992)
  • [10] Elsgolc L., Calculus of Variation, (1961)