# US 2024/0004394 A1 · Methods and system for predicting trajectories of uncertain road users by semantic segmentation of drivable area boundaries

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

- Number: US 2024/0004394 A1
- Document ID: US20240004394A1
- Status: Published application
- Kind: A1
- Application number: 18/467,111
- Filed: 2023-09-14
- Published: 2024-01-04
- Earliest claimed: 2021-01-05
- Assignees: Argo AI, LLC
- Applicants: Argo AI, LLC
- Inventors: Gregory Boyd Nichols
- Web page: https://patentgrep.com/patent/US20240004394A1

## CPC

- G05D 1/617: Safety or protection, e.g. defining protection zones around obstacles or avoiding hazards (arrangements for controlling the position or course of two or more vehicles for avoiding collisions therebetween G05D1/693; arrangements for reacting to or preventing system or operator failure G05D1/80)
- B60W 60/0027: {using trajectory prediction for other traffic participants}
- G01C 21/20: Instruments for performing navigational calculations (G01C21/24, G01C21/26 take precedence)
- G01C 21/3407: {specially adapted for specific applications}
- 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/38: {Electronic maps specially adapted for navigation; Updating thereof}
- G01C 21/3819: {Road shape data, e.g. outline of a route}
- G01C 21/3867: {Geometry of map features, e.g. shape points, polygons or for simplified maps}
- G05D 1/0214: {in accordance with safety or protection criteria, e.g. avoiding hazardous areas (monitoring the location of vehicles within a certain area, e.g. forbidden or allowed areas, in traffic control systems for road vehicles G08G1/13)}
- G08G 1/166: {for active traffic, e.g. moving vehicles, pedestrians, bikes}
- B60W 2554/4029: Pedestrians
- G05D: SYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES
- 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)
- 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

Methods and systems for controlling navigation of an autonomous vehicle for traversing a drivable area are disclosed. The methods include receiving information relating to a drivable area that includes a plurality of polygons, identifying a plurality of logical edges that form a boundary of the drivable area, sequentially and repeatedly analyzing concavities of each the plurality of logical edges until identification of a first logical edge that has a concavity greater than a threshold, creating a first logical segment of the boundary of the drivable area. This segmentation may be repeated until each of the plurality of logical edges has been classified. The method may include creating and adding (to a map) a data representation of the drivable area that comprises an indication of the plurality of logical segments, and adding the data representation to a road network map comprising the drivable area.

## Claims

### Claim 1

A method for controlling navigation of an autonomous vehicle for traversing a drivable area, the method comprising, by a processor:
receiving information relating to a drivable area in an environment of the autonomous vehicle, wherein the drivable area comprises a plurality of polygons;
identifying a plurality of logical edges that form a boundary of the drivable area;
determining whether there exists at least one logical edge that has a concavity greater than a threshold;
in response to determining that there exists at least one logical edge that has the concavity greater than the threshold:
sequentially, starting from an initial one of the plurality of logical edges and along the boundary of the drivable area, analyzing concavities of each the plurality of logical edges until identification of a first logical edge that has a concavity greater than the threshold;
upon identification of the first logical edge:
creating a first logical segment of the boundary of the drivable area, the first logical segment comprising:
the initial one of the plurality of logical edges,
logical edges between the initial one of the plurality of logical edges and the first logical edge, and
at least a portion of the first logical edge;
repeating the sequentially analyzing and creating steps until each of the plurality of logical edges has been classified into one of a plurality of logical segments of the boundary of the drivable area, each of the plurality of logical segments representative of a potential goal of an actor when traversing the drivable area;
in response to determining that there does not exist at least one logical edge that has the concavity greater than the threshold, forming a single logical segment of the boundary of the drivable area;
creating a data representation of the drivable area that comprises an indication of one or more logical segments; and
adding the data representation to a road network map comprising the drivable area.

### Claim 2 (depends on 1)

The method of claim 1, further comprising using the data representation for:
predicting a trajectory of a pedestrian for traversing the drivable area; and
using the trajectory to control navigation of the autonomous vehicle for avoiding collision with the pedestrian while traversing the drivable area.

### Claim 3 (depends on 1)

The method of claim 1, further comprising using the data representation for identifying an entrance into or an exit from an unmapped area of the environment from the drivable area.

### Claim 4 (depends on 1)

The method of claim 1, further comprising identifying the plurality of logical edges by:
identifying one or more shared edges in the drivable area, each of the one or more shared edges being collinear edges of two of the plurality of polygons; and
discarding the identified one or more shared edges.

### Claim 5 (depends on 4)

The method of claim 4, further comprising:
identifying adjacent edges of the two of the plurality of polygons; and
combining the adjacent edges to form a single logical edge.

### Claim 6 (depends on 1)

