# US 2021/0341309 A1 · Systems and methods for route planning

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

- Number: US 2021/0341309 A1
- Document ID: US20210341309A1
- Status: Published application
- Kind: A1
- Application number: 17/305,722
- Filed: 2021-07-14
- Published: 2021-11-04
- Earliest claimed: 2019-01-14
- Assignees: Zhejiang Huaray Technology Co., Ltd.
- Applicants: Zhejiang Huaray Technology Co., Ltd.
- Inventors: Yuanqiang YUAN; Wei LU; Yidong JIN; Jun YIN; Fangbo MU
- Web page: https://patentgrep.com/patent/US20210341309A1

## CPC

- G01C 21/3453: {Special cost functions, i.e. other than distance or default speed limit of road segments}
- G01C 21/3889: {Transmission of selected map data, e.g. depending on route}
- G01C 21/3446: {Details of route searching algorithms, e.g. Dijkstra, A*, arc-flags or using precalculated routes}
- G01C 21/3461: {Preferred or disfavoured areas, e.g. dangerous zones, toll or emission zones, intersections, manoeuvre types or segments such as motorways, toll roads or ferries}
- G01C 21/3492: {employing speed data or traffic data, e.g. real-time or historical (traffic control systems for road vehicles involving transmission of navigation instructions to the vehicle G08G1/0968)}
- G01C 21/3614: {through interaction with a road map, e.g. selecting a POI icon on a road map}
- G01C 21/3807: {characterised by the type of data}
- G01C 21/3874: {Structures specially adapted for data searching and retrieval}
- G08G 1/096816: {where the complete route is transmitted to the vehicle at once}
- G08G 1/09685: {where the complete route is computed only once and not updated}
- G08G 1/096866: {where the complete route is shown to the driver}
- G08G 1/096883: {where input information is obtained using a mobile device, e.g. a mobile phone, a PDA}
- 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)
- 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

The present disclosure may provide a method for route planning. The method may include obtaining a start location and a destination of a target vehicle. The method may also include obtaining a map of a target region including the start location and the destination. The map may include node information of each of a plurality of nodes. Further, the method may include obtaining motion status information associated with one or more vehicles other than the target vehicle in the target region. The method may further include determining a target route of the target vehicle based at least in part on the start location, the destination, the motion status information associated with the one or more vehicles, and the map.

## Claims

### Claim at position 1

1-14. (canceled)

### Claim 15

A system for route planning, comprising:
at least one storage device including a set of instructions; and
at least one processor in communication with the at least one storage device, wherein when executing the set of instructions, the at least one processor is configured to cause the system to:
obtain a start location and a destination of a target vehicle;
obtain a map of a target region including the start location and the destination, the map including node information of each of a plurality of nodes;
obtain motion status information associated with one or more vehicles other than the target vehicle in the target region; and
determine a target route of the target vehicle based at least in part on the start location, the destination, the motion status information associated with the one or more vehicles, and the map.

### Claim 16 (depends on 15)

The system of claim 15, wherein the node information of each of the plurality of nodes includes at least one of a location of the node, a barcode of the node, a coordinate of the node, a passability of the node, a turn capability of the node, a count of adjacent nodes, or a connectivity of the node to the adjacent nodes.

### Claim 17 (depends on 15)

The system of claim 15, wherein to determine the target route of the target vehicle based at least in part on the start location, the destination, the motion status information associated with one or more vehicles, and the map, the at least one processor is configured to cause the system to:
for at least one of the plurality of nodes, determine, based on the motion status information associated with the one or more vehicles, target node information by modifying at least part of the node information of each of the at least one of the plurality of nodes;
generate a target map based on the map and the target node information of the at least one of the plurality of nodes; and
determine the target route of the target vehicle based on the target map, the start location, and the destination.

### Claim 18 (depends on 17)

The system of claim 17, wherein to determine the target route of the target vehicle based on the target map, the start location, and the destination, the at least one processor is configured to cause the system further to:
determine a start node from the plurality of nodes based on the start location in the target map;
determine a destination node from the plurality of nodes based on the destination in the target map; and
determine the target route of the target vehicle based on a plurality of costs associated with a plurality of target nodes between the start node and the destination node, wherein the cost of the target node is determined based on a first cost from the start node to the target node and a second cost from the target node to the destination node.

