This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 WRI World Congress on Computer Science and Information Engineering
Coverage Rolling Path Planning of Unknown Environments with Dynamic Heuristic Searching
Los Angeles, California USA
March 31-April 02
ISBN: 978-0-7695-3507-4
A new complete coverage path planning algorithm based on rolling path planning, dynamic heuristic searching and directly filling is proposed to improve efficiency of path planning for mobile robot in unknown environments. The biological inspired neural network was used to model the environment of mobile robot. After the characteristic of local environment around robot was identified on line, the dynamic heuristic planning method combing static searching and following the boundary of obstacle is applied and generated path is much shorter and less turning. Using virtual obstacle and directly filling algorithm, the continuously covered area in U shape obstacle is obtained in unknown environments. The effectiveness of the proposed algorithm is validated by simulation in unknown complicated environments.
Index Terms:
complete coverage path planning, dynamic heuristic planning, rolling window, directly filling
Citation:
Xiaoqin Guo, "Coverage Rolling Path Planning of Unknown Environments with Dynamic Heuristic Searching," csie, vol. 5, pp.261-265, 2009 WRI World Congress on Computer Science and Information Engineering, 2009
Usage of this product signifies your acceptance of the Terms of Use.