Bloom Filter Map Link Encoding for Navigation Bandwidth
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing navigation systems face challenges in efficiently managing and updating map data across different versions, leading to bandwidth inefficiencies and maintenance issues when dealing with vehicle-dependent and time-dependent restrictions, as they require multiple versions of digital maps to be stored and maintained by servers.
Innovation Solution
The implementation of a map version-agnostic communication solution using bloom filters to encode and transmit categorized links, allowing for bandwidth-efficient transmission and decoding of traversable and non-traversable links, independent of digital map versions, by using map version-agnostic identifiers and encoding links into bit arrays.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If multiple versions of digital maps are maintained by the server to handle different map versions at client devices, then navigation accuracy and reliability are improved, but server memory requirements and maintenance complexity increase significantly
Solution Approach 1:
The patent extracts only the essential categorized link information (traversable and non-traversable links) from complete digital maps and transmits this extracted data to client devices. This allows clients to determine route validity without requiring the server to maintain or transmit full map versions, resolving the contradiction between navigation reliability and server complexity
Solution Approach 2:
Instead of maintaining multiple complete map versions, the system creates simplified copies containing only categorized link data that are transmitted to clients. These lightweight data structures enable clients to validate routes against their local map versions without requiring the server to store or manage multiple full map versions
2Measurement precision
If complete digital maps are transmitted between server and client to ensure map version compatibility, then route validation accuracy is improved, but network bandwidth consumption increases
Solution Approach 1:
The system extracts only the necessary categorized link information (traversable and non-traversable links with their identifiers and restrictions) from complete digital maps. This extracted data is transmitted to clients in a compact format, enabling accurate route validation without the bandwidth overhead of transmitting full map datasets
Solution Approach 2:
The patent implements local quality by providing different data representations to different clients based on their needs. Clients receive only the categorized link data relevant to their route validation requirements, while the server maintains full map versions locally. This allows each client to have the appropriate level of data quality without universal high-bandwidth transmission
3Reliability
If detailed link information is transmitted to ensure accurate route determination, then navigation reliability is improved, but data transmission time and bandwidth usage increase
Solution Approach 1:
The system extracts only the essential elements needed for route determination (categorized link identifiers, traversability status, and relevant restrictions) from detailed map data. This extracted information is transmitted quickly to clients, enabling reliable route determination without the time penalty of transmitting complete map datasets
Solution Approach 2:
The patent applies partial action by transmitting only the specific categorized link information needed for route validation rather than complete map data. This partial data transmission is sufficient for the navigation function while significantly reducing transmission time and bandwidth usage
Data Source
AI summary
An apparatus, method and computer program product are provided for generating map data of categorized links. The method may include receiving a request for at least one categorized link in a map area and obtaining at least one categorized link in the map area, based on the request. The method may further include determining link identifiers corresponding to each link of the at least one categorized link, and generating at least one bloom filter, wherein the at least one bloom filter encodes link identifiers corresponding to each link of the at least one categorized link.