, Volume 7, Issue 1, pp 1-15

Path Planning Using Intervals and Graphs

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

In this paper, the problem of interest is to find a path with given endpoints such that the path lies inside a compact set S given by nonlinear inequalities. The proposed approach uses interval analysis for characterizing S by subpavings (union of boxes) and graph algorithms for finding short feasible paths. As an illustration, the problem of finding collision-free paths for a polygonal rigid object through a space that is cluttered with segment obstacles is considered.