About this Journal Submit a Manuscript Table of Contents
VLSI Design
Volume 9 (1999), Issue 1, Pages 91-104
http://dx.doi.org/10.1155/1999/37271

Finding Combined L1 and Link Metric Shortest Paths in the Presence of Orthogonal Obstacles: A Heuristic Approach

1Department of Computer Science, Kyung Won University, Sung Nam 461-701, Korea
2Department of Computer Science, Louisiana State University, Baton Rouge 70803, LA, USA

Received 13 March 1997

Copyright © 1999 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

This paper presents new heuristic search algorithms for searching combined rectilinear (L1) and link metric shortest paths in the presence of orthogonal obstacles. The Guided Minimum Detour (GMD) algorithm for L1 metric combines the best features of mazerunning algorithms and line-search algorithms. The Line-by-Line Guided Minimum Detour (LGMD) algorithm for L1 metric is a modification of the GMD algorithm that improves on efficiency using line-by-line extensions. Our GMD and LGMD algorithms always find a rectilinear shortest path using the guided A* search method without constructing a connection graph that contains shortest paths. The GMD and the LGMD algorithms can be implemented in O(m+eloge+NlogN) and O(eloge+NlogN) time, respectively, and O(e+N) space, where m is the total number of searched nodes, e is the number of boundary sides of obstacles, and N is the total number of searched line segments. Based on the LGMD algorithm, we consider not only the problems of finding a link metric shortest path in terms of the number of bends, but also the combined L1 metric and link metric shortest path in terms of the length and the number of bends.