On fast planning of suboptimal paths amidst polygonal obstacles in plane

DOI10.1016/0304-3975(94)00194-NzbMath0884.68117OpenAlexW2005089525WikidataQ116677360 ScholiaQ116677360MaRDI QIDQ1367531

Nageswara S. V. Rao

Publication date: 29 September 1997

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

Full work available at URL: https://doi.org/10.1016/0304-3975(94)00194-n

zbMATH Keywords

planningpoint robot

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
• An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
• Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape
• An algorithmic approach to some problems in terrain navigation
• A “retraction” method for planning the motion of a disc
• Faster algorithms for the shortest path problem
• An O(n2) shortest path algorithm for a non-rotating convex body
• Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
• Optimal Search in Planar Subdivisions

This page was built for publication: On fast planning of suboptimal paths amidst polygonal obstacles in plane