检索结果-内蒙古大学图书馆

arXiv 2022年

作者： Li, Linlin Ding, Steven X. Liang, Ketian Chen, Zhiwen Xue, Ting School of Automation and Electrical Engineering University of Science and Technology Beijing Beijing100083 China Institute for Automatic Control and Complex Systems University of Duisburg-Essen Duisburg47057 Germany Key Laboratory of Energy Saving Control and Safety Monitoring for Rail Transportation of Hunan Provincial School of Automation Central South University Changsha410083 China College of Electrical Engineering and Automation Shandong University of Science and Technology Qingdao266590 China

This paper is dedicated to control theoretically explainable application of autoencoders to optimal fault detection in nonlinear dynamic systems. Autoencoder-based learning is a standard machine learning method and widely applied for fault (anomaly) detection and classification. In the context of representation learning, the so-called latent (hidden) variable plays an important role towards an optimal fault detection. In ideal case, the latent variable should be a minimal sufficient statistic. The existing autoencoder-based fault detection schemes are mainly application-oriented, and few efforts have been devoted to optimal autoencoder-based fault detection and explainable applications. The main objective of our work is to establish a framework for learning autoencoder-based optimal fault detection in nonlinear dynamic systems. To this aim, a process model form for dynamic systems is firstly introduced with the aid of control theory, which also leads to a clear system interpretation of the latent variable. The major efforts are made on the development of a control theoretic solution to the optimal fault detection problem, in which an analog concept to minimal sufficient statistic, the so-called lossless information compression, is introduced and proven for dynamic systems and fault detection specifications. In particular, the existence conditions for such a latent variable are derived, based on which a loss function and further a learning algorithm are developed. This learning algorithm enables optimally training of autoencoders to achieve an optimal fault detection in nonlinear dynamic systems. A case study on three-tank system is given at the end of this paper to illustrate the capability of the proposed autoencoder-based fault detection and to explain the essential role of the latent variable in the proposed fault detection system. Copyright © 2022, The Authors. All rights reserved.

关键词： Fault detection

来源：评论

学校读者我要写书评

暂无评论

Distributed Constrained Online Nonconvex Optimization with Compressed Communication

arXiv

引用

arXiv 2025年

作者： Zhang, Kunpeng Xu, Lei Yi, Xinlei Cao, Ming Johansson, Karl H. Chai, Tianyou Yang, Tao State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China Department of Mechanical Engineering University of Victoria VictoriaBCV8W 2Y2 Canada Shanghai Institute of Intelligent Science and Technology National Key Laboratory of Autonomous Intelligent Unmanned Systems Frontiers Science Center for Intelligent Autonomous Systems Ministry of Education Shanghai201210 China Engineering and Technology Institute Groningen Faculty of Science and Engineering University of Groningen GroningenAG 9747 Netherlands Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Digital Futures Stockholm10044 Sweden

This paper considers distributed online nonconvex optimization with time-varying inequality constraints over a network of agents. For a time-varying graph, we propose a distributed online primal–dual algorithm with compressed communication to efficiently utilize communication resources. We show that the proposed algorithm establishes an O(T max{1−θ1,θ1}) network regret bound and an O(T 1−θ1/2) network cumulative constraint violation bound, where T is the number of iterations and θ1 ∈ (0, 1) is a user-defined trade-off parameter. When Slater’s condition holds (i.e, there is a point that strictly satisfies the inequality constraints at all iterations), the network cumulative constraint violation bound is reduced to O(T 1−θ1). These bounds are comparable to the state-of-the-art results established by existing distributed online algorithms with perfect communication for distributed online convex optimization with (time-varying) inequality constraints. Finally, a simulation example is presented to validate the theoretical results. Copyright © 2025, The Authors. All rights reserved.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Lines cluster approaching mode control for air-breathing hypersonic vehicle under disturbances and uncertainties

引用

International Journal of Modeling, Simulation, and Scientific Computing 2020年第1期11卷 152-175页

作者： Fei Ma Yunjie Wu Xiaocen Liu Xiaodong Liu State Key Laboratory of Virtual Reality Technology and Systems Beihang University Beijing 100191P.R.China School of Automation Science and Electrical Engineering Beihang University Beijing 100191P.R.China Science and Technology on Aircraft Control Laboratory Beijing 100191 P.R.China Beijing Aerospace Automatic Control Institute Beijing 100854 P.R.China

