局部信息约束下网络演化博弈的动力学与优化（英文）

网络演化博弈的优化问题是混合值逻辑网络的一个自然推广.本文研究了一类网络演化博弈的优化控制问题,其中每个控制个体在极大化自己的收益时只能获取到邻域信息.首先,利用矩阵的半张量积,将局部信息约束下控制网络演化博弈的动力学转化为相应的代数形式.然后得到了局部信息约束下确定型网络演化博弈的最优控制序列.最后,基于动态规划的解,研究了局部信息约束下概率型网络演化博弈的优化控制问题,得到了最优控制序列的简单计算公式.两个数值例子验证了本文的理论结果.     

基于动态规划的约束优化问题多参数规划求解方法及应用

结合动态规划和单步多参数二次规划, 提出一种新的约束优化控制问题多参数规划求解方法. 一方面能得到约束线性二次优化控制问题最优控制序列与状态之间的显式函数关系, 减少多参数规划问题求解的工作量; 另一方面能够同时求解得到状态反馈最优控制律. 应用本文提出的多参数二次规划求解方法, 建立无限时间约束优化问题状态反馈显式最优控制律. 针对电梯机械系统振动控制模型做了数值仿真计算.     

基于种群分级遗传算法的受限广义预测控制

存在约束的控制过程限制了传统GPC方法在工业领域中的广泛应用.本文利用遗传算法来解决受限GPC算法的优化问题.当控制作用突破受限条件时,启用遗传算法来处理带约束的非线性优化问题,并以此作为滚动优化策略,求得最优控制律.遗传算法采用种群分级制度,充分利用所获信息对高级种群进行初始化,大大提高了算法的局部搜索能力.同时低级...     

有限时间信息融合线性二次型最优控制

针对有限时间线性二次型最优控制问题, 提出了一种新的求解方法—–信息融合估计方法. 基于线性最小方差估计准则下的融合估计理论, 通过融合期望状态轨迹、理想控制策略等软约束信息, 分别采用集中式融合和序贯式融合两种信息处理方法, 求得最优状态调节器问题的最优融合控制序列. 进一步从理论上论证了序贯式融合控制方法与传统最优控制方法的一致性, 并通过直流电机系统的数值仿真也验证了集中式和序贯式融合控制方法 与传统最优控制方法的等效性, 从而统一了最优估计与最优控制问题, 并为最优控制问题提供了一种新的求解方法.     

状态和输入受限的切换奇异布尔控制网络的最优控制

本文研究了状态和输入均受限的切换奇异布尔控制网络的最优控制问题.利用矩阵半张量积方法获得受限切换奇异布尔控制网络的等价代数形式.然后通过类似针变化得到了存在最优控制的必要条件,并且提出了一个算法设计切换序列和控制策略使收益函数最大化.最后给出例子验证所得结果的有效性.     

桥式吊车系统的伪谱最优控制设计

对于桥式吊车系统的最优控制问题,根据实际的工况要求,性能指标有时不一定是标准的二次形式.同时,在实际的控制问题中,状态和控制输入往往会受到一些边界条件和路径过程中的约束.针对这一问题,本文应用Chebyshev伪谱优化算法来处理,它可以处理状态和控制约束的非线性最优化问题以及一个非标准的目标函数.首先对桥式吊车系统模型进行一系列的坐标变换,将其转变为上三角系统形式的误差模型.然后将桥式吊车最优控制问题转化成具有一系列代数约束的参数优化问题,即非线性规划问题.通过求解离散化后的参数优化问题,得到桥式吊车的最优控制律.本文还给出了Chebyshev伪谱最优解的可行性和一致性分析.最后,在仿真研究中验证该控制器的有效性.     

状态和输入受限的切换奇异布尔控制网络的最优控制（英文）

本文研究了状态和输入均受限的切换奇异布尔控制网络的最优控制问题.利用矩阵半张量积方法获得受限切换奇异布尔控制网络的等价代数形式.然后通过类似针变化得到了存在最优控制的必要条件,并且提出了一个算法设计切换序列和控制策略使收益函数最大化.最后给出例子验证所得结果的有效性.     

基于二次型性能指标的混合动力汽车实时优化控制

为解决混合动力系统实时优化控制问题,本文提出了一种基于二次型性能指标最优的混合动力汽车功率分配优化方案.通过合理的假设和近似,建立了混合动力系统的线性模型,并利用二次型最优控制理论将混合动力最优控制问题转化为二次型最优调节问题进行求解,得到了一个结构简单的实时优化控制算法.5种道路工况下的仿真结果表明,本文提出的控制方法在未来道路工况未知的情况下能够实现混合动力系统的实时优化控制,且节油率与离线计算以燃油消耗最小为性能指标的全局最优控制的节油率相近.     

