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:
Feb. 19, 2019

Filed:

Aug. 19, 2016
Applicants:

Dura Operating, Llc, Auburn Hills, MI (US);

Ohio State Innovation Foundation, Columbus, OH (US);

Inventors:

Arda Kurt, Dublin, OH (US);

Umit Ozguner, Dublin, OH (US);

Gordon Thomas, Beverly Hills, MI (US);

Keith Redmill, Columbus, OH (US);

Assignee:

DURA OPERATING, LLC, Auburn Hills, MI (US);

Attorneys:
Primary Examiner:
Int. Cl.
CPC ...
B60W 30/06 (2006.01); G05D 1/00 (2006.01); G01C 22/00 (2006.01); G05D 1/02 (2006.01); B62D 1/28 (2006.01); B62D 15/02 (2006.01); G01C 21/34 (2006.01);
U.S. Cl.
CPC ...
B60W 30/06 (2013.01); B62D 15/0285 (2013.01); G01C 21/34 (2013.01); G05D 1/0088 (2013.01); G05D 1/0212 (2013.01); B60W 2550/10 (2013.01); B60W 2710/18 (2013.01); B60W 2720/10 (2013.01);
Abstract

A method for autonomously parking or un-parking a motor vehicle includes the steps of locating the motor vehicle within a parking area, setting a destination location within the parking area, generating and setting a path from the location of the motor vehicle to the destination location, and autonomously driving the motor vehicle along the path. The path is generated by (a) generating a first set of nodes from the location of the motor vehicle, (b) assigning a cost to each node in the first set of nodes, (c) selecting a lowest cost node from the first set of nodes, (d) generating another set of nodes from the selected node, (e) assigning a cost to each of the newly generated nodes, (f) selecting a lowest cost node from all of the nodes, and (g) repeating steps (d)-(f) until a lowest cost node is located at the destination location.


Find Patent Forward Citations

Loading…