Motion planning in environments with low obstacle density

DOI10.1007/PL00009402zbMath0912.68205OpenAlexW2078013630MaRDI QIDQ1275680

A. Frank van der Stappen, Mark H. Overmars, Jules Vleugels, Mark T. de Berg

Publication date: 13 January 1999

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009402

zbMATH Keywords

motion planning problemfree-flying robotsmotion planning algorithms

Mathematics Subject Classification ID

Automated systems (robots, etc.) in control theory (93C85) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies and applications (68U99)

Related Items (12)

Models and motion planning ⋮ Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs ⋮ An optimal-time algorithm for shortest paths on realistic polyhedra ⋮ Connect the Dot: Computing Feed-Links with Minimum Dilation ⋮ Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs ⋮ Exact and approximation algorithms for computing optimal fat decompositions ⋮ On realistic terrains ⋮ Approximating the Packedness of Polygonal Curves ⋮ Models and motion planning ⋮ Dynamic motion planning in low obstacle density environments ⋮ Dynamic motion planning in low obstacle density environments ⋮ Approximating the packedness of polygonal curves

This page was built for publication: Motion planning in environments with low obstacle density