Smart Algorithm Tunes Itself to Master Aircraft Fuel Pressure Control

Aircraft engineers have long dreamed of replacing heavy hydraulic and pneumatic plumbing with electric wiring, a vision known as the more-electric aircraft. The prize is substantial: commercial aviation generates more than two percent of global carbon dioxide emissions, and studies cited by a research team publishing in Results in Engineering suggest that electrifying aircraft systems can cut fuel consumption by roughly nine percent. One of the most demanding targets is the fuel injection system, where pumps must deliver fuel at a constant, precisely regulated pressure to the engine’s combustion chamber. Now, a group of Mexican researchers has tackled a deceptively small but stubborn obstacle in that quest: the tuning of a single mathematical matrix that determines whether a self-learning identification algorithm converges smoothly or spirals into instability. Their solution combines a heuristic search algorithm with a brand-new performance metric, and they have validated it on a physical testbed that mimics the fuel delivery dynamics of an aircraft.

The heart of the matter lies in a technique called recursive least squares, or RLS, a workhorse of online system identification. Engineers use RLS to build a mathematical model of a physical process in real time, feeding in measurements of inputs and outputs and continuously refining the model’s parameters so that its predictions match reality. In the aerospace case study, the process variable is pressure inside a hydraulic circuit driven by a gear pump, standing in for the high-pressure fuel pump that supplies an aircraft’s fuel metering unit and injectors. The RLS algorithm updates its parameter estimates using a gain vector computed from a covariance matrix, conventionally written as P, which tracks the uncertainty of the estimates. As fresh data arrive, P shrinks, signaling growing confidence in the identified model. The catch is that everything depends on how P is initialized at time zero.

Set the initial covariance matrix to zero and the algorithm is paralyzed: the update gain stays at zero forever and the parameters never move. Set it too large and convergence drags on for a long time, while any disturbance triggers abrupt, violent parameter updates that can prolong identification or break it entirely. Traditionally, engineers have chosen this initial value by trial and error, relying on deep intuition about the specific system at hand. The research team, led by Daniel Eduardo Palacios-Lopez and Mario Cesar Maya-Rodriguez, argues that this ad hoc practice is a genuine unsolved challenge in the field, and their experiments prove just how costly guesswork can be. In a sensitivity study of forty runs with randomly assigned initialization values, performance varied wildly, with the worst cases showing settling times above seventy-five seconds and error integrals hundreds of times larger than the best runs.

To replace guesswork with systematic search, the team first needed a way to score candidate initializations. Conventional metrics such as root mean square error, integral square error, integral absolute error, and their time-weighted variants each capture only part of the picture, typically the magnitude of the estimation error without regard to how that error behaves over time. For aircraft fuel systems, both properties matter: the error must be small, and it must die down smoothly, without oscillations that could destabilize a downstream controller. The researchers therefore proposed a new composite metric, the Integral of the Absolute Error and its Derivative, or IAED. It sums the absolute error plus a weighted term proportional to the absolute rate of change of the error, with a weighting factor set to 0.1 in this study. The derivative term acts as a buffer against erratic convergence, penalizing parameter trajectories that jitter or swing wildly even if their average error looks acceptable.

With the metric in hand, the team formulated an optimization problem: find the pair of numbers that define the initial covariance matrix so as to minimize the IAED, subject to a constraint that the identified parameters settle within a two percent error band before a maximum allowed time. They encoded the covariance matrix cleverly, writing it as a mantissa times ten raised to an exponent, much the way computers store large numbers in finite bits. This encoding lets the search algorithm jump across orders of magnitude, which matters because preliminary trials showed that solutions of similar quality could differ by three orders of magnitude in their parameter values. The problem is also multimodal, meaning infinitely many pairs map to the same matrix, but any pair that minimizes the cost function yields the desired initialization.

Because each candidate solution had to be evaluated on the real plant, taking roughly five minutes per test, population-based heuristics demanding hundreds or thousands of evaluations were impractical. The team instead adapted Random Mutation Hill Climbing, a single-solution iterative method that proposes small random perturbations to the current solution and keeps any perturbation that improves the score. If no direction helps, the step size is shrunk by a constant factor, allowing the search to zoom in on promising regions. Infeasible solutions violating the settling time constraint were handled with a penalty that assigns them a very large cost. Twenty-one heuristic runs, each limited to twenty update steps, were enough to beat the best of forty random trials, a striking demonstration of efficiency under severe experimental constraints.

The numbers tell a compelling story. The best random initialization achieved an IAED score of 19.49, a root mean square error of 0.356, and a settling time of 45.33 seconds. The heuristic search found an initialization with an IAED of 10.32, nearly halving the cost, while cutting the root mean square error to 0.192 and the settling time to 43.26 seconds, an improvement of 2.06 seconds. Every standard indicator improved: integral absolute error fell from 18.89 to 9.99, integral square error from 15.23 to 4.41, and integral time absolute error from 356.78 to 181.58. The winning parameters corresponded to a covariance matrix of five times ten raised to the 4.3 power. A four-dimensional heat map comparing error, error derivative, cost, and settling time visually confirmed the heuristic solution’s dominance over the entire random search space.

Beyond the experiments, the authors built a formal mathematical framework to explain when and why their approach works. Using Lyapunov stability analysis, they showed that under persistent excitation of the input signal, the parameter estimation error of RLS is exponentially asymptotically stable, and they proved that an optimal initialization tuple exists on the compact search space by appealing to the Extreme Value Theorem. Two corollaries distinguish ideal from real conditions: in a noise-free environment the estimation error converges to zero, while with measurement noise and unmodeled dynamics the algorithm achieves weak convergence, entering and remaining within a bounded neighborhood whose radius depends on the disturbance power. A further theorem guarantees that the heuristic search itself converges, provided the cost functional satisfies a Lipschitz condition that rules out abrupt discontinuities in the search landscape.

The practical stakes extend well beyond the laboratory bench. The testbed, a gear pump feeding a hydraulic circuit through a regulating valve held at 64.2 percent opening with the motor at 40 percent speed, is explicitly a scaled proof-of-concept rather than certified aerospace hardware, and the authors are candid about that limitation. Yet the underlying trend scales. In a real aircraft, faster and smoother identification convergence prevents prolonged transient states during which a model-based controller, such as model predictive control, might govern poorly or even destabilize the plant. Shorter transients mean less thermal and mechanical stress on actuators and better energy efficiency, directly supporting the more-electric aircraft agenda and Sustainable Development Goal 7 on clean energy. The team notes that future work will impose explicit finite-time convergence bounds and explore other heuristic and metaheuristic search strategies, potentially turning what was once a designer’s black art into a routine, automated step in deploying adaptive control on next-generation aircraft.

Subject of Research: Heuristic initialization of the covariance matrix in recursive least squares system identification for aerospace fuel pressure control

Article Title: Heuristic-based covariance initialization for RLS identification: A new IAED metric applied to aerospace pressure control systems

Article References: Palacios-Lopez, D. E., Maya-Rodriguez, M. C., Lopez-Muñoz, R., Lopez-Yañez, I., & Lozano-Hernandez, Y. (2026). Heuristic-based covariance initialization for RLS identification: A new IAED metric applied to aerospace pressure control systems. Results in Engineering, 32, Article 113378. https://doi.org/10.1016/j.rineng.2026.113378

Image Credits: AI Generated

DOI: 10.1016/j.rineng.2026.113378

Keywords: recursive least squares, system identification, more-electric aircraft, fuel injection, pressure control, covariance matrix initialization, heuristic optimization, hill climbing, IAED metric, model predictive control, aerospace engineering, energy efficiency