Path planning using intervals and graphs

DOI10.1023/A:1011400431065MaRDI QIDQ5935462zbMATH OpenOpenAlexFDO

Authors L. Jaulin

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

collision-free pathsgraph algorithmsinterval analysisnonlinear inequalitiespolygonal rigid object

Mathematics Subject Classification ID

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

Recommendations

• A new model for path planning with interval data
• Path-length analysis for grid-based path planning
• Efficient path planning algorithms in reach-avoid problems
• scientific article; zbMATH DE number 5025426
• Reliably Safe Path Planning Using Interval Analysis
• scientific article; zbMATH DE number 914133

Cited in

(8)

• 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
• Path Counting for Grid-Based Navigation
• scientific article; zbMATH DE number 5025426 (Why is no real title available?)
• Reliable robust path planning with application to mobile robots
• Box atlas: an interval version of atlas
• Using interval arithmetic to prove that a set is path-connected

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5935462)