A Algorithm of Path Planning Based on Multiple Mobile Robots

Article Preview

Abstract:

The environment of automated warehouse is complex. Path collision exists conflict between intelligent robot with unknown obstacles and intelligent mobile-robot, increasing the difficulty in multiple mobile robots path planning.To solve the problem, firstly working environmental model is established with traffic rules method and the grid method. Then the whole system adopts the idea of hierarchical cooperation for dynamic local and global path planning.By simulation this method is suitable for dynamic environment with known and unknown obstacles and effectively solve the problem of path planning for multiple mobile robots in automated warehouse.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

621-624

Citation:

Online since:

December 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Min Tan. Multi-robot Systems[M]. Beijing: Tsinghua University press. (2005). 4: p.81~99.

Google Scholar

[2] Yu Cao. Cooper ativemobiler obotics: antecedents and directions [A]. Proc IEEE Inter Confone Robotics and Automation[C]. (1995). 226~234.

Google Scholar

[3] Wenfeng Li. Wireless sensor network and mobile robot control [M]. Beijing: Science Press (2009). 1: 98-134.

Google Scholar

[4] Yaming Zhang. Research on method of multi-robot path planning. The research and application of computer [M]. Vol. 25 (2008).

Google Scholar

[5] Dongli Zhi, Maoxiang Sun, Feng Zhu . Motion planning for mobile robot based on real timeobstacle prediction. Robot, (2000), 22: 12~16.

Google Scholar

[6] Yi Dai , Guozheng Yan . Probability method of multi micro robots based on distributed localization. Optics and precision engineering, (2005), 13(6): 709~714.

Google Scholar

[7] Lanfeng Zhou, Bingrong Hong. Journal of Heilongjiang University, (2006).

Google Scholar