IP Library › Granted Patent US 12,403,787
Granted Patent B2
US 12,403,787 · App. 18/377,922 · Granted Sep 2, 2025

Electric vehicle charging management system and method

Inventor: Joseph R. Brannan (Bloomington, IL)
Assignee: State Farm Mutual Automobile Insurance Company
B60L53/36B60L53/305B60L53/53B60L53/62B60L53/66B60L58/12B60L58/13G01C21/3438G01C21/3469G01S19/42G06Q30/08B60L2240/12B60L2240/14B60L2240/54B60L2240/62
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,403,787
App. No.
18/377,922
Filed
Oct 9, 2023
Granted
Sep 2, 2025
Kind
B2
Examiner
ORTIZ, ELIM
Art Unit
2836
USPC
705/26.3
Abstract

Computer-implemented methods and computer systems are disclosed herein as implemented by a controller operatively coupled to a network of electric vehicles. The methods and systems include the controller (i) receiving a notification that an electric vehicle is stranded without sufficient power to operate; (ii) receiving information regarding the stranded electric vehicle; (iii) detecting one or more other electric vehicles in a vicinity of the stranded electric vehicle; (iv) receiving information regarding the detected one or more other electric vehicles; and/or (v) determining, based upon the received information, which of the detected one or more other electric vehicles to send a power source request. Alternatively, the notification may indicate that an electric vehicle has a low state of charge (SOC), or is otherwise has a battery in need of being recharged to facilitate the electric vehicle traveling to a destination.

Claims (42)

1. A computer-implemented method for recharging electric vehicles, the method comprising:

identifying, via one or more processors, a low state of charge (SOC) electric vehicle by determining that a SOC is below a predetermined threshold;

receiving, via the one or more processors, first vehicle telematics data associated with the low SOC electric vehicle, wherein the first vehicle telematics data comprises acceleration data, braking data, cornering data, speed data, direction data, route data, and location data;

determining, via the one or more processors, a group of electric vehicles within a predetermined distance of the low SOC electric vehicle;

receiving, via the one or more processors, second vehicle telematics data from the group of electric vehicles, wherein the second vehicle telematics data comprises a route being traveled, travel distance to destination information, remaining battery power information, and power available to transfer information;

selecting, via the one or more processors, an electric vehicle from the group of electric vehicles within the predetermined distance of the low SOC electric vehicle, wherein the selecting the electric vehicle from the group of electric vehicles comprises selecting the electric vehicle based at least in part upon the first vehicle telematics data and the second vehicle telematics data; and

scheduling, via the one or more processors, a rendezvous point for the low SOC electric vehicle with the selected electric vehicle for recharging the low SOC electric vehicle, the selected electric vehicle having an available battery power bandwidth sufficient to satisfy traveling needs of both the low SOC electric vehicle and the selected electric vehicle.

2. The computer-implemented method of claim 1 , wherein the predetermined threshold includes a percentage of the SOC remaining in the low SOC electric vehicle.

3. The computer-implemented method of claim 1 , wherein the predetermined threshold includes a determined distance that the low SOC electric vehicle is capable of traveling based upon the SOC remaining in the low SOC electric vehicle.

4. The computer-implemented method of claim 1 , further comprising:

determining, via the one or more processors, time constraints of the group of electric vehicles.

5. The computer-implemented method of claim 4 , wherein the time constraints are determined by collecting electronic calendar data of vehicle operators associated with the group of electric vehicles.

6. The computer-implemented method of claim 4 , further comprising:

eliminating one or more vehicles from the group of electric vehicles based upon the determined time constraints.

7. The computer-implemented method of claim 1 , further comprising:

determining, via the one or more processors, energy costs for the group of electric vehicles; and

wherein the selecting the electric vehicle from among the group of electric vehicles comprises selecting the electric vehicle based at least in part upon the determined energy costs.

8. The computer-implemented method of claim 1 , further comprising:

determining, via the one or more processors, energy or charging supply and demand for an area through which the low SOC electric vehicle is traveling.

9. The computer-implemented method of claim 8 , further comprising:

initiating, by the one or more processors, a bidding process for a driver of the low SOC electric vehicle to bid on the group of electric vehicles.

10. The computer-implemented method of claim 1 , wherein the identifying the low SOC electric vehicle that has the SOC below the predetermined threshold includes analyzing battery level data.

11. The computer-implemented method of claim 1 , further comprising:

ranking the group of electric vehicles based upon one or more factors, wherein the one or more factors include at least one factor selected from a group consisting of:

distance to the low SOC electric vehicle;

similarity of a route being traveled to a route of the low SOC electric vehicle;

travel distance to destination remaining;

remaining battery power or remaining miles based on current battery power; and

power available to transfer; and

wherein the selecting the electric vehicle from among the group of electric vehicles comprises selecting the electric vehicle based at least in part upon the ranking.

12. The computer-implemented method of claim 1 , further comprising determining the rendezvous point based on a route of the low SOC electric vehicle and a route of the selected electric vehicle.

13. A computer device for recharging electric vehicles, the computer device comprising:

one or more memories comprising instructions stored thereon; and

one or more processors coupled to the one or more memories and configured to perform operations comprising:

identifying a low SOC electric vehicle that has a state of charge (SOC) below a predetermined threshold;

receiving first vehicle telematics data associated with the low SOC electric vehicle, wherein the first vehicle telematics data comprises acceleration data, braking data, cornering data, speed data, direction data, route data, and location data;

determining a group of electric vehicles within a predetermined distance of the low SOC electric vehicle;

receiving second vehicle telematics data from the group of electric vehicles, wherein the second vehicle telematics data comprises a route being traveled, travel distance to destination information, remaining battery power information, and power available to transfer information;

selecting an electric vehicle from the group of electric vehicles within the predetermined distance of the low SOC electric vehicle, wherein the selecting the electric vehicle from the group of electric vehicles comprises selecting the electric vehicle based at least in part upon the first vehicle telematics data and the second vehicle telematics data; and

scheduling a rendezvous point for the low SOC electric vehicle with the selected electric vehicle for recharging the low SOC electric vehicle, the selected electric vehicle having an available battery power bandwidth sufficient to satisfy traveling needs of both the low SOC electric vehicle and the selected electric vehicle.

14. The computer device of claim 13 , wherein the operations further comprise determining time constraints of the group of electric vehicles.

