Navigation System Route Planning with Pre-calculated Paths
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Navigation systems fail to efficiently integrate special destinations into route planning while considering the use limitations of path networks, particularly for vehicles with specific constraints, as they do not adequately account for alternative paths with lower restrictions during route computation.
Innovation Solution
A navigation system and method that assigns multiple total paths between traffic nodes and special destinations, prioritizing those with lower use limitations by omitting path sections with severe restrictions, allowing for the selection of the shortest or most suitable path based on vehicle parameters, and displaying alternative paths with lower use limitations to the user.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If the navigation system stores and processes multiple alternative total paths with different use limitations for each special destination, then the route planning accuracy and adaptability for vehicles with special constraints is improved, but the device complexity and data storage requirements increase
Solution Approach 1:
The system pre-calculates and stores multiple alternative total paths with different use limitations in the database before actual route planning occurs. Each special destination is pre-associated with its connecting nodes and multiple possible routes, so that during runtime the system only needs to query and select from pre-prepared options rather than computing paths in real-time.
Solution Approach 2:
The path network is segmented into discrete path sections, each with specific use limitations (weight, height, length, etc.). The total paths are constructed by combining these segmented path sections between connecting nodes and special destinations. This segmentation allows the system to evaluate and filter paths based on vehicle-specific constraints by checking individual path section properties.
2Reliability
If the navigation system calculates and stores multiple alternative total paths with lower use limitations, then the reliability of route planning for restricted vehicles is improved, but the loss of time and computational resources increase
Solution Approach 1:
Multiple alternative total paths are pre-calculated and stored in the database during offline preparation, including paths with different use limitation profiles. During online operation, the system simply queries the pre-computed paths and selects the appropriate one based on the vehicle's current constraints, avoiding time-consuming real-time calculations.
Solution Approach 2:
The system replaces complex real-time mechanical path calculation with database querying and filtering operations. By substituting computational mechanics with data retrieval and comparison, the system achieves fast path selection without sacrificing reliability.
3Ease of operation
If the navigation system filters and assigns only accessible total paths based on vehicle parameters, then the ease of operation is improved, but the loss of information about alternative routes may occur
Solution Approach 1:
The system performs partial filtering by presenting the user with a subset of total paths that are most relevant to the vehicle's constraints, rather than showing all possible paths. This partial action provides sufficient information for decision-making without overwhelming the user with excessive alternatives.
Solution Approach 2:
The system pre-filters total paths based on vehicle parameters before presentation to the user, eliminating obviously infeasible routes in advance. This preliminary filtering action reduces the information load while ensuring that all potentially viable options remain available for user selection.
Data Source
AI summary
A navigation system for ascertaining qualified special destinations includes: a database, which stores transport route nodes and route sections connecting the route sections and properties thereof; a route computation device; and a memory device. Special destinations stored in the database are each linked to one or more connecting nodes, for example motorway exits. Each special destination has, for each connecting node linked thereto, at least one associated first total route, connecting the special destination and the connecting node to one another, and an associated total route length. At least in the event of the first total route having a use restriction, the special destination and the connecting node also have at least one associated second total route that, at least for one restriction parameter, has lesser use restrictions.