IP Library Granted Patent US 12,590,807
Granted Patent B2
US 12,590,807 · App. 18/697,488 · Granted Mar 31, 2026

Information processing apparatus and information processing method

Inventor: Daisuke Fukunaga (Tokyo, JP)
Assignee: SONY GROUP CORPORATION
G01C21/3461G01C21/3492
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,590,807
App. No.
18/697,488
Granted
Mar 31, 2026
Kind
B2
Abstract

Provided is an information processing apparatus includes a graph structure generation unit and a route planning unit. The graph structure generation unit sets an area including a plurality of graph elements in a graph including a node and an edge as a graph element. The route planning unit plans a route of a plurality of moving bodies (MB) in a graph such that a conflict of moving bodies (MB) exceeding the capacity of the area does not occur in the area.

Claims (48)

1 . An information processing apparatus, comprising:

an output device; and

a central processing unit (CPU) configured to:

control the output device to display a user interface (UI) having a graph;

perform an area setting process on the graph to set a first area in the graph, wherein

the set first area includes a first plurality of graph elements of a set of graph elements,

the graph includes a plurality of nodes and a plurality of edges, and

each of the plurality of nodes and each of the plurality of edges corresponds to a respective graph element of the set of graph elements; and

plan a plurality of routes of a plurality of moving bodies in the graph to avoid a first conflict in the set first area,

wherein

the first conflict indicates that a first number of moving bodies of the plurality of moving bodies simultaneously present in the set first area exceeds a first capacity of the set first area, and

the first capacity of the set first area indicates a second number of moving bodies, of the plurality of moving bodies, simultaneously allowable in the set first area.

2 . The information processing apparatus according to claim 1 , wherein the CPU is further configured to:

set in the graph a parent area including a plurality of child areas; and

the plurality of routes of the plurality of moving bodies to avoid a second conflict in the parent area, wherein

each of a set of child areas of the plurality of child areas includes at least one first respective moving body of the plurality of moving bodies,

the set of child areas includes a first number of child areas,

the second conflict indicates that the first number of child areas simultaneously including the at least one the first respective moving body exceeds a second capacity of the parent area, and

the second capacity of the parent area indicates a second number of child area, of the plurality of child areas, simultaneously allowable to include at least one second respective moving body of the plurality of moving bodies.

3 . The information processing apparatus according to claim 1 , wherein the CPU is further configured to set a third capacity of each of the set of graph elements to one.

4 . The information processing apparatus according to claim 1 , wherein the CPU is further configured to:

select at least one-way edge from the plurality of edges based on user input information, wherein the selected at least one-way edge corresponds to a second plurality of graph elements of the set of graph elements;

set a fourth capacity of the second plurality of graph elements to at least two; and

set a fifth capacity of each of the set of graph elements, except for the fourth capacity of the second plurality of graph elements, to one.

5 . The information processing apparatus according to claim 1 , wherein the output device is configured to:

display a selection tool to select the first plurality of graph elements; and

display of the selection tool to include the selected first plurality of graph elements in the set first area.

6 . The information processing apparatus according to claim 5 , wherein, based on the selection, the output device is further configured to display a window to set the first capacity of the set first area.

7 . The information processing apparatus according to claim 1 , wherein

the output device is further configured to display a plurality of areas in an identifiable manner, and

the plurality of areas includes the set first area.

8 . An information processing method executed by a computer, the method comprising:

controlling an output device to display a user interface (UI) having a graph;

performing an area setting process on the graph for setting an area in the graph, wherein

the set area includes a plurality of graph elements of a set of graph elements,

the graph includes a plurality of nodes and a plurality of edges, and

each of the plurality of nodes and each of the plurality of edges corresponds to a respective graph element of the set of graph elements; and

planning a plurality of routes of a plurality of moving bodies in the graph to avoid a conflict in the set area, wherein

the conflict indicates that a first number of moving bodies of the plurality of moving bodies simultaneously present in the set area exceeds a capacity of the set area, and

the capacity of the set area indicates a second number of moving bodies, of the plurality of moving bodies, simultaneously allowable in the set area.

9 . A non-transitory computer-readable medium having stored thereon, computer-executable instructions that when executed by a computer, causes the computer to execute operations, the operations comprising:

controlling an output device to display a user interface (UI) having a graph;

performing an area setting process on the graph for setting an area in the graph, wherein

the set area includes a plurality of graph elements of a set of graph elements,

the graph includes a plurality of nodes and a plurality of edges, and each of the plurality of nodes and each of the plurality of edges corresponds to a respective graph element of the set of graph elements; and

planning a plurality of routes of a plurality of moving bodies in the graph to avoid a conflict in the set area, wherein

the conflict indicates that a first number of moving bodies of the plurality of moving bodies simultaneously present in the set area exceeds a capacity of the set area, and

the capacity of the set area indicates a second number of moving bodies of the plurality of moving bodies, simultaneously allowable in the set area.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 1, 2024
From: FUKUNAGA, DAISUKE
To: SONY GROUP CORPORATION
Reel/Frame 066959/0624 →
Priority Claims (1)
JP 2021-167514 · Oct 12, 2021 · national
Continuity (1)
Related Publication 20250012581A1 · Jan 9, 2025
References Cited (13)
US 5625559A · Egawa · 1997 [cited by examiner]
US 11079245B1 · Niewiadomski · 2021 [cited by examiner]
CN 109115226 · 2019 [cited by examiner]
JP 10312217A · 1998 [cited by applicant]
JP 10320047A · 1998 [cited by applicant]
JP 2020008962A · 2020 [cited by applicant]
JP 2020009405A · 2020 [cited by applicant]
JP 2021071795A · 2021 [cited by applicant]
JP 2021071891A · 2021 [cited by applicant]
JP 2022047944A · 2022 [cited by applicant]
WO 2020132386A1 · 2020 [cited by applicant]
International Search Report and Written Opinion of PCT Application No. PCT/JP2022/036995, issued on Nov. 8, 2022, 10 pages of ISRWO. [cited by applicant]
Sharon, et al., “Conflict-Based Search for Optimal Multi-Agent Pathfinding”, Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, vol. 219, Feb. 2015, 7 pages. [cited by applicant]