# US 2025/0153740 A1 · Method and device for load-aware scheduling of vehicle movements

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

- Number: US 2025/0153740 A1
- Document ID: US20250153740A1
- Status: Published application
- Kind: A1
- Application number: 18/837,396
- Filed: 2022-03-04
- Published: 2025-05-15
- Earliest claimed: 2022-03-04
- Assignees: Volvo Autonomous Solutions AB
- Applicants: Volvo Autonomous Solutions AB
- Inventors: Fabio FORCOLIN; Âsa ROGENFELT
- Web page: https://patentgrep.com/patent/US20250153740A1

## CPC

- B60W 60/0025: {specially adapted for specific operations}
- G01C 21/343: {Calculating itineraries (travelling salesman problem G06Q10/04; optimisation of routes G06Q10/047)}
- G01C 21/3407: {specially adapted for specific applications}
- G01C 21/3453: {Special cost functions, i.e. other than distance or default speed limit of road segments}
- G05D 1/0297: {by controlling means in a control room}
- 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)
- G06Q 50/40: Business processes related to the transportation industry (shipping G06Q10/083)
- G08G 1/096811: {where the route is computed offboard}
- G08G 1/09685: {where the complete route is computed only once and not updated}
- G08G 1/123: indicating the position of vehicles, e.g. scheduled vehicles; {Managing passenger vehicles circulating according to a fixed timetable, e.g. buses, trains, trams}(transmission of navigation instructions to vehicles G08G1/0968)
- G08G 1/202: {Dispatching vehicles on the basis of a location, e.g. taxi dispatching}
- B60W: CONJOINT CONTROL OF VEHICLE SUB-UNITS OF DIFFERENT TYPE OR DIFFERENT FUNCTION; CONTROL SYSTEMS SPECIALLY ADAPTED FOR HYBRID VEHICLES; ROAD VEHICLE DRIVE CONTROL SYSTEMS FOR PURPOSES NOT RELATED TO THE CONTROL OF A PARTICULAR SUB-UNIT
- G01C: MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY (measuring liquid level G01F; radio navigation, determining distance or velocity by use of propagation effects, e.g. Doppler effects, propagation time, of radio waves, analogous arrangements using other waves G01S)
- G05D: SYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES
- 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
- G08G: TRAFFIC CONTROL SYSTEMS (guiding railway traffic, ensuring the safety of railway traffic B61L; arrangement of road signs or traffic signals E01F9/00; radar or analogous systems, sonar systems, lidar systems specially adapted for traffic control G01S13/91, G01S15/88, G01S17/88; {radar or analogous systems, sonar systems, lidar systems specially adapted for anti-collision purposes G01S13/93, G01S15/93, G01S17/93})

## Abstract

A method of scheduling movements of a plurality of vehicles, wherein each vehicle occupies one node in a shared set of planning nodes and is movable to other nodes along edges between pairs of the nodes, and the vehicle has a time-variable internal state of being either loaded or not-loaded. The method comprises: defining a first subset of the planning nodes at which no loaded vehicle is allowed to stop; obtaining predefined routes of the vehicles; and scheduling the movements of the vehicles along said predefined routes while enforcing a no-stopping condition in the first subset of the planning nodes. In some embodiments, the first subset is defined on the basis of topographical information.

## Claims

### Claim 1

A method of scheduling movements of a plurality of vehicles, wherein each vehicle
occupies one node in a shared set of planning nodes and is movable to other nodes along edges between pairs of the nodes, and
has a time-variable internal state of being either loaded or not-loaded,
the method comprising:
defining a first subset of the planning nodes at which no loaded vehicle is allowed to stop;
obtaining predefined routes of the vehicles; and
scheduling the movements of the vehicles along said predefined routes while enforcing a no-stopping condition in the first subset of the planning nodes.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
defining a second subset of the planning nodes at which no vehicle is allowed to stop, wherein the movements are scheduled while further enforcing the no-stopping condition in the second subset of the planning nodes.

### Claim 3 (depends on 2)

The method of claim 2, wherein the second subset is defined before the first subset is defined.

### Claim 4 (depends on 2)

The method of claim 2, wherein the defining of the second subset of the planning nodes includes:
analyzing the set of planning nodes and edges with respect to the number of oncoming vehicle movements each planning node blocks when the planning node is occupied.

### Claim 5 (depends on 1)

The method of claim 1, wherein the defining of the first subset of the planning nodes includes:
obtaining topographical information associated with the planning nodes, and
analyzing the set of planning nodes and edges with respect to the operational cost of stopping and/or starting a vehicle when loaded.

### Claim 6 (depends on 5)

The method of claim 5, wherein the topographical information includes elevation.

### Claim 7 (depends on 1)

The method of claim 1, wherein the scheduling is performed while enforcing a rule that not-loaded vehicles shall yield to loaded vehicles.

### Claim 8 (depends on 1)

The method of claim 1, wherein the scheduling includes executing an optimization process tending to increase productivity and/or to minimize route completion time.

### Claim 9 (depends on 1)

The method of claim 1, wherein a planning node represents a shared trafficable resource, which can be occupied by at most one vehicle at a time.

### Claim 10 (depends on 1)

The method of claim 1, wherein the edges are unidirectional.

### Claim 11 (depends on 1)

The method of claim 1, wherein the vehicles are autonomous.

### Claim 12 (depends on 1)

The method of claim 1, further comprising:
feeding motion commands to said plurality of vehicles for realizing the routes as scheduled.

### Claim 13 (depends on 1)

A traffic planner configured to schedule movements of a plurality of vehicles, the traffic planner comprising memory and processing circuitry configured to perform the method of claim 1.

### Claim 14 (depends on 1)

A non-transitory computer readable medium storing a computer program comprising instructions to cause a computer to execute the steps of the method of claim 1.
