.png){kind=icon}
返回
A bidirectional path-finding algorithm and data structure for maritime routing
.png){kind=icon}
OA
AI
DOI：10.1080/13658816.2014.887087.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Route planning is an important problem for many real-time applications in open and complex environments. The maritime domain is a relevant example of such environments where dynamic phenomena and navigation constraints generate difficult route finding problems. This paper develops a spatial data structure that supports the search for an optimal route between two locations while minimizing a cost function. Although various search algorithms have been proposed so far (e.g. breadth-first search, bidirectional breadth-first search, Dijkstra's algorithm, A(*), etc.), this approach provides a bidirectional dynamic routing algorithm which is based on hexagonal meshes and an iterative deepening A(*) (IDA(*)) algorithm, and a front to front strategy using a dynamic graph that facilitates data accessibility. The whole approach is applied to the context of maritime navigation, taking into account navigation hazards and restricted areas. The algorithm developed searches for optimal routes while minimizing distance and computational time.
Keyword:
maritime routing
computational geometry
artificial intelligence
geographic information science
navigation aids
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.1
论文数:
2.7K
被引数:
9.3K
机构
暂无机构信息
引用论文
.png){kind=icon}
West Nile virus and other zoonotic viruses in Russia: examples of emerging-reemerging situations
PREAI
分享收藏分享收藏
Efficient encoding and spatial operation scheme for aperture 4 hexagonal discrete global grid system
PREAI
分享收藏
查看更多内容