Coordination for Multi-Robot Exploration and Mapping

By Reid G. Simmons, David Apfelbaum, Wolfram Burgard, Dieter Fox, Mark Moors, Sebastian Thrun, Håkan L. S. Younes. AAAI/IAAI, 2000

656 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/3622c64866650e82f4f62df5954322e15d3c9442

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Efficient Informative Sensing using Multiple Robots (2014, background): “Simmons et al. (2000) proposed a distributed approach for exploration and mapping with multiple robots by minimizing the overlap in information gain amongst multiple robots.”
On the use of simulation in robotics: Opportunities, challenges, and suggestions for moving forward (2020, background): “A rich universe opens up when multiple agents participate in the same scenario (34).”
An Incremental Self-Deployment Algorithm for Mobile Sensor Networks (2002, methodology): “On the other hand, the heuristics used by both (Simmons et al., 2000) and (Burgard et al.”
Market-Based Multirobot Coordination: A Survey and Analysis (2006, background): “Market-based approaches can often seamlessly incorporate online tasks by auctioning new tasks as they are introduced by an operator [8] or generated by the robots themselves [45, 21], or as they become available due to the completion of preceding tasks [5, 6, 18, 38].”
Simultaneous Localization and Mapping with Sparse Extended Information Filters (2004, background): “On-line SLAM is of great practical importance in many navigation and exploration problems (Burgard et al. 2000; Simmons et al. 2000).”
Coordinated multi-robot exploration (2005, methodology): “In the sequel, this approach will be denoted as uncoordinated exploration since it lacks a component that arbitrates between the robots whenever they choose the same frontier cells.”
Distributed Multirobot Exploration and Mapping (2005, methodology): “If the robots know their relative locations and share a map of the area they explored so far, then effective coordination can be achieved by guiding the robots into different, non-overlapping areas of the environment [1], [29], [37], [2].”
A system for volumetric robotic mapping of abandoned mines (2003, methodology): “We believe that existing techniques for mobile robot exploration [7], [ 19 ], [23] can be adapted for the purpose of autonomously exploring mines.”
Multi-robot exploration controlled by a market economy (2002, methodology): “In contrast to other systems which must send large amounts of map data in order to facilitate coordination [6, 11], coordination in our system is for the most part achieved by sharing price information.”
A comprehensive taxonomy for multi-robot task allocation (2013, methodology): “A few examples are work by Vail and Veloso (2003) using potential fields, Gerkey and Matarić (2002) using auction methods, and Simmons et al. (2000) also using auctions.”
Learning Occupancy Grid Maps with Forward Sensor Models (2003, unknown): “Various authors have investigated building such maps while simultaneously localizing the robot (Burgard, 1999; Thrun, 1998; Yamauchi et al., 1998) and during robot exploration (Burgard, 2000; Simmons et al., 2000; Thrun, 1993; Yamauchi, 1997).”
Robotic mapping: a survey (2003, background): “Today’s approaches are usually greedy, that is, they chose control by greedily maximizing information gain [12, 17, 89, 105], sometimes under consideration of safety constraints [37].”
An experiment in integrated exploration (2002, methodology): “In [17] multiple robots cooperatively explore an indoor environment each using a SLAM algorithm for localization and mapping.”
A Probabilistic On-Line Mapping Algorithm for Teams of Mobile Robots (2001, methodology): “In practice, however, the speedup is usually sublinear (Simmons et al. 2000).”
Mobile Sensor Network Deployment using Potential Fields: A Distributed, Scalable Solution to the Area Coverage Problem (2002, background): “Two good examples are provided by Simmons [ 14 ] and Burgard [3], both of whom build global maps, apply heuristics to select goal locations for exploration, and use explicit communication to prevent more than one robot from heading for the same goal.”