Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 1021.65029
Jaulin, Luc
Path planning using intervals and graphs. (English)
[J] Reliab. Comput. 7, No.1, 1-15 (2001). ISSN 1385-3139; ISSN 1573-1340/e

Summary: The problem of interest is to find a path with given endpoints such that the path lies inside a compact set $\bbfS$ given by nonlinear inequalities. The proposed approach uses interval analysis for characterizing $\bbfS$ 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.

MSC 2000:: *65K05 Mathematical programming (numerical methods)
90C30 Nonlinear programming
65G40 General methods in interval analysis

Keywords: nonlinear inequalities; interval analysis; graph algorithms; collision-free paths; polygonal rigid object

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]