### Claim 19 (depends on 18)

The system of claim 18, wherein the first cost from the start node to the target node is determined based on a weight value of the target node, a cost of a parent node of the target node, a cost from a parent node of the target node to the target node, and a turn cost from a parent node of the target node to the target node in the target map.

### Claim 20 (depends on 15)

The system of claims 15, wherein to determine the target route of the target vehicle based at least in part on the start location, the destination, the motion status information associated with one or more vehicles, and the map, the at least one processor is configured to cause the system to:
identify one or more static vehicles from the one or more vehicles based on the motion status information;
for each of the one or more static vehicles, determine a preset region including one or more nodes associated with the static vehicle;
for each of the one or more nodes associated with the static vehicle, modify the node information of the node;
determine a candidate map based on the map and the modified node information of the one or more nodes associated with each of the one or more static vehicles; and
determine a candidate route of the target vehicle based on the candidate map, the start location, and the destination.

### Claim 21 (depends on 20)

The system of claim 20, wherein, for each of the one or more nodes associated with the static vehicle, to modify the node information of the node, the at least one processor is directed to:
assign a weight value larger than a predetermined threshold to the node, and
designate the node as a node incapable of turn.

### Claim 22 (depends on 20)

The system of claim 20, wherein the at least one processor is configured to cause the system further to:
determine whether the candidate route at least partially overlaps with at least part of at least one predetermined route that has not been passed, the at least one predetermined route corresponding to at least one moving vehicle of the one or more vehicles; and
in response to a determination that the candidate route does not overlap with the at least one predetermined route that has not been passed, designate the candidate route as the target route of the target vehicle.

### Claim 23 (depends on 22)

The system of claim 22, wherein the at least one processor is configured to cause the system further to:
in response to a determination that the candidate route at least partially overlaps with the at least part of the at least one predetermined route that has not been passed, for each of the one or more nodes associated with the static vehicle, modify the node information of the node;
identify one or more moving vehicles from the one or more vehicles based on the motion status information;
for each of the one or more moving vehicles, determine one or more nodes associated with a predetermined route corresponding to the moving vehicle;
for each of the one or more nodes associated with the moving vehicle, modify the node information of the node;
determine a second candidate map based on the map, the modified node information of the one or more nodes associated with each of the one or more static vehicles, and the modified node information of the one or more nodes associated with each of the one or more moving vehicles; and
determine a second candidate route of the target vehicle based on the second candidate map, the start location, and the destination.

### Claim 24 (depends on 23)

The system of claim 23, wherein
for each of the one or more nodes associated with the static vehicle, to modify the node information of the node, the at least one processor is configured to cause the system to:
designate the node as a barrier; and
for each of the one or more nodes associated with the moving vehicle, to modify the node information of the node, the at least one processor is configured to cause the system to:
assign a weight value larger than a predetermined threshold to the node.

### Claim 25 (depends on 15)

The system of claim 15, wherein to determine the target route of the target vehicle based at least in part on the start location, the destination, the motion status information associated with the one or more vehicles, and the map, the at least one processor is configured to cause the system further to:
identify one or more static vehicles from the one or more vehicles based on the motion status information;
for each of the one or more static vehicles, determine a preset region including one or more nodes associated with the static vehicle;
for each of the one or more nodes associated with the static vehicle, modify the node information of the node by designating the node as a barrier;
identify one or more moving vehicles from the one or more vehicles based on the motion status information;
for each of the one or more moving vehicles, determine one or more nodes associated with a predetermined route corresponding to the moving vehicle;
for each of the one or more nodes associated with the moving vehicle, modify the node information of the node by assigning a weight value larger than a predetermined threshold to the node;[[ and]]
determine the target map based on the map, the modified node information of the one or more nodes associated with each of the one or more static, and the modified node information of the one or more nodes associated with each of the one or more moving vehicles; and
determine the target route of the target vehicle based on the target map, the start location, and the destination.

### Claim 26