This paper investigates the velocity and altitude tracking control problem for airbreathing hypersonic vehicle(AHV)in the presence of external disturbances and parameter uncertainties.A composite controller containing improved lines cluster approaching mode control(LCAMC)and nonlinear disturbance observer(NDO)is developed to guarantee the tracking errors converge to zero and enhance the robustness of control ***,considering the multiple uncertain parameters,a genetic algorithm(GA)based Pareto uncertainty estimation is employed to predict the parameter uncertainties of the AHV ***,the mathematical proofs of proposed method are analyzed by utilizing Lyapunov *** results demonstrate the effective tracking performance,excellent disturbance estimation and uncertainty estimation ability of the composite method.

关键词： Air-breathing hypersonic vehicle tracking control lines cluster approaching mode control nonlinear disturbance observer Pareto uncertainty estimation

来源：评论

学校读者我要写书评

暂无评论

Distributed Online Convex Optimization with Adversarial Constraints: Reduced Cumulative Constraint Violation Bounds under Slater’s Condition

arXiv

引用

arXiv 2023年

作者： Yi, Xinlei Li, Xiuxian Yang, Tao Xie, Lihua Hong, Yiguang Chai, Tianyou Johansson, Karl H. Lab for Information & Decision Systems Massachusetts Institute of Technology CambridgeMA02139 United States Department of Control Science and Engineering College of Electronics and Information Engineering Tongji University Shanghai201804 China Shanghai Research Institute for Intelligent Autonomous Systems China The State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China School of Electrical and Electronic Engineering Nanyang Technological University 50 Nanyang Avenue Singapore639798 Singapore Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Digital Futures Stockholm10044 Sweden

This paper considers distributed online convex optimization with adversarial constraints. In this setting, a network of agents makes decisions at each round, and then only a portion of the loss function and a coordinate block of the constraint function are privately revealed to each agent. The loss and constraint functions are convex and can vary arbitrarily across rounds. The agents collaborate to minimize network regret and cumulative constraint violation. A novel distributed online algorithm is proposed and it achieves an O(T max{c,1−c}) network regret bound and an O(T 1−c/2) network cumulative constraint violation bound, where T is the number of rounds and c ∈ (0, 1) is a user-defined trade-off parameter. When Slater’s condition holds (i.e, there is a point that strictly satisfies the inequality constraints), the network cumulative constraint violation bound is reduced to O(T 1−c). Moreover, if the loss functions are strongly convex, then the network regret bound is reduced to O(log(T)), and the network cumulative constraint violation bound is reduced to O(√log(T)T) and O(log(T)) without and with Slater’s condition, respectively. To the best of our knowledge, this paper is the first to achieve reduced (network) cumulative constraint violation bounds for (distributed) online convex optimization with adversarial constraints under Slater’s condition. Finally, the theoretical results are verified through numerical simulations. Copyright © 2023, The Authors. All rights reserved.

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

A Parallel Intelligent System for Optimizing High-Speed Railway Rescheduling by Learning

A Parallel Intelligent System for Optimizing High-Speed Rail...

引用

Digital Twins and Parallel Intelligence (DTPI), IEEE International Conference on

作者： Pengxin Yang Dongliang Cui Xuewu Dai Yisheng Lv Hairong Dong Xinghao Wang Ruiguang Liu State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang China State Key Laboratory for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences Beijing China State Key Laboratory of Rail Traffic Control and Safety Beijing Jiaotong University Beijing China

The railway system is a complex system because of many constraints, randomness and high security requirements, so it is difficult to establish an accurate mathematical model for it, which brings great challenges to railway scheduling. Parallel intelligence theory can effectively solve the modeling, analysis and control of complex systems, so it has a wide range of applications in the field of intelligent transportation. In this paper, we build an artificial system according to the actual system, and use the surrogate modelling to carry out the calculation experiments, and proposed a parallel scheduling system based on the parallel intelligence method. Select a case to design scenario and perform computational experiment, the scheduling strategy is given and the scheduling strategy is analyzed.

