Planning a time-minimal motion among moving obstacles

DOI10.1007/BF01908631zbMath0771.68116OpenAlexW2042517341MaRDI QIDQ1261288

Hanan Samet, Kikuo Fujimura

Publication date: 1 September 1993

Published in: Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

visibility graphsMotion planningtime-varying environmentaccessibility graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computing methodologies and applications (68U99)

Related Items (3)

Method of evolving junctions: a new approach to optimal control with constraints ⋮ Maximum thick paths in static and dynamic environments ⋮ Time-minimal paths amidst moving obstacles in three dimensions

Cites Work

• Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
• Visibility of disjoint polygons
• On multiple moving objects
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Planning a time-minimal motion among moving obstacles