# US 2021/0080558 A1 · Extended Object Tracking Using RADAR

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

- Number: US 2021/0080558 A1
- Document ID: US20210080558A1
- Status: Published application
- Kind: A1
- Application number: 17/019,157
- Filed: 2020-09-11
- Published: 2021-03-18
- Earliest claimed: 2019-09-13
- Assignees: Aptiv Technologies AG
- Applicants: Aptiv Technologies Limited
- Inventors: Nikhil Bharadwaj Gosala; Xiaoli Meng
- Web page: https://patentgrep.com/patent/US20210080558A1

## CPC

- G01S 13/723: {by using numerical data}
- G01S 7/415: {Identification of targets based on measurements of movement associated with the target}
- G01S 13/42: Simultaneous measurement of distance and other co-ordinates (indirect measurement G01S13/46)
- G01S 13/589: {measuring the velocity vector}
- G01S 13/931: of land vehicles
- G01S: RADIO DIRECTION-FINDING; RADIO NAVIGATION; DETERMINING DISTANCE OR VELOCITY BY USE OF RADIO WAVES; LOCATING OR PRESENCE-DETECTING BY USE OF THE REFLECTION OR RERADIATION OF RADIO WAVES; ANALOGOUS ARRANGEMENTS USING OTHER WAVES

## Abstract

Techniques are provided for extended object tracking using RADAR return points only. The techniques include receiving the return points from at least one RADAR sensor of the vehicle. One or more clusters based on or from the return points are generated. An estimated position and velocity of each of the one or more clusters is computed. A Recursive Least Squares (RLS) based algorithm is proposed to estimate the instantaneous velocity of a cluster in real-time that allows for accurate track-cluster association, removes the need to perform computationally expensive non-linear state updates, and allows for the estimation of the true velocity even in frames with a large amount of clutter. If it is determined that the one or more clusters are associated with an existing object track, the existing object track is updated using at least the respective positions of the one or more clusters associated with the existing object track.

## Claims

### Claim 1

A method comprising:
receiving, using one or more processors of a vehicle, return points from at least one RADAR sensor of the vehicle;
generating, using the one or more processors, one or more clusters based on or from the return points;
computing, using the one or more processors, an estimated position and a velocity of each of the one or more clusters;
determining, using the one or more processors, if the one or more clusters are associated with an existing object track; and
in accordance with the one or more clusters being associated with the existing object track,
updating the existing object track using at least the respective positions of the one or more clusters associated with the existing object track.

### Claim 2 (depends on 1)

The method of claim 1, wherein generating the one or more clusters further comprises:
filtering, using the one or more processors, return points to remove return points that have range rates less than a threshold range rate.

### Claim 3 (depends on 2)

The method of claim 2, further comprising:
accumulating, using the one or more processors, the filtered return points for multiple RADAR time-steps or frames.

### Claim 4 (depends on 1)

The method of claim 1, wherein generating the one or more clusters of the return points comprises clustering the return points using density-based, spatial clustering.

### Claim 5 (depends on 4)

The method of claim 4, wherein the density-based, spatial clustering uses an elliptical region around the return points to expand the one or more clusters, and the elliptical region has a major axis that is parallel to traffic flow.

### Claim 6 (depends on 1)

The method of claim 1, further comprising:
after generating the one or more clusters, computing, using the one or more processors, a length, width and center of each cluster, wherein the center is a representative position of the cluster and all return points belonging to the cluster are assumed to be concentrated at the center.

### Claim 7 (depends on 6)

The method of claim 6, wherein the center is determined by drawing a rectangular bounding box through extreme return points in the cluster and the center is the geometric center of the rectangular bounding box.

### Claim 8 (depends on 6)

The method of claim 6, further comprising:
computing, using the one or more processors, a heading for each of the one or more clusters using the respective velocities of the each of the one or more clusters.

### Claim 9 (depends on 8)

The method of claim 8, wherein the length is defined as a maximum distance between the return points in a direction of the heading.

### Claim 10 (depends on 8)

The method of claim 8, wherein the width is defined as a maximum distance between the return points that are perpendicular to the heading.

### Claim 11 (depends on 6)

The method of claim 6, wherein the returns are aligned to an axis of a global reference frame prior to computing the length, width and center.

### Claim 12 (depends on 1)

The method of claim 1, wherein determining if the each one or more clusters are associated with the existing object track using the respective positions and velocities of the each of the one or more cluster further comprises:
computing differences between the respective estimated positions and velocities of the one or more clusters and a predicted position and velocity of the existing object track; and
determining if the differences are below respective threshold values for the position and velocity.

### Claim 13 (depends on 1)

The method of claim 1, wherein computing the estimated velocity of the each of the one or more clusters, further comprises estimating the velocity of the each of the one or more cluster using one or more recursive least squares (RLS) filters.

### Claim 14 (depends on 13)

The method of claim 13, wherein the initial velocity of the RLS filter is determined by solving a system of linear equations using two points randomly selected from the cluster.

### Claim 15 (depends on 13)

The method of claim 13, wherein the initial velocity of the RLS filter is estimated using an accumulation history of the cluster.

### Claim 16 (depends on 13)

The method of claim 13, wherein the initial velocity of the RLS filter is set to an arbitrary value.

### Claim 17 (depends on 13)

The method of claim 13, wherein the initial velocity of the RLS filter is determined by selecting the velocities of random return points in the cluster, and solving a system of linear equations for the velocity of the cluster using the velocities of the random return points.

### Claim 18 (depends on 1)

The method of claim 1, wherein two or more clusters are associated with the existing object track, the method further comprising:
assimilating return points from the two or more clusters into a single, larger cluster and computing the estimated position, velocity, extents and center of the single, larger cluster.

### Claim 19 (depends on 1)

The method of claim 1, wherein in accordance with the one or more clusters not being associated to an existing object track, creating a new object track with a state of the new object track being initialized with the estimated position and velocity of the cluster.

### Claim 20 (depends on 1)

The method of claim 1, wherein a state of the existing object track is maintained and updated using a Kalman Filter, and the state includes the estimated position, velocity, length and width of the object being tracked.

### Claim 21 (depends on 20)

The method of claim 20, wherein the Kalman Filter is a linear Kalman Filter that employs a constant velocity motion model for model prediction.

### Claim 22 (depends on 21)

The method of claim 21, wherein the estimated velocity of the cluster is used to update the velocity state of the Kalman Filter.

### Claim 23 (depends on 1)

The method of claim 1, wherein in accordance with the existing object track not being associated with a cluster for N iterations, terminating the existing object track, wherein N is a positive integer greater than one.

### Claim 24 (depends on 1)

An apparatus comprising:
one or more processors; and
memory storing instructions that when executed by the one or more processors, cause the one or more processors to perform the method of claim 1.

### Claim 25 (depends on 1)

A non-transitory, computer-readable storage medium storing instructions that when executed by one or more processors, cause the one or more processors to perform the method of claim 1.
