REAL-TIME TRAJECTORY MODIFICATION BASED ON BEZIER SHAPE DEFORMATION

被引:0
作者
Hilario, L. [1 ]
Montes, N. [1 ]
Mora, M. C. [2 ]
Falco, A. [1 ]
机构
[1] Cardenal Herrera CEU Univ, C San Bartolome 55, Alfara Del Patriarca 46115, Spain
[2] Univ Jaume 1, Mech Engn & Construct Dept, Castellon de La Plana, Spain
来源
ICEC 2010: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION | 2010年
关键词
Bezier; Deformation; Constrained optimization; Trajectory; Path planning; Artificial potential fields; CURVE;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper presents a new technique for flexible path planning based on the deformation of a Bezier curve through a field of vectors. This new technique is called Bezier Shape Deformation (BSD). This deformation is computed with a constrained optimization method (Lagrange Multipliers Theorem). The main advantage of this method is how the solution is obtained. A linear system is solved to achieve the result. As a consequence, the deformed curve is computed in a few milliseconds where the linear system can be solved offline if the Bezier curve order is maintained constant during the movement of the robot. This method allows the use of these trajectories in dynamic environments where the computational cost is critical. This technique can be combined with any collision avoidance algorithm that produces a field of vectors. In particular, it is appropriate for artificial potential field methods. At the end of the paper, the presented methodology is combined with an artificial potential fields algorithm recently proposed, the Potential Field Projection method (PFP). This method is based on the combination of the classical Potential Fields method and the multi-rate Kalman filter estimation and takes into account the uncertainties on locations, the future trajectory of the robot and the obstacles and the multi-rate information supplied by sensors. As shown in the simulation results, flexible trajectories for collision avoidance are generated with smooth curves.
引用
收藏
页码:243 / 248
页数:6
相关论文
共 21 条
[1]   Trajectory reconstruction with NURBS curves for robot programming by demonstration [J].
Aleotti, J ;
Caselli, S ;
Maccherozzi, G .
2005 IEEE INTERNATIONAL SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE IN ROBOTICS AND AUTOMATION, PROCEEDINGS, 2005, :73-78
[2]  
Aleotti J., 2005, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems, P1029
[3]  
Choi JW, 2009, LECT NOTES ENG COMP, P668
[4]  
Choi JW, 2008, LECT NOTES ENG COMP, P625
[5]   Analysis of a spline based, obstacle avoiding path planning algorithm [J].
Connors, John ;
Elkaim, Gabriel .
2007 IEEE 65TH VEHICULAR TECHNOLOGY CONFERENCE, VOLS 1-6, 2007, :2565-2569
[6]  
Fei-hai X., 2005, J ZHEJIANG U SC A S1, P124
[7]   CONSTRAINT-BASED CURVE MANIPULATION [J].
FOWLER, B ;
BARTELS, R .
IEEE COMPUTER GRAPHICS AND APPLICATIONS, 1993, 13 (05) :43-49
[8]  
Hwang J. H., 2003, IROS 2003, P1414
[9]   Path Planning Based on Bezier Curve for Autonomous Ground Vehicles [J].
Choi, Ji-wung ;
Curry, Renwick ;
Elkaim, Gabriel .
WCECS 2008: ADVANCES IN ELECTRICAL AND ELECTRONICS ENGINEERING - IAENG SPECIAL EDITION OF THE WORLD CONGRESS ON ENGINEERING AND COMPUTER SCIENCE, PROCEEDINGS, 2009, :158-166