Finding combined L-1 and link metric shortest paths in the presence of orthogonal obstacles: A heuristic approach Article

Lim, JS, Iyengar, SS, Zheng, SQ. (1999). Finding combined L-1 and link metric shortest paths in the presence of orthogonal obstacles: A heuristic approach . 9(1), 91-104. 10.1155/1999/37271

Open Access International Collaboration

keywords

  • ALGORITHM
  • Computer Science
  • Computer Science, Hardware & Architecture
  • GRAPH
  • L-1 and link metric shortest paths
  • Science & Technology
  • TREES
  • Technology
  • line-search algorithms
  • maze-running algorithms

Digital Object Identifier (DOI)

start page

  • 91

end page

  • 104

volume

  • 9

issue

  • 1