Research on Coverage Path Planning of Mobile Robot Based on Genetic Algorithm
暂无分享,去创建一个
This paper presents a complete coverage path planning method, which combines local space coverage with global motion planning. It is realized by modeling mobile robot environment based on Boustrophedon cell decomposition method; and according to the characteristics of regional environment model, the connectivity of the traversing space is represented by a complete weighted connected matrix. Then Genetic algorithm (GA) is used to optimize the subspace traversal distance to obtain the shortest global traversal sequence of mobile robot.
[1] M. I. Ribeiro,et al. Complete coverage path planning and guidance for cleaning robots , 1997, ISIE '97 Proceeding of the IEEE International Symposium on Industrial Electronics.
[2] Yan Ming-zhong. Survey on technology of mobile robot path planning , 2010 .
[3] Fu Jun-hui. Mobile Robot Path Planning Based on Grid Algorithm and CGA , 2012 .
[4] Yang Li,et al. Complete Coverage Path Planning of Mobile Robot Based on Dynamic Programming Algorithm , 2012, EMEIT 2012.