arXiv 1111.04952011-11math.OCmath.DS

Optimizing the stable behavior of parameter-dependent dynamical systems - maximal domains of attraction, minimal absorption times

Péter Koltai, Alexander Volf

英文摘要：

We propose a method for approximating solutions to optimization problems involving the global stability properties of parameter-dependent continuous-time autonomous dynamical systems. The method relies on an approximation of the infinite-state deterministic system by a finite-state non-deterministic one - a Markov jump process. The key properties of the method are that it does not use any trajectory simulation, and that the parameters and objective function are in a simple (and except for a system of linear equations) explicit relationship.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Converse Lyapunov Functions and Converging Inner Approximations to Maximal Regions of Attraction of Nonlinear Systems

This paper considers the problem of approximating the "maximal" region of attraction (the set that contains all asymptotically stable sets) of any given set of locally exponentially stable nonlinear Ordinary Differential Equations (ODEs) with a sufficiently smooth vector field. Given a locally exponential stable ODE with a differentiable vector field, we show that there exists a globally Lipschitz continuous converse Lyapunov function whose 1-sublevel set is equal to the maximal region of attraction of the ODE. We then propose a sequence of d-degree Sum-of-Squares (SOS) programming problems th…

2022-09-03math.DSmath.OC

Computing the domain of attraction of switching systems subject to non-convex constraints

We characterize and compute the maximal admissible positively invariant set for asymptotically stable constrained switching linear systems. Motivated by practical problems found, e.g., in obstacle avoidance, power electronics and nonlinear switching systems, in our setting the constraint set is formed by a finite number of polynomial inequalities. First, we observe that the so-called Veronese lifting allows to represent the constraint set as a polyhedral set. Next, by exploiting the fact that the lifted system dynamics remains linear, we establish a method based on reachability computations to…

2015-10-26math.DSmath.OC

具有有序部分吸引力的合作最大覆盖选址问题

The Cooperative Maximal Covering Location Problem with ordered partial attractions

本文提出有序合作最大覆盖选址问题 OCMCLP，以有序中值函数统一刻画部分吸引力聚合，并给出 MILP 与广义 Benders 割两种精确解法及随机实验和充电站案例验证。

2024-09-09math.OC

最大工作负载、最小工作负载、最大工作负载差异：同时优化所有准则

Maximal workload, minimal workload, maximal workload difference: optimizing all criteria at once

本文研究工人任务分配模型，指出最小化最大负载差异的解同时优化最大与最小负载，并证明在无多面体结构的相近模型中该现象依然成立。

2023-06-30cs.DMmath.OC

具有特征吸引域的局部稳定神经常微分方程

Locally Stable Neural ODEs with Characterized Region of Attraction

KTH Royal Institute of Technology（皇家理工学院）；LAAS-CNRS, Université de Toulouse, CNRS（图卢兹大学国家科学研究中心）

提出一类神经常微分方程，通过联合学习最大Lyapunov函数约束模型动力学，实现局部指数稳定动力学及其吸引域的通用逼近。

2026-06-18math.OC

基于锚定神经网络的最大李雅普诺夫函数通用逼近

Universal Approximation of Maximal Lyapunov Functions with Anchored Neural Networks

University of Waterloo（滑铁卢大学）

该研究针对局部由渐近稳定齐次向量场主导的系统，构造锚定保正神经网络族，证明其可半全局通用逼近最大李雅普诺夫函数，还给出候选函数认证条件并通过数值示例验证架构有效性。

2026-08-19cs.SYeess.SYmath.OC

更多相关论文收起更多论文

向学习和验证最大神经Lyapunov函数

Towards Learning and Verifying Maximal Neural Lyapunov Functions

University of Waterloo（滑铁卢大学）

本文提出基于物理信息神经网络的方法，用于学习接近最大化的Lyapunov函数，并通过SMT求解器验证局部和全局稳定性。

2023-04-14cs.SYeess.SYmath.OC

Convex computation of the region of attraction of polynomial control systems

We address the long-standing problem of computing the region of attraction (ROA) of a target set (e.g., a neighborhood of an equilibrium point) of a controlled nonlinear system with polynomial dynamics and semialgebraic state and input constraints. We show that the ROA can be computed by solving an infinite-dimensional convex linear programming (LP) problem over the space of measures. In turn, this problem can be solved approximately via a classical converging hierarchy of convex finite-dimensional linear matrix inequalities (LMIs). Our approach is genuinely primal in the sense that convexity …

2013-11-28math.OC

最大Lyapunov函数的（无）监督学习

(Un)supervised Learning of Maximal Lyapunov Functions

Digital Futures（数字未来）；Division of Decision and Control Systems, KTH Royal Institute of Technology（决策与控制系统部门，皇家理工学院）

本文提出一种新型神经网络架构，用于学习最大Lyapunov函数以确定动力系统吸引域，并通过无监督优化和原始-对偶算法实现高效训练，在准确性上达到或超越现有方法。

2025-05-26cs.LGcs.SYeess.SY

Linear-Quadratic Optimal Control in Maximal Coordinates

The linear-quadratic regulator (LQR) is an efficient control method for linear and linearized systems. Typically, LQR is implemented in minimal coordinates (also called generalized or "joint" coordinates). However, other coordinates are possible and recent research suggests that there may be numerical and control-theoretic advantages when using higher-dimensional non-minimal state parameterizations for dynamical systems. One such parameterization is maximal coordinates, in which each link in a multi-body system is parameterized by its full six degrees of freedom and joints between links are mo…

2021-03-25math.OC

多项式动力系统最大正不变集的内近似

Inner approximations of the maximal positively invariant set for polynomial dynamical systems

École Polytechnique（巴黎综合理工学院）；Réseaux de Transport d’Électricité（法国输电系统运营商）；LAAS-CNRS（法国国家科学研究中心高级分析与自动化学研究所）；Faculty of Electrical Engineering, Czech Technical University in Prague（布拉格捷克理工大学电气工程学院）

本文提出了一种基于Lasserre级数的方法，用于计算连续时间多项式动力系统最大正不变集的内近似，解决了无限时间内的内近似问题，而先前工作只能提供有限时间内的吸引区或最大正不变集的外近似。

2023-05-22cs.SYeess.SYmath.OC

优化电力系统灵活性：最大化可管理不确定性区域

Optimizing Flexibility in Power Systems by Maximizing the Region of Manageable Uncertainties

针对电网运行中的负荷与发电不确定性，本文提出通过最大化可管理不确定性区域来提升系统灵活性，并基于直流潮流近似和半无限优化算法求解最大不确定性范围及可管理功率传输范围。

2025-01-24math.OC

The greedy strategy in optimizing the Perron eigenvalue

We address the problems of minimizing and of maximizing the spectral radius overa compact family of non-negative matrices. Those problems being hard in generalcan be efficiently solved for some special families. We consider the so-called prod-uct families, where each matrix is composed of rows chosen independently from givensets. A recently introduced greedy method works very fast. However, it is applicablemostly for strictly positive matrices. For sparse matrices, it often diverges and gives awrong answer. We present the "selective greedy method" thatworks equally well forall non-negative pro…

2020-05-18math.OC