DocumentCode
1632805
Title
Collision-free curvature-bounded smooth path planning using composite Bezier curve based on Voronoi diagram
Author
Ho, Yi-Ju ; Liu, Jing-Sin
Author_Institution
Inst. of Inf. Sci., Acad. Sinica, Taipei, Taiwan
fYear
2009
Firstpage
463
Lastpage
468
Abstract
In this paper, we present an obstacle avoiding smooth path planning method based on Voronoi diagram and composite Bezier curve algorithm which obtains the curvature bounded path with small length. In our algorithm, a Voronoi diagram is constructed according to the global environment. The piecewise linear rough path in the Voronoi diagram which keeps away from the obstacles is obtained by performing Dijkstra´s shortest path algorithm. Dynamic programming is employed to subdivide the nodes on the piecewise linear path into control point subsequences to generate a collision free composite Bezier curve which satisfies the curvature constraint and approaches minimal path length.
Keywords
collision avoidance; computational geometry; curve fitting; dynamic programming; piecewise linear techniques; Dijkstra shortest path algorithm; Voronoi diagram; collision free curvature-bounded smooth path planning; composite bezier curve algorithm; curvature constraint; dynamic programming; global environment; minimal path length; obstacle avoiding smooth path planning method; piecewise linear rough path; Automatic control; Dynamic programming; Heuristic algorithms; Joining processes; Kinematics; Mobile robots; Path planning; Piecewise linear techniques; Robot sensing systems; Upper bound; Bezier curve; Voronoi diagram; curvature constraint; dynamic programming; shortest path; smooth path planning;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Intelligence in Robotics and Automation (CIRA), 2009 IEEE International Symposium on
Conference_Location
Daejeon
Print_ISBN
978-1-4244-4808-1
Electronic_ISBN
978-1-4244-4809-8
Type
conf
DOI
10.1109/CIRA.2009.5423161
Filename
5423161
Link To Document