Explore the vast range of titles available.

Autonomous racing has increasingly become a research subject as it provides insights into dynamic, high-speed situations. One crucial aspect of handling these situations, especially in the presence of dynamic obstacles, is the generation of a collision-free trajectory that represents a safe behavior and is also competitive in the case of racing. We propose a local planning approach that generates such trajectories for a racing car on an oval race track by searching a spatiotemporal graph. A considerable challenge of search-based methods in a spatiotemporal domain is the curse of dimensionality. Therefore, we propose how a previously presented graph structure that is based on intervals instead of discrete values can be searched more efficiently without losing optimality by using a uniform-cost search strategy. We extend the search method to make it anytime-capable so that it can provide a suboptimal trajectory even if the search has to be terminated early. The graph-based planning approach allows us to apply a flexible cost function so that our approach can operate fully autonomously on an oval race track, including the pit lane. We present a cost function for oval racing and explain how the terms contribute to the desired behaviors. This is supported by results with a full-scale prototype.

In motion planning for autonomous racing, the challenge arises in planning smooth trajectories close to the handling limits of the vehicle with a sufficient planning horizon. Graph-based trajectory planning methods can find the global discrete-optimal solution, but they suffer from the curse of dimensionality. Therefore, to achieve low computation times despite a long planning horizon, coarse discretization and simple edges that are efficient to generate must be used. However, the resulting rough trajectories cannot reach the handling limits of the vehicle and are also difficult to track by the controller, which can lead to unstable driving behavior. In this paper, we show that the initial edges connecting the vehicle’s estimated state with the actual graph are crucial for vehicle stability and race performance. We therefore propose a sampling-based approach that relies on jerk-optimal curves to generate these initial edges. The concept is introduced using a layer-based graph, but it can be applied to other graph structures as well. We describe the integration of the curves within the graph and the required adaptation to racing scenarios. Our approach enables stable driving at the handling limits and fully autonomous operation on the race track. While simulations show the comparison of our concept with an alternative approach based on uniform acceleration, we also present experimental results of a dynamic overtake with speeds up to 74 m/s on a full-size vehicle.

Trajectory planning for autonomous race cars poses special challenges due to the highly interactive and competitive environment. Prior work has applied game theory as it provides equilibria for such non-cooperative dynamic problems. This contribution introduces a framework to assess the suitability of the Nash equilibrium for racing scenarios. To achieve this, we employ a variant of iLQR, called iLQGame, to find trajectories that satisfy the equilibrium conditions for a linear-quadratic approximation of the original game. In particular, we are interested in the difference between the behavioral outcomes of the open-loop and the feedback Nash equilibria and show how iLQGame can generate both types of equilibria. We provide an overview of open problems and upcoming research, including convergence properties of iLQGame in racing games, cost function parameterization, and moving horizon implementations.

Existing approaches to trajectory planning for autonomous racing employ sampling-based methods, generating numerous jerk-optimal trajectories and selecting the most favorable feasible trajectory based on a cost function penalizing deviations from an offline-calculated racing line. While successful on oval tracks, these methods face limitations on complex circuits due to the simplistic geometry of jerk-optimal edges failing to capture the complexity of the racing line. Additionally, they only consider two-dimensional tracks, potentially neglecting or surpassing the actual dynamic potential. In this paper, we present a sampling-based local trajectory planning approach for autonomous racing that can maintain the lap time of the racing line even on complex race tracks and consider the race track's three-dimensional effects. In simulative experiments, we demonstrate that our approach achieves lower lap times and improved utilization of dynamic limits compared to existing approaches. We also investigate the impact of online racing line generation, in which the time-optimal solution is planned from the current vehicle state for a limited spatial horizon, in contrast to a closed racing line calculated offline. We show that combining the sampling-based planner with the online racing line generation can significantly reduce lap times in multi-vehicle scenarios.

We propose an online planning approach for racing that generates the time-optimal trajectory for the upcoming track section. The resulting trajectory takes the current vehicle state, effects caused by 3D track geometries, and speed limits dictated by the race rules into account. In each planning step, an optimal control problem is solved, making a quasi-steady-state assumption with a point mass model constrained by gg-diagrams. For its online applicability, we propose an efficient representation of the gg-diagrams and identify negligible terms to reduce the computational effort. We demonstrate that the online planning approach can reproduce the lap times of an offline-generated racing line during single vehicle racing. Moreover, it finds a new time-optimal solution when a deviation from the original racing line is necessary, e.g., during an overtaking maneuver. Motivated by the application in a rule-based race, we also consider the scenario of a speed limit lower than the current vehicle velocity. We introduce an initializable slack variable to generate feasible trajectories despite the constraint violation while reducing the velocity to comply with the rules.

