# US 2026/0087197 A1 · Planning devices, planning methods, planning program

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

- Number: US 2026/0087197 A1
- Document ID: US20260087197A1
- Status: Published application
- Kind: A1
- Application number: 19/106,938
- Filed: 2022-09-05
- Published: 2026-03-26
- Earliest claimed: 2022-09-05
- Assignees: NTT, Inc.
- Applicants: Ntt, Inc.
- Inventors: Daichi ASAHI; Ai HOSHINO; Takahiro HATA; Chihiro YAMAMOTO; Masato KAMIYA; Ippei SHAKE
- Web page: https://patentgrep.com/patent/US20260087197A1

## CPC

- G06F 30/20: Design optimisation, verification or simulation (optimisation, verification or simulation of circuit designs G06F30/30)
- G06Q 10/04: Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem" (market predictions or forecasting for commercial activities G06Q30/0202)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- 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 planning device for planning a digital twin system including at least two digital twins. A planning device includes an overall arbitration unit that performs calculation of overall arbitration of an operation plan for an operation performed in a state where there is no operation of an object in a real space corresponding to each of the digital twins, and transmits a result of the overall arbitration to each of the digital twins, and a partial change unit that performs calculation of a partial change of the operation plan, by correction based on the result of the overall arbitration, for an operation performed in a state where there is an operation of an object in a real space corresponding to each of the digital twins, and transmits a result of the partial change to each of the digital twins.

## Claims

### Claim 1

A planning device for planning a digital twin system including at least two digital twins, the planning device comprising:
a memory; and
at least one processor coupled to the memory, the at least one processor being configured to:
perform calculation of overall arbitration of an operation plan for an operation performed in a state where there is no operation of an object in a real space corresponding to each of the digital twins, and transmit a result of the overall arbitration to each of the digital twins; and
perform calculation of a partial change of the operation plan, by correction based on the result of the overall arbitration, for an operation performed in a state where there is an operation of an object in a real space corresponding to each of the digital twins, and transmit a result of the partial change to each of the digital twins.

### Claim 2 (depends on 1)

The planning device according to claim 1, wherein, among a first digital twin related to behavior prediction of a user, a second digital twin related to demand prediction, a third digital twin related to a robot, and a fourth digital twin related to an air conditioner, the digital twin includes at least the first digital twin and the second digital twin,
the at least one processor is configured to create a combination of a recommendation to a user in the first digital twin and a recommendation by a combination of operation plans of other digital twins other than the first digital twin by a predetermined optimization method in accordance with a predetermined objective function and a predetermined constraint condition by using acquisition information from each of the digital twins, and notify each of the digital twins of a result of the overall arbitration, and
create a combination of the recommendations by correcting a difference from an operation plan of a combination of recommendations created in advance using each piece of acquisition information from the digital twins, with the combination of the recommendations based on the result of the overall arbitration as an initial combination, in accordance with a predetermined evaluation function and a predetermined constraint condition, and notify each of the digital twins of a result of the partial change.

### Claim 3 (depends on 2)

The planning device according to claim 2, wherein the objective function and the evaluation function represent a function that assumes a combination having a large value as a good combination and further represent a function combining one or more purposes, and
the at least one processor is configured to determine a purpose from any one or a combination of a case where the purpose is user satisfaction, a case where the purpose is recommendation success, a case where the purpose is matching of prediction-actual result difference of demand prediction, and a case where the purpose is effective use of a robot.

### Claim 4 (depends on 3)

The planning device according to claim 3, wherein,
in a case where the purpose is the user satisfaction, a value of a sum of user satisfaction levels of combinations of recommendations of all users is used,
in a case where the purpose is the recommendation success, a sum of recommendation success rates of combinations of recommendations of a user is used,
in a case where the purpose is the matching of prediction-actual result difference of demand prediction, an absolute value obtained by subtracting a total number of recommendations of a target of combination of recommendations from a predicted demand number of a target menu is used, and
in a case where the purpose is the effective use of the robot, an absolute value obtained by subtracting a total number of recommendations including robot delivery of a combination of recommendations from an acceptable number of robots is used.

### Claim 5 (depends on 2)

The planning device according to claim 2, wherein
the constraint condition is a condition that a combination that does not satisfy a condition is not selectable, and
the at least one processor is configured to determine a constraint from any one or a combination of a case where prevention of recommendations equal to or more than a predicted demand number is set as a constraint, a case where congestion prevention is set as a constraint, a case where prevention of recommendations equal to or more than an acceptable number of robots is set as a constraint, and a case where a value obtained by subtracting a total number of recommendations including robot delivery of a combination of recommendations from an acceptable number of robots being equal to or more than a predetermined value is set as a constraint.

### Claim 6 (depends on 5)

The planning device according to claim 5, wherein,
in a case where the prevention of recommendations equal to or more than the predicted demand number is set as a constraint, a value obtained by subtracting a number of target recommendations from a target predicted demand number being equal to or more than a predetermined value is set as a constraint,
in a case where the congestion prevention is set as a constraint, a value obtained by subtracting the total number of recommendations to eat at a target store of a combination of recommendations from an accommodatable number of people in the store being equal to or more than a predetermined value is set as a constraint, and
in a case where the prevention of recommendations equal to or more than an acceptable number of robots is set as a constraint, a value obtained by subtracting a total number of recommendations including robot delivery of a combination of recommendations from an acceptable number of robots being equal to or more than a predetermined value is set as a constraint.

### Claim 7

A planning method for planning a digital twin system including at least two digital twins, the planning method causing a computer to execute processing comprising:
performing calculation of overall arbitration of an operation plan for an operation performed in a state where there is no operation of an object in a real space corresponding to each of the digital twins, and transmitting a result of the overall arbitration to each of the digital twins; and
performing calculation of a partial change of the operation plan, by correction based on the result of the overall arbitration, for an operation performed in a state where there is an operation of an object in a real space corresponding to each of the digital twins, and transmitting a result of the partial change to each of the digital twins.

### Claim 8

A non-transitory, computer-readable storage medium storing a planning program for planning a digital twin system including at least two digital twins, the planning program causing a computer to execute processing comprising:
performing calculation of overall arbitration of an operation plan for an operation performed in a state where there is no operation of an object in a real space corresponding to each of the digital twins, and transmitting a result of the overall arbitration to each of the digital twins; and
performing calculation of a partial change of the operation plan, by correction based on the result of the overall arbitration, for an operation performed in a state where there is an operation of an object in a real space corresponding to each of the digital twins, and transmitting a result of the partial change to each of the digital twins.
