2019
DOI: 10.1109/lra.2019.2897368
|View full text |Cite
|
Sign up to set email alerts
|

Communication-Efficient Planning and Mapping for Multi-Robot Exploration in Large Environments

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
70
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 81 publications
(71 citation statements)
references
References 26 publications
1
70
0
Order By: Relevance
“…A trade-off between information gain and navigation cost was considered in the local planner. In another study [18], a Gaussian mixture model for global mapping to model complex environment geometries was proposed. A small memory footprint was maintained which enables distributed operation with a low volume of communication.…”
mentioning
confidence: 99%
“…A trade-off between information gain and navigation cost was considered in the local planner. In another study [18], a Gaussian mixture model for global mapping to model complex environment geometries was proposed. A small memory footprint was maintained which enables distributed operation with a low volume of communication.…”
mentioning
confidence: 99%
“…Improving the phases described in Section 3 (pose identification, optimal goal selection and navigation and checking) can reduce the time needed to finish the procedure, shorten the distance traveled, or enhance the fidelity of the resulting map [ 88 , 89 , 90 ]. Thus, different techniques have been developed, which may focus on one stage or another.…”
Section: Optimization Trendsmentioning
confidence: 99%
“…The approximation of the mutual information of range sensors [24] also led to the development of exploration approaches based on probabilistic occupancy maps with entropy reduction, such as decMCTS [25] or SGA [26]. Recently, in [27], [28], a finite-horizon decentralized planner (DGSA) has been designed using sampling-based Monte Carlo Tree Search (MCTS) [29]. The trajectories of the robots are assigned by solving a submodular maximization problem over matroid constraints with greedy assignment heuristics, for which polynomial-time algorithms and suboptimality bounds can be established [30].…”
Section: Related Workmentioning
confidence: 99%