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

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

来源：评论

学校读者我要写书评

暂无评论

Distributed Online Convex Optimization with Time-Varying Constraints: Tighter Cumulative Constraint Violation Bounds under Slater's Condition

引用

IEEE Transactions on Automatic control 2025年

作者： Yi, Xinlei Li, Xiuxian Yang, Tao Xie, Lihua Hong, Yiguang Chai, Tianyou Johansson, Karl H. National Key Laboratory of Autonomous Intelligent Unmanned Systems Shanghai Institute of Intelligent Science and Technology China Ministry of Education Frontiers Science Center for Intelligent Autonomous Systems China Massachusetts Institute of Technology Lab for Information & Decision Systems CambridgeMA02139 United States Northeastern University State Key Laboratory of Synthetical Automation for Process Industries Shenyang110819 China Nanyang Technological University School of Electrical and Electronic Engineering 50 Nanyang Avenue 639798 Singapore Kth Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Sweden Digital Futures Stockholm10044 Sweden

This paper considers distributed online convex optimization with time-varying 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 static network regret and network cumulative constraint violation. A novel distributed online algorithm with a vanishing stepsize is proposed and it achieves an O(Tmax {c,1-c}) static network regret bound and an O(T1-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(T1-c). Moreover, if the loss functions are strongly convex, then static 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 tighter (network) cumulative constraint violation bounds for (distributed) online convex optimization with time-varying constraints under Slater's condition. Finally, the theoretical results are verified through numerical simulations. © 1963-2012 IEEE.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

A safe control scheme for the dense medium coal separation process based on Bayesian network and Active Learning

A safe control scheme for the dense medium coal separation p...

引用

第33届中国控制与决策会议

作者： Wenchao Bao Fei Chu Chao Shang Tao Chen Fuli Wang Furong Gao China University of Mining and Technology School of Information and Control EngineeringUnderground Space Intelligent Control Engineering Research Center of the Ministry of Education Department of Automation Tsinghua University Department ofChemistry and Process Engineering University of Surrey School of Information Science and Engineering Northeastern University Department of Chemical Engineering Hong Kong University of Science and Technology

The paper presents a safe control method for the operation of dense medium coal preparation process based on Bayesian network(BN) and active *** dense medium coal preparation process fluctuates significantly in operating conditions and abnormal operating conditions occur frequently due to the uncertainty in the *** address this issue,we establish the BN model of safety control by integrating qualitative expert knowledge and quantitative data information based on the analysis of causes of abnormal conditions and corresponding operation schemes,which acts as the basis for the safety *** the previous BN structure learning method based on observation data information can only get Markov equivalence class and needs a large amount of data,it is difficult to establish an accurate *** address this issue,we propose a BN structure learning method based on active learning to improve its efficiency and *** results show that the proposed method can effectively provide safety control decisions for abnormal conditions in the dense medium coal preparation process.

关键词： Safe control Bayesian network Active learning Dense medium coal separation

来源：评论

学校读者我要写书评

暂无评论

Communication Compression for Distributed Nonconvex Optimization

arXiv

引用

arXiv 2022年

作者： Yi, Xinlei Zhang, Shengjun Yang, Tao Chai, Tianyou Johansson, Karl H. Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Digital Futures Stockholm100 44 Sweden Department of Electrical Engineering University of North Texas DentonTX76203 United States State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China

This paper considers distributed nonconvex optimization with the cost functions being distributed over agents. Noting that information compression is a key tool to reduce the heavy communication load for distributed algorithms as agents iteratively communicate with neighbors, we propose three distributed primal–dual algorithms with compressed communication. The first two algorithms are applicable to a general class of compressors with bounded relative compression error and the third algorithm is suitable for two general classes of compressors with bounded absolute compression error. We show that the proposed distributed algorithms with compressed communication have comparable convergence properties as state-of-the-art algorithms with exact communication. Specifically, we show that they can find first-order stationary points with sublinear convergence rate O(1/T) when each local cost function is smooth, where T is the total number of iterations, and find global optima with linear convergence rate under an additional condition that the global cost function satisfies the Polyak–Lojasiewicz condition. Numerical simulations are provided to illustrate the effectiveness of the theoretical results. Copyright © 2022, The Authors. All rights reserved.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Prediction model for mechanical properties of hot-rolled strips by deep learning

引用

Journal of Iron and Steel Research International 2020年第9期27卷 1045-1053页

作者： Wei-gang Li Lu Xie Yun-tao Zhao Zi-xiang Li Wen-bo Wang Engineering Research Center of Metallurgical Automation and Measurement Technology of Ministry of Education Wuhan University of Science and TechnologyWuhan 430081HubeiChina Key Laboratory of Metallurgical Equipment and Control Technology of Ministry of Education Wuhan University of Science and TechnologyWuhan 430081HubeiChina Hubei Province Key Laboratory of Systems Science in Metallurgical Process Wuhan University of Science and TechnologyWuhan 430081HubeiChina

The prediction of the mechanical properties of hot-rolled strips is a very complex,highly dimensional and nonlinear problem,and the published models might lack reliability,practicability and ***,a new model was proposed for predicting the mechanical properties of hot-rolled strips by deep ***,the one-dimensional numerical data were transformed into two-dimensional data for expressing the complex interaction between the influencing ***,a new convolutional network was proposed to establish the prediction model of tensile strength of hot-rolled strips,and an improved inception module was introduced into this network to abstract features from different *** comparative experiments were carried out to find the optimal network structure and its ***,the prediction experiments were carried out on different models to evaluate the performance of the new convolutional network,which includes the stepwise regression,ridge regression,support vector machine,random forest,shallow neural network,Bayesian neural network,deep feed-forward network and improved LeNet-5 convolutional neural *** results show that the proposed convolutional network has better prediction accuracy of the mechanical properties of hot-rolled strips compared with other models.

关键词： Deep learning Convolutional neural network Mechanical property Hot-rolled strip

来源：评论

学校读者我要写书评

暂无评论

Ultrasound Array Scanning for Oil-gas-water Three-phase Flow Measurement Based on Plane Wave

Ultrasound Array Scanning for Oil-gas-water Three-phase Flow...

引用

第三十九届中国控制会议

作者： Sheng Tian Chao Tan Feng Dong Tianjin Key Laboratory of Process Measurement and Control School of Electrical Engineering and Automation Tianjin University

In order to extract the size and distribution of discrete phases in oil-gas-water three-phase flow, a method that combines an ultrasonic array sensor with plane wave scanning is proposed and studied through numerical simulation. A frequency-domain simulation model is established. The size of the transmitting aperture that can generate plane wave is optimized from four elements to eight elements. Under the action of an ultrasonic plane wave, the curves that could express the relationship between the ultrasound attenuation coefficient（UAC） and the receiving element position of the oil bubble and gas bubble are plotted. We found that these curves have their own inherent variation rules. With transmitting aperture position shift, the UAC curve trend of the gas bubble changes significantly, but the UAC curve trend of the oil bubble has little change. The difference of oil bubble diameter will cause the UAC curve shape of the three-phase flow consistent with the curve shape of oil-water two-phase flow or gas-water two-phase flow. The relationship about the curves of the receiving element position between the variation of UAC could distinguish the spacing between the oil bubble and gas bubble. The transmitting/receiving aperture size for the three-phase flow measurement is selected as four elements/four elements or five elements/five elements, and the excitation-measurement mode is determined. This research lays a foundation for improving the accuracy of image reconstruction in the ultrasound process tomography for multiphase flow.

关键词： Ultrasound array scanning oil-gas-water three-phase flow plane wave information extraction

来源：评论

学校读者我要写书评

暂无评论

Global Consensus for Heterogeneous Saturated Multi-Agent Systems via Sampled-Data control

Global Consensus for Heterogeneous Saturated Multi-Agent Sys...

引用

IEEE Conference on Decision and control

作者： Juan Qian Xiaoling Wang Daniele Astolfi Housheng Su Guo-Ping Jiang College of Automation and the College of Artificial Intelligence Nanjing University of Posts and Telecommunications Nanjing China Jiangsu Engineering Center for IOT Intelligent Robots(IOTRobot) Nanjing China CNRS LAGEPP UMR 5007 43 boulevard du 11 novembre 1918 Université Claude Bernard Lyon 1 Villeurbanne France Key Laboratory of Smart Manufacturing in Energy Chemical Process Ministry of Education East China University of Science and Technology Shanghai China School of Artificial Intelligence and Automation Image Processing and Intelligent Control Key Laboratory of Education Ministry of China Huazhong University of Science and Technology Luoyu Road 1037 Wuhan China

ISBN: (数字)9798350316339

ISBN: (纸本)9798350316346

This paper addresses the global consensus problem for multi-input multi-output saturated systems within a sampled-data framework, aiming to advance global consensus, manage heterogeneous actuator saturation across components, and preserve distributed characteristics by using sampled-data feedback. We propose a distributed control algorithm that incorporates a redesigned saturation function, represented as decentralized dynamic saturation levels. These levels for each agent’s dimensions are autonomously updated through an adaptive strategy, which mitigates heterogeneous saturation by carefully selecting constant and time-varying saturation parameters in it. Lyapunov analysis proves that global consensus can be achieved under the proposed control law, provided the sampling periods of all agents remain below a calculated threshold. An example is given to demonstrate the effectiveness of this approach.

关键词： Actuators Upper bound Heuristic algorithms Decentralized control Multi-agent systems

来源：评论

学校读者我要写书评

暂无评论

Multivariate Time Delay Estimation Based on Dynamic Characteristic Analytics

Multivariate Time Delay Estimation Based on Dynamic Characte...

引用

第三十九届中国控制会议

作者： Xu Chen Chunhui Zhao State Key Laboratory of Industrial Control Technology College of Control Science and Engineering Zhejiang University State Key Laboratory of Process Automation in Mining & Metallurgy Beijing Key Laboratory of Process Automation in Mining &Metallurgy

Time delay widely exists among industrial process variables, which may lead to invalid description of systems and reduce the model accuracy for soft sensor, process monitoring etc. Therefore, it is crucial to estimate time delay for improving model accuracy. In traditional research, time delay estimation（TDE） algorithm for two variables is fully investigated, but little research pays attention to multivariate. The method of pairwise comparison may not only cause high calculation complexity but also cut off the correlation between multivariate. In this work, a new TDE algorithm is proposed to estimate time delay between multivariate, which extracts dynamic latent variable to represent the process using improved dynamic inner PCA algorithm（DiPCA）. Dynamic latent variable extracts the autocorrelation and cross-correlation between process variables. Take it as a standard and analyze the time delay, so that the influence of multivariate variables could be comprehensively considered. Since there may be non-linear variables, the significant factor（SF） is used for variable selection, and the multivariate variables are divided into multiple linear subgroups, which makes the analysis result more reasonable. The effectiveness is illustrated with two numerical examples and the Tennessee Eastman process.

关键词： Time delay estimation process dynamics dynamic latent variable variable selection multivariate

来源：评论

学校读者我要写书评

暂无评论

Room Impulse Response Reshaping-Based Blind Source Separation for an Underdetermined Reverberant Environment

SSRN

引用

SSRN 2024年

作者： Xie, Yuan Zou, Tao Yang, Junjie Sun, Weijun Xie, Shengli School of Mechanical and Electrical Engineering Guangzhou University Guangdong-Hong Kong-Macao Key Laboratory of Multi-scale Information Fusion and Collaborative Optimization Control of Complex Manufacturing Process Guangzhou510006 China School of Automation Guangdong University of Technology Joint International Research Laboratory of Intelligent Information Processing and System Integration of IoT Ministry of Education of the P.R.C. Guangzhou510006 China School of Automation Guangdong University of Technology Guangdong Key Laboratory of IoT Information Processing Guangdong-HongKong-Macao Joint Laboratory for Smart Discrete Manufacturing Guangzhou510006 China School of Automation Guangdong University of Technology Key Laboratory of Intelligent Detection and the IoT in Manufacturing Ministry of Education 111 Center for Intelligent Batch Manufacturing Based on IoT Technology Guangzhou510006 China

Blind source separation under an underdetermined reverberation environment is a very challenging issue. The classical method is based on the expectation maximization algorithm. However, it is limited to high reverberation environments, resulting in bad or even invalid separation performance. To eliminate this restriction, a room impulse response reshaping-based expectation maximization method is designed to solve the problem of blind signal separation in an underdetermined reverberant environment. Firstly, a room impulse response reshaping technology is designed to eliminate the influence of audible echo on the reverberant environment, improving the quality of the received signals. Then, a new mathematical model of time-frequency mixing signals is established to reduce the approximation error of model transformation caused by high reverberation. Furthermore, an improved expectation maximization method is proposed for real-time update learning rules of model parameters, and then the sources are separated using the estimators provided by the improved expectation maximization method. Experimental results based on source separation of speech and music mixtures demonstrate that the proposed algorithm achieves better separation performance while maintaining much better robustness than popular expectation maximization methods. © 2024, The Authors. All rights reserved.

关键词： Reverberation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：