Earticle

초록

영어

Group mobile robot path planning is a multi-objective optimization problem, as the requirement of obstacle avoidance, traditional robot path planning optimization method has the problem of algorithm complexity, large search space and low efficiency, it is difficult to obtain the optimal solution. In order to improve the efficiency and the positioning accuracy of group robot path planning, we put forward a group mobile robot path planning method based on variable dimension artificial bee colony algorithm. Firstly, we take robot working environment to model, then taking group robot path network as nectar source, the ultimate goal of path planning is to find minimal path network, to find an optimal swarm robot moving path network which avoids obstacles through the mutual cooperation between bees. Simulation experiment results show that the path planning method based on variable dimension artificial bee colony algorithm improves the efficiency of swarm robot path planning, it can find optimal solution of swarm robot path planning during the shortest time, and it can avoid obstacles safely, it provides basis to group robot task coordination.

목차

Abstract
 1. Introduction
 2. Group Path Planning Mathematical Model
  2.1. Group path Planning Problem Model
  2.2. Cost Function Analysis of Group System Path Network
 3. ABC Algorithm Mathematical Model
 4. Group Path Optimization Method based on MDABC Algorithm
 5. Simulation Experiment
 6. Conclusion
 References

키워드

저자

• Jie Li [ College of Automation, Harbin Engineering University, Harbin, China ]
• Hongwei Mo [ College of Automation, Harbin Engineering University, Harbin, China ]
• Yao Sun [ College of Automation, Harbin Engineering University, Harbin, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of u- and e- Service, Science and Technology

• 간기

  격월간

• pISSN

  2005-4246

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605