2016/09/26 by Yu Fan Chen, Chen, Yu Fan, Miao Liu +5 · 16 citations
Computer Science · #FOS: Computer and information sciences #Multi-Agent Systems and Negotiation #Multiagent Systems (cs.MA) #Reinforcement Learning in Robotics #Robotic Path Planning Algorithms
paper · pdf · doi:10.48550/arxiv.1609.07845
openalex publication_date 2016/09/26 · openalex created_date 2022/10/02 · openalex updated_date 2026/07/28
Finding feasible, collision-free paths for multiagent systems can be\nchallenging, particularly in non-communicating scenarios where each agent's\nintent (e.g. goal) is unobservable to the others. In particular, finding time\nefficient paths often requires anticipating interaction with neighboring\nagents, the process of which can be computationally prohibitive. This work\npresents a decentralized multiagent collision avoidance algorithm based on a\nnovel application of deep reinforcement learning, which effectively offloads\nthe online computation (for predicting interaction patterns) to an offline\nlearning procedure. Specifically, the proposed approach develops a value\nnetwork that encodes the estimated time to the goal given an agent's joint\nconfiguration (positions and velocities) with its neighbors. Use of the value\nnetwork not only admits efficient (i.e., real-time implementable) queries for\nfinding a collision-free velocity vector, but also considers the uncertainty in\nthe other agents' motion. Simulation results show more than 26 percent\nimprovement in paths quality (i.e., time to reach the goal) when compared with\noptimal reciprocal collision avoidance (ORCA), a state-of-the-art collision\navoidance strategy.\n