关键词： Data analysis processor scheduling Transportation Prediction algorithms Rail transportation Scheduling Mathematical models

来源：评论

学校读者我要写书评

暂无评论

Distributed AC Optimal Power Flow: A Scalable Solution for Large-Scale Problems

arXiv

引用

arXiv 2025年

作者： Dai, Xinliang Jiang, Yuning Guo, Yi Jones, Colin N. Diehl, Moritz Hagenmeyer, Veit Institute for Automation and Applied Informatics The Karlsruhe Institute of Technology Germany Automatic Control Laboratory EPFL Switzerland Urban Energy Systems Laboratory Swiss Federal Laboratory for Materials Science and Technology Switzerland Department of Mathematics University of Freiburg Germany

This paper introduces a novel distributed optimization framework for large-scale AC Optimal Power Flow (OPF) problems, offering both theoretical convergence guarantees and rapid convergence in practice. By integrating smoothing techniques and the Schur complement, the proposed approach addresses the scalability challenges and reduces communication overhead in distributed AC OPF. Additionally, optimal network decomposition enables efficient parallel processing under the single program multiple data (SPMD) paradigm. Extensive simulations on large-scale benchmarks across various operating scenarios indicate that the proposed framework is 2 to 5 times faster than the state-of-the-art centralized solver IPOPT on modest hardware. This paves the way for more scalable and efficient distributed optimization in future power system applications. Copyright © 2025, The Authors. All rights reserved.

关键词： Parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Operating Performance Assessment of Complex Industrial process Based on Kernel Locally Linear Embedding PLS

Operating Performance Assessment of Complex Industrial Proce...

引用

第32届中国过程控制会议(CPCC2021)

作者： Chu Fei Mo Shuangshuang Wang Fuli Lu Ningyun Ma Xiaoping Research Center of Underground Space Intelligent Control Engineering of the Ministry of Education China University of Mining and Technology School of Information and Control Engineering China University of Mining and Technology State Key Laboratory of Automatic Control Technology for Mining and Metallurgy Process Beijing General Research Institute of Mining & Metallurgy State Key Laboratory of Integrated Automation for Process Industries Northeastern University College of Automation Engineering Nanjing University of Aeronautics and Astronautics

Due to the process disturbances and uncertainties,the operating performance of industrial process may deviate from the optimal operating point along with ***,non-optimal operation may lead to decline production quality and economic *** it is significant to implement online assessment strategy and further analyze the actual process operating performance,so as to make the production process in the best operating performance as far as *** process data is strongly nonlinear due to the change of system state caused by the change of machine performance or operation *** this time,the relationship between the local nearest neighbor samples is ***,the existing methods of operating performance assessment for solving nonlinear problems only focus on the global structure of data,i.e.,the variance,while ignoring the local neighborhood structure in each performance ***,a new method called kernel locally linear embedding PLS(KLLEPLS) is developed and applied for operating performance *** includes offline modeling,online evaluation and non-optimal cause *** algorithm not only has concise expression and similar analytical solutions for PLS,but also retains the original geometric structure of strongly nonlinear data when extracting the maximum correlation information between process ***,the practice and effectiveness of the proposed method are demonstrated by the dense medium coal preparation process and Tennessee Eastman(TE) process.

关键词： Complex industrial process operating performance assessment kernel locally linear embedding PLS non-optimal cause identification

来源：评论

学校读者我要写书评

暂无评论

Distributed Optimal Power Flow for VSC-MTDC Meshed AC/DC Grids Using ALADIN

arXiv

引用

arXiv 2022年

作者： Zhai, Junyi Dai, Xinliang Jiang, Yuning Xue, Ying Hagenmeyer, Veit Jones, Colin N. Zhang, Xiao-Ping Qingdao China City & Energy Research Institute Suzhou China Institute for Automation and Applied Informatics Karlsruhe Institute of Technology Germany Automatic Control Laboratory EPFL Switzerland School of Electric Power Engineering South China University of Technology Guangzhou China Department of Electronic Electrical and Systems Engineering University of Birmingham Birmingham United Kingdom

