Skip to content
#edge computing Open access

i4mGr0ot/F1-Aero-ERS-Joint-Optimization: Joint Aero-ERS Optimization for 2026 F1

Sep 2026 · Zenodo (CERN European Organization for Nuclear Research)

Abstract

The 2026 Formula One regulations introduce two coupled changes that matter for lap time: movable wings that let the car choose a low drag mode on the straights and a high downforce mode in the corners, and a larger 350~kW electric motor whose deployable power is reduced by a speed dependent rampdown. The two are coupled because choosing low drag raises speed and pushes the car into the band where its own electric deploy is taken away. This paper develops a reusable minimum lap time optimal control tool that schedules the aerodynamic mode and the electric deploy and harvest together, and anchors the result to real 2026 data. Three vehicle models of increasing fidelity are used: a point mass, a dynamic model that resolves load transfer onto four individual tyres, and a transient single track model that carries the yaw rate and the body sideslip as states so that corner entry rotation is computed rather than assumed. The racing line is not prescribed; it is derived as a free state across the true width of each track, bounded by the real track limits rather than the painted edge. The problem is solved by direct collocation in curvilinear coordinates using CasADi and IPOPT, with the numerical error held below 0.1 percent. Rather than tuning grip so the lap matches the pole, the car is calibrated to its demonstrated capability: drag from the real top speed, grip from the real corner speed, power fixed at the regulation values. The calibrated model matches real 2026 qualifying poles to within 0.17 percent. The optimal lap sits within a few percent of the pole but several seconds under median race pace, the value of the electric system is strongly circuit dependent because of the rampdown, and the quasi steady assumption is found to be optimistic by two to nine percent.

View source

Similar papers

#computer vision Review Sep 2017

Agile Software Development Methods: Review and Analysis

This publication proposes a definition and a classification of agile software development approaches and analyses ten software development methods that can be characterized as being "agile" against the defined criterion.

P. Abrahamsson, O. Salo, Jussi Ronkainen et al. · 727 citations · ⚡54
#computer vision Jun 2008

The impact of agile practices on communication in software development

The study shows that agile practices improve both informal and formal communication, but indicates that, in larger development situations involving multiple external stakeholders, a mismatch of adequate communication mechanisms can sometimes even hinder the communication.

M. Pikkarainen, Jukka Haikara, O. Salo et al. · 401 citations · ⚡48
#machine learning Review Open access Oct 2014

Software development in startup companies: A systematic mapping study

The results indicate that software engineering work practices are chosen opportunistically, adapted and configured to provide value under the constrains imposed by the startup context.

Nicolò Paternoster, Carmine Giardino, M. Unterkalmsteiner et al. · 394 citations · ⚡54

Related blog posts

Microsoft Research Blog Oct 29, 2026

Microsoft Research Focus – Edition #97

Host Sowbhagya Suresh shares some of the latest news and cutting-edge research from across Microsoft—from understanding the challenges facing coding agents to uncovering how people use AI at work and improving extended-range weather forecasting. The post Microsoft Research Focus – Edition #97 appeared first on Microsoft Research.

MIT News · Artificial Intelligence Oct 28, 2026

Making machines that can listen

Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.

Microsoft Research Blog Oct 21, 2026

Solving a 31-year-old grand challenge in mathematics – the KLS conjecture

For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan–Lovász–Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of high-dimensional […] The post Solving a 31-year-old grand challenge in mathematics – the KLS conjecture appear…

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.