Fastest path across constrained moving rectilinear obstacles

DOI10.1016/0020-0190(91)90153-9MaRDI QIDQ751322zbMATH OpenOpenAlexFDO

Authors D. Kharzeev

Publication date 1991

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(91)90153-9

zbMATH Keywords

computational geometrymotion planningoptimal pathmoving parallel obstacles

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Rectilinear shortest paths among transient obstacles
• Shortest paths in the plane with polygonal obstacles
• Optimal piecewise linear motion of an object among obstacles
• Time-minimal paths amidst moving obstacles in three dimensions
• Shortest paths among transient obstacles

Cites work

• Euclidean shortest paths in the presence of rectilinear barriers
• Motion planning among time dependent obstacles
• Motion planning in the presence of moving obstacles
• Motion planning with inertial constraints
• Routing past unions of disjoint linear barriers

Cited in

(3)

• Rectilinear shortest paths among transient obstacles
• Fastest-path planning for direction-dependent speed functions
• The Fastest Path Between Two Points, with a Symmetric Obstacle

This page was built for publication: Fastest path across constrained moving rectilinear obstacles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q751322)