Online Reachability Analysis and Space Convexification for Autonomous Racing
arXiv:2311.09781 · doi:10.4204/EPTCS.395.7
Abstract
This paper presents an optimisation-based approach for an obstacle avoidance problem within an autonomous vehicle racing context. Our control regime leverages online reachability analysis and sensor data to compute the maximal safe traversable region that an agent can traverse within the environment. The idea is to first compute a non-convex safe region, which then can be convexified via a novel coupled separating hyperplane algorithm. This derived safe area is then used to formulate a nonlinear model-predictive control problem that seeks to find an optimal and safe driving trajectory. We evaluate the proposed approach through a series of diverse experiments and assess the runtime requirements of our proposed approach through an analysis of the effects of a set of varying optimisation objectives for generating these coupled hyperplanes.
arXiv commentIn Proceedings FMAS 2023, arXiv:2311.08987
References in corpus (6)
- Optimization-Based Autonomous Racing of 1:43 Scale RC Cars
- F1/10: An Open-Source Autonomous Cyber-Physical Platform
- Algorithms for Verifying Deep Neural Networks
- Game-Theoretic Model Predictive Control with Data-Driven Identification of Vehicle Model for Head-to-Head Autonomous Racing
- The Convex Feasible Set Algorithm for Real Time Optimization in Motion Planning
- An NMPC Approach using Convex Inner Approximations for Online Motion Planning with Guaranteed Collision Avoidance