The increasing application of voltage source converter (VSC) based high voltage direct current (VSC-HVDC) technology in power grids has raised the importance of incorporating DC grids and converters into the existing transmission network. This poses significant challenges in dealing with the resulting optimal power flow (OPF) problem. In this paper, a recently proposed nonconvex distributed optimization algorithm—Augmented Lagrangian based Alternating Direction Inexact Newton method (ALADIN), is tailored to solve the nonconvex AC/DC OPF problem for emerging voltage source converter (VSC) based multiterminal high voltage direct current (VSC-MTDC) meshed AC/DC hybrid systems. The proposed scheme decomposes this AC/DC hybrid OPF problem and handles it in a fully distributed way. Compared to the existing state-of-art Alternating Direction Method of Multipliers (ADMM), which is in general, not applicable for nonconvex problems, ALADIN has a theoretical convergence guarantee. Applying these two approaches to VSC-MTDC coupled with an IEEE benchmark AC power system illustrates that the tailored ALADIN outperforms ADMM in convergence speed and numerical robustness. Copyright © 2022, The Authors. All rights reserved.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

Distributed Optimal Power Flow for VSC-MTDC Meshed AC/DC Grids Using ALADIN

Distributed Optimal Power Flow for VSC-MTDC Meshed AC/DC Gri...

引用

IEEE PES Innovative Smart Grid Technologies Conference Europe (ISGT Europe)

作者： Junyi Zhai Xinliang Dai Yuning Jiang Ying Xue Veit Hagenmeyer Colin N. Jones Xiao-Ping Zhang College of New Energy China University of Petroleum (UPC) China Karlsruhe Institute of Technology (KIT) Institute for Automation and Applied Informatics Germany Automatic Control Laboratory École Polytechnique Fédérale de Lausanne (EPFL) Switzerland School of Electric Power Engineering South China University of Technology (SCUT) China Department of Electronic Electrical and Systems Engineering University of Birmingham (UBir) Birmingham United Kingdom

The increasing application of voltage source converter (VSC) based high voltage direct current (VSC-HVDC) technology in power grids has raised the importance of incorporating DC grids and converters into the existing transmission network. This poses significant challenges in dealing with the resulting optimal power flow (OPF) problem. In this paper, a recently proposed nonconvex distributed optimization algorithm — Augmented Lagrangian based Alternating Direction Inexact Newton method (ALADIN), is tailored to solve the nonconvex AC/DC OPF problem for emerging voltage source converter (VSC) based multiterminal high voltage direct current (VSC-MTDC) meshed AC/DC hybrid systems. The proposed scheme decomposes this AC/DC hybrid OPF problem and handles it in a fully distributed way. Compared to the existing state-of-art Alternating Direction Method of Multipliers (ADMM), which is in general, not applicable for nonconvex problems, ALADIN has a theoretical convergence guarantee. Applying these two approaches to VSC-MTDC coupled with an IEEE benchmark AC power system illustrates that the tailored ALADIN outperforms ADMM in convergence speed and numerical robustness.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Quantized Distributed Nonconvex Optimization with Linear Convergence

Quantized Distributed Nonconvex Optimization with Linear Con...

引用

IEEE Conference on Decision and control

作者： Lei Xu Xinlei Yi Jiayue Sun Yang Shi Karl Henrik Johansson Tao Yang State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang China Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Digital Futures Stockholm Sweden Department of Mechanical Engineering University of Victoria Victoria Canada

ISBN: (数字)9781665467612

ISBN: (纸本)9781665467629

This paper considers distributed nonconvex op-timization for minimizing the average of local cost functions, by using local information exchange over undirected communication networks. Since the communication channels often have limited bandwidth or capacity, we first introduce a quantization rule and an encoder/decoder scheme to reduce the transmission bits. By integrating them with a distributed algorithm, we then propose a distributed quantized nonconvex optimization algorithm. Assuming the global cost function satisfies the Polyak– Łojasiewicz condition, which does not require the global cost function to be convex and the global minimizer is not necessarily unique, we show that the proposed algorithm linearly converges to a global optimal point. Moreover, a low data rate is shown to be sufficient to ensure linear convergence when the algorithm parameters are properly chosen. The theoretical results are illustrated by numerical simulation examples.

关键词： Quantization (signal) Communication channels Bandwidth Cost function Numerical simulation Communication networks Distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：