Benchmarking Learning-Based Formula 1 Race Strategies

Introduction to the show: ident: Robotics Radio. Generated commentary on the latest robotics and control papers.

Rosa: We're looking at the paper: "Benchmarking Learning-Based Formula 1 Race Strategies".

Dev: Here's the gist of the paper. This paper presents two complementary frameworks to optimize Formula 1 race strategies by jointly accounting for energy allocation, tire wear and pit stop timing.

Rosa: The learned policy’s suboptimality is assessed with respect to the optimal solution, both in a nominal scenario and with an unforeseen disturbance.

Dev: Modeling the Race Scenario The race scenario is modeled using lap time maps and a dynamic tire wear model capturing the main trade-offs arising during a race.

Rosa: The system states include the battery energy Eb, the available fuel energy Ef, the car’s mass mcar and the race time Trace.

Paper summary: Rosa: To recap, the paper "Benchmarking Learning-Based Formula one Race Strategies" presents this dual approach where they use a mixed-integer nonlinear program to find an optimal solution for race strategies, and then they train a reinforcement learning agent to solve the same problem in an environment <ref:2512.21570#pg1,Learning-Based Formula 1 Race Strategies>.

Dev: They show that this method is useful because the computational burden of finding the optimal strategy can be shifted entirely into the training phase, allowing for very fast inference when you actually need a decision during a race.

Taro: It’s about getting a solution that is robust and reliable when things get messy, which they prove by testing it against an unforeseen event where tire wear suddenly increases at lap twenty-two.

Rosa: The abstract says the learned policy shows suboptimality of approximately five seconds on one point five hours of race time in both the normal case and with that disturbance, mainly because of how they allocate their battery energy <ref:2512.21570#pg1>.

Dev: That's a concrete number showing that even though it’s not perfect, this RL approach is performing very well compared to the optimal solution found by the MINLP solver, which takes sixty-eight seconds to run.

Taro: The way they model tire wear is pretty specific, using a function fj(TW, mcar) with terms involving current tire wear and the car's mass ratio to update that wear state lap by lap.

Rosa: And they handle the lap time calculation by combining nominal maps with a correction term based on that tire wear model, where they use functions N1, N2, and N3 for each compound.

Dev: The reward function for the reinforcement learning agent is set up to minimize total race time by defining a per-step reward as Tlap constant minus the lap time at that step.

Taro: It seems like they’re trying to bridge the gap between complex, slow optimization methods and systems that can actually react in real-time when you are on track or in the pit lane.

Rosa: And what this means for us is that for anyone who only listens to the show, it shows how learning-based approaches can be practical when you need a fast decision maker instead of waiting for a heavy solver.

Conclusion: Dev: So looking at "Benchmarking Learning-Based Formula one Race Strategies," the authors are basically saying that combining a direct optimization method like the MINLP with an RL agent trained on the same problem is a solid way to check how good the learning approach is <ref:2512.21570#pg1,Learning-Based Formula 1 Race Strategies>.

Rosa: They show that while they find an optimal solution, it can still be slow, taking about sixty-eight seconds to solve for the entire race strategy.

Taro: But by training an agent on this exact scenario, they get a policy that's robust enough to handle unexpected events and pit stop timing changes reasonably well.

Dev: The implication here is that we can use this RL approach because its inference time is very small, which is what makes it suitable for real races where you need rapid decision-making.

Rosa: They suggest a path forward by integrating the two approaches, using the RL agent's discrete decisions to parametrize a continuous nonlinear program within a model predictive control framework.

Taro: That would get rid of those integer variables in the online optimization, which is what makes it feasible for real-time deployment during a race event.

Dev: So in simple terms, this paper provides a benchmark showing that learning approaches are reliable and fast enough to support human decision-making by providing near-optimal strategies without needing massive computational power on the fly.