# US 2022/0034675 A1 · Method and system for path planning, computer system, and computer-readable storage medium

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

- Number: US 2022/0034675 A1
- Document ID: US20220034675A1
- Status: Published application
- Kind: A1
- Application number: 17/276,729
- Filed: 2019-07-19
- Published: 2022-02-03
- Earliest claimed: 2018-09-30
- Assignees: Beijing Jingdong Zhenshi Information Technology Co., Ltd.
- Applicants: Beijing Jingdong Zhenshi Information Technology Co., Ltd.
- Inventors: Jianqi LI; Yuanhui LANG
- Web page: https://patentgrep.com/patent/US20220034675A1

## CPC

- G01C 21/206: {specially adapted for indoor navigation}
- 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)}
- G05D 1/0287: {involving a plurality of land vehicles, e.g. fleet or convoy travelling (traffic control systems for road vehicles G08G1/00, particularly anticollision systems G08G1/16)}
- G05D 1/692: involving a plurality of disparate vehicles
- G06F 18/23: Clustering techniques
- 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
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

The present disclosure provides a method for path planning, comprising: determining moving paths for a plurality of sorting vehicles (S210), wherein each sorting vehicle corresponds to one of the moving paths, and each moving path comprises one or more navigation points; in a process of each sorting vehicle moving along the corresponding moving path, determining whether the moving paths for the plurality of sorting vehicles have a conflict point (S220), wherein the conflict point is a navigation point causing distribution congestion; in response to the moving paths for the plurality of sorting vehicles have a conflict point, determining a distribution congestion area according to position information of the conflict point (S230); and planning a moving path for the sorting vehicle outside the distribution congestion area (S240). The present disclosure further provides a system for path planning, a computer system and a computer-readable storage medium.

## Claims

### Claim 1

A method for path planning, comprising:
determining moving paths for a plurality of sorting vehicles, wherein each sorting vehicle corresponds to one of the moving paths, and each moving path comprises one or more navigation points;
in a process of each sorting vehicle moving along a corresponding moving path, determining whether the moving paths for the plurality of sorting vehicles have a conflict point, wherein the conflict point is a navigation point causing distribution congestion;
in response to the moving paths for the plurality of sorting vehicles have a conflict point, determining a distribution congestion area according to position information of the conflict point; and
planning a moving path for a sorting vehicle outside the distribution congestion area.

### Claim 2 (depends on 1)

The method of claim 1, wherein the moving paths for the plurality of sorting vehicles have a plurality of conflict points, and wherein the determining a distribution congestion area according to position information of the conflict point comprises:
performing cluster analysis on the plurality of conflict points according to position information of each conflict point; and
determining the distribution congestion area according to a result of the cluster analysis.

### Claim 3 (depends on 2)

The method of claim 2, wherein:
the determining the distribution congestion area according to a result of the cluster analysis comprises: determining a plurality of distribution congestion areas according to the result of the cluster analysis;
in response to a plurality of distribution congestion areas are determined, the planning a moving path for a sorting vehicle outside the distribution congestion area comprises:
determining a number of conflict points within each of the plurality of distribution congestion areas;
determining a congestion cost for each distribution congestion area according to the number of conflict points within said each distribution congestion area; and
planning the moving path for the sorting vehicle outside the distribution congestion areas according to the congestion cost for each distribution congestion area.

### Claim 4 (depends on 3)

The method of claim 3, wherein the planning the moving path for the sorting vehicle outside the distribution congestion areas according to the congestion cost for each distribution congestion area comprises:
comparing the congestion cost for each of the distribution congestion areas with the congestion cost for another of the distribution congestion areas; and
planning the moving path for the sorting vehicle outside the distribution congestion areas according to a position of a distribution congestion area having the lowest congestion cost.

### Claim 5 (depends on 1)

The method of claim 1, further comprising:
re-planning a moving path for each sorting vehicle within the distribution congestion area.

### Claim at position 6

6-10. (canceled)

### Claim 11 (depends on 1)

A computer system, comprising:
one or more processors; and
a memory, configured to store one or more programs which, when executed by the one or more processors, cause the one or more processors to implement the method for path planning of claim 1.

### Claim 12 (depends on 1)

A computer-readable storage medium having executable instructions stored thereon which, when executed by a processor, cause the processor to implement the method for path planning of claim 1.

### Claim 13 (depends on 2)

A computer system, comprising:
one or more processors; and
a memory, configured to store one or more programs which, when executed by the one or more processors, cause the one or more processors to implement the method for path planning of claim 2.

### Claim 14 (depends on 3)

A computer system, comprising:
one or more processors; and
a memory, configured to store one or more programs which, when executed by the one or more processors, cause the one or more processors to implement the method for path planning of claim 3.

### Claim 15 (depends on 4)

A computer system, comprising:
one or more processors; and
a memory, configured to store one or more programs which, when executed by the one or more processors, cause the one or more processors to implement the method for path planning of claim 4.

### Claim 16 (depends on 5)

A computer system, comprising:
one or more processors; and
a memory, configured to store one or more programs which, when executed by the one or more processors, cause the one or more processors to implement the method for path planning of claim 5.

### Claim 17 (depends on 2)

A computer-readable storage medium having executable instructions stored thereon which, when executed by a processor, cause the processor to implement the method for path planning of claim 2.

### Claim 18 (depends on 3)

A computer-readable storage medium having executable instructions stored thereon which, when executed by a processor, cause the processor to implement the method for path planning of claim 3.

### Claim 19 (depends on 4)

A computer-readable storage medium having executable instructions stored thereon which, when executed by a processor, cause the processor to implement the method for path planning of claim 4.

### Claim 20 (depends on 5)

A computer-readable storage medium having executable instructions stored thereon which, when executed by a processor, cause the processor to implement the method for path planning of claim 5.
