Characterizing the shortest path of an object among obstacles

DOI10.1016/0020-0190(89)90083-5zbMATH Open0681.68088OpenAlexW1985494011MaRDI QIDQ1823707FDOQ1823707

Authors: Ellen B. Feinberg 

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90083-5

Recommendations

• Shortest path on a non-convex polyhedron
• Optimal piecewise linear motion of an object among obstacles
• Planar rectilinear shortest path computation using corridors
• Computational Science and Its Applications – ICCSA 2004
• An algorithm for finding shortest paths in a maze

zbMATH Keywords

heuristicscomputational geometryshortest pathmotion planning

Mathematics Subject Classification ID

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

Cites Work

• A note on two problems in connexion with graphs
• On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers
• Title not available (Why is that?)
• Optimal piecewise linear motion of an object among obstacles
• Title not available (Why is that?)

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Characterizing the shortest path of an object among obstacles

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