演化博弈的鲁棒稳定与镇定

本文研究了干扰影响下演化博弈的稳定与镇定问题. 首先, 文章给出了干扰博弈、控制–干扰博弈以及鲁棒 Nash均衡等概念, 并在此基础上提出了干扰演化博弈与控制–干扰演化博弈鲁棒稳定与镇定的定义. 其次, 利用矩 阵半张量积工具, 得到了干扰演化博弈与控制–干扰演化博弈的代数状态空间表示, 将鲁棒稳定与镇定问题转化为 一个辅助系统的集合稳定与集合镇定问题. 紧接着, 文章建立了干扰演化博弈与控制–干扰演化博弈鲁棒稳定与镇 定的充分必要条件, 并进一步设计了状态反馈控制器. 最后, 通过两个例子验证了所得结论的有效性.     

自由时间最优控制问题的一种控制向量参数化方法

针对自由时间最优控制问题,提出一种控制向量参数化（CVP）方法.通过引入时间尺度因子,将自由时间最优控制问题转化为固定时间问题,并将终端时刻作为优化参数.基于CVP方法,最优控制问题被转化为一个非线性规划（NLP）问题.建立目标和约束函数的Hamiltonian函数,通过求解伴随方程获得目标和约束函数的梯度,采用序列二次规划（SQP）方法获得问题的数值解.对于控制有切换结构的优化问题,给出了一种网格精细化策略,以提高控制质量.补料分批反应器最优控制问题的仿真实验验证了所提出方法的有效性.     

Semi-tensor product approach to networked evolutionary games

In this paper a comprehensive introduction for modeling and control of networked evolutionary games （NEGs） via semi-tensor product （STP） approach is presented. First, we review the mathematical model of an NEG, which consists of three ingredients： network graph, fundamental network game, and strategy updating rule. Three kinds of network graphs are considered, which are i） undirected graph for symmetric games; ii） directed graph for asymmetric games, and iii） d-directed graph for symmetric games with partial neighborhood information. Three kinds of fundamental evolutionary games （FEGs） are discussed, which are i） two strategies and symmetric （S-2）; ii） two strategies and asymmetric （A-2）; and iii） three strategies and symmetric （S-3）. Three strategy updating rules （SUR） are introduced, which are i） Unconditional Imitation （UI）; ii） Fermi Rule（FR）; iii） Myopic Best Response Adjustment Rule （MBRA）. First, we review the fundamental evolutionary equation （FEE） and use it to construct network profile dynamics （NPD）of NEGs.
To show how the dynamics of an NEG can be modeled as a discrete time dynamics within an algebraic state space, the fundamental evolutionary equation （FEE） of each player is discussed. Using FEEs, the network strategy profile dynamics （NSPD） is built by providing efficient algorithms. Finally, we consider three more complicated NEGs： i） NEG with different length historical information, ii） NEG with multi-species, and iii） NEG with time-varying payoffs. In all the cases, formulas are provided to construct the corresponding NSPDs. Using these NSPDs, certain properties are explored. Examples are presented to demonstrate the model constructing method, analysis and control design technique, and to reveal certain dynamic behaviors of NEGs.     

Decentralized Swarm Coordination: A Combined Coverage/Connectivity Approach

Decentralized motion coordination for coverage optimization purposes in mobile sensor networks is the scope of this paper. Coordination is performed based on spatial Voronoi tessellation, while taking into consideration the limited sensing capabilities of the agents. Each node performs an independent optimization in order to increase network??s area coverage via its motion, while it attains information from its current and future Delaunay neighbors. A decentralized algorithm is proposed in order to achieve optimal network??s coverage, based on local information. Connectivity issues are analyzed in detail, while a lower bound on the communication radius of the nodes is derived, in order to attain sufficient information for performing the corresponding optimization. An agent moves inside its region of responsibility in a way that the total area surveyed by the network is a monotonically increasing function of time. The online control action makes the network adaptive to possible changes in the environment.     

Enhanced information reconfiguration for distributed model predictive control for cyber‐physical networked systems

This paper considers a class of cyber‐physical networked systems, which are composed of many interacted subsystems, and are controlled in a distributed framework. The operating point of each subsystem changes with the varying of working conditions or productions, which may cause the change of the interactions among subsystems correspondingly. How to adapt to this change with good closed‐loop optimization performance and appropriate information connections is a problem. To solve this problem, the impaction of a subsystem's control action on the performance of related closed‐loop subsystems is first deduced for measuring the coupling among subsystems. Then, a distributed model predictive control (MPC) for tracking, whose subsystems online reconfigure their information structures, is proposed based on this impaction index. When the operating points changed, each local MPC calculates the impaction indices related to its structural downstream subsystems. If and only if the impaction index exceeds a defined bound, its behavior is considered by its downstream subsystem's MPC. The aim is to improve the optimization performance of entire closed‐loop systems and avoid the unnecessary information connections among local MPCs. Besides, contraction constraints are designed to guarantee that the overall system converges to the set points. The stability analysis is also provided. Simulation results show that the proposed impaction index is reasonable along with the efficiency of the proposed distributed MPC.     