This paper presents a hierarchical planning algorithm for racing with multiple opponents. The two-stage approach consists of a high-level behavioral planning step and a low-level optimization step. By combining discrete and continuous planning methods, our algorithm encourages global time optimality without being limited by coarse discretization. In the behavioral planning step, the fastest behavior is determined with a low-resolution spatio-temporal visibility graph. Based on the selected behavior, we calculate maneuver envelopes that are subsequently applied as constraints in a time-optimal control problem. The performance of our method is comparable to a parallel approach that selects the fastest trajectory from multiple optimizations with different behavior classes. However, our algorithm can be executed on a single core. This significantly reduces computational requirements, especially when multiple opponents are involved. Therefore, the proposed method is an efficient and practical solution for real-time multi-vehicle racing scenarios.

Interaction-aware trajectory planning is crucial for closing the gap between autonomous racing cars and human racing drivers. Prior work has applied game theory as it provides equilibrium concepts for non-cooperative dynamic problems. With this contribution, we formulate racing as a dynamic game and employ a variant of iLQR, called iLQGames, to solve the game. iLQGames finds trajectories for all players that satisfy the equilibrium conditions for a linear-quadratic approximation of the game and has been previously applied in traffic scenarios. We analyze the algorithm's applicability for trajectory planning in racing scenarios and evaluate it based on interaction awareness, competitiveness, and safety. With the ability of iLQGames to solve for open-loop and feedback Nash equilibria, we compare the behavioral outcomes of the two equilibrium concepts in simple scenarios on a straight track section.

For decades, motorsport has been an incubator for innovations in the automotive sector and brought forth systems like disk brakes or rearview mirrors. Autonomous racing series such as Roborace, F1Tenth, or the Indy Autonomous Challenge (IAC) are envisioned as playing a similar role within the autonomous vehicle sector, serving as a proving ground for new technology at the limits of the autonomous systems capabilities. This paper outlines the software stack and approach of the TUM Autonomous Motorsport team for their participation in the Indy Autonomous Challenge, which holds two competitions: A single-vehicle competition on the Indianapolis Motor Speedway and a passing competition at the Las Vegas Motor Speedway. Nine university teams used an identical vehicle platform: A modified Indy Lights chassis equipped with sensors, a computing platform, and actuators. All the teams developed different algorithms for object detection, localization, planning, prediction, and control of the race cars. The team from TUM placed first in Indianapolis and secured second place in Las Vegas. During the final of the passing competition, the TUM team reached speeds and accelerations close to the limit of the vehicle, peaking at around 270 km/h and 28 ms2. This paper will present details of the vehicle hardware platform, the developed algorithms, and the workflow to test and enhance the software applied during the two-year project. We derive deep insights into the autonomous vehicle's behavior at high speed and high acceleration by providing a detailed competition analysis. Based on this, we deduce a list of lessons learned and provide insights on promising areas of future work based on the real-world evaluation of the displayed concepts.

Motorsport has always been an enabler for technological advancement, and the same applies to the autonomous driving industry. The team TUM Auton-omous Motorsports will participate in the Indy Autonomous Challenge in Octo-ber 2021 to benchmark its self-driving software-stack by racing one out of ten autonomous Dallara AV-21 racecars at the Indianapolis Motor Speedway. The first part of this paper explains the reasons for entering an autonomous vehicle race from an academic perspective: It allows focusing on several edge cases en-countered by autonomous vehicles, such as challenging evasion maneuvers and unstructured scenarios. At the same time, it is inherently safe due to the motor-sport related track safety precautions. It is therefore an ideal testing ground for the development of autonomous driving algorithms capable of mastering the most challenging and rare situations. In addition, we provide insight into our soft-ware development workflow and present our Hardware-in-the-Loop simulation setup. It is capable of running simulations of up to eight autonomous vehicles in real time. The second part of the paper gives a high-level overview of the soft-ware architecture and covers our development priorities in building a high-per-formance autonomous racing software: maximum sensor detection range, relia-ble handling of multi-vehicle situations, as well as reliable motion control under uncertainty.

Childhood traumatization (CT) is associated with the development of several neuropsychiatric disorders in later life. Experimental data in animals and observational data in humans revealed evidence for biological alterations in response to CT that may contribute to its long-term consequences. This includes epigenetic changes in miRNA levels that contribute to complex alterations of gene expression. We investigated the association between CT and 121 miRNAs in a target sample of N = 150 subjects from the general population and patients from the Department of Psychiatry. We hypothesized that CT exhibits a long-term effect on miRNA plasma levels. We supported our findings using bioinformatics tools and databases. Among the 121 miRNAs 22 were nominally significantly associated with CT and four of them (let-7g-5p, miR-103a-3p, miR-107, and miR-142-3p) also after correction for multiple testing; most of them were previously associated with Alzheimer’s disease (AD) or depression. Pathway analyses of target genes identified significant pathways involved in neurodevelopment, inflammation and intracellular transduction signaling. In an independent general population sample (N = 587) three of the four miRNAs were replicated. Extended analyses in the general population sample only (N = 687) showed associations of the four miRNAs with gender, memory, and brain volumes. We gained increasing evidence for a link between CT, depression and AD through miRNA alterations. We hypothesize that depression and AD not only share environmental factors like CT but also biological factors like altered miRNA levels. This miRNA pattern could serve as mediating factor on the biological path from CT to adult neuropsychiatric disorders.