Altruistic coordination for multi-robot cooperative pathfinding

详细信息    查看全文

• 作者：Changyun Wei ; Koen V. Hindriks ; Catholijn M. Jonker
• 关键词：Multi ; robot systems ; Cooperative pathfinding ; Coordination ; Collision avoidance
• 刊名：Applied Intelligence
• 出版年：2016
• 出版时间：March 2016
• 年：2016
• 卷：44
• 期：2
• 页码：269-281
• 全文大小：8,317 KB
• 参考文献：1.Bennewitz M, Burgard W, Thrun S (2002) Finding and optimizing solvable priority schemes for decoupled path planning techniques for teams of mobile robots. Robot Auton Syst 41(2):89–99CrossRef
  2.Burgard W, Moors M, Stachniss C, Schneider FE (2005) Coordinated multi-robot exploration. IEEE Trans Robot 21(3):376–386CrossRef
  3.Desaraju VR, How JP (2012) Decentralized path planning for multi-agent teams with complex constraints. Auton Robot 32(4):385–403CrossRef
  4.Dresner K, Stone P (2004) Multiagent traffic management: a reservation-based intersection control mechanism Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 530–537
  5.Hindriks K (2013) The goal agent programming language, http://​ii.​tudelft.​nl/​trac/​goal
  6.Johnson M, Jonker C, Riemsdijk B, Feltovich P, Bradshaw J (2009) Joint activity testbed: Blocks world for teams (bw4t)
  7.Kaminka GA (2012) Autonomous agents research in robotics: A report from the trenches 2012 AAAI Spring Symposium Series
  8.Luna R, Bekris KE (2011) Efficient and complete centralized multi-robot path planning
  9.Parker LE (2000) Current state of the art in distributed autonomous mobile robotics. In: Distributed Autonomous Robotic Systems 4, pp. 3–12 Springer
  10.Parker LE (2012) Decision making as optimization in multi-robot teams
  11.Ryan MR (2008) Exploiting subgraph structure in multi-robot path planning. J Artif Intell Res 31:497–542MATH
  12.Silver D. (2005) Cooperative pathfinding
  13.Standley T, Korf R (2011) Complete algorithms for cooperative pathfinding problems Proceedings of the Twenty-Second international joint conference on Artificial Intelligence, pp. 668–673
  14.Surynek P (2010)  An optimization variant of multi-robot path planning is intractable
  15.Van Den Berg JP, Overmars M.H. (2005) Prioritized motion planning for multiple robots
  16.Wang KHC, Botea A (2008) Fast and memory-efficient multi-agent pathfinding International Conference on Automated Planning and Scheduling (ICAPS), pp. 380–387
  17.Wang KHC, Botea A (2011) Mapp: a scalable multi-agent path planning algorithm with tractability and completeness guarantees. J Artif Intell Res 42(1):55–90MathSciNet MATH
  18.Wei C, Hindriks KV (2013) An agent-based cognitive robot architecture. In: Dastani M, Hbner J, Logan B (eds) Programming Multi-Agent Systems, Lecture Notes in Computer Science , vol. 7837, pp. 54–71. Springer Berlin Heidelberg
  19.de Wilde B, ter Mors AW, Witteveen C (2013) Push and rotate: cooperative multi-agent path planning Proceedings of the Twelfth International Conference on Autonomous Agents and Multiagent Systems, pp. 87–94
  20.uluaga M, Vaughan R (2005) Reducing spatial interference in robot teams by local-investment aggression IEEE/RSJ International Conference on Intelligent Robots and Systems(IROS), pp. 2798–2805
  
• 作者单位：Changyun Wei (1)
  Koen V. Hindriks (1)
  Catholijn M. Jonker (1)
  
  1. Interactive Intelligence Group, Delft University of Technology, Mekelweg 4, Delft, The Netherlands
  
• 刊物类别：Computer Science
• 刊物主题：Artificial Intelligence and Robotics
  Mechanical Engineering
  Manufacturing, Machines and Tools
  
• 出版者：Springer Netherlands
• ISSN：1573-7497

文摘

When multiple robots perform tasks in a shared workspace, they might be confronted with the risk of blocking each other’s ways, which will lead to conflicts or interference among them. Planning collision-free paths for all the robots is a challenge for a multi-robot system, which is also known as the multi-robot cooperative pathfinding problem in which each robot has to navigate from its starting location to the destination while keeping avoiding stationary obstacles as well as the other robots. In this paper, we present a novel fully decentralized approach to this problem. Our approach allows robots to make real-time responses to dynamic environments and can resolve a set of benchmark deadlock situations subject to complex spatial constraints in a shared workspace by means of altruistic coordination. Specifically, when confronted with congested situations, each robot can employ waiting, moving-forwards, dodging, retreating and turning-head strategies to make local adjustments. Most importantly, each robot only needs to coordinate and communicate with the others that are located within its coordinated network in our approach, which can reduce communication overhead in fully decentralized multi-robot systems. In addition, experimental results also show that our proposed approach provides an efficient and competitive solution to this problem.