Coverage for robotics – A survey of recent results

By Howie Choset. Annals of Mathematics and Artificial Intelligence, 2001

1,339 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Computer Vision and Pattern Recognition, Mechanical Engineering

View Paper: https://www.semanticscholar.org/paper/ae0b7a035ac2b0d8cf25512aa3efebd82de78a06

How researchers see this paper

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

In Computer Networks and Communications

In Computer Vision and Pattern Recognition

In Mechanical Engineering

Citations in the corpus

Multi-robot area patrol under frequency constraints (2007, methodology): “As in work on multi-robot coverage, different variations exist [11]: Offline (map of area and obstacles given apriori) or online (work area unknown), using approximatecell coverage (when using approximate cell decomposition metho ds, partial cells may be excluded from the coverage path), or exact(al”
Estimation of Spatially Distributed Processes Using Mobile Spatially Distributed Sensor Network (2009, background): “This problem is known in the robotics literature as the coverage path planning problem, where a single limited-range sensor agent needs to visit all points in the environment (see, for example [1, 16], and references therein).”
Cooperative Minimum Time Surveillance With Multiple Ground Vehicles (2010, background): “Applications where such a formulation is reasonable include vacuum cleaning and demining [14] and [15], general coverage [16]–[18], multi robot coverage [19] and”
Survey on Coverage Path Planning with Unmanned Aerial Vehicles (2019, methodology): “In this way, the CPP problem can be reduced to motion planning from one cell to another [9].”
Multirobot systems: a classification focused on coordination (2004, background): “points of the free space in the environment [51].”
Decentralized policies for geometric pattern formation (2007, background): “Finally, in Section VI, we discuss a practical problem where our generalized version of cyclic pursuit may be a suitable and advantageous approach; in particular, we consider the path planning problem, where the objective is to ensure that at least one agent eventually moves to within a given distan”
Optimization approaches for civil applications of unmanned aerial vehicles (UAVs) or aerial drones: A survey (2018, background): “Coverage path planning with drones refers to finding paths of drones such that all points of some area P are covered at least once (see general surveys by Choset [49] and Galceran and Carreras [87] on coverage path planning for robotics).”
Trajectory Optimization using Reinforcement Learning for Map Exploration (2008, background): “With the exception of some work in coverage behaviors (Choset 2001), these exploration strategies generally ignore the effect of motion between measurement points.”
Control of Multiple UAVs for Persistent Surveillance: Algorithm and Flight Test Results (2012, background): “1This means that the sensor footprint (circular in our case) equals the cell size [4].”
Decentralized, Adaptive Coverage Control for Networked Robots (2009, background): “There are also a number of other notions of multi-robot sensory coverage (e.g. Choset (2001), Latimer et al. (2002), Butler and Rus (2004) and Ögren et al. (2004)), but we choose to adopt the locational optimization approach for its interesting possibilities for analysis and its compatibility with…”
Planning algorithms (2006, background): “A survey of coverage planning appears in [219].”
A Comprehensive Review of Coverage Path Planning in Robotics Using Classical and Heuristic Algorithms (2021, background): “CPP is the determination of the path that cover all points from an initial state to a final state while detecting and avoiding obstacles in a target environment [17].”
Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms (2009, background): “(2009) consider coverage problems where the density function is unknown, Lekien and Leonard (2009) propose centralized laws for non-uniform coverage using cartograms, de Silva and Ghrist (2007) study static coverage problems with minimal assumptions on the capabilities of individual sensors using al”
Coverage control for mobile sensing networks (2002, background): “Finally, we note that the terminology “coverage” is also used in [34], [35] and references therein to refer to a differ ent problem called thecoverage path planning problem , where a single robot equipped with a limited footprint sensor needs to visit all points in its environment.”
Awareness Coverage Control Over Large-Scale Domains With Intermittent Communications (2010, background): “This problem is also closely related to the coverage path planning problem, where a single limited-range sensor agent needs to visit all points in the environment (see, for example [15], [16] and references therein).”
Body schema acquisition through active learning (2010, methodology): “In this paper, we suggest a new method based on active learning which explores the configuration space searching for the most informative measurements.”
Aerial remote sensing in agriculture: A practical approach to area coverage and path planning for fleets of mini aerial robots (2011, methodology): “The environment is in general mapped in a cellular decomposition or grid, following the taxonomy proposed by Choset (2001).”