Cooperation Protocols in Multi-Agent Robotic Systems

  • Authors:
  • Fang-Chang Lin;Jane Yung-Jen Hsu

  • Affiliations:
  • Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan, R.O.C./ E-mail: fclin&commat/robot.csie.ntu.edu.tw, yjhsu&commat/robot.csie.ntu.edu.tw;Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan, R.O.C./ E-mail: fclin&commat/robot.csie.ntu.edu.tw, yjhsu&commat/robot.csie.ntu.edu.tw

  • Venue:
  • Autonomous Robots
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

Multi-agent robotic systems are useful in many practicalapplications. For some tasks, such as holding a conference, {\itcooperation} among agents are necessary. For other tasks, such ascleaning a room, multiple agents can work inparallel for better performance. This paper provides help-based (HCP) andcoordination-based (CCP) protocols for controlling agents toaccomplish multi-agent tasks. The HCP utilizes efficient negotiationto coordinate agents into groups. The CCP improves overallperformance by exchanging local knowledge among agents and makingdecisions in parallel. A reactive and modularized agent architecturewas employed to implement the protocols. Since each protocol isembedded into the architecture, it is efficient and effective. Inaddition, the protocols are deadlock-free. The protocols wereutilized to solve the Object-Sorting Task, whichabstracts two characteristics of tasks: parallelism andcooperation. The experimental results showed that 1) both HCP and CCPare stable under different workload; 2) the protocols can effectivelyutilize the agent-power to achieve super-linear improvement; 3) TheCCP is better than the HCP in both performance and speedup.