Route Planning System Using IA* and Dijkstra Algorithms
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current voyage planning techniques are inefficient in planning routes around obstacles, especially moving obstacles, due to computational complexity and time-consuming algorithms, making them unsuitable for large-scale applications.
Innovation Solution
A route planning system utilizing a processor with executable instructions comprising A* and Iterative A* algorithms, along with a Dijkstra algorithm, and an Automatic Identification System (AIS) transceiver to rapidly compute optimal routes across large areas, including around moving obstacles, by generating directed arcs and way-points.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Manufacturing precision
If traditional AI path-finding algorithms are used to guarantee optimal routes, then route optimality is improved, but computational resources and time consumption increase enormously
Solution Approach 1:
The patent segments the route planning problem into multiple stages: way-point generation using A* algorithm, arc generation using Dijkstra algorithm, and route selection using IA* algorithm. This segmentation allows each algorithm to focus on specific aspects of route planning, reducing overall computational complexity while maintaining optimality.
Solution Approach 2:
The patent performs preliminary actions by pre-generating way-points and directed arcs using A* and Dijkstra algorithms before final route selection. This preliminary computation creates a structured graph representation of the environment, enabling faster route planning when obstacles move or conditions change.
2Productivity
If related art voyage planning techniques are used, then planning stages are completed, but inability to handle moving obstacles reduces effectiveness
Solution Approach 1:
The patent implements dynamic route planning where the IA* algorithm can re-plan routes in real-time when obstacles move or conditions change. The system maintains an updated graph representation of the environment, allowing adaptive response to dynamic situations while preserving the efficiency of the underlying A* and Dijkstra algorithms.
3Reliability
If comprehensive search of all possible paths is performed, then optimal path is guaranteed, but computational resources become enormous
Solution Approach 1:
The patent applies local quality by using heuristic functions in the A* algorithm to guide the search toward promising areas of the search space. Instead of uniformly exploring all possible paths, the algorithm focuses computational effort on areas that are more likely to contain optimal routes, based on heuristic estimates of cost to reach the goal.
Data Source
AI summary
A route planning system and methods involving: a processor operable by executable instructions, the instructions having cooperating algorithms, the cooperating algorithms having an A* algorithm, an IA* algorithm cooperatively communicating with the A* algorithm; and a Dijkstra algorithm cooperatively communicating with the IA* algorithm, the IA* algorithm configured to iteratively and recursively call the A* algorithm to generate directed arcs, the IA* algorithm configured to call the Dijkstra algorithm and to transmit the directed arcs to the Dijkstra algorithm, and the A* algorithm and the Dijkstra algorithm being non-interacting; and an automatic identifications systems transceiver disposed in relation to a vessel, the transceiver configured to receive global positioning system signals and calculate a current position of the vessel in relation to Earth, the AIS transceiver configured to communicate with the processor.