摘要
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.
| 原文 | 英語 |
|---|---|
| 頁(從 - 到) | 1632-1637 |
| 頁數 | 6 |
| 期刊 | Proceedings - IEEE International Conference on Robotics and Automation |
| 卷 | 2 |
| 出版狀態 | 已出版 - 1996 |
| 對外發佈 | 是 |
| 事件 | Proceedings of the 1996 13th IEEE International Conference on Robotics and Automation. Part 1 (of 4) - Minneapolis, MN, USA 持續時間: 22 04 1996 → 28 04 1996 |
UN SDG
此研究成果有助於以下永續發展目標
-
SDG9 工業、創新基礎建設
指紋
深入研究「Coordination-based cooperation protocol in multi-agent robotic systems」主題。共同形成了獨特的指紋。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver