Abstract: Among other things, techniques are described for determining precedence order at a multiway stop. In embodiments, identifications are assigned to tracks, and young tracks are compared to stale tracks. A young track matches a stale track based on one or more factors. An identification of the young track is reassigned to an identification of the stale track, wherein the young track is determined to match the stale track based on the one or more factors. An earliest time of appearance of agents is determined based on identifications and in view of perception obscured areas. A precedence order for navigating through the intersection is determined based on local rules, the identifications, and the earliest time of appearance of agents, and the vehicle proceeds through the multiway stop intersection in accordance with the precedence order.

Abstract: Provided are methods for gridlock prevention, which can include obtaining sensor data, obtaining an intersection parameter, and determining a constraint. Some methods described also include generating trajectories and providing data associated with a selected trajectory, such as for operation of an autonomous vehicle along the trajectory. Systems and computer program products are also provided.

Abstract: Among other things, techniques are described for determining precedence order at a multiway stop. In embodiments, identifications are assigned to tracks, and young tracks are compared to stale tracks. A young track matches a stale track based on one or more factors. An identification of the young track is reassigned to an identification of the stale track, wherein the young track is determined to match the stale track based on the one or more factors. An earliest time of appearance of agents is determined based on identifications and in view of perception obscured areas. A precedence order for navigating through the intersection is determined based on local rules, the identifications, and the earliest time of appearance of agents, and the vehicle proceeds through the multiway stop intersection in accordance with the precedence order.

Abstract: Among other things, techniques are described for collision free path generation by connecting C-slices through cell decomposition. An environment is sampled at discrete headings of a vehicle to generate a configuration space (C-space) with one or more C-slices. A first C-slice is decomposed into one or more cells that represent free space. A C-slice adjacency list is generated for the first C-slice. A super adjacency list is derived that connects vertices of interest across the one or more C-slices to form a super adjacency graph. In embodiments, Dubins path is used for connecting the vertices of interest both within and across C-slices to ensure the kinematic feasibility of all the searched paths. An optimal path is navigated, wherein the optimal path is a shortest path from a starting pose to a goal pose on the super adjacency graph.

Abstract: The subject matter described in this specification is directed to a system and techniques for operating an autonomous vehicle (AV) at a multi-way stop intersection. After detecting the AV is at a primary stopline of the multi-way stop intersection, a planned travel path though the multi-way stop intersection is obtained. If the planned travel path of the AV through the multi-way stop intersection satisfies a set of one or more clearance criteria, the AV proceeds past the primary stopline. The clearance criteria include a criterion that is satisfied in response to detecting the AV is clear to safely merge into a travel lane corresponding to the planned travel path.