REVIEW 1 cited by
Multi-agent Task-Driven Exploration via Intelligent Map Compression and Sharing
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
This paper investigates the task-driven exploration of unknown environments with mobile sensors communicating compressed measurements. The sensors explore the area and transmit their compressed data to another robot, assisting it to reach its goal location. We propose a novel communication framework and a tractable multi-agent exploration algorithm to select the sensors' actions. The algorithm uses a task-driven measure of uncertainty, resulting from map compression, as a reward function. We validate the efficacy of our algorithm through numerical simulations conducted on a realistic map and compare it with alternative approaches. The results indicate that the proposed algorithm effectively decreases the time required for the robot to reach its target without causing excessive load on the communication network.
Forward citations
Cited by 1 Pith paper
-
Reinforcement Learning Driven Multi-Robot Exploration via Explicit Communication and Density-Based Frontier Search
A decentralized multi-robot exploration system using A*-based frontier density features and a learned proximity-limited map-sharing action reaches roughly 80 to 100 percent coverage in simulation and lab tests.
Discussion (0). Continue with ORCID to comment.