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 条
  • [41] On shortest path representation
    Retvari, Gabor
    Biro, Jozsef J.
    Cinkler, Tibor
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2007, 15 (06) : 1293 - 1306
  • [42] The Shortest Path to Significance
    Hecker, Julian
    Prokopenko, Dmitry
    Fier, Heide Lohlein
    Lange, Christoph
    [J]. HUMAN HEREDITY, 2016, 81 (04) : 233 - 233
  • [43] A SHORT PATH TO THE SHORTEST-PATH
    LAX, PD
    [J]. AMERICAN MATHEMATICAL MONTHLY, 1995, 102 (02): : 158 - 159
  • [44] Secluded Path via Shortest Path
    Johnson, Matthew P.
    Liu, Ou
    Rabanca, George
    [J]. STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, SIROCCO 2014, 2014, 8576 : 108 - 120
  • [45] ERA*: Enhanced Relaxed A* algorithm for solving the shortest path problem in regular grid maps
    Ammar, Adel
    [J]. INFORMATION SCIENCES, 2024, 657
  • [46] Grid discretization based method for anisotropic shortest path problem over continuous regions
    Jia, ZF
    Varaiya, P
    [J]. 2004 43RD IEEE CONFERENCE ON DECISION AND CONTROL (CDC), VOLS 1-5, 2004, : 3830 - 3837
  • [47] The analysis of effectiveness of the shortest path for traveling salesman problems in 2D grid
    Valbahs, Edvards
    Grabusts, Peter
    [J]. AICT 2013: APPLIED INFORMATION AND COMMUNICATION TECHNOLOGIES, 2013, : 315 - 320
  • [48] Shortest path games
    Rosenthal, Edward C.
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2013, 224 (01) : 132 - 140
  • [49] On shortest path games
    Fragnelli, V
    García-Jurado, I
    Méndez-Naya, L
    [J]. MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2000, 52 (02) : 251 - 264
  • [50] On shortest path games
    Vito Fragnelli
    Ignacio García-Jurado
    Luciano Méndez-Naya
    [J]. Mathematical Methods of Operations Research, 2000, 52 : 251 - 264
12345