IP Library › Granted Patent US 12,723,885
Granted Patent B2
US 12,723,885 · App. 18/954,130 · Granted Sep 1, 2026

Systems and methods for dynamically generating optimal routes for vehicle operation management

Inventors: Aaron Williams (Congerville, IL); Ryan Michael Gross (Normal, IL); Joseph Robert Brannan (Bloomington, IL)
Assignee: State Farm Mutual Automobile Insurance Company
G01C21/3492B64C39/024G01C21/20G01C21/3438G01C21/3453G05D1/00G05D1/0088G05D1/227G06Q10/047G06Q10/06316G06Q10/0635G06Q10/0639G06Q10/08355G06Q50/40B64U2101/60B64U2101/64B64U2201/104G05D2101/10
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,723,885
App. No.
18/954,130
Granted
Sep 1, 2026
Kind
B2
Abstract

A vehicle routing system includes a vehicle routing and analytics (VRA) computing device, one or more databases, and one or more vehicles communicatively coupled to the VRA computing device. The VRA computing device is configured to generate an optimal route for a vehicle to travel that maximizes potential revenue for operation of the vehicle, the optimal route including a schedule of a plurality of tasks, and generate analytics associated with operation of the vehicle. The VRA computing device is further configured to provide a management hub software application accessible by vehicle users associated with vehicles, tasks sources, and other users.

Claims (44)

1 . A vehicle routing and analytics (VRA) computing device for generating a respective optimal route for each vehicle of a plurality of vehicles, the VRA computing device communicatively coupled to the plurality of vehicles, wherein the VRA computing device comprises at least one processor in communication with at least one memory, wherein the at least one processor is programmed to:

retrieve a vehicle definition for each vehicle of the plurality of vehicles, each vehicle definition including availability parameters and delivery preferences associated with a respective vehicle of the plurality of vehicles;

retrieve a plurality of task definitions defining a respective plurality of tasks, each task including a respective cargo to be delivered, pick-up time, delivery time, pick-up location, delivery location, and priority criteria;

execute at least one of artificial intelligence and deep learning functionality using the vehicle definition and the plurality of task definitions as inputs;

receive, as output from the executed at least one of artificial intelligence and deep learning functionality, a respective subset of tasks for each vehicle of the plurality of vehicles;

generate the respective optimal route for each vehicle of the plurality of vehicles, each optimal route including a scheduled list of the subset of tasks for the vehicle to perform, wherein each optimal route prioritizes the subset of tasks based at least in part upon the priority criteria of each task of the subset of tasks; and

control at least one vehicle of the plurality of vehicles to travel along the respective optimal route.

2 . The VRA computing device of claim 1 , wherein each optimal route further includes navigation instructions instructing a respective driver of the respective vehicle to operate the respective vehicle according to the navigation instructions in the absence of a control signal for controlling the respective vehicle.

3 . The VRA computing device of claim 1 , wherein each task of the plurality of tasks is assigned to one vehicle of the plurality of vehicles.

4 . The VRA computing device of claim 1 , wherein the priority criteria include one or more of: an identification of the cargo as at least one of a person or an object, a prioritized vehicle characteristic, an availability limitation, or a vehicle characteristic restriction.

5 . The VRA computing device of claim 1 , wherein the at least one processor is further programmed to generate each optimal route by scheduling tasks with more restrictive priority criteria before scheduling tasks with less restrictive priority criteria.

6 . The VRA computing device of claim 1 , wherein one optimal route includes instructions regarding introduction of the cargo into the respective vehicle based at least in part upon the priority criteria of a corresponding task of the subset of tasks, the instructions to be provided to a human operator associated with the cargo.

7 . The VRA computing device of claim 1 , wherein each vehicle of the plurality of vehicles has a plurality of sensors disposed thereon and configured to collect sensor data during operation of the respective vehicle, the respective plurality of sensors disposed on each vehicle including at least one sensor configured to identify check-in and check-out of cargo to and from the respective vehicle, and wherein the at least one processor is further programmed to:

receive, from the plurality of vehicles, sensor data during operation of the plurality of vehicles according to the generated respective optimal routes; and

monitor the received sensor data for adherence to the generated optimal routes.

