IP Library Granted Patent US 12,530,967
Granted Patent B2
US 12,530,967 · App. 18/583,292 · Granted Jan 20, 2026

Methods and systems for vehicle alerting based on map data model with links and nodes

Inventors: Jigar Patel (Arlington Heights, IL); Cory Hohs (Chicago, IL); Surya Sonti (Chicago, IL)
Assignee: HAAS, Inc.
G08G1/096791
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,530,967
App. No.
18/583,292
Granted
Jan 20, 2026
Kind
B2
Abstract

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.

Claims (55)

1 . A method for alerting vehicles, the method comprising:

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, wherein the map data model includes links that correspond to segments of roads and nodes that correspond to intersections between segments of roads, and wherein nodes are identified by unique node IDs and links are identified by unique 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.

2 . The method of claim 1 , further comprising generating a vehicle entry by:

map matching location information corresponding to a vehicle to at least one of a node ID and a link ID on the digital map; and

defining a most probable path of the vehicle in terms of a set of map identifiers that includes at least one of a node ID and a link ID.

3 . The method of claim 2 , wherein the location information includes latitude and longitude coordinates of the vehicle.

4 . The method of claim 3 , wherein defining the most probable path of the vehicle in terms of a set of map identifiers that includes at least one of a node ID and a link ID involves using motion information corresponding to the vehicle to predict the set of map identifiers.

5 . The method of claim 4 , wherein the motion information includes at least one of a speed, acceleration, trajectory, direction, and azimuth of the vehicle.

6 . The method of claim 1 , further comprising generating the search key, wherein generating the search key involves:

map matching location information corresponding to an alerting vehicle to at least one of a node ID and a link ID on the digital map; and

defining a most probable path of the alerting vehicle in terms of a set of map identifiers that includes at least one of a node ID and a link ID.

7 . The method of claim 6 , wherein the location information includes latitude and longitude coordinates of the vehicle.

8 . The method of claim 6 , wherein defining the most probable path of the alerting vehicle in terms of a set of map identifiers that includes at least one of a node ID and a link ID involves using motion information corresponding to the alerting vehicle to predict the set of map identifiers.

9 . The method of claim 8 , wherein the motion information includes at least one of a speed, acceleration, trajectory, direction, and azimuth of the vehicle.

10 . The method of claim 1 , further comprising:

generating a vehicle entry by:

map matching location information corresponding to a vehicle to at least one of a node ID and a link ID on the digital map; and

defining a most probable path of the vehicle in terms of a set of map identifiers that includes at least one of a node ID and a link ID;

generating the search key by:

map matching location information corresponding to an alerting vehicle to at least one of a node ID and a link ID on the digital map; and

defining a most probable path of the alerting vehicle in terms of a set of map identifiers that includes at least one of a node ID and a link ID.

11 . The method of claim 10 , wherein:

the location information corresponding to the vehicle includes latitude and longitude coordinates of the vehicle; and

the location information corresponding to the alerting vehicle includes latitude and longitude coordinates of the alerting vehicle.

12 . The method of claim 11 , wherein:

defining the most probable path of the vehicle in terms of a set of map identifiers that includes at least one of a node ID and a link ID involves using motion information corresponding to the vehicle to predict the set of map identifiers; and

defining the most probable path of the alerting vehicle in terms of a set of map identifiers that includes at least one of a node ID and a link ID involves using motion information corresponding to the alerting vehicle to predict the set of map identifiers.

13 . The method of claim 12 , wherein:

the motion information corresponding to the vehicle includes at least one of a speed, acceleration, trajectory, direction, and azimuth of the vehicle; and

the motion information corresponding to the alerting vehicle includes at least one of a speed, acceleration, trajectory, direction, and azimuth of the alerting vehicle.

14 . The method of claim 1 , further comprising:

generating a vehicle entry by:

map matching location information corresponding to a vehicle to at least one of a node ID and a link ID on the digital map; and

defining a most probable path of the vehicle over a specific time interval in terms of a set of map identifiers that includes at least one of a node ID and a link ID;

generating the search key by:

map matching location information corresponding to an alerting vehicle to at least one of a node ID and a link ID on the digital map; and

