Urban traffic scenarios often require a high degree of cooperation between traffic participants to ensure safety and efficiency. Observing the behavior of others, humans infer whether or not others are cooperating. This work aims to extend the capabilities of automated vehicles, enabling them to cooperate implicitly in heterogeneous environments. Continuous actions allow for arbitrary trajectories and hence are applicable to a much wider class of problems than existing cooperative approaches with discrete action spaces. Based on cooperative modeling of other agents, Monte Carlo Tree Search (MCTS) in conjunction with Decoupled-UCT evaluates the action-values of each agent in a cooperative and decentralized way, respecting the interdependence of actions among traffic participants. The extension to continuous action spaces is addressed by incorporating novel MCTS-specific enhancements for efficient search space exploration. The proposed algorithm is evaluated under different scenarios, showing that the algorithm is able to achieve effective cooperative planning and generate solutions egocentric planning fails to identify.
Furthermore, off-line calculated maneuver templates can be used to devise cooperative plans. First, the maneuver template needs to match a given traffic scene with specific initial constraints, then the maneuver described in the template is checked for feasibility. If multiple templates are feasible given a specific traffic scene the maneuver template with the lowest cost specifies the cooperative maneuver @cite_18 .
@cite_18
2740978061 2741737371 2793154907 2146363089
We introduce a novel concept based on maneuver templates, which are formalized collaborative maneuvers, to select cooperative driving strategies. The approach is based on the exclusion principle, where we derive provable conditions to discard unsafe cooperative maneuvers for a given traffic situation. We thereby consider the full action set of all cooperative vehicles and do not discretize the action space. We demonstrate the applicability of our approach with numerical examples. In order to determine a cooperative driving strategy, it is beneficial for an autonomous vehicle to incorporate the intended motion of surrounding vehicles within its own motion planning. However, as intentions cannot be measured directly and the motion of multiple vehicles often are highly interdependent, this incorporation has proven challenging. In this paper, the problem of maneuver estimation is addressed, focusing on situations with close interaction between traffic participants. Therefore, we define collective maneuvers based on trajectory homotopy, describing the relative motion of multiple vehicles in a scene. Representing maneuvers by sample trajectories, maneuver-dependent prediction models of the vehicle states can be defined. This allows for a Bayesian estimation of maneuver probabilities given observations of the real motion. The approach is evaluated by simulation in overtaking scenarios with oncoming traffic and merging scenarios at an intersection. Cooperative driving behavior is essential for driving in traffic, especially for ramp merging, lane changing or navigating intersections. Autonomous vehicles should also manage these situations by behaving cooperatively and naturally. The challenge of cooperative driving is estimating other vehicles' intentions. In this paper, we present a novel method to estimate other human-driven vehicles' intentions with the aim of achieving a natural and amenable cooperative driving behavior, without using wireless communication. The new approach allows the autonomous vehicle to cooperate with multiple observable merging vehicles on the ramp with a leading vehicle ahead of the autonomous vehicle in the same lane. To avoid calculating trajectories, simplify computation, and take advantage of mature Level-3 components, the new method reacts to merging cars by determining a following target for an off-the-shelf distance keeping module (ACC) which governs speed control of the autonomous vehicle. We train and evaluate the proposed model using real traffic data. Results show that the new approach has a lower collision rate than previous methods and generates more human driver-like behaviors in terms of trajectory similarity and time-to-collision to leading vehicles. Cooperative driving technology with intervehicle communication has attracted increasing attention recently. It aims to improve driving safety and efficiency using appropriate motion scheduling of all the encountered vehicles. Under cooperative driving control, the motion of individual vehicles could be conducted in a safe, deterministic, and smooth manner. This is particularly useful to heavy-duty vehicles since their acceleration deceleration capacity is relatively low. Specifically in this paper, cooperative driving at blind crossings (crossings without traffic lights) is studied. A concept of safety driving patterns is proposed to represent the collision-free movements of vehicles at crossings. The solution space of all allowable movement schedules is then described by a spanning tree in terms of safety driving patterns; four trajectory planning algorithms are formulated to determine the driving plans with least execution times using schedule trees. The group communication strategy for intervehicle networks is also analyzed. Finally, simulation studies have been conducted, and results demonstrate the potentiality and usefulness of the proposed algorithms for cooperative driving at blind crossings