IP Library Granted Patent US 12,531,817
Granted Patent B2
US 12,531,817 · App. 18/392,518 · Granted Jan 20, 2026

Resource management

Inventors: Koji Moriyama (Rancho Palos Verdes, CA); Richard Y. Asato (Torrance, CA); Ryosuke Shibata (Saitama, JP); Brian Moran (Rancho Santa Margarita, CA); Xiaojian Yang (Anaheim, CA)
Assignee: Honda Motor Co., Ltd.
H04L47/827H04L47/762H04L47/822
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,531,817
App. No.
18/392,518
Granted
Jan 20, 2026
Kind
B2
Abstract

According to one aspect, a system for resource management may perform receiving a total resource request, a vector of two or more maximum available resources associated with two or more corresponding resource providers, and a number of resource providers and calculating an individual resource request for each of the two or more resource providers by iteratively comparing the vector of two or more maximum available resources with a vector of a current average resource residual, taking a minimum between those vectors as a running tally for the individual resource requests, and recalculating the current average resource residual.

Claims (36)

1 . A system for resource management, comprising:

a memory storing one or more instructions; and

a processor executing one or more of the instructions stored on the memory to perform:

receiving a total resource request, a vector of two or more maximum available resources associated with two or more corresponding resource providers, and a number of resource providers;

calculating an individual resource request for each of the two or more resource providers by comparing vectors; and

implementing the individual resource request for each of the two or more resource providers to draw the corresponding resources from each of the two or more resource providers.

2 . The system for resource management of claim 1 , wherein the individual resource request for each of the two or more resource providers is set to the corresponding maximum available resources when a sum of the vector of two or more maximum available resources is less than the total resource request.

3 . The system for resource management of claim 1 , wherein the individual resource request for each of the two or more resource providers is equal when possible.

4 . The system for resource management of claim 1 , wherein the current average resource residual is initialized as zero.

5 . The system for resource management of claim 1 , wherein the calculating the individual resource request for each of the two or more resource providers is associated with an iterative threshold.

6 . The system for resource management of claim 5 , wherein the iterative threshold is two iterations or three iterations.

7 . A system for resource management, comprising:

a memory storing one or more instructions;

a processor executing one or more of the instructions stored on the memory to perform:

receiving a total resource request, a vector of two or more maximum available resources associated with two or more corresponding resource providers, and a number of resource providers;

calculating an individual resource request for each of the two or more resource providers by iteratively comparing the vector of two or more maximum available resources with a vector of a current average resource residual, taking a minimum between those vectors as a running tally for the individual resource requests, and recalculating the current average resource residual; and

implementing the individual resource request for each of the two or more resource providers to draw the corresponding resources from each of the two or more resource providers.

8 . The system for resource management of claim 7 , wherein the individual resource request for each of the two or more resource providers is set to the corresponding maximum available resources when a sum of the vector of two or more maximum available resources is less than the total resource request.

9 . The system for resource management of claim 7 , wherein the individual resource request for each of the two or more resource providers is equal when possible.

10 . The system for resource management of claim 7 , wherein the current average resource residual is initialized as zero.

11 . The system for resource management of claim 7 , wherein the calculating the individual resource request for each of the two or more resource providers is associated with an iterative threshold.

12 . The system for resource management of claim 11 , wherein the iterative threshold is two iterations or three iterations.

13 . A system for resource management, comprising:

a memory storing one or more instructions;

a processor executing one or more of the instructions stored on the memory to perform:

receiving a total resource request, a vector of two or more maximum available resources associated with two or more corresponding resource providers, and a number of resource providers;

calculating an individual resource request for each of the two or more resource providers based on a classification number; and

implementing the individual resource request for each of the two or more resource providers to draw the corresponding resources from each of the two or more resource providers.

14 . The system for resource management of claim 13 , wherein any resource provider having a maximum available resource less than or equal to the classification number is assigned an individual resource request equal to their corresponding maximum available resource.

15 . The system for resource management of claim 13 , wherein remaining resource providers having a maximum available resource greater than the classification number are assigned individual resource requests which evenly split the total resource request minus maximum available resources for the resource providers having the maximum available resource less than or equal to the classification number.

16 . The system for resource management of claim 13 , wherein the individual resource request for each of the two or more resource providers is set to the corresponding maximum available resources when a sum of the vector of two or more maximum available resources is less than the total resource request.

17 . The system for resource management of claim 13 , wherein the individual resource request for each of the two or more resource providers is equal when possible.

18 . The system for resource management of claim 13 , wherein the classification number is calculated by sorting the vector of two or more maximum available resources.

19 . The system for resource management of claim 16 , wherein the classification number is calculated by generating a number of dimension vectors equal to the number of resource providers based on the sorted vector of two or more maximum available resources.

20 . The system for resource management of claim 17 , wherein the classification number is calculated by generating an updated dimension vector based on the number of dimension vectors.

21 . The system for resource management of claim 18 , wherein the updated dimension vector may be a monotonically increasing vector.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 21, 2023
From: MORIYAMA, KOJI; ASATO, RICHARD Y.; SHIBATA, RYOSUKE; MORAN, BRIAN; YANG, XIAOJIAN
To: HONDA MOTOR CO., LTD.
Reel/Frame 065932/0337 →
Continuity (3)
Continuation 18188547 · Mar 23, 2023
Continuation 18188793 · Mar 23, 2023
Related Publication 20240323146A1 · Sep 26, 2024
References Cited (26)
US 6571215B1 · Mahapatro · 2003 [cited by examiner]
US 9705895B1 · Gutzmann · 2017 [cited by examiner]
US 9898315B1 · Li · 2018 [cited by examiner]
US 10031785B2 · Gonzalez · 2018 [cited by examiner]
US 10812482B1 · Xu et al. · 2020 [cited by applicant]
US 11036537B1 · Quinn et al. · 2021 [cited by applicant]
US 20050044202A1 · Shirota · 2005 [cited by examiner]
US 20060140115A1 · Timus · 2006 [cited by examiner]
US 20080062437A1 · Rizzo · 2008 [cited by examiner]
US 20090119237A1 · Triantafillidis · 2009 [cited by examiner]
US 20090163223A1 · Casey · 2009 [cited by examiner]
US 20110218849A1 · Rutigliano · 2011 [cited by examiner]
US 20140064200A1 · Oh · 2014 [cited by examiner]
US 20150236724A1 · Reinart · 2015 [cited by examiner]
US 20180026891A1 · Vasseur · 2018 [cited by examiner]
US 20190199611A1 · Kotadia · 2019 [cited by examiner]
US 20210019160A1 · Pan · 2021 [cited by examiner]
US 20210042719A1 · Proud · 2021 [cited by examiner]
US 20210176174A1 · Chou · 2021 [cited by examiner]
US 20210382757A1 · Azuma · 2021 [cited by examiner]
US 20210406815A1 · Mimassi · 2021 [cited by examiner]
US 20220138786A1 · Sawarkar · 2022 [cited by examiner]
US 20230186281A1 · Todasco · 2023 [cited by examiner]
US 20230247143A1 · Gustof · 2023 [cited by examiner]
Office Action of U.S. Appl. No. 18/188,547 dated Feb. 15, 2024, 22 pages. [cited by applicant]
Notice of Allowance of U.S. Appl. No. 18/188,547 dated May 28, 2024, 7 pages. [cited by applicant]