15. The computer device of claim 14 , wherein the operations further comprise eliminating one or more vehicles from the group of electric vehicles based upon the determined time constraints.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 31, 2025
From: BRANNAN, JOSEPH R.
To: STATE FARM MUTUAL AUTOMOBILE INSURANCE COMPANY
Reel/Frame 071893/0612 →
Continuity (7)
Continuation 17075419 · Oct 20, 2020
Provisional Application 63092286 · Oct 15, 2020
Provisional Application 62939906 · Nov 25, 2019
Provisional Application 62938676 · Nov 21, 2019
Provisional Application 62930807 · Nov 5, 2019
Provisional Application 62923713 · Oct 21, 2019
Related Publication 20240034170A1 · Feb 1, 2024
References Cited (130)
US 6044261A · Kazmi · 2000 [cited by applicant]
US 6496689B1 · Keller et al. · 2002 [cited by applicant]
US 8860362B2 · Kamen et al. · 2014 [cited by applicant]
US 9587952B1 · Slusar · 2017 [cited by applicant]
US 9709988B2 · Miller et al. · 2017 [cited by applicant]
US 9778653B1 · McClintock et al. · 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 10333338B2 · Zenner et al. · 2019 [cited by applicant]
US 10399461B1 · Sosinov et al. · 2019 [cited by applicant]
US 10409285B2 · Bostick et al. · 2019 [cited by applicant]
US 10467824B2 · Rosenbaum · 2019 [cited by applicant]
US 11133688B2 · Schaffer et al. · 2021 [cited by applicant]
US 11216824B1 · Faga et al. · 2022 [cited by applicant]
US 11227452B2 · Rosenbaum · 2022 [cited by applicant]
US 11407410B2 · Rosenbaum · 2022 [cited by applicant]
US 11447024B1 · Brannan · 2022 [cited by applicant]
US 11524707B2 · Rosenbaum · 2022 [cited by applicant]
US 11594083B1 · Rosenbaum · 2023 [cited by applicant]
US 11981223B2 · Brannan · 2024 [cited by applicant]
US 20060293849A1 · Baldwin · 2006 [cited by applicant]
US 20070149711A1 · Chaudhary et al. · 2007 [cited by applicant]
US 20080281663A1 · Hakim et al. · 2008 [cited by applicant]
US 20090043520A1 · Pollack et al. · 2009 [cited by applicant]
US 20090082957A1 · Agassi et al. · 2009 [cited by applicant]
US 20090222143A1 · Kempton · 2009 [cited by applicant]
US 20100060720A1 · Hirasawa · 2010 [cited by applicant]
US 20110191186A1 · Levy et al. · 2011 [cited by applicant]
US 20110202217A1 · Kempton · 2011 [cited by applicant]
US 20110202476A1 · Nagy et al. · 2011 [cited by applicant]
US 20110225105A1 · Scholer et al. · 2011 [cited by applicant]
US 20110238519A1 · Basak et al. · 2011 [cited by applicant]
US 20110246252A1 · Uesugi · 2011 [cited by applicant]
US 20120005031A1 · Jammer · 2012 [cited by applicant]
US 20120089408A1 · Stancil et al. · 2012 [cited by applicant]
US 20120095830A1 · Contreras Delpiano et al. · 2012 [cited by applicant]
US 20120109409A1 · Hara · 2012 [cited by applicant]
US 20120271758A1 · Jammer · 2012 [cited by applicant]
US 20120296678A1 · Boot et al. · 2012 [cited by applicant]
US 20120303259A1 · Prosser · 2012 [cited by applicant]
US 20120303397A1 · Prosser · 2012 [cited by applicant]
US 20120306446A1 · Suganuma et al. · 2012 [cited by applicant]
US 20130020993A1 · Taddeo et al. · 2013 [cited by applicant]
US 20130043838A1 · Tsuchiya · 2013 [cited by applicant]
US 20140129139A1 · Ellison et al. · 2014 [cited by applicant]
US 20140278104A1 · Proietty et al. · 2014 [cited by applicant]
US 20150042278A1 · Leary · 2015 [cited by applicant]
US 20150149221A1 · Tremblay · 2015 [cited by applicant]
US 20150165915A1 · Cun · 2015 [cited by applicant]
US 20150239365A1 · Hyde et al. · 2015 [cited by applicant]
US 20150291047A1 · Saito et al. · 2015 [cited by applicant]
US 20150321570A1 · Cun · 2015 [cited by applicant]
US 20160129793A1 · Cronie · 2016 [cited by applicant]
US 20160137077A1 · Kim et al. · 2016 [cited by applicant]
US 20160225095A1 · Biemer et al. · 2016 [cited by applicant]
US 20160257212A1 · Thompson et al. · 2016 [cited by applicant]
US 20160321740A1 · Hill · 2016 [cited by applicant]
US 20170050529A1 · Lambert et al. · 2017 [cited by applicant]
US 20170168493A1 · Miller et al. · 2017 [cited by applicant]
US 20170176195A1 · Rajagopalan et al. · 2017 [cited by applicant]
US 20170262790A1 · Khasis · 2017 [cited by applicant]
US 20170282736A1 · Goei · 2017 [cited by applicant]
US 20170363432A1 · Hall · 2017 [cited by examiner]
US 20170374202A1 · Zait et al. · 2017 [cited by applicant]
US 20180016131A1 · Varini · 2018 [cited by applicant]
US 20180045533A1 · Jackson et al. · 2018 [cited by applicant]
US 20180081360A1 · Bostick et al. · 2018 [cited by applicant]
US 20180257498A1 · Delp · 2018 [cited by applicant]
US 20180281606A1 · Scherer · 2018 [cited by applicant]
US 20180339682A1 · Hall · 2018 [cited by examiner]
US 20180373268A1 · Antunes Marques Esteves · 2018 [cited by applicant]
US 20190009756A1 · Jacobs · 2019 [cited by applicant]
US 20190016312A1 · Carlson et al. · 2019 [cited by applicant]
US 20190047427A1 · Pogorelik · 2019 [cited by applicant]
US 20190089024A1 · Enzinger et al. · 2019 [cited by applicant]
US 20190152329A1 · Onodera et al. · 2019 [cited by applicant]
US 20190165591A1 · Kisacikoglu et al. · 2019 [cited by applicant]
US 20190178678A1 · Rahbari asr et al. · 2019 [cited by applicant]
US 20190202304A1 · Moghe et al. · 2019 [cited by applicant]
US 20190255963A1 · Goei · 2019 [cited by applicant]
US 20190275907A1 · Lee et al. · 2019 [cited by applicant]
US 20190279266A1 · Hayrabedian · 2019 [cited by applicant]
US 20190308513A1 · Akhavan-Tafti · 2019 [cited by applicant]
US 20190344679A1 · Miller et al. · 2019 [cited by applicant]
US 20190351783A1 · Goei · 2019 [cited by applicant]
US 20190383637A1 · Teske · 2019 [cited by applicant]
US 20200023747A1 · Logvinov et al. · 2020 [cited by applicant]
US 20200122595A1 · Nonnenmacher et al. · 2020 [cited by applicant]
US 20200184576A1 · Rayes et al. · 2020 [cited by applicant]
US 20200219332A1 · Shekar et al. · 2020 [cited by applicant]
US 20200262305A1 · Chakraborty · 2020 [cited by examiner]
US 20200262307A1 · Rosene et al. · 2020 [cited by applicant]
US 20200269720A1 · Enslin et al. · 2020 [cited by applicant]
US 20200317067A1 · Miller · 2020 [cited by applicant]
US 20200324667A1 · Yaldo et al. · 2020 [cited by applicant]
US 20200333151A1 · Akhtar · 2020 [cited by applicant]
US 20200341472A1 · Zenner et al. · 2020 [cited by applicant]
US 20200353836A1 · Imberger · 2020 [cited by applicant]
US 20200376972A1 · Martin et al. · 2020 [cited by applicant]
US 20200386561A1 · Namiki · 2020 [cited by applicant]
US 20210053458A1 · Fujiwara et al. · 2021 [cited by applicant]
US 20210096564A1 · Panigrahi et al. · 2021 [cited by applicant]
US 20210118070A1 · Taber, Jr. et al. · 2021 [cited by applicant]
US 20210203177A1 · Peng · 2021 [cited by applicant]
US 20210237797A1 · Faivre · 2021 [cited by applicant]
US 20210241626A1 · Nishimura et al. · 2021 [cited by applicant]
US 20210380012A1 · Tsuda et al. · 2021 [cited by applicant]
US 20220092893A1 · Rosenbaum · 2022 [cited by applicant]
US 20220118878A1 · Kwapisz · 2022 [cited by applicant]
US 20220187091A1 · Suzuki et al. · 2022 [cited by applicant]
US 20220340148A1 · Rosenbaum · 2022 [cited by applicant]
US 20230060300A1 · Rosenbaum · 2023 [cited by applicant]
DE 102015219425A1 · 2016 [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]
WO 2007149711A2 · 2007 [cited by applicant]
WO 2010060720A2 · 2010 [cited by applicant]
WO 2015063967A1 · 2015 [cited by applicant]
WO 2017154219A1 · 2017 [cited by applicant]
WO 2018072613A1 · 2018 [cited by applicant]
WO 2018130336A1 · 2018 [cited by applicant]
WO 2019094900A1 · 2019 [cited by applicant]
WO 2019174949A1 · 2019 [cited by applicant]
Truesdell, EVmatch: A Creative Solution to Increase Electric Vehicle Charging Access for Everyone, Mar. 3, 2019, CleanTechnica (Year: 2019). [cited by applicant]
Masuch, Nils et al., “A Context-Aware Mobile Accessible Electric Vehicle Management System,” Proceedings of the Federated Conference on Computer Science and Information Systems, 2011, ISBN 978-83-60810-39-2; pp. 305-312. [cited by applicant]