Evolutionary Search for Polynomial Lyapunov Functions: A Genetic Programming Method for Exponential Stability Certification

This paper presents a method for constructing polynomial Lyapunov functions to analyze the stability of nonlinear dynamical systems. The approach is based on genetic programming, a variant of genetic algorithms where the search space consists of hierarchical tree structures. In our formulation, these polynomial functions are represented as binary trees. The Lyapunov conditions for exponential stability are interpreted as a minimax optimization problem, using a carefully designed fitness metric to ensure positivity and dissipation within a chosen domain. The genetic algorithm then evolves candidate polynomial trees, minimizing constraint violations and continuously refining stability guarantees. Numerical examples illustrate that this methodology can effectively identify and optimize Lyapunov functions for a wide range of systems, indicating a promising direction for automated stability proofs in engineering applications.

Authors

Institutions

Publication Details

Journal
Axioms
Published
2025-04-30
DOI
https://doi.org/10.3390/axioms14050343
Primary Topic
Evolutionary Algorithms and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Evolutionary Search for Polynomial Lyapunov Functions: A Genetic Programming Method for Exponential Stability Certification

Anton Ryzhov, Yurii Kravchenko, Андрій Собчук, Roman Pykhnivskyi
Axioms
Evolutionary Algorithms and Applications
article

Evolutionary Search for Polynomial Lyapunov Functions: A Genetic Programming Method for Exponential Stability Certification

Anton Ryzhov, Yurii Kravchenko, Андрій Собчук, Roman Pykhnivskyi
article en

Abstract

This paper presents a method for constructing polynomial Lyapunov functions to analyze the stability of nonlinear dynamical systems. The approach is based on genetic programming, a variant of genetic algorithms where the search space consists of hierarchical tree structures. In our formulation, these polynomial functions are represented as binary trees. The Lyapunov conditions for exponential stability are interpreted as a minimax optimization problem, using a carefully designed fitness metric to ensure positivity and dissipation within a chosen domain. The genetic algorithm then evolves candidate polynomial trees, minimizing constraint violations and continuously refining stability guarantees. Numerical examples illustrate that this methodology can effectively identify and optimize Lyapunov functions for a wide range of systems, indicating a promising direction for automated stability proofs in engineering applications.

AxiomsVol. 14(5)
Taras Shevchenko National University of Kyiv (UA), State University of Information and Communication Technologies (UA)
Openalex Percentile: Top 96%
Evolutionary Algorithms and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.