, Volume 71, Issue 3-4, pp 303-317
Date: 11 Nov 2012

Fast Path Re-planning Based on Fast Marching and Level Sets

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

We investigate path planning algorithms that are based on level set methods for applications in which the environment is static, but where an a priori map is inaccurate and the environment is sensed in real-time. Our principal contribution is not a new path planning algorithm, but rather a formal analysis of path planning algorithms based on level set methods. Computational costs when planning paths with level set methods are due to the creation of the level set function. Once the level set function has been computed, the optimal path is simply gradient descent down the level set function. Our approach rests on the formal analysis of how value of the level set function changes when the changes in the environment are detected. We show that in many practical cases, only a small domain of the level set function needs to be re-computed when the environment changes. Simulation examples are presented to validate the effectiveness of the proposed method.