基于蚁群算法的城域交通控制实时滚动优化

为求解城域交通控制实时滚动优化的混合整数规划模型，将滚动优化各阶段的控制变量映射为一个层状构造图，并定义局部启发信息和信息素更新公式，从而应用蚁群算法搜索各路口的最优信号灯相位序列．对算法复杂度作了理论分析，并通过仿真实验与单路口感应式信号控制技术进行比较，结果表明性能较好．     

Two-level stochastic control for the linear quadratic problem related to a static system

Two-level, hierarchical, partially decentralized control is considered for a large-scale system composed of M linear static subsystems with an interaction and a quadratic performance index. The coordinator and the local controllers, using their different information, realize the control resulting from the global and local optimization, respectively. It is seen that the optimal control laws are linear functions of some estimates and are determined by the formulated two-level certainty equivalence principle. A discussion on the usefulness of the application of particular local controllers is described.     

A survey on distributed online optimization and online games

Distributed online optimization and online games have been increasingly researched in the last decade, mostly motivated by their wide applications in sensor networks, robotics (e.g., distributed target tracking and formation control), smart grids, deep learning, and so forth. In these problems, there is a network of agents which interact with each other in a collaborative manner (i.e., distributed online optimization) or noncooperative manner (i.e., online games) through local information exchanges. And the local cost function of each agent is time-varying in dynamic and adversarial environments. At each time, a decision must be made by each agent based on historical information at hand without knowing its future cost functions. For these problems, a comprehensive survey is still lacking. This paper aims to provide a thorough overview of distributed online optimization and online games from the perspective of problem settings, algorithms, communication and computation requirements, and performances. In addition, some potential future directions are also discussed.     

一阶多智能体受扰系统的自抗扰分布式优化算法

研究一类具有未知外部干扰的一阶多智能体系统的分布式优化问题.在分布式优化任务中,每个智能体只被容许利用自己的局部目标函数和邻居的状态信息,设计一个分布式优化算法,使全局目标函数取得最小值,其中全局目标函数是所有局部目标函数之和.针对该问题,首先提出由扩张状态观测器和优化算法组成的自抗扰分布式优化算法.其次,在Lyapu...     

通信随机时滞条件下基于分布式模型预测的AUV编队控制

考虑水声通信随机时滞条件下AUV编队协同控制问题,提出一种基于分布式模型预测的AUV编队控制方法.首先,通过所设计的随机时滞通信同步策略,将异步状态信息转换为同步状态信息;然后,结合虚拟轨迹、状态预测、控制约束以及编队内AUV状态信息描述协同编队代价函数,将其引入局部滚动时域优化,实现编队控制目标,并利用李雅普诺夫理论验证编队控制器的稳定性;最后,将所提出方法与现有编队控制方法进行对比仿真,仿真结果验证了其有效性.     

Distributed model predictive control over network information exchange for large-scale systems

A class of large scale systems, which is naturally divided into many smaller interacting subsystems, are usually controlled by a distributed or decentralized control framework. In this paper, a novel distributed model predictive control (MPC) is proposed for improving the performance of entire system. In which each subsystem is controlled by a local MPC and these controllers exchange a reduced set of information with each other by network. The optimization index of each local MPC considers not only the performance of the corresponding subsystem but also that of its neighbours. The proposed architecture guarantees satisfactory performance under strong interactions among subsystems. A stability analysis is presented for the unconstrained distributed MPC and the provided stability results can be employed for tuning the controller. Experiment of the application to accelerated cooling process in a test rig is provided for validating the efficiency of the proposed method.     

非平衡有向网络的完全分布式凸优化

分布式凸优化问题的目的是如何以分布式方法最小化局部智能体成本函数和,而现有分布式算法的控制步长选取依赖于系统智能体个数、伴随矩阵等全局性信息,有悖于分布式算法的初衷.针对此问题,提出一种基于非平衡有向网络的完全分布式凸优化算法(FDCOA).基于多智能体一致性理论和梯度跟踪技术,设计了一种非负余量迭代策略,使得FDCOA的控制步长收敛范围仅与智能体局部信息相关,进而实现控制步长的分布式设置.进一步分析了FDCOA在固定强连通和时变强连通网络情形下的收敛性.仿真结果表明本文构建的分布式控制步长选取方法对FDCOA在有向非平衡下的分布式凸优化问题是有效的.