Multi-Agent Exploration of an Unknown Sparse Landmark Complex via Deep Reinforcement Learning
Xiatao Sun, Yuwei Wu, Subhrajit Bhattacharya, Vijay Kumar

TL;DR
This paper introduces a deep reinforcement learning approach for multi-agent exploration in environments with sparse landmarks, enabling efficient and cooperative exploration without relying on dense landmark assumptions.
Contribution
It presents a novel RL framework for multi-robot exploration that handles sparse landmarks and reduces communication, improving over existing methods.
Findings
Outperforms state-of-the-art in sparse environments
Efficient training with partial observability and credit assignment
Effective curriculum learning strategy reduces reward sparsity
Abstract
In recent years Landmark Complexes have been successfully employed for localization-free and metric-free autonomous exploration using a group of sensing-limited and communication-limited robots in a GPS-denied environment. To ensure rapid and complete exploration, existing works make assumptions on the density and distribution of landmarks in the environment. These assumptions may be overly restrictive, especially in hazardous environments where landmarks may be destroyed or completely missing. In this paper, we first propose a deep reinforcement learning framework for multi-agent cooperative exploration in environments with sparse landmarks while reducing client-server communication. By leveraging recent development on partial observability and credit assignment, our framework can train the exploration policy efficiently for multi-robot systems. The policy receives individual rewards…
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
TopicsRobotics and Sensor-Based Localization · Distributed Control Multi-Agent Systems · Optimization and Search Problems