8 . A computer-implemented method for generating a respective optimal route for each vehicle of a plurality of vehicles, the method implemented using a vehicle routing analytics (VRA) computing device communicatively coupled to the plurality of vehicles, wherein the VRA computing device includes at least one processor in communication with at least one memory, wherein the method comprises:

retrieving a vehicle definition for each vehicle of the plurality of vehicles, each vehicle definition including availability parameters and delivery preferences associated with a respective vehicle of the plurality of vehicles;

retrieving a plurality of task definitions defining a respective plurality of tasks, each task including a respective cargo to be delivered, pick-up time, delivery time, pick-up location, delivery location, and priority criteria;

executing at least one of artificial intelligence and deep learning functionality using the vehicle definition and the plurality of task definitions as inputs;

receiving, as output from the executed at least one of artificial intelligence and deep learning functionality, a respective subset of tasks for each vehicle of the plurality of vehicles;

generating the respective optimal route for each vehicle of the plurality of vehicles, each optimal route including a scheduled list of the subset of tasks for the vehicle to perform, wherein each optimal route prioritizes the subset of tasks based at least in part upon the priority criteria of each task of the subset of tasks; and

controlling at least one vehicle of the fleet of vehicles to travel along the optimal route.

9 . The computer-implemented method of claim 8 , wherein generating each optimal route comprises generating each optimal route to include navigation instructions instructing a respective driver of the respective vehicle to operate the respective vehicle according to the navigation instructions in the absence of a control signal for controlling the respective vehicle.

10 . The computer-implemented method of claim 8 , wherein generating each optimal route comprises scheduling tasks with more restrictive priority criteria before scheduling tasks with less restrictive priority criteria.

11 . The computer-implemented method of claim 8 , wherein generating each optimal route comprises generating one optimal route to include instructions regarding introduction of the cargo into the respective vehicle based at least in part upon the priority criteria of a corresponding task of the subset of tasks, the instructions to be provided to a human operator associated with the cargo.

12 . The computer-implemented method of claim 11 , further comprising causing the instructions to be displayed to the human operator associated with the cargo at the initiation of the corresponding task.

13 . The computer-implemented method of claim 8 , wherein each vehicle of the plurality of vehicles has a plurality of sensors disposed thereon and configured to collect sensor data during operation of the respective vehicle, the respective plurality of sensors disposed on each vehicle including at least one sensor configured to identify check-in and check-out of cargo to and from the respective vehicle, the method further comprising:

receiving, from the plurality of vehicles, sensor data during operation of the plurality of vehicles according to the generated optimal routes; and

monitoring the received sensor data for adherence to the generated optimal routes.

14 . At least one non-transitory computer-readable storage medium having stored thereon computer-executable instructions that, when executed by at least one processor of a vehicle routing and analytics (VRA) computing device communicatively coupled to a plurality of vehicles, cause the at least one processor to:

retrieve a vehicle definition for each vehicle of the plurality of vehicles, each vehicle definition including availability parameters and delivery preferences associated with a respective vehicle of the plurality of vehicles;

retrieve a plurality of task definitions defining a respective plurality of tasks, each task including a respective cargo to be delivered, pick-up time, delivery time, pick-up location, delivery location, and priority criteria;

execute at least one of artificial intelligence and deep learning functionality using the vehicle definition and the plurality of task definitions as inputs;

receive, as output from the executed at least one of artificial intelligence and deep learning functionality, a respective subset of tasks for each vehicle of the plurality of vehicles;

generate a respective optimal route for each vehicle of the plurality of vehicles, each optimal route including a scheduled list of the subset of tasks for the vehicle to perform, wherein each optimal route prioritizes the subset of tasks based at least in part upon the priority criteria of each task of the subset of tasks; and

control at least one vehicle of the plurality of vehicles to travel along the respective optimal route.

15 . The at least one non-transitory computer-readable storage medium of claim 14 , wherein each optimal route further includes navigation instructions instructing a respective driver of the respective vehicle to operate the respective vehicle according to the navigation instructions in the absence of a control signal for controlling the respective vehicle.

16 . The at least one non-transitory computer-readable storage medium of claim 14 , wherein each task of the plurality of tasks is assigned to one vehicle of the plurality of vehicles.

