An algorithm for shortest-path motion in three dimensions
type: Item
instance of: scholarly article
title: An algorithm for shortest-path motion in three dimensions
zbMATH Open document ID: 0603.68070
DOI: 10.1016/0020-0190(85)90029-8
published in: Information Processing Letters
publication date: 1985-01-01T00:00:00Z
review text: We describe a fully polynomial approximation scheme for the problem of finding the shortest distance between two points in three-dimensional space in the presence of polyhedral obstacles. The fastest algorithm known for the exact solution of this problem is doubly exponential.
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 3974319
zbMATH Keywords: path planning
zbMATH Keywords: fully polynomial approximation scheme
zbMATH Keywords: polyhedral obstacles
author: Christos Papadimitriou
MaRDI profile type: Publication
full work available at URL: 0020-0190(85)90029-8
OpenAlex ID: W2024693023
cites work: A note on two problems in connexion with graphs
cites work: Q4130999
cites work: Q4739657
description: scientific article; zbMATH DE number 3974319