TY  - JOUR
AU  - Zhao, Lanhao
AU  - Liu, Shuai
PY  - 2026
DA  - 2026/08/11
TI  - Machine Learning for Lyapunov Function Synthesis: A Comprehensive Review
JO  - Aerospace Engineering Communications
T2  - Aerospace Engineering Communications
JF  - Aerospace Engineering Communications
VL  - 1
IS  - 3
SP  - 100
EP  - 109
DO  - 10.62762/AEC.2026.822279
UR  - https://www.icck.org/article/abs/AEC.2026.822279
KW  - lyapunov function
KW  - computational relaxation method
KW  - data-driven paradigms
KW  - reinforcement learning
KW  - generative models
AB  - Lyapunov functions underpin the stability analysis and controller synthesis for aerospace vehicles, from spacecraft attitude control to autonomous flight systems and UAV swarm coordination. This review discusses the development of computational Lyapunov function synthesis methods. Within this scope, it traces the evolution from traditional Sum-of-Squares (SOS) programming to artificial intelligence symbolic discovery technologies, prompted by the increasing complexity of nonlinear systems. Specifically, the following stages can be identified: computational relaxation methods constrained by polynomial templates; data-driven paradigms leveraging neural network-based empirical approximations; and the fusion of machine learning fitting and formal verification through the Counter-Example Guided Inductive Synthesis (CEGIS) framework. Subsequently, researchers developed construction-based network architectures and hybrid scalable verification mechanisms to address bottlenecks in computational verification. Interestingly, the use of generative models and reinforcement learning to explore analytically expressible expressions with physical interpretability is emerging as an active research area in this field. To date, these tools have been extended to various dynamic scenarios, such as stochastic systems, decentralized multi-agent topologies (e.g., unmanned aerial vehicle swarms and satellite constellations), safe reinforcement learning for autonomous flight control, and partial differential equation (PDE) solving. This review evaluates the aforementioned methodological stages, with a focus on analyzing the trade-offs among model expressivity, computational scalability, and the rigor of formal guarantees across different technical routes.
SN  - 3071-1967
PB  - Institute of Central Computation and Knowledge
LA  - English
ER  - 

@article{Zhao2026Machine,
  author = {Lanhao Zhao and Shuai Liu},
  title = {Machine Learning for Lyapunov Function Synthesis: A Comprehensive Review},
  journal = {Aerospace Engineering Communications},
  year = {2026},
  volume = {1},
  number = {3},
  pages = {100-109},
  doi = {10.62762/AEC.2026.822279},
  url = {https://www.icck.org/article/abs/AEC.2026.822279},
  abstract = {Lyapunov functions underpin the stability analysis and controller synthesis for aerospace vehicles, from spacecraft attitude control to autonomous flight systems and UAV swarm coordination. This review discusses the development of computational Lyapunov function synthesis methods. Within this scope, it traces the evolution from traditional Sum-of-Squares (SOS) programming to artificial intelligence symbolic discovery technologies, prompted by the increasing complexity of nonlinear systems. Specifically, the following stages can be identified: computational relaxation methods constrained by polynomial templates; data-driven paradigms leveraging neural network-based empirical approximations; and the fusion of machine learning fitting and formal verification through the Counter-Example Guided Inductive Synthesis (CEGIS) framework. Subsequently, researchers developed construction-based network architectures and hybrid scalable verification mechanisms to address bottlenecks in computational verification. Interestingly, the use of generative models and reinforcement learning to explore analytically expressible expressions with physical interpretability is emerging as an active research area in this field. To date, these tools have been extended to various dynamic scenarios, such as stochastic systems, decentralized multi-agent topologies (e.g., unmanned aerial vehicle swarms and satellite constellations), safe reinforcement learning for autonomous flight control, and partial differential equation (PDE) solving. This review evaluates the aforementioned methodological stages, with a focus on analyzing the trade-offs among model expressivity, computational scalability, and the rigor of formal guarantees across different technical routes.},
  keywords = {lyapunov function, computational relaxation method, data-driven paradigms, reinforcement learning, generative models},
  issn = {3071-1967},
  publisher = {Institute of Central Computation and Knowledge}
}