17 . The at least one non-transitory computer-readable storage medium of claim 14 , wherein the priority criteria include one or more of: an identification of the cargo as at least one of a person or an object, a prioritized vehicle characteristic, an availability limitation, or a vehicle characteristic restriction.

18 . The at least one non-transitory computer-readable storage medium of claim 14 , wherein the computer-executable instructions further cause the at least one processor to generate each optimal route by scheduling tasks with more restrictive priority criteria before scheduling tasks with less restrictive priority criteria.

19 . The at least one non-transitory computer-readable storage medium of claim 14 , wherein one optimal route includes instructions regarding introduction of the cargo into the respective vehicle based at least in part upon the priority criteria of a corresponding task of the subset of tasks, the instructions to be provided to a human operator associated with the cargo.

20 . The at least one non-transitory computer-readable storage medium of claim 14 , wherein each vehicle of the plurality of vehicles has a plurality of sensors disposed thereon and configured to collect sensor data during operation of the respective vehicle, the respective plurality of sensors disposed on each vehicle including at least one sensor configured to identify check-in and check-out of cargo to and from the respective vehicle, and wherein the computer-executable instructions further cause the at least one processor to:

receive, from the plurality of vehicles, sensor data during operation of the plurality of vehicles according to the generated optimal routes; and

monitor the received sensor data for adherence to the generated optimal routes.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 22, 2024
From: WILLIAMS, AARON; GROSS, RYAN MICHAEL; BRANNAN, JOSEPH ROBERT
To: STATE FARM MUTUAL AUTOMOBILE INSURANCE COMPANY
Reel/Frame 069373/0238 →
Continuity (5)
Continuation 17895804 · Aug 25, 2022
Continuation 16544078 · Aug 19, 2019
Provisional Application 62843729 · May 6, 2019
Provisional Application 62806258 · Feb 15, 2019
Related Publication 20250146830A1 · May 8, 2025
References Cited (133)
US 4741163A · Hidaka et al. · 1988 [cited by applicant]
US 6600991B1 · Jardin · 2003 [cited by applicant]
US 7363126B1 · Zhong et al. · 2008 [cited by applicant]
US 8112300B2 · Harper · 2012 [cited by applicant]
US 8275508B1 · Adams et al. · 2012 [cited by applicant]
US 8738289B2 · Ghoting et al. · 2014 [cited by applicant]
US 9035479B1 · Gates · 2015 [cited by examiner]
US 9037406B2 · Mason et al. · 2015 [cited by applicant]
US 9068852B2 · Mason et al. · 2015 [cited by applicant]
US 9368026B1 · Herbach et al. · 2016 [cited by applicant]
US 9557183B1 · Ross et al. · 2017 [cited by applicant]
US 9792575B2 · Khasis · 2017 [cited by applicant]
US 9830748B2 · Rosenbaum · 2017 [cited by applicant]
US 9990782B2 · Rosenbaum · 2018 [cited by applicant]
US 10269190B2 · Rosenbaum · 2019 [cited by applicant]
US 10467824B2 · Rosenbaum · 2019 [cited by applicant]
US 10573184B1 · Pandit et al. · 2020 [cited by applicant]
US 10648823B2 · Bagchi · 2020 [cited by applicant]
US 10671961B2 · Cao · 2020 [cited by applicant]
US 10697784B1 · Li · 2020 [cited by applicant]
US 10787315B2 · Hance et al. · 2020 [cited by applicant]
US 10789567B1 · Ur · 2020 [cited by applicant]
US 10852152B2 · Mitchell et al. · 2020 [cited by applicant]
US 11227452B2 · Rosenbaum · 2022 [cited by applicant]
US 11407410B2 · Rosenbaum · 2022 [cited by applicant]
US 11466997B1 · Williams · 2022 [cited by examiner]
US 11524707B2 · Rosenbaum · 2022 [cited by applicant]
US 11594083B1 · Rosenbaum · 2023 [cited by applicant]
US 12181300B2 · Williams · 2024 [cited by examiner]
US 20030078802A1 · Yonezawa · 2003 [cited by applicant]
US 20050021745A1 · Bookman et al. · 2005 [cited by applicant]
US 20050216182A1 · Hussain et al. · 2005 [cited by applicant]
US 20080077464A1 · Gottlieb et al. · 2008 [cited by applicant]
US 20080275643A1 · Yaqub et al. · 2008 [cited by applicant]
US 20090048890A1 · Burgh · 2009 [cited by applicant]
US 20090055270A1 · Magdon-Ismail et al. · 2009 [cited by applicant]
US 20090187450A1 · Kocis · 2009 [cited by examiner]
US 20090326991A1 · Wei et al. · 2009 [cited by applicant]
US 20090327011A1 · Petroff · 2009 [cited by applicant]
US 20100094769A1 · Davidson et al. · 2010 [cited by applicant]
US 20100106603A1 · Dey et al. · 2010 [cited by applicant]
US 20100287073A1 · Kocis et al. · 2010 [cited by applicant]
US 20100299175A1 · Marchildon et al. · 2010 [cited by applicant]
US 20110130905A1 · Mayer · 2011 [cited by applicant]
US 20120053993A1 · Huberman · 2012 [cited by examiner]
US 20120226548A1 · Hanna · 2012 [cited by applicant]
US 20120310691A1 · Carlsson et al. · 2012 [cited by applicant]
US 20130069803A1 · McCormick et al. · 2013 [cited by applicant]
US 20130132140A1 · Amin et al. · 2013 [cited by applicant]
US 20130224721A1 · Gilling · 2013 [cited by applicant]
US 20130339266A1 · Looman et al. · 2013 [cited by applicant]
US 20140011522A1 · Lin et al. · 2014 [cited by applicant]
US 20140046585A1 · Morris, IV et al. · 2014 [cited by applicant]
US 20140129139A1 · Ellison et al. · 2014 [cited by applicant]
US 20140330576A1 · Bauer · 2014 [cited by applicant]
US 20150051941A1 · Bell · 2015 [cited by applicant]
US 20150248639A1 · Maney et al. · 2015 [cited by applicant]
US 20150260531A1 · Ehsani et al. · 2015 [cited by applicant]
US 20150285652A1 · Peri et al. · 2015 [cited by applicant]
US 20160063435A1 · Shah · 2016 [cited by examiner]
US 20160196701A1 · Strother et al. · 2016 [cited by applicant]
US 20160210591A1 · Lafrance · 2016 [cited by applicant]
US 20160379168A1 · Foerster et al. · 2016 [cited by applicant]
US 20170046644A1 · Zhang et al. · 2017 [cited by applicant]
US 20170090478A1 · Blayvas et al. · 2017 [cited by applicant]
US 20170123421A1 · Kentley et al. · 2017 [cited by applicant]
US 20170132934A1 · Kentley et al. · 2017 [cited by applicant]
US 20170192437A1 · Bier et al. · 2017 [cited by applicant]
US 20170199045A1 · George et al. · 2017 [cited by applicant]
US 20170200197A1 · Brubaker · 2017 [cited by examiner]
US 20170294060A1 · Lonski · 2017 [cited by examiner]
US 20170323249A1 · Khasis · 2017 [cited by applicant]
US 20180124319A1 · Jo · 2018 [cited by applicant]
US 20180129999A1 · Zhang et al. · 2018 [cited by applicant]
US 20180184245A1 · Park · 2018 [cited by applicant]
US 20180240288A1 · Samper et al. · 2018 [cited by applicant]
US 20180260740A1 · Namineni et al. · 2018 [cited by applicant]
US 20180268359A1 · Soubhagya · 2018 [cited by applicant]
US 20180276586A1 · Treasure · 2018 [cited by examiner]
US 20180336510A1 · DaCosta et al. · 2018 [cited by applicant]
US 20180356239A1 · Marco · 2018 [cited by examiner]
US 20180356823A1 · Cooper · 2018 [cited by applicant]
US 20180364061A1 · Chen et al. · 2018 [cited by applicant]
US 20190011931A1 · Selvam et al. · 2019 [cited by applicant]
US 20190019146A1 · Chraibi et al. · 2019 [cited by applicant]
US 20190066041A1 · Hance et al. · 2019 [cited by applicant]
US 20190073611A1 · Sahota et al. · 2019 [cited by applicant]
US 20190121338A1 · Cella et al. · 2019 [cited by applicant]
US 20190147399A1 · O'Block · 2019 [cited by applicant]
US 20190164432A1 · Quitoriano et al. · 2019 [cited by applicant]
US 20190179336A1 · Colijn et al. · 2019 [cited by applicant]
US 20190195638A1 · Tajammul et al. · 2019 [cited by applicant]
US 20190196503A1 · Abari et al. · 2019 [cited by applicant]
US 20190197438A1 · Meredith et al. · 2019 [cited by applicant]
US 20190212753A1 · Sarkar · 2019 [cited by examiner]
US 20190220785A1 · Tanno et al. · 2019 [cited by applicant]
US 20190236165A1 · Nickerson · 2019 [cited by applicant]
US 20190244318A1 · Rajcok et al. · 2019 [cited by applicant]
US 20190251509A1 · Simpson · 2019 [cited by applicant]
US 20190370922A1 · Asghari et al. · 2019 [cited by applicant]
US 20200020015A1 · Anders et al. · 2020 [cited by applicant]
US 20200034791A1 · Lee et al. · 2020 [cited by applicant]
US 20200116508A1 · Dashti et al. · 2020 [cited by applicant]
US 20200133306A1 · Chadha et al. · 2020 [cited by applicant]
US 20200160709A1 · Ramot et al. · 2020 [cited by applicant]
US 20200209002A1 · Hou et al. · 2020 [cited by applicant]
US 20200219407A1 · Priest · 2020 [cited by applicant]
US 20200258018A1 · Brady · 2020 [cited by examiner]
US 20200300644A1 · Tian et al. · 2020 [cited by applicant]
US 20200394617A1 · Fornell et al. · 2020 [cited by applicant]
US 20210163021A1 · Frazzoli et al. · 2021 [cited by applicant]
US 20220092893A1 · Rosenbaum · 2022 [cited by applicant]
US 20220129849A1 · Mimassi · 2022 [cited by applicant]
US 20220340148A1 · Rosenbaum · 2022 [cited by applicant]
US 20220404162A1 · Williams et al. · 2022 [cited by applicant]
US 20230060300A1 · Rosenbaum · 2023 [cited by applicant]
EP 3239686A1 · 2017 [cited by applicant]
EP 3578433B1 · 2020 [cited by applicant]
EP 3730375B1 · 2021 [cited by applicant]
EP 3960576A1 · 2022 [cited by applicant]
EP 4190659A1 · 2023 [cited by applicant]
EP 4190660A1 · 2023 [cited by applicant]
JP 10134300A · 1998 [cited by examiner]
JP H10134300A · 1998 [cited by applicant]
WO 2011066468A1 · 2011 [cited by applicant]
WO 2019203816A1 · 2019 [cited by applicant]
Ehmke, Jan Fabian, and Dirk Christian Mattfeld. “Vehicle routing for attended home delivery in city logistics.” Procedia-Social and Behavioral Sciences 39 (2012): 622-632 (Year: 2012). [cited by applicant]
Gray, Felix, “The Future Begins (in December)”, The Hustle, Nov. 14, 2018, https://thehustle.co/the-future-begins-in-december/. [cited by applicant]
Keerthisinghe. Schedule optimization of freight vehicle fleet using data analytics. Diss. 2018. [cited by applicant]
Rahili et al., “Optimal Routing for Autonomous Taxis using Distributed Reinforcement Learning,” 2018 IEEE International Conference on Data Mining Workshops (ICDMW), IEEE, 2018. [cited by applicant]
Lin, Kaixiang, et al. “Efficient large-scale fleet management via multi-agent deep reinforcement learning.” Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. 2018 (Year: 2… [cited by applicant]
Billhardt, Holger, et al. “Dynamic coordination in fleet management systems: Toward smart cyber fleets.” IEEE Intelligent Systems 29.3 (2014): 70-76 (Year: 2014). [cited by applicant]
Waiyaki, Edward Chege, and Anton Brits. “Leveraging Telematics for Optimal Fleet Performance.” International Journal of Business 1.1 (2015) (Year: 2015). [cited by applicant]