SearcharxivSearch

arXiv · 2609.26506

New perspectives for the fitness fatigue model: how to revisit questions about the science of sports training from the perspective of systems control theory

Abstract

The Fitness-Fatigue model (FFM) was initially designed to gain a better physiological understanding of the impact of training loads on sports performance. For almost 50 years, simulations have been compared with the observed response of sports performance to training loads. Understanding the relationship between training load and performance should have answered some fundamental questions for the physical trainer or sports coach: 1/ how to define the best training to achieve a performance without exhausting an athlete or how to achieve a performance in a limited time; 2/ how to assess the athlete's fatigue and fitness reliably to better understand his performance; 3/ how to prevent the risk of injury. But this was not the case. Studies dedicated to the FFM have been limited to improving somewhat on Banister's initial model without really taking the necessary step back to take advantage of the mathematical framework offered by the state representation, the implicit formalism underlying the FFM. The idea behind this research strategy is that having a valid and accurate model makes it easy to address previous questions through simulation: multiple training scenarios can be simulated until the ideal scenario for a given training question is identified. The main drawback to this approach is the combinatorial nature of the exercise. This paper is not discussing the relevance of the model, but how to use it. The state representation makes it possible to study the controllability, observability and diagnosability of a system (i.e, the athlete) and thus to formally answer the three previous practical questions. It can be considered that sports science studies have missed the richness of the FFM model. Artificial learning approaches are increasingly preferred to the FFM model because they are supposed to better capture observation. However, in the light of the state representation, the FFM model could still be extended naturally while remaining mathematically interpretable, offering mathematical tools to estimate the state of the athlete, and to define the most adequate training and prevent the risk of injury. This article does not aim to solve the question of optimal training in practice, for that it would need to be validated by specialists in physiology and sports science, it just proposes to take a fresh look at training issues and to demystify the mathematical formalism adopted by Banister.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jacky Montmain, Pierre Couturier, Gérard Dray. 2026-09-22. New perspectives for the fitness fatigue model: how to revisit questions about the science of sports training from the perspective of systems control theory. https://arxiv.org/abs/2609.26506

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Failure-Aware Iterative Learning of State-Control Invariant Sets

In this paper, we address the problem of computing maximal state-control invariant sets for deterministic linear systems using failing trajectories. We introduce the concept of state-control invariance, which extends control invariance from the state space to the joint state-control space. The maximal state-control invariant (MSCI) set simultaneously encodes the maximal control invariant set (MCI) and, for each state in the MCI, the set of control inputs that preserve invariance. We prove that the state projection of the MSCI is the MCI and the state-dependent sections of the MSCI are the admissible invariance-preserving inputs. Building on this framework, we develop a Failure-Aware Iterative Learning (FAIL) algorithm for deterministic linear time-invariant systems with polytopic constraints. The algorithm iteratively updates a constraint set in the state-control space by learning predecessor halfspaces from one-step failing state-input pairs, without knowing the dynamics. For each failure, FAIL learns the violated halfspaces of the predecessor of the constraint set by a regression on failing trajectories. We prove that the learned constraint set converges monotonically to the MSCI. Numerical experiments on a double integrator system validate the proposed approach.

eess.SY

Consensus and Synchronization of Multi-agent Systems over Finite Fields - Graph Topologies

This paper presents cooperative protocols for multi-agent systems with agents having a finite state-space. Both scalar single-integrator consensus and general LTI system synchronization are considered. Systems having a finite state-space describe agents with minimal memory capacity processing only a finite alphabet. Such systems are remarkably resilient to communication noise. The crucial problem, however, is to construct the admissible communication topology, which is NP-hard. We address this by efficiently exploring the subsets of admissible graph matrices and propose two new algorithms to generate them. Simulations validate the proposed approach.

eess.SY

Extracting Exact Lie Derivatives Without Backpropagation: A Dual Compiler for Neural Control Barrier Functions

A safety filter based on a neural control barrier function (CBF) deployed in an embedded control loop evaluates, at each control cycle, the trained network and its Lie derivatives along the system vector fields, under the memory and worst-case execution time (WCET) constraints that safety-oriented coding standards impose. Reverse-mode automatic differentiation, by which training frameworks obtain these derivatives, retains an activation cache whose size grows with the sum of the layer widths, and general-purpose differentiation runtimes allocate the computational graph from the heap at each call. This paper presents a compiler that evaluates a neural CBF and its exact Lie derivatives by forward-mode dual-number arithmetic. The compiler emits self-contained C++ code in which a single forward pass, without backpropagation, returns the barrier value and its exact Lie derivative along a given vector field; the drift and input Lie derivatives of the safety constraint are obtained from one such pass per vector field, and a second-order extension based on hyper-dual numbers returns the exact second-order Lie derivatives required by CBFs of relative degree two. The dual forward pass requires a workspace bounded by four times the widest layer, independent of network depth, and the emitted code contains no allocation call sites, so the absence of dynamic allocation is verifiable by inspection of the code. On an ESP32-S3 microcontroller, the compiled filter assembles the complete safety constraint in under one millisecond from statically allocated buffers of at most 768 bytes, and the maximum execution time over 1000 evaluations lies within 5% of the median in all three examples, whereas a heap-allocating reverse-mode baseline shows maxima 33% and 70% above its median in the two first-order examples. The compiler and the embedded experiments are released as open-source software.

eess.SY