An Efficient Algorithm for Shortest Path in Three Dimensions With Polyhedral Obstacles

被引：0

作者：

Khouri, J. ^{[1
]}

Stelson, K. A. ^{[1
]}

机构：

[1] Univ Minnesota, Dept Mech Engn, Prod Ctr, Minneapolis, MN 55455 USA

来源：

JOURNAL OF DYNAMIC SYSTEMS MEASUREMENT AND CONTROL-TRANSACTIONS OF THE ASME | 1989年 / 111卷 / 03期

基金：

美国国家科学基金会;

关键词：

D O I：

10.1115/1.3153072

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

An algorithm to find the shortest path between two specified points in three-dimensional space in the presence of polyhedral obstacles is described. The proposed method iterates for the precise location of the minimum length path on a given sequence of edges on the obstacles. The iteration procedure requires solving a tri-diagonal matrix at each step. Both the computer storage and the number of computations are proportional to n, the number of edges in the sequence. The algorithm is stable and converges for the general case of any set of lines, intersecting, parallel or skew.

引用

页码：433 / 436

页数：4

共 50 条

[1] Three-dimensional shortest path planning in the presence of polyhedral obstacles
Jiang, K
Seneviratne, LD
Earles, SWE
[J]. PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART C-JOURNAL OF MECHANICAL ENGINEERING SCIENCE, 1996, 210 (04) : 373 - 381
[2] ALGORITHM FOR SHORTEST-PATH MOTION IN THREE DIMENSIONS.
Papadimitriou, Christos H.
[J]. 1600, (20):
[3] A genetic algorithm for shortest path motion problem in three dimensions
Pennisi, Marzio
Pappalardo, Francesco
Motta, Alfredo
Cincotti, Alessandro
[J]. ADVANCED INTELLIGENT COMPUTING THEORIES AND APPLICATIONS, PROCEEDINGS: WITH ASPECTS OF ARTIFICIAL INTELLIGENCE, 2007, 4682 : 534 - 542
[4] AN EFFICIENT ALGORITHM FOR FINDING A COLLISION-FREE PATH AMONG POLYHEDRAL OBSTACLES
FU, LC
LIU, DY
[J]. JOURNAL OF ROBOTIC SYSTEMS, 1990, 7 (01): : 129 - 137
[5] Efficient path planning algorithm in three dimensions for UAV
Yin, Gaoyang
Zhou, Shaolei
Wu, Qingpo
[J]. Xibei Gongye Daxue Xuebao/Journal of Northwestern Polytechnical University, 2016, 34 (04): : 564 - 570
[6] SHORTEST PATH IN A GRID WITH OBSTACLES
DAMM, E
[J]. ANGEWANDTE INFORMATIK, 1977, (05): : 213 - 216
[7] AN ALGORITHM FOR SHORTEST-PATH MOTION IN 3 DIMENSIONS
PAPADIMITRIOU, CH
[J]. INFORMATION PROCESSING LETTERS, 1985, 20 (05) : 259 - 263
[8] Constructing approximate shortest path maps in three dimensions
Har-Peled, S
[J]. SIAM JOURNAL ON COMPUTING, 1999, 28 (04) : 1182 - 1197
[9] An efficient distributed algorithm reconstructing the shortest path
Park, JH
Yoon, SH
Lee, CS
Lee, JB
Choi, SH
[J]. PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-V, 2000, : 2833 - 2838
[10] An Algorithm for Computing the Shortest Path of Three Spheres
Chou, Chang-Chien
Hsieh, Wan-Kuang
Lee, Huei-Yuan
[J]. 2008 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS (SMC), VOLS 1-6, 2008, : 1264 - +

← 1 2 3 4 5 →