Referenced Items are not available for this document.
An optimal planned route is a foundation of safe and economical navigation. This paper proposes a method for the shortest distance routing in a chart based on testing a spatial relation of a linear route segment and an obstacle area. Firstly, safety contour traces are traced and obstacle areas are acquired automatically. Then possible optimum paths circumambulating an obstacle are searched automatically by comparing the spatial relation of the linear route segment and the nearest obstacle area. Finally a route binary tree is constructed and the shortest route is obtained. Experimental results demonstrate that the proposed method has more advantageous over traditional methods in efficiency, accuracy and reliability.
Published in:
Advanced Computer Control (ICACC), 2010 2nd International Conference on
(Volume:5
)
Date of Conference: 27-29 March 2010
- Page(s):
- 142 - 147
- Print ISBN:
- 978-1-4244-5845-5
- INSPEC Accession Number:
- 11502615
- Conference Location :
- Shenyang
- Digital Object Identifier :
- 10.1109/ICACC.2010.5487275
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
