Dynamic motion planning in low obstacle density environments

DOI10.1016/S0925-7721(98)00026-1zbMath0913.68194OpenAlexW1980034979WikidataQ127704207 ScholiaQ127704207MaRDI QIDQ1276943

Robert-Paul Berretty, A. Frank van der Stappen, Mark H. Overmars

Publication date: 2 February 1999

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0925-7721(98)00026-1

zbMATH Keywords

motion planningcell decompositionlow obstacle density

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Dynamic motion planning in low obstacle density environments

Cites Work

• On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
• Triangulating a nonconvex polytope
• Motion planning among time dependent obstacles
• Motion planning in environments with low obstacle density
• Motion planning for multiple robots
• A new technique for analyzing substructures in arrangements of piecewise linear surfaces
• The complexity of the free space for motion planning amidst fat obstacles
• Vertical decompositions for triangles in 3-space
• Motion planning in the presence of moving obstacles
• A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk

This page was built for publication: Dynamic motion planning in low obstacle density environments