Time-minimal paths amidst moving obstacles in three dimensions

DOI10.1016/S0304-3975(00)00408-4zbMath0988.68168MaRDI QIDQ5958315

Kikuo Fujimura

Publication date: 3 March 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

shortest pathstime-minimal pathstime-varying environments

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Maximum thick paths in static and dynamic environments

Cites Work

• An algorithm for shortest-path motion in three dimensions
• Motion planning among time dependent obstacles
• Planning a time-minimal motion among moving obstacles
• A new algorithm for shortest paths among obstacles in the plane
• The Discrete Geodesic Problem
• The Number of Shortest Paths on the Surface of a Polyhedron
• Motion planning in the presence of moving obstacles
• A single-exponential upper bound for finding shortest paths in three dimensions
• Approximating shortest paths on a convex polytope in three dimensions

This page was built for publication: Time-minimal paths amidst moving obstacles in three dimensions