On the moving-obstacle path-planning algorithm of Shih, Lee, and Gruver

Robert A. Conn; Moshe Kam

doi:10.1109/3477.552194

On the moving-obstacle path-planning algorithm of Shih, Lee, and Gruver

Robert A. Conn, Moshe Kam

Research output: Contribution to journal › Article › peer-review

12 Scopus citations

Abstract

We analyze a motion planning algorithm proposed by Shih, Lee, and Gruver [1]. 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.

Original language	English (US)
Pages (from-to)	136-138
Number of pages	3
Journal	IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Volume	27
Issue number	1
DOIs	https://doi.org/10.1109/3477.552194
State	Published - 1997
Externally published	Yes

All Science Journal Classification (ASJC) codes

Control and Systems Engineering
Software
Information Systems
Human-Computer Interaction
Computer Science Applications
Electrical and Electronic Engineering

Access to Document

10.1109/3477.552194

Cite this

@article{376deb20c2984131bda51000a99b5292,

title = "On the moving-obstacle path-planning algorithm of Shih, Lee, and Gruver",

abstract = "We analyze a motion planning algorithm proposed by Shih, Lee, and Gruver [1]. 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.",

author = "Conn, {Robert A.} and Moshe Kam",

year = "1997",

doi = "10.1109/3477.552194",

language = "English (US)",

volume = "27",

pages = "136--138",

journal = "IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics",

issn = "1083-4419",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "1",

}

TY - JOUR

T1 - On the moving-obstacle path-planning algorithm of Shih, Lee, and Gruver

AU - Conn, Robert A.

AU - Kam, Moshe

PY - 1997

Y1 - 1997

N2 - We analyze a motion planning algorithm proposed by Shih, Lee, and Gruver [1]. 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.

AB - We analyze a motion planning algorithm proposed by Shih, Lee, and Gruver [1]. 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.

UR - http://www.scopus.com/inward/record.url?scp=0031075213&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031075213&partnerID=8YFLogxK

U2 - 10.1109/3477.552194

DO - 10.1109/3477.552194

M3 - Article

C2 - 18255848

AN - SCOPUS:0031075213

SN - 1083-4419

VL - 27

SP - 136

EP - 138

JO - IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

JF - IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

IS - 1

ER -

On the moving-obstacle path-planning algorithm of Shih, Lee, and Gruver

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this