Method for autonomously parking a motor vehicle for head-in, tail-in, and parallel parking spots
A method for autonomously parking a motor vehicle in various types of parking spots includes the steps of receiving a map of a parking area, locating the motor vehicle within the parking area, selecting a parking spot within the parking area, generating a node tree from the location of the motor vehicle to the parking spot, selecting a path from the node tree, wherein the path connects the location of the motor vehicle to the parking spot, autonomously driving the motor vehicle along the path from the location of the motor vehicle to an intermediate location on the path, and performing a parking maneuver into the parking spot from the intermediate location. The parking maneuver may be a head-in, tail-in, or parallel parking maneuver.
1. A method for autonomously parking a motor vehicle, the method comprising:
receiving a map of a parking area;
locating the motor vehicle relative to the parking area;
selecting a parking spot within the parking area;
generating a plurality of paths each having a cost function from the location of the motor vehicle to the parking spot;
selecting a path from the plurality of paths based on the cost function, wherein the path connects the location of the motor vehicle to proximal the parking spot;
autonomously driving the motor vehicle along the path from the location of the motor vehicle to an intermediate location on the path; and
performing a parking maneuver into the parking spot from the intermediate location:
wherein generating the plurality of paths includes generating a node tree which includes:
(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 linked to the selected node and offset from the selected node by a fixed distance and a steering angle;
(e) assigning a cost to each of the newly generated nodes, wherein the cost of a node is equal to a base cost plus an inherited cost from the selected node, a turning cost, and a reverse cost if the newly generated node is behind the selected node;
(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 parking spot.
2. The method of claim 1 wherein the parking maneuver is one of a head-in parking maneuver, a tail-in parking maneuver, and a parallel parking maneuver.
3. The method of claim 2 wherein which of the parking maneuvers is performed is a function of a sensor coverage of the motor vehicle.
4. The method of claim 2 wherein the parking maneuver is one of a head-in parking maneuver and a parallel parking maneuver if a rear of the motor vehicle lacks sufficient sensor coverage.
5. The method of claim 2 wherein the parking maneuver is one of a tail-in parking maneuver and a parallel parking maneuver if a front of the motor vehicle lacks sufficient sensor coverage.
6. The method of claim 2 wherein which of the parking maneuvers is performed is selected by an operator of the motor vehicle.
7. The method of claim 2 wherein which of the parking maneuvers is performed is a function of the type of parking spot.
8. The method of claim 2 wherein which of the parking maneuvers is performed is commanded by a parking area infrastructure.
9. The method of claim 1 wherein selecting a path from the node tree includes selecting a path from the location of the motor vehicle to the parking spot comprising the last selected lowest cost node and parent nodes connected to the last selected lowest cost node.
10. The method of claim 9 wherein nodes between the location of the motor vehicle and the intermediate location are in an approach phase and the nodes between the intermediate location and the parking spot are in a park phase, and wherein the turning cost and the reverse cost are different in the approach phase than in the parking phase.
11. The method of claim 10 wherein the steering angle cost and the reverse cost are greater in the approach phase than in the parking phase.
12. The method of claim 1 wherein the intermediate location is set a predefined distance from the parking spot.
13. The method of claim 1 wherein the parking maneuver is a function of the type of selected parking spot.
14. A method for autonomously parking a motor vehicle, the method comprising:
receiving a map of a parking area;
locating the motor vehicle within the parking area;
selecting a parking spot within the parking area;
generating a node tree from the location of the motor vehicle to the parking spot, wherein the node tree includes a plurality of nodes, each node having a base cost plus a fixed cost;
selecting a path from the node tree, wherein the path connects the location of the motor vehicle to the parking spot, and wherein the path includes an approach phase and a parking phase, and wherein the fixed costs in the approach phase are greater than the fixed costs in the parking phase;
autonomously driving the motor vehicle along the path in the approach phase; and
performing a parking maneuver into the parking spot in the parking phase.
15. The method of claim 14 wherein the parking maneuver is one of a head-in parking maneuver, a tail-in parking maneuver, and a parallel parking maneuver.
16. The method of claim 15 wherein which of the parking maneuvers is performed is a function of a sensor coverage of the motor vehicle and a type of selected parking spot.
17. The method of claim 15 wherein the fixed costs include a turning cost and a reverse cost.
18. The method of claim 17 wherein both the turning cost and the reverse cost are greater in the approach phase than in the parking phase.
19. A method for autonomously parking a motor vehicle, the method comprising:
receiving a map of a parking area;
locating the motor vehicle within the parking area;
selecting a parking spot within the parking area;
generating a node tree from the location of the motor vehicle to the parking spot comprising the steps of:
(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 linked to the selected node and offset from the selected node by a fixed distance and a steering angle;
(e) assigning a cost to each of the newly generated nodes, wherein the cost of a node is equal to a base cost plus an inherited cost from the selected node, a turning cost, and a reverse cost if the newly generated node is behind the selected node;
(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 parking spot;
selecting a path from the node tree, wherein the path connects the location of the motor vehicle to the parking spot, and wherein the path includes an approach phase and a parking phase, and wherein the turning costs and the reverse costs in the approach phase are greater than the turning costs and the reverse costs in the parking phase;
autonomously driving the motor vehicle along the path in the approach phase; and
performing a parking maneuver into the parking spot in the parking phase, wherein the parking maneuver includes one of a tail-in parking maneuver, a head-in parking maneuver, and a parallel parking maneuver.