THE APPROXIMATE CELL DECOMPOSITION WITH LOCAL NODE REFINEMENT GLOBAL PATH PLANNING METHOD - PATH NODES REFINEMENT AND CURVE PARAMETRIC INTERPOLATION

Citation
Ni. Katevas et al., THE APPROXIMATE CELL DECOMPOSITION WITH LOCAL NODE REFINEMENT GLOBAL PATH PLANNING METHOD - PATH NODES REFINEMENT AND CURVE PARAMETRIC INTERPOLATION, Journal of intelligent & robotic systems, 22(3-4), 1998, pp. 289-314
Citations number
18
Categorie Soggetti
Computer Science Artificial Intelligence","Robotics & Automatic Control","Computer Science Artificial Intelligence","Robotics & Automatic Control
ISSN journal
09210296
Volume
22
Issue
3-4
Year of publication
1998
Pages
289 - 314
Database
ISI
SICI code
0921-0296(1998)22:3-4<289:TACDWL>2.0.ZU;2-I
Abstract
The paper presents a novel global path planning approach for mobile ro bot navigation in two dimensional workspace cluttered by polygonal obs tacles. The core of the planning method introduced is based on the app roximate cell decomposition method. The advantage of the new method is the employment of novel path refinement procedures of the paths produ ced by approximate cell decomposition that are based on local characte riscics of the workspace. Furthermore, the refined path is parametrica lly interpolated by cubic splines via a physical centripetal model, in troducing the dynamic constraints of mobile robots' motion to the path construction. The method has been implemented both in a computer grap hics simulation and on a real mobile robot cruising at indoor environm ents. Planned paths on several configurations are presented.