# US 2024/0403820 A1 · Monte-carlo tree search-based metaheuristic for faster optimal fleet allocation

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2024/0403820 A1
- Document ID: US20240403820A1
- Status: Published application
- Kind: A1
- Application number: 18/328,665
- Filed: 2023-06-02
- Published: 2024-12-05
- Earliest claimed: 2023-06-02
- Assignees: Ford Global Technologies, LLC
- Applicants: Ford Global Technologies, LLC
- Inventors: Mithun Goutham; Stephanie Stockar; Meghna Menon; Sarah Garrow; Tren Martinus Johannes Theodor Baltussen
- Web page: https://patentgrep.com/patent/US20240403820A1

## CPC

- G06Q 10/087: Inventory or stock management, e.g. order filling, procurement or balancing against orders
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR

## Abstract

A method of managing a fleet of robots for delivery of materials in a facility is provided. The method includes: determining a sequence of waypoints by a Branch and Bound (B&B) method; determining a path through the sequence of waypoints by a dual graph method; and determining a fleet composition and distribution of tasks among the robots by the B&B method and a Monte Carlo Tree Search (MCTS) method.

## Claims

### Claim 1

A method of managing a fleet of robots for delivery of materials in a facility, the method comprising:
determining a sequence of waypoints by a Branch and Bound (B&B) method;
determining a path through the sequence of waypoints by a dual graph method; and
determining a fleet composition and distribution of tasks among the robots by integrating the B&B method and a Monte Carlo Tree Search (MCTS) method.

### Claim 2 (depends on 1)

The method according to claim 1, further comprising determining a candidate fleet composition by using the MCTS method.

### Claim 3 (depends on 2)

The method according to claim 2, wherein the candidate fleet composition is the most efficient fleet composition that has the least operational cost.

### Claim 4 (depends on 3)

The method according to claim 3, further comprising using the least operational cost to update an upper bound in the B&B algorithm.

### Claim 5 (depends on 1)

The method according to claim 1, further comprising partitioning a search space of the B&B algorithm by a plurality of processors.

### Claim 6 (depends on 5)

The method according to claim 5, wherein the search space is partitioned based on the number of robots.

### Claim 7 (depends on 1)

The method according to claim 1, wherein the fleet composition includes a number of robots and types of robots in the fleet.

### Claim 8 (depends on 1)

The method according to claim 1, wherein the fleet of robots include a plurality of autonomous mobile robots (AMRs).

### Claim 9 (depends on 1)

The method according to claim 1, further comprising determining the distribution of task by a random rollout.

### Claim 10 (depends on 1)

The method according to claim 1, further comprising backpropagating the operational cost through a tree of the MCTS algorithm.

### Claim 11 (depends on 1)

The method according to claim 1, further comprising using the MCTS algorithm to provide bound estimates for a search space using the B&B algorithm.

### Claim 12 (depends on 11)

The method according to claim 11, further comprising continuously updating an upper bound of a search by the B&B algorithm by a search result of the MCTS algorithm.
