On fast planning of suboptimal paths amidst polygonal obstacles in plane

DOI10.1016/0304-3975(94)00194-NzbMATH Open0884.68117OpenAlexW2005089525WikidataQ116677360 ScholiaQ116677360MaRDI QIDQ1367531FDOQ1367531

Authors: N. 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

Recommendations

• Shortest paths in the plane with polygonal obstacles
• Shortest paths in the plane with convex polygonal obstacles
• A nearly optimal algorithm for finding \(L _{1}\) shortest paths among polygonal obstacles in the plane
• Time and space efficient algorithms for shortest paths between convex polygons

zbMATH Keywords

planningpoint robot

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space
• Title not available (Why is that?)
• On soft predicates in subdivision motion planning
• Consideration of obstacle danger level in path planning using A\(^*\) and fast-marching optimisation: Comparative study
• The application of \(\psi\)-transform for determining a near-optimal path in the presence of polyhedral obstacles

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

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