Motion planning in the presence of moving obstacles

DOI10.1145/179812.179911zbMath0812.68115OpenAlexW2083093559MaRDI QIDQ4310844

John H. Reif, Micha Sharir

Publication date: 3 November 1994

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/179812.179911

zbMATH Keywords

computational complexityTuring machinecylindrical algebraic decompositionasteroid avoidance problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (14)

Motion planning among time dependent obstacles ⋮ Optimal and suboptimal motion planning for collision avoidance of mobile robots in non-stationary environments ⋮ A light-propagation model for aircraft trajectory planning ⋮ A survey of motion planning and related geometric algorithms ⋮ Evasion on plane from a single mobile observer in the conflict environment ⋮ Reachability by paths of bounded curvature in a convex polygon ⋮ Offline variants of the ``lion and man problem: some problems and techniques for measuring crowdedness and for safe path planning ⋮ A globally converging algorithm for reactive robot navigation among moving and deforming obstacles ⋮ Path planning for multiple mobile robots under double-warehouse ⋮ Maximum thick paths in static and dynamic environments ⋮ Time-minimal paths amidst moving obstacles in three dimensions ⋮ Fastest path across constrained moving rectilinear obstacles ⋮ Randomized query processing in robot path planning ⋮ Dynamic motion planning in low obstacle density environments

This page was built for publication: Motion planning in the presence of moving obstacles