On fast planning of suboptimal paths amidst polygonal obstacles in plane

DOI10.1016/0304-3975(94)00194-NMaRDI QIDQ1367531zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

planningpoint robot

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(5)

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

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)