SHORTEST PATH IN A GRID WITH OBSTACLES

被引：0
|
作者：
DAMM, E [1 ]
机构：
[1] TH DARMSTADT,FACHSEBIET UBERTRAGUNGSTECHNIK,D-6100 DARMSTADT,FED REP GER
来源：
ANGEWANDTE INFORMATIK | 1977年 / 05期
关键词：
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：213 / 216
页数：4
相关论文
共 50 条
  • [1] Locomotion by Shortest Path and Obstacles Avoidance
    Patwardhan, Milind
    Kulkarni, Kimaya
    Mahajan, Apoorva
    Zambre, Yash
    Killedar, Shreya
    [J]. 2019 IEEE PUNE SECTION INTERNATIONAL CONFERENCE (PUNECON), 2019,
  • [2] Shortest path amidst disc obstacles is computable
    Chang, Ee-Chien
    Choi, Sung Woo
    Kwon, Do Yong
    Park, Hyungju
    Yap, Chee K.
    [J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 2006, 16 (5-6) : 567 - 590
  • [3] EUCLIDEAN SHORTEST-PATH IN THE PRESENCE OF OBSTACLES
    CHEN, YM
    RAMANAN, P
    [J]. NETWORKS, 1991, 21 (03) : 257 - 265
  • [4] SHORTEST PATH ALGORITHM FOR GRID GRAPHS
    HADLOCK, FO
    [J]. NETWORKS, 1977, 7 (04) : 323 - 334
  • [5] CHARACTERIZING THE SHORTEST-PATH OF AN OBJECT AMONG OBSTACLES
    FEINBERG, EB
    [J]. INFORMATION PROCESSING LETTERS, 1989, 31 (05) : 257 - 264
  • [6] Shortest path in the presence of obstacles: An application to ocean shipping
    Fagerholt, K
    Heimdal, SI
    Loktu, A
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2000, 51 (06) : 683 - 688
  • [7] Spatial Filtering for Identifying a Shortest Path Around Obstacles
    Hong, Insu
    Murray, Alan T.
    Wolf, Levi J.
    [J]. GEOGRAPHICAL ANALYSIS, 2016, 48 (02) : 176 - 190
  • [8] Complexity of pairwise shortest path routing in the grid
    Gonzalez, TF
    Serena, D
    [J]. THEORETICAL COMPUTER SCIENCE, 2004, 326 (1-3) : 155 - 185
  • [9] Planning the Shortest Safe Path Amidst Unpredictably Moving Obstacles
    van den Berg, Jur
    Overmars, Mark
    [J]. ALGORITHMIC FOUNDATION OF ROBOTICS VII, 2008, 47 : 103 - 118
  • [10] Shortest path queries among weighted obstacles in the rectilinear plane
    Chen, DZ
    Klenk, KS
    Tu, HYT
    [J]. SIAM JOURNAL ON COMPUTING, 2000, 29 (04) : 1223 - 1246
12345