Node-Link Map Vehicle Alerting for Large Fleet Zone Matching
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Managing alerting zones in cloud-based safety systems for a large number of vehicles is cumbersome and resource-intensive due to the conventional method of defining zones using latitude and longitude coordinates.
Innovation Solution
Utilizing a node/link-based map data model to populate a database with vehicle entries that include node IDs and link IDs, and initiating alert messaging operations based on matches between search keys and these IDs to define alerting zones.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional latitude and longitude coordinates are used to define alerting zones, then the alerting zone can cover the projected route and surrounding area of vehicles, but the system becomes cumbersome and resource-intensive when managing a large number of vehicles
Solution Approach 1:
The patent transforms the coordinate system parameters from continuous latitude/longitude values to discrete node/link IDs from a graph-based map model. This parameter change simplifies the representation of alerting zones by converting geometric areas into sets of discrete graph elements, making it easier to manage and compute intersections with vehicle paths.
Solution Approach 2:
The patent creates an abstract graph-based representation (copy) of the geographic map, where nodes and links represent locations and routes. This abstract model serves as a simplified copy that captures essential spatial relationships without the complexity of continuous coordinates, enabling efficient alerting zone management.
2Measurement precision
If conventional latitude and longitude coordinates are used to track vehicle positions, then the complete position information can be maintained, but the computational resources required for tracking and projecting vehicle positions increase
Solution Approach 1:
The patent changes the parameter representation of vehicle positions from continuous latitude/longitude coordinates to discrete node/link IDs in a graph model. This transformation maintains position accuracy by mapping coordinates to specific graph elements while reducing computational complexity through discretization and use of integer-based IDs instead of floating-point coordinates.
3Manufacturing precision
If alerting zones are defined using geographical areas with latitude and longitude coordinates, then the zones can accurately represent the projected route and surrounding area, but managing these zones for large numbers of vehicles becomes resource-intensive
Solution Approach 1:
The patent transforms alerting zone definitions from continuous geographic areas to discrete sets of node and link IDs. This parameter transformation maintains the ability to accurately represent routes and areas while enabling efficient management through graph-based operations that are computationally lighter than coordinate-based geometric calculations.
Solution Approach 2:
The patent segments the continuous geographic space into discrete graph elements (nodes and links). This segmentation allows alerting zones to be represented as collections of discrete elements rather than continuous areas, facilitating efficient computation of vehicle-path intersections and reducing the computational burden of managing multiple zones.
Data Source
AI summary
Embodiments of a method and non-transitory computer readable mediums for vehicle alerting are disclosed. In an embodiment, the method for vehicle alerting involves populating a database with vehicle entries, the vehicle entries in the database including a vehicle identifier (ID) and at least one of a node ID and a link ID that correspond to a digital map that uses a map data model with node IDs and link IDs, and initiating an alert messaging operation corresponding to a vehicle ID of a vehicle entry in the database in response to a match between a search key and at least one of the node ID and the link ID of the vehicle entry, wherein the search key includes at least one of a node ID and a link ID.