defining a most probable path of the alerting vehicle over a specific time interval in terms of a set of map identifiers that includes at least one of a node ID and a link ID.

15 . The method of claim 14 , wherein the specific time interval is in the range of 1040 seconds.

16 . A non-transitory computer readable medium comprising instructions to be executed in a computer system, wherein the instructions when executed in the computer system perform a method comprising:

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, wherein the map data model includes links that correspond to segments of roads and nodes that correspond to intersections between segments of roads, and wherein nodes are identified by unique node IDs and links are identified by unique 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.

17 . A method for alerting vehicles, the method comprising:

receiving vehicle telemetry data, the vehicle telemetry data including location information and motion information;

populating a database with data generated from the received vehicle telemetry data, wherein the database is populated with vehicle entries that include 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, wherein the map data model includes links that correspond to segments of roads and nodes that correspond to intersections between segments of roads, and wherein nodes are identified by unique node IDs and links are identified by unique link IDs;

receiving alerting vehicle telemetry data from an alerting vehicle, the alerting vehicle telemetry data including location information and motion information;

assigning at least one of a node ID and a link ID to the alerting vehicle in response to the vehicle telemetry data;

finding a match between a vehicle entry in the database and the alerting vehicle, wherein a match involves the vehicle entry and the alerting vehicle having at least one of a node ID and a link ID in common; and

initiating an alert messaging operation corresponding to a vehicle ID of the matching vehicle entry in response to the match.

18 . A method for alerting vehicles, the method comprising:

receiving first vehicle telemetry data, the first vehicle telemetry data including location information related to a first vehicle;

generating a first set of at least one of a node ID and a link ID from the first vehicle telemetry data that correspond to a digital map that uses a map data model with node IDs and link IDs, wherein the map data model includes links that correspond to segments of roads and nodes that correspond to intersections between segments of roads, and wherein nodes are identified by unique node IDs and links are identified by unique link IDs;

receiving second vehicle telemetry data, the second vehicle telemetry data including location information related to a second vehicle;

generating a second set of at least one of a node ID and a link ID from the second vehicle telemetry data; and

