Navigation Mesh Route Simplification via Node Scoring
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing navigation mesh routes generated by algorithms like 'string-pulling' often result in unnatural, jagged, or complex routes that do not respect the original shape, making them unsuitable for turn-by-turn guidance and are difficult to simplify without crossing non-navigable areas.
Innovation Solution
A curve evolution based path simplification algorithm that scores each node in a route based on its importance to the route's shape, removing nodes with the least importance while maintaining a valid route, ensuring it does not cross into non-navigable areas, until no further nodes can be removed without creating an invalid route.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Length of moving object
If a string-pulling algorithm is used to simplify the route, then the route becomes more direct and shorter, but the route loses its original shape and becomes unnatural-looking
Solution Approach 1:
The patent applies parameter changes by scoring each internal node based on multiple parameters (incoming segment length, outgoing segment length, path angle) and using these scores to determine which nodes to remove. This systematic parameter-based approach allows the algorithm to balance route simplification with shape preservation, unlike the string-pulling algorithm that uses a single criterion (route length).
Solution Approach 2:
The patent uses partial action by selectively removing only those internal nodes that have the lowest scores and meet removal criteria, rather than removing all possible nodes or none. This partial removal strategy maintains the essential shape characteristics while achieving sufficient simplification, resolving the contradiction between route shortening and shape preservation.
2Adaptability or versatility
If navigation mesh routes are generated directly, then routing coverage is comprehensive, but the routes are jagged, complex, and difficult to provide turn-by-turn guidance
Solution Approach 1:
The patent extracts and removes unnecessary internal nodes from the navigation mesh route while preserving the essential path structure. By taking out redundant nodes that contribute to jaggedness and complexity but are not essential for maintaining valid routing coverage, the algorithm simplifies the route for turn-by-turn guidance while preserving comprehensive routing adaptability.
Solution Approach 2:
The patent segments the route into connected nodes and evaluates each internal node independently using scoring based on local geometric parameters. This segmentation allows the algorithm to process and simplify the route in manageable units, reducing overall complexity while maintaining the segmented routing coverage needed for comprehensive navigation.
3Device complexity
If internal nodes are removed to simplify the route, then the route becomes smoother and less complex, but the route may cross into non-navigable areas
Solution Approach 1:
The patent employs feedback by checking whether removing an internal node would cause the route to cross into non-navigable areas before actually removing it. This validation feedback mechanism ensures that simplification operations maintain route validity, resolving the contradiction between reducing complexity and preserving reliability.
Solution Approach 2:
The patent applies preliminary anti-action by preventing the removal of nodes that would compromise route validity. Before simplifying the route by removing internal nodes, the algorithm proactively checks and blocks removal operations that would cause the route to cross non-navigable areas, thus preventing validity issues before they occur.
Data Source
AI summary
Systems, apparatuses, and methods are provided for developing an improved route from a navigation mesh. A route is provided, wherein the route includes a plurality of connected nodes having a starting node, an ending node, and internal nodes. Each internal node of the plurality of connected nodes is scored by an algorithm, wherein the score provided for each internal node based on an importance of the respective internal node to the overall shape of the route. The internal node with a score having a least importance on the shape of the route is removed, so long a valid path between the starting node and the ending node is maintained. The process may be repeated until a threshold simplification of the route has been achieved or until no further internal nodes can be removed without creating an invalid path.