On fast planning of suboptimal paths amidst polygonal obstacles in plane
type: Item
instance of: scholarly article
title: On fast planning of suboptimal paths amidst polygonal obstacles in plane
zbMATH Open document ID: 0884.68117
DOI: 10.1016/0304-3975(94)00194-N
author: N. S. V. Rao
published in: Theoretical Computer Science
publication date: 1997-09-29T00:00:00Z
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 1065134
zbMATH Keywords: planning
zbMATH Keywords: point robot
Wikidata QID: Q116677360
MaRDI profile type: Publication
cites work: Faster algorithms for the shortest path problem
cites work: Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
cites work: An O(n2) shortest path algorithm for a non-rotating convex body
cites work: Optimal Search in Planar Subdivisions
cites work: Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape
cites work: An algorithmic approach to some problems in terrain navigation
cites work: A “retraction” method for planning the motion of a disc
cites work: Q3992847
cites work: Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
cites work: An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
full work available at URL: 0304-3975(94)00194-n
OpenAlex ID: W2005089525
description: scientific article; zbMATH DE number 1065134