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
- Anton Ryzhov (ORCID: https://orcid.org/0000-0003-4099-0742)
- Yurii Kravchenko (ORCID: https://orcid.org/0000-0002-0281-4396)
- Андрій Собчук (ORCID: https://orcid.org/0000-0003-3250-3799)
- Roman Pykhnivskyi (ORCID: https://orcid.org/0009-0000-2514-8210)
Institutions
- Taras Shevchenko National University of Kyiv (UA)
- State University of Information and Communication Technologies (UA)
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