A method for searching optimal routes with collision avoidance on raster charts

Journal of Navigation

Volumn 56, Issue 3, 2003, Pages 371-384

  Chang, Ki Yin ^a   Jan, Gene Eu ^a   Parberry, Ian ^b  

^a NATIONAL TAIWAN OCEAN UNIVERSITY   (Taiwan)

^b UNIVERSITY OF NORTH TEXAS   (United States)

Author keywords

Charts; Maze routing; Optimal route; Raster charts

Indexed keywords

ALGORITHM; COLLISION AVOIDANCE; GPS; NAVIGATION AID; RASTER; REAL TIME; SHIPPING;

EID: 0141890850     PISSN: 03734633     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0373463303002418     Document Type: Article

References (28)

1. Ahuja, R. K., Mehlhorn, K., Orlin, J. B. and Tarjan, R. E. (1990). Faster algorithms for the shortest path problem. Journal of ACM, 37, 213-223.
2. Beattie, J. H. (1995). The future of electronic chart in merchant ships. This Journal, 48, 335-348.
3. Chen, Y. M. and Ramanan, P. (1991). Euclidean shortest paths in the presence of obstacles. Networks, 21, 257-265.
4. Cockcroft, A. N. and Lameijer, J. N. (1996). A guide to the collision avoidance rules: International Regulations for Preventing Collisions at Sea. (5th ed.): Oxford.
5. Coenen, F. P., Smeaton, G. P. and Bole, A. G. (1989). Knowledge-based collision avoidance. This Journal, 42, 107-116.
6. Coldwell, T. G. (1983). Marine traffic behaviour in restricted waters. This Journal, 36, 430-444.
7. Colley, B. A., Curtis, R. G. and Stockel, C. T. (1984). A marine traffic flow and collision avoidance computer simulation. This Journal, 37, 232-250.
8. Davis, P. V., Dove, M. J. and Stockel, C. T. (1982). A computer simulation of multi-ship encounters. This Journal, 35, 347-352.
9. Dawson, J. (1997). Digital charting, now and in the future. This Journal, 52, 251-255.
10. Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1, 269-271.
11. Eracl, F. and Lee, H. C. (1997). Time-efficient maze routing algorithms on reconfigurable mesh architectures. Journal of Parallel and Distributed Computing, 44, 133-140.
12. Fagerholt, K., Heimdal, S. and Loktu, A. (2000). Shortest paths in the presence of obstacles: an application to ocean shipping. Journal of the Operational Research Society, 51, 683-688.
13. Fawcett, J. and Robinson, P. (2000). Adaptive routing for road traffic. IEEE Comput. Graph. Appl., 20, 46-53.
14. Fujii, Y. and Tanaka, K. (1971). Traffic capacity. This Journal, 24, 543-552.
15. Goodwin, E. M. (1975). A statistical study of ship domains. This Journal, 28, 328-344.
16. Henzinger, M. R., Klein, P., Rao, S. and Subramanian, S. (1997). Faster shortest-path algorithms for planar graphs. Journal of Computer and System Sciences, 55, 3-23.
17. Hoel, J. H. (1976). Some variations of Lee's algorithm. IEEE Trans. Comput., c-25, 19-24.
18. Jan, G. E. and Chang, K. Y. (2002). An improved Lee's algorithm on electronic maps. Proceeding of Int. Computer Symposium, 776-786.
19. Jan, G. E., Chang, K. Y. and Parberry, I. (2003). A new cell decomposition method to automatic path-planning for a mobile robot. The Seventh Int. Conference on Automation Technology, Sept. 2003.
20. Kimmel, R., Amir, A. and Bruckstein, A. M. (1995). Finding shortest paths on surfaces using level sets propagation. IEEE Trans. Pattern Anal. Machine Intell. 17, 635-640.
21. Lee, C. Y. (1961). An algorithm for path connection and its applications. IRE Trans. Electron. Comput., EC-10, 346-365.
22. Lin, Y. L., Hsu, Y. C. and Tsai, F. S. (1990). Hybrid routing. IEEE Trans. Computer-Aided Design, 9, 151-157.
23. Norris, A. P. (1998). The status and future of the electronic chart. This Journal, 51, 321-326.
24. Rubin, F. (1974). The Lee path connection algorithm. IEEE Trans. Comput., c-23, 907-914.
25. Sherwani, N. A. (1999). Algorithms for VLSI physical design automation, 3rd ed. Boston: Kluwer Academic Publishers, 260-279.
26. p-norm). European Journal of Operational Research, 20, 373-381.
27. Xing, Z. and Kao, R. (2002). Shortest path search using tiles and piecewise linear cost propagation. IEEE Trans. Computer-Aided Design, 21, 145-158.
28. Zhao, J., Wu, Z. and Wang, F. (1993). Comments on ship domains. This Journal, 46, 422-436.