The method of claim 1, wherein the threshold is determined based on at least one or more characteristics of a feature included in the drivable area, the one or more characteristics comprising: a type of the feature; a size of the feature; or a degree of curvature of the feature.

### Claim 7 (depends on 6)

The method of claim 6, wherein the threshold is about 120° to about 140° and is determined such that a pedestrian can move from one point of a logical segment of the boundary of the drivable area to another point on the logical segment following a shortest path without entering the drivable area for more than a threshold distance.

### Claim 8 (depends on 6)

The method of claim 6, wherein the threshold is determined such that opposite sides of a lane within the drivable area comprise distinct logical segments.

### Claim 9 (depends on 1)

The method of claim 1, further comprising determining that there does not exist at least one logical edge that has the concavity greater than the threshold when the environment comprises an area substantially surrounded by the drivable area on all sides.

### Claim 10 (depends on 1)

The method of claim 1, wherein:
the environment comprises an n-way intersection; and
the methods include forming n logical segments of the boundary of the drivable area.

### Claim 11

A system for controlling navigation of an autonomous vehicle for traversing a drivable area, the system comprising:
a processor; and
a non-transitory computer readable medium comprising one or more programming instructions that, when executed by a processor, will cause the processor to:
receive information relating to a drivable area in an environment of the autonomous vehicle, wherein the drivable area comprises a plurality of polygons,
identify a plurality of logical edges that form a boundary of the drivable area,
determine whether there exists at least one logical edge that has a concavity greater than a threshold;
in response to determining that there exists at least one logical edge that has the concavity greater than the threshold:
sequentially, starting from an initial one of the plurality of logical edges and along the boundary of the drivable area, analyze concavities of each the plurality of logical edges until identification of a first logical edge that has a concavity greater than a threshold,
upon identification of the first logical edge, create a first logical segment of the boundary of the drivable area, the first logical segment comprising:
the initial one of the plurality of logical edges,
logical edges between the initial one of the plurality of logical edges and the first logical edge, and
at least a portion of the first logical edge;
repeat the sequentially analyzing and creating steps until each of the plurality of logical edges has been classified into one of a plurality of logical segments of the boundary of the drivable area, each of the plurality of logical segments representative of a potential goal of an actor when traversing the drivable area,
in response to determining that there does not exist at least one logical edge that has the concavity greater than the threshold, form a single logical segment of the boundary of the drivable area;
create a data representation of the drivable area that comprises an indication of one or more logical segments, and
add the data representation to a road network map comprising the drivable area.

### Claim 12 (depends on 11)

The system of claim 11, further comprising programming instructions that, when executed by a processor, will cause the processor to use the data representation for:
predicting a trajectory of a pedestrian for traversing the drivable area; and
using the trajectory to control navigation of the autonomous vehicle for avoiding collision with the pedestrian while traversing the drivable area.

### Claim 13 (depends on 11)

The system of claim 11, further comprising programming instructions that, when executed by a processor, will cause the processor to use the data representation for identifying an entrance into or an exit from an unmapped area of the environment from the drivable area.

### Claim 14 (depends on 11)

The system of claim 11, further comprising programming instructions that, when executed by a processor, will cause the processor to identify the plurality of logical edges by:
identifying one or more shared edges in the drivable area, each of the one or more shared edges being collinear edges of two of the plurality of polygons; and
discarding the identified one or more shared edges.

### Claim 15 (depends on 14)

The system of claim 14, further comprising programming instructions that, when executed by a processor, will cause the processor to:
identify adjacent edges of the two of the plurality of polygons; and
combine the adjacent edges to form a single logical edge.

### Claim 16 (depends on 11)

The system of claim 11, wherein the threshold is determined based on at least one or more characteristics of a feature included in the drivable area, the one or more characteristics comprising: a type of the feature; a size of the feature; or a degree of curvature of the feature.

### Claim 17 (depends on 16)

The system of claim 16, wherein the threshold is about 120° to about 140° and is determined such that a pedestrian can move from one point of a logical segment of the boundary of the drivable area to another point on the logical segment following a shortest path without entering the drivable area for more than a threshold distance.

### Claim 18 (depends on 11)

The system of claim 11, further comprising programming instructions that, when executed by a processor, will cause the processor to:
identify a portion of the initial logical edge that has a first concavity greater than the threshold; and
upon identification of the portion, divide the initial logical edge into two logical segments.

### Claim 19 (depends on 11)

The system of claim 11, wherein programming instructions that when executed by the processor, will cause the processor to determine that there does not exist at least one logical edge that has the concavity greater than the threshold when the environment comprises an area substantially surrounded by the drivable area on all sides.

### Claim 20 (depends on 11)

The system of claim 11, wherein:
the environment comprises an n-way intersection; and
the system further comprises programming instructions that when executed by the processor, will cause the processor to form n logical segments of the boundary of the drivable area.
