Information processing apparatus and information processing method
AssigneeSony Group Corporation
InventorDaisuke Fukunaga
Life of this patent
Estimating the term…
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.
Claims9
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.
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.
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.
Dependencies are inferred from the claim text.