An Optimized Random Tree and Particle Swarm Algorithm For Distribution Environments
1
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
Purpose – Robot path planning, a constrained optimization problem, has been an active research area with many methods developed to tackle it. This study proposes the use of a Rapidly-exploring Random Tree and Particle Swarm Optimizer algorithm for path planning. Research design, data, and methodology – The grid method is built to describe the working space of the mobile robot, then the Rapidly-exploring Random Tree algorithm is applied to obtain the global navigation path and the Particle Swarm Optimizer algorithm is adopted to obtain the best path. Results – Computer experiment results demonstrate that this novel algorithm can rapidly plan an optimal path in a cluttered environment. Successful obstacle avoidance is achieved, the model is robust, and performs reliably. The effectiveness and efficiency of the proposed algorithm is demonstrated through simulation studies. Conclusions – The findings could provide insights to the validity and practicability of the method. This method makes it is easy to build a model and meet real-time demand for mobile robot navigation with a simple algorithm, which results in a certain practical value for distribution environments.
Abstract
Purpose – Robot path planning, a constrained optimization problem, has been an active research area with many methods developed to tackle it. This study proposes the use of a Rapidly-exploring Random Tree and Particle Swarm Optimizer algorithm for path planning. Research design, data, and methodology – The grid method is built to describe the working space of the mobile robot, then the Rapidly-exploring Random Tree algorithm is applied to obtain the global navigation path and the Particle Swarm Optimizer algorithm is adopted to obtain the best path. Results – Computer experiment results demonstrate that this novel algorithm can rapidly plan an optimal path in a cluttered environment. Successful obstacle avoidance is achieved, the model is robust, and performs reliably. The effectiveness and efficiency of the proposed algorithm is demonstrated through simulation studies. Conclusions – The findings could provide insights to the validity and practicability of the method. This method makes it is easy to build a model and meet real-time demand for mobile robot navigation with a simple algorithm, which results in a certain practical value for distribution environments.
참고문헌 (9)
- Cai, Wenbin, "Rolling Path Planning of Robot Based on Rapidly Exploring Random Tree in an Unknown Environment", Journal of Nanjing Normal University : Engineering and Technology Edition, 6(2), pp.79~83 (2009)
- Guo, Haitao, "Rapid-exploring random tree algorithm for path planning of robot based on grid method", Journal of Nanjing Normal University : Engineering and Technology Edition, 7(2), pp.58~61 (2007)
- Guo, Haitao, "Novel Path Planning for Robots Syncretizing Ant Algorithm and Genetic Algorithm", Journal of Chinese Computer Systems, 29(10), pp.1838~1841 (2009)
- Guo, Tongying, "Research of Path Planning for Polishing Robot Based on Improved Genetic Algorithm", Proceedings of the 2004 IEEE International Conference on Robotics and Biomimetics (2006)
- Hu, Yanrong, "A Knowledge Based Genetic A1gorithm for Path Planning of a Mobile Robot", Proceedings of the 2004 IEEE international Conference on Robotics & Automation NewOrleans, pp.4350~4355 (2004)
- Qin, Yuan-Qing, "Path Planning For Mobile Robot Using The Particle Swarm Optimization With Mutation Operator", Proceedings of the Third International Conference on Machine Learning and Cybernetics, pp.2473~2478 (2008)
- "Control and Decision", 2005, 1052~1060
- Zhang, Meiyu, "Motion Planning Of Autonomous Mobile Robot Based On Ant Colony Algorithm", Computer Engineering and Applications, 41(9), pp.34~37 (2008)
- Zhu, Qing-Bao, "Ant Algorithm for Navigation of Multi-Robot Movement in Unknown Environment", Journal of Software, 17(9), pp.1890~1898 (2006)