The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Sep. 10, 2019

Filed:

May. 07, 2015
Applicants:

Volvo Car Corporation, Gothenburg, SE;

Volvo Truck Corporation, Gothenburg, SE;

Inventors:

David Madas, Gothenburg, SE;

Jonatan Silvlin, Gothenburg, SE;

Andreas Eidehall, Molndal, SE;

Peter Sundstrom, Gothenburg, SE;

Assignees:

Volvo Car Corporation, Gothenburg, SE;

Volvo Truck Corporation, Gothenburg, SE;

Attorney:
Primary Examiner:
Int. Cl.
CPC ...
G08G 1/16 (2006.01); B62D 15/02 (2006.01); B60W 10/20 (2006.01); B60W 30/09 (2012.01); B60W 30/095 (2012.01); G01C 21/34 (2006.01); B60W 10/18 (2012.01);
U.S. Cl.
CPC ...
G08G 1/166 (2013.01); B60W 10/18 (2013.01); B60W 10/20 (2013.01); B60W 30/09 (2013.01); B60W 30/095 (2013.01); B60W 30/0956 (2013.01); B62D 15/0265 (2013.01); G01C 21/3415 (2013.01); G08G 1/163 (2013.01); B60W 2550/20 (2013.01); B60W 2710/18 (2013.01); B60W 2710/20 (2013.01);
Abstract

The present invention relates to a method for determining an evasive path for a host vehicle (), the method i.a. comprising: establishing (S) a predicted traffic environment () of the host vehicle in a time-lateral position domain, the predicted traffic environment comprising an object prediction representation () of a traffic object; determining (S) a start node () for the host vehicle; defining (S) an end node () for the host vehicle; placing (S) several boundary nodes () relative to the object prediction representation; setting (S) node connections (--) between the start node, the boundary nodes, and the end node; and traversing (S) the nodes using a graph-search algorithm in order to find a path from the start node to the end time with a lowest cost.


Find Patent Forward Citations

Loading…