IP Library › Patent Application 18857743
Patent Application
App. No. 18/857,743

DELIVERY PLANNING APPARATUS, DELIVERY PLANNING METHOD, AND PROGRAM

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 None
App. No.
18/857,743
Abstract

A delivery planning device includes an algorithm calculation unit that solves a vehicle routing problem for determining a route for providing a service to a plurality of nodes by a plurality of moving bodies using a neural network that performs reinforcement learning by an Actor-Critic method, in which the algorithm calculation unit has a plurality of actor networks corresponding to the plurality of moving bodies, and each actor network determines the route based on a state of a certain moving body and a state of the plurality of nodes.

Claims (28)

1 . A delivery planning device comprising:

an algorithm calculation unit that solves a vehicle routing problem for determining a route for providing a service to a plurality of nodes by a plurality of moving bodies using a neural network that performs reinforcement learning by an Actor-Critic method, wherein

the algorithm calculation unit has a plurality of actor networks corresponding to the plurality of moving bodies, and each actor network determines the route based on a state of a certain moving body and a state of the plurality of nodes.

2 . The delivery planning device according to claim 1 , wherein

a state of each moving body includes at least a position and a loading amount, and a state of each node includes at least a position and a demand.

3 . The delivery planning device according to claim 1 , wherein

the algorithm calculation unit performs repeatedly the processing of determining an action and updating a state for each moving body in each time step.

4 . A delivery planning method executed by a delivery planning device, the delivery planning method comprising:

solving a vehicle routing problem for determining a route for providing a service to a plurality of nodes by a plurality of moving bodies using a neural network that performs reinforcement learning by an Actor-Critic method, wherein

each actor network in a plurality of actor networks corresponding to the plurality of moving bodies determines the route based on a state of a certain moving body and a state of the plurality of nodes.

5 . (canceled)

6 . The delivery planning device according to claim 1 , wherein

the algorithm calculation unit outputs a delivery plan by solving a vehicle routing problem (VRP) problem based on information on each node and each delivery vehicle.

7 . The delivery planning method according to claim 4 , wherein

a state of each moving body includes at least a position and a loading amount, and a state of each node includes at least a position and a demand.

8 . The delivery planning method according to claim 4 , wherein

the algorithm calculation unit performs repeatedly the processing of determining an action and updating a state for each moving body in each time step.

9 . The delivery planning method according to claim 4 , wherein

outputting a delivery plan by solving a vehicle routing problem (VRP) problem based on information on each node and each delivery vehicle.

10 . A computer-readable non-transitory recording medium storing computer-executable program instructions that when executed by a processor cause a computer to execute a delivery planning method comprising:

solving a vehicle routing problem for determining a route for providing a service to a plurality of nodes by a plurality of moving bodies using a neural network that performs reinforcement learning by an Actor-Critic method, wherein

each actor network in a plurality of actor networks corresponding to the plurality of moving bodies determines the route based on a state of a certain moving body and a state of the plurality of nodes.

11 . The computer-readable non-transitory recording medium according to claim 10 wherein the delivery planning method according to claim 10 , further comprising:

a state of each moving body includes at least a position and a loading amount, and a state of each node includes at least a position and a demand.

12 . The computer-readable non-transitory recording medium according to claim 10 wherein the delivery planning method according to claim 10 , further comprising:

the algorithm calculation unit performs repeatedly the processing of determining an action and updating a state for each moving body in each time step.

13 . The computer-readable non-transitory recording medium according to claim 10 wherein the delivery planning method according to claim 10 , further comprising:

outputting a delivery plan by solving a vehicle routing problem (VRP) problem based on information on each node and each delivery vehicle.

Assignments (2)
CHANGE OF NAME Recorded Jan 1, 2026
From: NIPPON TELEGRAPH AND TELEPHONE CORPORATION
To: NTT, INC.
Reel/Frame 074164/0675 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 15, 2025
From: WANG, ZHAO; NAKANO, YUSUKE; NISHIMATSU, KEN; AKASHI, KAZUAKI
To: NIPPON TELEGRAPH AND TELEPHONE CORPORATION
Reel/Frame 069879/0967 →