Hostname: page-component-7dd5485656-j7khd Total loading time: 0 Render date: 2025-10-29T19:44:59.786Z Has data issue: false hasContentIssue false
  • English
  • Français

Optimal Interceptions on Two-Dimensional Grids with Obstacles

Published online by Cambridge University Press:  10 December 2007

Ki Yin Chang ,
Gene Eu Jan ,
Chien-Min Su  and
Ian Parberry
Ki Yin Chang*
Affiliation:
(National Taiwan Ocean University, Taiwan)
Gene Eu Jan
Affiliation:
(National Taipei University, Taiwan)
Chien-Min Su
Affiliation:
(National Taiwan Ocean University, Taiwan)
Ian Parberry
Affiliation:
(University of North Texas, USA)
*
(Email: b0170@mail.ntou.edu.tw)
Get access Rights & Permissions [Opens in a new window]

Abstract

This article presents efficient and practical methods for path planning of optimal interceptions on two-dimensional grids with obstacles, such as raster charts or non-distorted digital maps. The proposed methods search for optimal paths from sources to multiple moving-targets by a novel higher geometry wave propagation scheme in the grids, instead of the traditional vector scheme in the graphs. By introducing a time-matching scheme, the optimal interception paths from sources to all the moving-targets are obtained among the combinations with linear time and space complexities. Two optimal path planning methods for multiple one-to-one interceptions, the MIN-MAX and MIN-AVG, are applied to emulate the real routing.

Keywords

InterceptionHigher geometry maze routerMultiple moving-targetsRaster charts

Information

Type
Research Article
Information
The Journal of Navigation , Volume 61 , Issue 1 , January 2008 , pp. 31 - 43
Copyright
Copyright © The Royal Institute of Navigation 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

REFERENCES

Benkoski, S. J., Monticino, M. G. and Weisinger, J. R. (1991). A survey of the search theory literature. Naval Research Logistics, 38, 469–494.3.0.CO;2-E>CrossRefGoogle Scholar
Chang, K. Y., Jan, G. E. and Parberry, I. (2004). A method for searching optimal routes with collision avoidance on raster charts. The Journal of Navigation, 56, 371–384.CrossRefGoogle Scholar
Chimura, F. and Tokoro, M. (1994). Trailblazer search: A new method for searching and capturing moving targets, Proceedings of the National Conference on Artificial Intelligence, 2, 1347–1352.Google Scholar
Dawson, J. (1997). Digital charting, now and in the future. The Journal of Navigation, 52, 251–255.CrossRefGoogle Scholar
Eagle, J. N. (1984). The optimal search for a moving target when the search path is constrained. Operations Research, 32, 1107–1115.CrossRefGoogle Scholar
Eagle, J. N. and Yee, J. R. (1990). An optimal branch-and-bound procedure for the constrained path, moving target search problem. Operations Research, 28, 110–114.CrossRefGoogle Scholar
Hart, P. E., Nilsson, N. J. and Raphael, B. (1968). A formal basis for the heuristic determination of minimum cost paths, IEEE Trans. on Systems Science and Cybernetics, 4(2), 100–107.Google Scholar
Ishida, T. and Korf, R. E. (1995). Moving-target: A real-time search for changing goals. IEEE Trans. on Pattern Analysis and Machine Intelligence, 17, 609–619.CrossRefGoogle Scholar
Jan, G. E., Chang, K. Y., Gao, S. and Parberry, I. (2005). A 4-geometry maze routing algorithm and its application on multi-terminal nets. ACM Trans. on Design Automation of Electronic Systems, 10, 116–135.CrossRefGoogle Scholar
Norris, A. P. (1998). The status and future of the electronic chart. The Journal of Navigation, 51, 321–326.CrossRefGoogle Scholar
Pillich, B., Pearlman, S., Chase, C. and GmbH, S. C. (2003). Real time data and ECDIS in a web-based port management package. OCEANS Proceedings, 4, 2227–2233.Google Scholar
Ross, M. and Dawson, R. (1994). Drift errors in search and rescue. The Journal of Navigation, 47, 369–382.CrossRefGoogle Scholar
Schuster, G. M., Melnikov, G. and Katsaggelos, A. K. (1999). A review of the minimum maximum criterion for optimal bit allocation among dependent quantizers, IEEE Transactions on Multimedia, 1(1), 3–17.Google Scholar
Thomas, L. C. and Eagle, J. N. (1995). Criteria and approximate methods for path-constrained moving-target search problems, Naval Research Logistics, 42, 27–38.3.0.CO;2-H>CrossRefGoogle Scholar