Path Planning for Robotic Demining: Robust Sensor-Based Coverage of Unstructured Environments and Probabilistic Methods

2003 ◽  
Vol 22 (7-8) ◽  
pp. 441-466 ◽  
Author(s):  
Ercan U. Acar ◽  
Howie Choset ◽  
Yangang Zhang ◽  
Mark Schervish
Sensors ◽  
2021 ◽  
Vol 21 (22) ◽  
pp. 7562
Author(s):  
Johann Laconte ◽  
Abderrahim Kasmi ◽  
François Pomerleau ◽  
Roland Chapuis ◽  
Laurent Malaterre ◽  
...  

In the context of autonomous robots, one of the most important tasks is to prevent potential damage to the robot during navigation. For this purpose, it is often assumed that one must deal with known probabilistic obstacles, then compute the probability of collision with each obstacle. However, in complex scenarios or unstructured environments, it might be difficult to detect such obstacles. In these cases, a metric map is used, where each position stores the information of occupancy. The most common type of metric map is the Bayesian occupancy map. However, this type of map is not well suited for computing risk assessments for continuous paths due to its discrete nature. Hence, we introduce a novel type of map called the Lambda Field, which is specially designed for risk assessment. We first propose a way to compute such a map and the expectation of a generic risk over a path. Then, we demonstrate the benefits of our generic formulation with a use case defining the risk as the expected collision force over a path. Using this risk definition and the Lambda Field, we show that our framework is capable of doing classical path planning while having a physical-based metric. Furthermore, the Lambda Field gives a natural way to deal with unstructured environments, such as tall grass. Where standard environment representations would always generate trajectories going around such obstacles, our framework allows the robot to go through the grass while being aware of the risk taken.


2009 ◽  
Vol 26 (2) ◽  
pp. 212-240 ◽  
Author(s):  
Michael W. Otte ◽  
Scott G. Richardson ◽  
Jane Mulligan ◽  
Gregory Grudic

2001 ◽  
Author(s):  
Howie Choset ◽  
Ercan U. Acar ◽  
Yangang Zhang ◽  
Mark Schervish

Abstract Coverage path planning is the determination of a path that a robot must take in order to pass itself, a detector, or some other effector over each point in an environment. Applications include demining, floor scrubbing, and inspection. In previous work, we developed the boustrophedon cellular decomposition, an exact cellular decomposition approach, for the purposes of coverage. Each cell in the boustrophedon decomposition is covered with simple back and forth motions. Therefore, coverage is reduced to finding an exhaustive path through a graph that represents the adjacency relationships of the cells in the boustrophedon decomposition. Such a path will ensure that a detector passes over all points in the environment, but it does not guarantee that all ordnance is indeed detected because mine detectors have error. Therefore, we also consider probabilistic methods to determine paths for the robot to maximize the likelihood of detecting all ordnance in a target location using a priori known information.


Author(s):  
B. Hummel ◽  
S. Kammel ◽  
Thao Dang ◽  
C. Duchow ◽  
C. Stiller

Sign in / Sign up

Export Citation Format

Share Document