Home /Research /Distributed Path Planning of Swarm Mobile Robots
SWARM

Distributed Path Planning of Swarm Mobile Robots

Ya-Ting Lee, Song-Fung Zeng, Chian‐Song Chiu

Year
2019
Citations
2

Abstract

This paper is mainly to solve the path planning problem of swarm robots. If swarm robots work in the same environment at the same time, it is necessary to have appropriate planning methods to enable individuals in the group to complete their tasks. The solution is to use the artificial bee colony algorithm for the problem of robot path planning. Because the artificial bee colony algorithm has a high efficiency to solve the optimization problem, it tries to solve the problem of robot path planning in a distributed manner. The concept of organizing robots achieves efficient task of information processing and group working in the environment.

Keywords

Motion planningRobotMobile robotSwarm behaviourComputer scienceAnt roboticsSwarm roboticsPath (computing)Artificial bee colony algorithmSwarm intelligence

Related papers

Browse all SWARM papers