initiating an alert messaging operation for a vehicle ID corresponding to the first vehicle in response to the first set of a node ID and a link ID and the second set of a node ID and a link ID having at least one of a node ID and a link ID in common.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 6, 2024
From: PATEL, JIGAR; HOHS, CORY; SONTI, SURYA
To: HAAS, INC.
Reel/Frame 066668/0303 →
Continuity (1)
Related Publication 20250265927A1 · Aug 21, 2025
References Cited (46)
US 8466805B2 · Waymire · 2013 [cited by applicant]
US 8612131B2 · Gutierrez et al. · 2013 [cited by applicant]
US 9333913B1 · Elders et al. · 2016 [cited by applicant]
US 9396210B1 · Crook et al. · 2016 [cited by applicant]
US 10127813B2 · Walsh et al. · 2018 [cited by applicant]
US 10169991B2 · Massey et al. · 2019 [cited by applicant]
US 10582354B1 · Isaac et al. · 2020 [cited by applicant]
US 11170649B2 · Ganesan · 2021 [cited by examiner]
US 12109938B2 · Tucker et al. · 2024 [cited by applicant]
US 20060058950A1 · Kato et al. · 2006 [cited by applicant]
US 20100007523A1 · Hatav · 2010 [cited by examiner]
US 20140162219A1 · Stankoulov · 2014 [cited by examiner]
US 20150375756A1 · Do · 2015 [cited by examiner]
US 20170061706A1 · Iehara · 2017 [cited by examiner]
US 20170144669A1 · Spata · 2017 [cited by applicant]
US 20170249839A1 · Becker et al. · 2017 [cited by applicant]
US 20170268896A1 · Bai et al. · 2017 [cited by applicant]
US 20190096215A1 · Shahid et al. · 2019 [cited by applicant]
US 20200017117A1 · Milton · 2020 [cited by examiner]
US 20200101844A1 · Miller, Jr. et al. · 2020 [cited by applicant]
US 20200126412A1 · James · 2020 [cited by applicant]
US 20210097311A1 · McBeth et al. · 2021 [cited by applicant]
US 20220013006A1 · Srivastava et al. · 2022 [cited by applicant]
US 20220230036A1 · Manci et al. · 2022 [cited by applicant]
US 20220300641A1 · Bennati · 2022 [cited by examiner]
US 20240067087A1 · Tucker et al. · 2024 [cited by applicant]
US 20240085214A1 · Nayak et al. · 2024 [cited by applicant]
US 20240094010A1 · Bernhardt et al. · 2024 [cited by applicant]
US 20240212486A1 · Beaurepaire · 2024 [cited by examiner]
WO 2023159260A1 · 2023 [cited by applicant]
Notice of Allowance for U.S. Appl. No. 18/912,425, dated Jan. 29, 2025, 7 pages. [cited by applicant]
Non-Final Office Action for U.S. Appl. No. 18/912,425, dated Nov. 25, 2024, 22 pages. [cited by applicant]
International Search Report and Written Opinion for Application No. PCT/US25/14777, dated Apr. 22, 2025, 11 pages. [cited by applicant]
Ochieng, W.Y. et al., “Map-matching in complex urban road networks”, Brazilian Journal of Cartography; 55 (2); Dec. 2003; 16 pgs. [cited by applicant]
Chen, Lei et al. “Cloud-based traffic control for interaction between autonomous vehicles and emergency vehicles”, 26th ITS World Congress, Singapore, Oct. 21-25, 2019, 11 pgs. [cited by applicant]
DRM, “Digital Road Map, The Essential Basis of ITS for Safer, Smarther and Cleaner Road Transport”, Sep. 2013, 8 pgs. [cited by applicant]
Erke, Shang et al. “An improved A-Star based path planning algorithm forautonomous land vehicles”, International Journal of Advanced Robotic Systems, vol. 17, Issue 5, Sep.-Oct. 2020, 21 pgs. [cited by applicant]
Gupta, Ajay Kumar et al. “A Comprehensive Review of Map-Matching Techniques: Empirical Analysis, Taxonomy, and Emerging Research Trends”, International Journal of Web Services Research vol. 19, Issue 1, Nov. 2022, 32 pg… [cited by applicant]
Huang, Zhenfeng et al. “Survey on vehicle map matching techniques”, CAAI Transactions on Intelligence Technology, 2021, pp. 55-71. [cited by applicant]
Liu, Yungxiang et al. “Automatic driving path planning based on A-Star algorithm”, ICIIBMS 2022.Track 1: Image Processing, Computer Science and Information Technology, Nara, Japan, Nov. 24-26, 2022, pp. 19-21. [cited by applicant]
Luz, Philipp et al. “Lane-Level Map-Aiding Approach Based on Non-Lane-Level Digital Map Data in Road Transport Security”, Sustainability 2021, 13, 9724, 18 pgs. [cited by applicant]
Saki, Siavash et al. “A Practical Guide to an Open-Source Map-Matching Approach for Big GPS Data”, SN Computer Science (2022) 3: 415, 13 pgs. [cited by applicant]
IBM, “Map matching”, Website [online]. Last updated Jan. 11, 2024 [retrieved Jan. 26, 2024]. Retrieved from the internet: <https://www.ibm.com/docs/en/icvi/continuous-delivery?topic=mapping-map-matching>, 3 pgs. [cited by applicant]
IBM, “Map data model”, Website [online]. Last updated Jan. 11, 2024 [retrieved Jan. 26, 2024]. Retrieved from the internet: <https://www.ibm.com/docs/en/icvi/continuous-delivery?topic=mapping-map-data-model>, 5 pgs. [cited by applicant]
U.S. Department of Transportation , Federal Highway Administration, “2019 Version: vol. III: Guidelines for Applying Traffic Microsimulation Modeling Software 2019 Update to the 2004 Version”, 2019, 6 pgs. [cited by applicant]
U.S. Department of Transportation , Federal Highway Administration, “Traffic Analysis Toolbox vol. III: Guidelines for Applying Traffic Microsimulation Modeling Software”, 2019 Update to the 2004 Version, https://ops.fh… [cited by applicant]