A method implemented on a computing device including at least one processor, at least one storage medium, and a communication platform connected to a network, the method comprising:
obtaining a start location and a destination of a target vehicle;
obtaining a map of a target region including the start location and the destination, the map including node information of each of a plurality of nodes;
obtaining motion status information associated with one or more vehicles other than the target vehicle in the target region; and
determining a target route of the target vehicle based at least in part on the start location, the destination, the motion status information associated with one or more vehicles, and the map.

### Claim 27

(canceled)

### Claim 28 (depends on 26)

The method of claim 26, wherein the determining the target route of the target vehicle based at least in part on the start location, the destination, the motion status information associated with one or more vehicles includes:
for at least one of the plurality of nodes, determining, based on the motion status information associated with the one or more vehicles, target node information by modifying at least part of the node information of each of the at least one of the plurality of nodes;
generating a target map based on the map and the target node information of the at least one of the plurality of nodes; and
determining the target route of the target vehicle based on the target map, the start location, and the destination.

### Claim 29 (depends on 28)

The method of claim 28, wherein the determining the target route of the target vehicle based on the target map, the start location, and the destination includes:
determining a start node from the plurality of nodes based on the start location in the target map;
determining a destination node from the plurality of nodes based on the destination in the target map; and
determining the target route of the target vehicle based on a plurality of costs associated with a plurality of target nodes between the start node and the destination node, wherein the cost of the target node is determined based on a first cost from the start node to the target node and a second cost from the target node to the destination node.

### Claim 30

(canceled)

### Claim 31 (depends on 26)

The method of claim 26, wherein the determining the target route of the target vehicle based at least in part on the start location, the destination, the motion status information associated with one or more vehicles, and the map includes:
identifying one or more static vehicles from the one or more vehicles based on the motion status information;
for each of the one or more static vehicles, determining a preset region including one or more nodes associated with the static vehicle;
for each of the one or more nodes associated with the static vehicle, modifying the node information of the node;
determining a candidate map based on the map and the modified node information of the one or more nodes associated with each of the one or more static vehicles; and
determining a candidate route of the target vehicle based on the candidate map, the start location, and the destination.

### Claim 32 (depends on 31)

The method of claim 31, wherein for each of the one or more nodes associated with the static vehicle, the modifying the node information of the node includes:
assigning a weight value larger than a predetermined threshold to the node, and
designating the node as a node incapable of turn.

### Claim 33 (depends on 31)

The method of claim 31, further comprising:
determining whether the candidate route at least partially overlaps with at least part of at least one predetermined route that has not been passed, the at least one predetermined route corresponding to at least one moving vehicle of the one or more vehicles; and
in response to a determination that the candidate route does not overlap with the at least one predetermined route that has not been passed, designating the candidate route as the target route of the target vehicle.

### Claim 34 (depends on 33)

The method of claim 33, further comprising:
in response to a determination that the candidate route at least partially overlaps with the at least part of the at least one predetermined route that has not been passed, for each of the one or more nodes associated with the static vehicle, modifying the node information of the node;
identifying one or more moving vehicles from the one or more vehicles based on the motion status information;
for each of the one or more moving vehicles, determining one or more nodes associated with a predetermined route corresponding to the moving vehicle;
for each of the one or more nodes associated with the moving vehicle, modifying the node information of the node;
determining a second candidate map based on the map, the modified node information of the one or more nodes associated with each of the one or more static vehicles, and the modified node information of the one or more nodes associated with each of the one or more moving vehicles; and
determining a second candidate route of the target vehicle based on the second candidate map, the start location, and the destination.

### Claim 35 (depends on 34)

The method of claim 34, wherein
for each of the one or more nodes associated with the static vehicle, the modifying the node information of the node includes:
designating the node as a barrier; and
for each of the one or more nodes associated with the moving vehicle, the modifying the node information of the node includes:
assigning a weight value larger than a predetermined threshold to the node.

### Claim at position 23

36-47. (canceled)

### Claim 48

A non-transitory computer readable medium, comprising executable instructions that, when executed by at least one processor, direct the at least one processor to perform a method, the method comprising:
obtaining a start location and a destination of a target vehicle;
obtaining a map of a target region including the start location and the destination, the map including node information of each of a plurality of nodes;
obtaining motion status information associated with one or more vehicles other than the target vehicle in the target region; and
determining a target route of the target vehicle based at least in part on the start location, the destination, the motion status information associated with one or more vehicles, and the map.
