Journal article
On the moving-obstacle path-planning algorithm of Shih, Lee, and Gruver
IEEE transactions on systems, man and cybernetics. Part B, Cybernetics, v 27(1)
01 Jan 1997
PMID: 18255848
Featured in Collection : UN Sustainable Development Goals @ Drexel
Abstract
We analyze a motion planning algorithm proposed by Shih, Lee, and Gruver. In particular, we discuss the case of motion planning among moving obstacles, for which an algorithm is presented in [1]. The algorithm is claimed to always yield a collision-free path when one exists. We provide a specific counter-example to this claim, examine the possibility of repairing the algorithm, and discuss the computational complexity of a corrected algorithm.
Metrics
Details
- Title
- On the moving-obstacle path-planning algorithm of Shih, Lee, and Gruver
- Creators
- Robert Conn - Drexel UniversityMoshe Kam
- Publication Details
- IEEE transactions on systems, man and cybernetics. Part B, Cybernetics, v 27(1)
- Publisher
- The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
- Resource Type
- Journal article
- Language
- English
- Web of Science ID
- WOS:A1997WD89200014
- Scopus ID
- 2-s2.0-0031075213
- Other Identifier
- 991019347015304721
UN Sustainable Development Goals (SDGs)
This publication has contributed to the advancement of the following goals:
InCites Highlights
Data related to this publication, from InCites Benchmarking & Analytics tool:
- Web of Science research areas
- Automation & Control Systems
- Computer Science, Artificial Intelligence
- Computer Science, Cybernetics