Towards Learning-Based Formula 1 Race Strategies

TL;DR

This paper introduces two frameworks for optimizing Formula 1 race strategies, combining a mixed-integer nonlinear program and reinforcement learning to improve decision-making regarding energy, tires, and pit stops.

Contribution

It presents a novel integrated approach using optimization and reinforcement learning to enhance race strategy planning and real-time decision support.

Findings

Reinforcement learning agent achieves about 5 seconds suboptimality over 1.5 hours.

The mixed-integer nonlinear program effectively models trade-offs in race scenarios.

The approach provides a benchmark for future learning-based race strategies.

Abstract

This paper presents two complementary frameworks to optimize Formula 1 race strategies, jointly accounting for energy allocation, tire wear and pit stop timing. First, the race scenario is modeled using lap time maps and a dynamic tire wear model capturing the main trade-offs arising during a race. Then, we solve the problem by means of a mixed-integer nonlinear program that handles the integer nature of the pit stop decisions. The same race scenario is embedded into a reinforcement learning environment, on which an agent is trained. Providing fast inference at runtime, this method is suited to improve human decision-making during real races. The learned policy's suboptimality is assessed with respect to the optimal solution, both in a nominal scenario and with an unforeseen disturbance. In both cases, the agent achieves approximately 5s of suboptimality on 1.5h of race time, mainly attributable to the different energy allocation strategy. This work lays the foundations for learning-based race strategies and provides a benchmark for future developments.