Abstract
This paper proposes a coordination-based cooperation protocol for the Object-Sorting Task in multi-agent robotic systems. The protocol coordinates the agents to move objects to destinations efficiently and effectively. Every agent autonomously makes subjective optimal decision, then the coordination algorithm resolves their conflicts by considering the global results. Since every agent runs the same algorithm to obtain the common results without further communication, the protocol is efficient. Implementation of the protocol is realized on a distributed modularized agent architecture. Experimental results shows that the protocol is effective and better than a previous proposed help-based protocol. In addition, its performance very closes to a deliberate but high complexity model, genetic algorithms. The protocol can be applied to coordinate multiple autonomous robots for dispatching and transporting components in manufacturing systems.
| Original language | English |
|---|---|
| Pages (from-to) | 1632-1637 |
| Number of pages | 6 |
| Journal | Proceedings - IEEE International Conference on Robotics and Automation |
| Volume | 2 |
| State | Published - 1996 |
| Externally published | Yes |
| Event | Proceedings of the 1996 13th IEEE International Conference on Robotics and Automation. Part 1 (of 4) - Minneapolis, MN, USA Duration: 22 04 1996 → 28 04 1996 |
UN SDGs
This output contributes to the following UN Sustainable Development Goals (SDGs)
-
SDG 9 Industry, Innovation, and Infrastructure
Fingerprint
Dive into the research topics of 'Coordination-based cooperation protocol in multi-agent robotic systems'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver