Systems and Methods for Generating Basis Paths for Autonomous Vehicle Motion Control
Systems and methods for basis path generation are provided. In particular, a computing system can obtain a target nominal path. The computing system can determine a current pose for an autonomous vehicle. The computing system can determine, based at least in part on the current pose of the autonomous vehicle and the target nominal path, a lane change region. The computing system can determine one or more merge points on the target nominal path. The computing system can, for each respective merge point in the one or more merge points, generate a candidate basis path from the current pose of the autonomous vehicle to the respective merge point. The computing system can generate a suitability classification for each candidate basis path. The computing system can select one or more candidate basis paths based on the suitability classification for each respective candidate basis path in the plurality of candidate basis paths.
1 . A computer-implemented method, comprising:
determining a target lane for an autonomous vehicle that is different from a current lane in which the autonomous vehicle is operating;
determining, based on satisfaction of a lane change criterion, a merge point describing a location for the autonomous vehicle between two vehicles in the target lane,
the lane change criterion corresponding to a limit for at least one feature associated with the motion of the autonomous vehicle for entering the target lane;
determining a motion plan for entering the target lane based on the merge point; and
controlling the autonomous vehicle to navigate in accordance with the motion plan.
2 . The computer-implemented method of claim 1 , comprising:
identifying a lane change region in the target lane;
identifying one or more candidate merge points in the target lane based on the lane change region; and
selecting the merge point from the one or more candidate merge points.
3 . The computer-implemented method of claim 2 , comprising:
determining that a path associated with a candidate merge point does not pass through the lane change region; and
eliminating the candidate merge point from consideration for selection as the merge point.
4 . The computer-implemented method of claim 1 , wherein the at least one feature corresponds to: a respective acceleration, a respective speed, or a respective turning rate.
5 . The computer-implemented method of claim 4 , wherein the respective acceleration corresponds to a maximum acceleration, wherein the respective acceleration corresponds to a minimum acceleration, wherein the respective speed corresponds to a maximum speed, wherein the respective speed corresponds to a minimum speed, wherein the respective turning rate corresponds to a maximum turning rate, wherein the respective speed corresponds to a minimum speed.
6 . The computer-implemented method of claim 5 , wherein the satisfaction of the lane change criterion corresponds to at least one of: the respective acceleration satisfying an acceleration threshold, the respective speed satisfying a speed threshold, the respective turning rate satisfying a turning rate threshold,
wherein the acceleration threshold comprises at least one of a maximum or minimum acceleration, wherein the speed threshold comprises at least one of a maximum or minimum speed, wherein the turning rate threshold comprises at least one of a maximum or minimum turning rate.
7 . The computer-implemented method of claim 6 , wherein at least one of the minimum acceleration, the minimum speed, or the minimum turning rate is based on a traffic law or a motion of traffic in the target lane.
8 . The computer-implemented method of claim 1 , wherein the target lane is adjacent to the current lane.
9 . The computer-implemented method of claim 1 , wherein the lane change criterion is indicative of a cost to enter the target lane based on the merge point.
10 . The computer-implemented method of claim 1 , comprising:
determining that entering the target lane at the merge point does not violate one or more constraints, wherein the more or more constraints corresponds to at least one of: a stopping location, a velocity target, or a buffer distance.
11 . The computer-implemented method of claim 1 , comprising:
converting the motion plan into one or more vehicle controls for implementation by the autonomous vehicle.
12 . The computer-implemented method of claim 1 , wherein the motion plan is indicative of a path for the autonomous vehicle.
13 . A system, comprising:
one or more processors; and
one or more non-transitory, computer-readable media storing instructions that are executable by one or more processors to cause the system to perform operations comprising:
determining a target lane for an autonomous vehicle that is different from a current lane in which the autonomous vehicle is operating;
determining, based on the satisfaction of a lane change criterion, a merge point describing a location for the autonomous vehicle between two vehicles in the target lane,
the lane change criterion corresponding to a limit for at least one feature associated with the motion of the autonomous vehicle for entering the target lane;
determining a path for entering the target lane based on the merge point; and
providing one or more signals to instruct the autonomous vehicle to travel based on the path.
14 . The system of claim 13 , wherein the operations comprise:
identifying a lane change region in the target lane;
identifying one or more candidate merge points in the target lane based on the lane change region; and
selecting the merge point from the one or more candidate merge points.
15 . The system of claim 14 , wherein the operations comprise:
determining one or more candidate paths,
a respective candidate path, of the one or more candidate paths, indicating a trajectory for the autonomous vehicle associated with a respective candidate merge point; and
selecting the merge point from the one or more candidate merge points based on the one or more candidate paths.
16 . The system of claim 13 , wherein the at least one feature corresponds to: a respective acceleration, a respective speed, or a respective turning rate.
17 . The system of claim 16 , wherein the satisfaction of the lane change criterion corresponds to at least one of: the respective acceleration satisfying an acceleration threshold, the respective speed satisfying a speed threshold, or the respective turning rate satisfying a turning rate threshold.
18 . The system of claim 13 , wherein the autonomous vehicle comprises a truck.
19 . The system of claim 13 , wherein the operations comprise:
determining that entering the target lane based on the merge point does not violate one or more constraints, wherein the more or more constraints corresponds to at least one of: a stopping location, a velocity target, or a buffer distance.
20 . One or more non-transitory, computer-readable media storing instructions that are executable by one or more processors to perform operations comprising:
determining a target lane for an autonomous vehicle that is different from a current lane in which the autonomous vehicle is operating;
determining, based on the satisfaction of a lane change criterion, a merge point describing a location for the autonomous vehicle between two vehicles in the target lane,
the lane change criterion corresponding to a limit for at least one feature associated with the motion of the autonomous vehicle for entering the target lane;
determining a path for entering the target lane based on the merge point; and
controlling the motion of the autonomous vehicle based on the path.