XML Map Data Route Search Using Administrative Boundary Nodes
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional navigation systems face inefficiencies in generating and modifying map data, particularly due to the complex and time-consuming nature of mesh-based data formats, which are not logically related to geographic areas, hindering effective route searching.
Innovation Solution
A route search method utilizing XML map data structured by administrative regions, where boundary nodes are established to evaluate costs of virtual and physical links, allowing for efficient route calculation between a start point and destination by connecting boundary nodes across different administrative regions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If mesh structured data is used for map data, then the map data can be stored and retrieved, but the generation and modification process becomes complex and time-consuming
Solution Approach 1:
The patent segments the map data into hierarchical layers (national, state, county, city levels) with each layer containing specific administrative region boundary nodes and road network information. This segmentation allows the system to store comprehensive map data while simplifying generation and modification processes by working with discrete administrative units rather than complex mesh structures.
Solution Approach 2:
The patent transitions from a two-dimensional mesh grid structure to a hierarchical multi-dimensional structure organized by administrative regions. This dimensional change enables more intuitive organization of map data by geographic hierarchy, making generation and modification easier while maintaining comprehensive coverage.
2Quantity of substance
If mesh structured data is used, then map data can be stored, but the route searching efficiency is reduced due to lack of logical relationship with geographic areas
Solution Approach 1:
The patent segments the map data into hierarchical layers corresponding to administrative regions (national, state, county, city), where each layer contains boundary nodes and road networks for that specific region. This segmentation creates logical relationships with geographic areas, enabling efficient route searching by navigating through administrative hierarchies rather than searching through unrelated mesh grids.
Solution Approach 2:
The patent introduces boundary nodes as intermediary elements that connect different administrative regions and serve as key reference points for route calculation. These boundary nodes act as mediators between hierarchical layers, enabling efficient route searching by providing structured connection points that reflect actual geographic relationships.
3Ease of manufacture
If layered structure with multiple details is used, then map data can be organized by hierarchy, but the processing time for route calculation increases
Solution Approach 1:
The patent segments the route calculation process into hierarchical stages, where routes are calculated independently at each administrative level (national, state, county, city) and then combined. This segmentation allows for efficient processing by breaking down the complex route calculation into manageable sub-problems, reducing overall processing time while maintaining hierarchical organization.
Solution Approach 2:
The patent performs preliminary actions by pre-calculating and storing route information at higher administrative levels (national and state levels) before processing local routes. This preliminary action reduces the computational burden during actual route calculation by having pre-computed data available for lower levels.
4Measurement precision
If detailed map information is included in all layers, then route accuracy is improved, but the data size and processing complexity increase
Solution Approach 1:
The patent applies local quality by including detailed map information (POI icons, building footprints, specific road characteristics) only in the lowest city-level layer, while higher layers contain summarized information appropriate to their scale. This selective inclusion of details at appropriate levels maintains route accuracy for local navigation while reducing overall data structure complexity and processing requirements.
Data Source
AI summary
A route search method for a navigation system using the XML map data that is layered based on administrative regions improves efficiency and accuracy of finding an optimum route. The method includes the steps of establishing boundary nodes on boundaries of administrative regions, creating cost information on virtual links that connect the boundary nodes on the administrative regions and physical links on a base layer, selecting candidate virtual links regions by evaluating the cost information, detecting candidate total routes between the start point and destination by connecting the candidate virtual links and other routes, and applying physical links in the base layer to the candidate total routes for further evaluating the costs of the total routes to select the most cost effective total route.