IP Library Granted Patent US 12,314,888
Granted Patent B2
US 12,314,888 · App. 18/801,980 · Granted May 27, 2025

EV battery degradation in a fleet

Inventors: Norman Lu (Fairview, TX); Maximilian Parness (Takoma Park, MD)
Assignee: TOYOTA MOTOR NORTH AMERICA, INC.
G06Q10/083
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,314,888
App. No.
18/801,980
Granted
May 27, 2025
Kind
B2
Abstract

An example operation includes one or more of determining objects to be delivered by a group of vehicles, and choosing a vehicle of the group of vehicles with a most degraded battery to transport a heaviest object of the objects.

Claims (48)

1. A method, comprising:

identifying, via a software application, an electric vehicle (EV) among a plurality of EVs with a most degraded electric battery based on battery characteristics of the plurality of EVs;

querying, via the software application, a server for details of objects to be delivered by the plurality of EVs;

determining, via the software application, the objects to be delivered by the plurality of EVs based on the battery characteristics and the details of the objects;

identifying, via the software application, a heaviest object of the objects that is to be delivered within a radius from the EV with the most degraded electric battery in the plurality of EVs; and

transmitting, via the software application, an instruction that controls the EV with the most degraded electric battery to autonomously-maneuver along a route.

2. The method of claim 1 , wherein the transmitting comprises transmitting the route that is within the radius from a starting location to the EV with the most degraded electric battery.

3. The method of claim 1 , comprising:

choosing another EV in the plurality of EVs with a next most degraded battery to transport the heaviest object when the EV with the most degraded electric battery is unable to transport the heaviest object.

4. The method of claim 1 , wherein the identifying the EV with the most degraded electric battery is performed based on an age of the electric battery of the EV, a history of one or more of a number of charging cycles of the electric battery, and a rate of a received charge of the electric battery.

5. The method of claim 1 , wherein the method further comprises assigning, via the software application, the EV with the most degraded electric battery a minimum number of deliveries per period as compared with other EVs in the plurality of EVs.

6. The method of claim 1 , comprising:

determining a ranking of the plurality of EVs based on a degradation of each battery included in each EV among the plurality of EVs; and

choosing a route for each EV based on the ranking of the plurality of EVs.

7. The method of claim 1 , comprising:

executing the software application via an electronic control unit (ECU) of the EV.

8. A system, comprising:

a processor and memory communicably coupled to the processor, wherein the processor is configured to:

identify an electric vehicle (EV) among a plurality of EVs with a most degraded electric battery based on battery characteristics of the plurality of EVs;

query a server for details of objects to be delivered by the plurality of EVs;

determine the objects to be delivered by the plurality of EVs based on the battery characteristics and the details of the objects;

identify a heaviest object of the objects that is to be delivered within a radius from the EV with the most degraded electric battery in the plurality of EVs; and

transmit an instruction that controls the EV with the most degraded electric battery to autonomously-maneuver along a route.

9. The system of claim 8 , wherein the processor is configured to transmit the route that is within the radius from a starting location to the EV with the most degraded electric battery.

10. The system of claim 8 ,

wherein the processor is further configured to choose another EV in the plurality of EVs with a next most degraded battery to transport the heaviest object when the EV with the most degraded electric battery is unable to transport the heaviest object.

11. The system of claim 8 , wherein the processor is configured to identify the EV with the most degraded electric battery is performed based on an age of the electric battery of the EV, a history of one or more of a number of charging cycles of the electric battery, and a rate of a received charge of the electric battery.

12. The system of claim 8 , wherein the processor is configured to assign the EV with the most degraded electric battery a minimum number of deliveries per period as compared with other EVs in the plurality of EVs.

13. The system of claim 8 , wherein the processor is further configured to:

determine a ranking of the plurality of EVs based on a degradation of each battery included in each EV among the plurality of EVs; and

choose a route for each EV based on the ranking of the plurality of EVs.

14. The system of claim 8 , wherein the processor is further configured to:

execute via an electronic control unit (ECU) of the EV.

15. A non-transitory computer readable medium comprising instructions, that when read by a processor, cause the processor to perform:

identifying an electric vehicle (EV) among a plurality of EVs with a most degraded electric battery based on battery characteristics of the plurality of EVs;

querying a server for details of objects to be delivered by the plurality of EVs;

determining the objects to be delivered by the plurality of EVs based on the battery characteristics and the details of the objects;

identifying a heaviest object of the objects that is to be delivered within a radius from the EV with the most degraded electric battery in the plurality of EVs; and

transmitting an instruction that controls the EV with the most degraded electric battery to autonomously-maneuver along a route.

16. The non-transitory computer readable medium of claim 15 , wherein the transmitting comprises transmitting the route that is within the radius from a starting location to the EV with the most degraded electric battery.

17. The non-transitory computer readable medium of claim 15 , comprising:

choosing another EV in the plurality of EVs with a next most degraded battery to transport the heaviest object when the EV with the most degraded electric battery is unable to transport the heaviest object.

18. The non-transitory computer readable medium of claim 15 , wherein the identifying the EV with the most degraded electric battery is performed based on an age of the electric battery of the EV, a history of one or more of a number of charging cycles of the electric battery, and a rate of a received charge of the electric battery.

19. The non-transitory computer readable medium of claim 15 , comprising:

assigning the EV with the most degraded electric battery a minimum number of deliveries per period as compared with other EVs in the plurality of EVs.

20. The non-transitory computer readable medium of claim 15 , comprising:

determining a ranking of the plurality of EVs based on a degradation of each battery included in each EV among the plurality of EVs; and

choosing a route for each EV based on the ranking of the plurality of EVs.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 6, 2025
From: TOYOTA JIDOSHA KABUSHIKI KAISHA
To: TOYOTA MOTOR NORTH AMERICA, INC.
Reel/Frame 071949/0336 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 31, 2024
From: LU, NORMAN; PARNESS, MAXIMILIAN
To: TOYOTA MOTOR NORTH AMERICA, INC.; TOYOTA JIDOSHA KABUSHIKI KAISHA
Reel/Frame 068457/0749 →
Continuity (2)
Continuation 17850240 · Jun 27, 2022
Related Publication 20240403804A1 · Dec 5, 2024
References Cited (23)
US 8706409B2 · Mason et al. · 2014 [cited by applicant]
US 9079505B1 · Hyde et al. · 2015 [cited by applicant]
US 9141266B2 · McCormick et al. · 2015 [cited by applicant]
US 10528062B2 · Looman et al. · 2020 [cited by applicant]
US 10691138B2 · Esteves · 2020 [cited by applicant]
US 10712750B2 · Kentley-Klay et al. · 2020 [cited by applicant]
US 10775184B2 · Ho et al. · 2020 [cited by applicant]
US 11067983B2 · Kentley-Klay et al. · 2021 [cited by applicant]
US 20150294403A1 · Chu et al. · 2015 [cited by applicant]
US 20160247106A1 · Dalloro et al. · 2016 [cited by applicant]
US 20170140603A1 · Ricci · 2017 [cited by applicant]
US 20180134171A1 · Hyde et al. · 2018 [cited by applicant]
US 20190066409A1 · Mota · 2019 [cited by applicant]
US 20190207272A1 · O'Brien · 2019 [cited by examiner]
US 20210041241A1 · Mitra · 2021 [cited by examiner]
US 20210254988A1 · Styles · 2021 [cited by examiner]
US 20210383321A1 · Scharaswak et al. · 2021 [cited by applicant]
US 20220266719A1 · Iida · 2022 [cited by examiner]
US 20230153743A1 · Kaneria · 2023 [cited by examiner]
JP 2017519270A · 2017 [cited by applicant]
WO 2020230149A1 · 2020 [cited by applicant]
WO WO2021144577A1 · 2021 [cited by examiner]
Gebbran, Daniel et al., Electrical Vehicle Fleet Routing Accounting for Dynamic Battery Degradation, Mar. 9, 2022, pp. 1-6. https://arxiv.org/abs/2203.04642. (Year: 2022). [cited by examiner]