Encoded Routability Graph Junction Transition Likelihoods
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing indoor positioning systems face challenges in efficiently processing and reducing the complexity of encoded routability graphs, which are large and computationally burdensome, affecting mobile device performance in navigating indoor structures.
Innovation Solution
A method to obtain and assign likelihoods of transition from ingress to egress edges in an encoded routability graph based on features of the encoded map, using a computing platform to determine and compress the graph, reducing the number of interconnected junctions and feasible paths, thereby improving processing efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If an encoded routability graph is used to represent feasible paths in an indoor environment, then navigation capability is improved, but the graph size and computational complexity increase, burdening mobile devices
Solution Approach 1:
The patent segments the encoded routability graph by identifying and separating junctions as distinct nodes with specific properties (ingress edges, egress edges, directional transitions). This segmentation allows the graph to be processed and compressed by focusing on key decision points rather than treating the entire path network as a single complex structure, thereby reducing computational burden while maintaining navigation capability.
Solution Approach 2:
The patent performs preliminary computation of transition likelihoods and graph compression on a server before transmitting data to mobile devices. By pre-processing the routability graph to determine probable transitions at junctions based on map features, the system reduces the amount of data and computational requirements that mobile devices must handle during actual navigation, resolving the contradiction between comprehensive navigation capability and device complexity.
2Measurement precision
If transition likelihoods are assigned to all egress edges at junctions based on map features, then navigation accuracy is improved, but processing time and computational resources increase
Solution Approach 1:
The patent applies local quality by computing transition likelihoods specifically at junction nodes rather than uniformly across the entire graph. Each junction is analyzed based on its local map features (ingress and egress edges, directional transitions), allowing accurate navigation decisions at critical points without the computational overhead of processing every edge in the graph, thus balancing accuracy with processing efficiency.
Solution Approach 2:
The patent changes the parameter representation by using encoded map features and directional transition probabilities instead of detailed geometric path information. By representing navigation data in terms of transition likelihoods at junctions rather than complete path geometries, the system achieves accurate navigation with reduced processing requirements and faster computation times.
3Device complexity
If the encoded routability graph is compressed to reduce size, then mobile device processing burden is reduced, but information loss may occur
Solution Approach 1:
The patent extracts and retains only the essential information needed for navigation by identifying junctions as key nodes and computing transition likelihoods between their ingress and egress edges. By extracting this critical path information while discarding redundant details, the system achieves graph compression that reduces mobile device processing burden without significant loss of navigational utility, as the extracted junction-based representation preserves the essential routing decisions.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
Techniques are provided, which may be implemented in various methods, apparatuses, and/or articles of manufacture, to obtain an encoded routability graph representative of feasible paths in an indoor environment represented by an encoded map, and assign likelihoods of transition from an ingress edge in the encoded routability graph to individual egress edges through a junction connecting the ingress edge to a plurality of egress edges based, at least in part, on one or more features of the encoded map.