Path planning using intervals and graphs

DOI10.1023/A:1011400431065zbMath1021.65029OpenAlexW65745200MaRDI QIDQ5935462

Jaulin, Luc

Publication date: 22 October 2003

Published in: Reliable Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1011400431065

zbMATH Keywords

interval analysiscollision-free pathsgraph algorithmsnonlinear inequalitiespolygonal rigid object

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) General methods in interval analysis (65G40)

Related Items (3)

Toolgraph design of optimal and feasible control strategies for time-varying dynamical systems ⋮ A branch and prune algorithm for the computation of generalized aspects of parallel robots ⋮ Reliably Safe Path Planning Using Interval Analysis

This page was built for publication: Path planning using intervals and graphs