A method for calculating a shortest distance navigation route
By segmenting navigation areas and using Dijkstra's algorithm to calculate the shortest path, the inefficiency of calculating the shortest distance routes in global oceans in existing technologies is solved, resulting in higher quality routes with less computation.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- CHONGQING TESLINK TECH CO LTD
- Filing Date
- 2023-06-13
- Publication Date
- 2026-07-24
AI Technical Summary
Existing technologies struggle to balance computational quality and computational load when calculating the shortest routes across the global oceans, especially when considering geographical and meteorological conditions, resulting in low computational efficiency.
The sea area is segmented by combining the navigation area segmentation algorithm with the template matching method to form a route network. The shortest path is calculated using Dijkstra's algorithm, and the route is smoothed by geometric methods to ensure that it does not pass through obstacle areas and danger zones.
It improves the quality and efficiency of route calculation, reduces the amount of computation, and generates routes that are closer to the actual shortest distance, thus avoiding the waste of computing resources.
Smart Images

Figure CN116824914B_ABST