DocumentCode
2097019
Title
A distributed foraging algorithm based on artificial potential field
Author
Zedadra, Ouarda ; Seridi, Hamid ; Jouandeau, Nicolas ; Fortino, Giancarlo
Author_Institution
LabSTIC, 8 may 1945 University P.O. Box 401, 24000 Guelma
fYear
2015
fDate
28-30 April 2015
Firstpage
1
Lastpage
6
Abstract
Simple collections of agents that perform collectively and use distributed control algorithms constitute the interests of swarm robotics. A key issue to improve system performances is to effectively coordinate the team of agents. We present in this paper a multi-agent foraging algorithm called Cooperative-Color Marking Foraging Agents (C-CMFA). It uses the coordination rules of the S-MASA (Stigmergic Multi-Ant Search Area) algorithm to (i) speed up the search process and (ii) allow agents to build an optimal Artificial Potential Field (APF) simultaneously while exploring. To benefit from multiple robots, we add one cooperation rule in the algorithm to attract a large number of agents to the found food. This algorithm constitutes a distributed and synchronous version of the c-marking algorithm. Simulation results in comparison with the c-marking one show the superiority of C-CMFA in different environment configurations.
Keywords
Color; Heuristic algorithms; Robot kinematics; Robot sensing systems; Search problems; Simulation;
fLanguage
English
Publisher
ieee
Conference_Titel
Programming and Systems (ISPS), 2015 12th International Symposium on
Conference_Location
Algiers, Algeria
Type
conf
DOI
10.1109/ISPS.2015.7244986
Filename
7244986
Link To Document