Home /Research /Cooperative patrol planning of multi-robot systems by a competitive auction system
SWARM

Cooperative patrol planning of multi-robot systems by a competitive auction system

Kao‐Shing Hwang, Jin-Ling Lin, Huiling Huang

Year
2009
Citations
21

Abstract

This research focuses on how a multi-robot system can work cooperatively to complete patrol missions. The planning and assignment of patrol points to the robots are the major issues to tackle with. A cooperative auction system (CAS) is proposed to solve the problem of patrol planning. Here, each mobile robot picks its own patrol points via the cooperative auction system and the system will continuously re-auction, based on the team work performance, to further improve the performance of cooperation for a large scale multi-robot system. From the experimental results, the proposed approach demonstrates several advantages, such as less time complexity, lower routing path cost, better workload balancing among robots.

Keywords

Computer scienceRobotAuction algorithmWorkloadMotion planningMobile robotPath (computing)SimulationCommon value auctionArtificial intelligence

Related papers

Browse all SWARM papers