Towards Learning Scalable Agile Dynamic Motion Planning for Robosoccer Teams with Policy Optimization
Brandon Ho, Batuhan Altundas, Matthew Gombolay

TL;DR
This paper introduces a scalable, learning-based dynamic motion planning approach for multi-agent robotic systems, specifically applied to Robosoccer, addressing real-time collision avoidance and efficient navigation in changing environments.
Contribution
The paper proposes a novel policy optimization method for scalable, real-time motion planning in multi-agent systems, overcoming limitations of classical and existing learning-based approaches.
Findings
Successfully demonstrated in a Robosoccer environment
Achieves collision-free navigation for heterogeneous agents
Operates efficiently in dynamic, changing environments
Abstract
In fast-paced, ever-changing environments, dynamic Motion Planning for Multi-Agent Systems in the presence of obstacles is a universal and unsolved problem. Be it from path planning around obstacles to the movement of robotic arms, or in planning navigation of robot teams in settings such as Robosoccer, dynamic motion planning is needed to avoid collisions while reaching the targeted destination when multiple agents occupy the same area. In continuous domains where the world changes quickly, existing classical Motion Planning algorithms such as RRT* and A* become computationally expensive to rerun at every time step. Many variations of classical and well-formulated non-learning path-planning methods have been proposed to solve this universal problem but fall short due to their limitations of speed, smoothness, optimally, etc. Deep Learning models overcome their challenges due to their…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAI-based Problem Solving and Planning
