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

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

来源：评论

学校读者我要写书评

暂无评论

Photovoltaic Power Forecasting Based on SVM Optimized by Improved ABC

Photovoltaic Power Forecasting Based on SVM Optimized by Imp...

引用

作者： Lin Liu Yanyun Lu Shuqin Li School of Management Hefei University of Technology Key Laboratory of Process Optimization and Intelligent Decision-making Ministry of Education

In order to improve the accuracy of photovoltaic power output prediction, a photovoltaic power prediction method based on similar days and improved artificial bee colony support vector machine is proposed. Firstly, through calculating the Euclidean distance of history day and measured day meteorological factors to determine similar days. Secondly, select historical data of photovoltaic power output, temperature, humidity and daily radiation on the slope of similar days and temperature, humidity and daily radiation on the slope of test date as input variables of support vector machine. And we adopt the improved artificial bees colony to optimize kernel function parameters and the penalty factor of support vector machine. Finally get the output in each period of photovoltaic power prediction. The experimental results showed that the proposed method can effectively improve the prediction accuracy of photovoltaic power.

关键词： Photovoltaic Power Forecasting Based on SVM Optimized by Improved ABC

来源：评论

学校读者我要写书评

暂无评论

Earth observation satellite scheduling for emergency tasks

引用

Journal of Systems Engineering and Electronics 2019年第5期30卷 931-945页

作者： SUN Haiquan XIA Wei HU Xiaoxuan XU Chongyan School of Management Hefei University of TechnologyHefei 230009China Key Laboratory of Process Optimization and Intelligent Decision-making Ministry of EducationHefei 230009China Graduate School Beijing Institute of Remote Sensing InformationBeijing 100192China

The earth observation satellites(EOSs)scheduling problem for emergency tasks often presents many *** example,the scheduling calculation should be completed in seconds,the scheduled task rate is supposed to be as high as possible,the disturbance measure of the scheme should be as low as possible,which may lead to the loss of important observation opportunities and data transmission *** scheduling algorithms are not designed for these ***,we propose a rolling horizon strategy(RHS)based on event triggering as well as a heuristic algorithm based on direct insertion,shifting,backtracking,deletion,and reinsertion(ISBDR).In the RHS,the driven scheduling mode based on the emergency task arrival and control station time window events are designed to transform the long-term,large-scale problem into a short-term,small-scale problem,which can improve the schedulability of the original scheduling scheme and emergency response *** the ISBDR algorithm,the shifting rule with breadth search capability and backtracking rule with depth search capability are established to realize the rapid adjustment of the original plan and improve the overall benefit of the plan and early completion of emergency ***,two heuristic factors,namely the emergency task urgency degree and task conflict degree,are constructed to improve the emergency task scheduling guidance and algorithm ***,we conduct extensive experiments by means of simulations to compare the algorithms based on ISBDR and direct insertion,shifting,deletion,and reinsertion(ISDR).The results demonstrate that the proposed algorithm can improve the timeliness of emergency tasks and scheduling performance,and decrease the disturbance measure of the scheme,therefore,it is more suitable for emergency task scheduling.

关键词： emergency task rolling horizon shifting rule backtrackingrule

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of China’s industry: a generalized equilibrium data envelopment analysis approach with fixed-sum undesirable output

引用

INFOR: Information Systems and Operational Research 2021年第2期59卷 290-308页

作者： Min Yang Qingxian An Dan Hu Liang Liang a School of Management Hefei University of Technology Hefei P.R. China b Key Laboratory of Process Optimization and Intelligent Decision-Making Ministry of Education Hefei University of Technology Hefei P.R.China c School of Business Central South University Changsha P.R. China

With the rapid development of economy, China faces a considerable challenge from environmental problems especially with the waste of gas pollution emitted by China’s industry. To assess the environmental performance of China’s industry, this paper proposes a new generalized equilibrium efficiency frontier data envelopment analysis (GEEFDEA) approach that considers waste gases as undesirable outputs. It is assumed that the total amount of waste gases that the industry is permitted to emit is limited (or fixed), that is, increasing air pollution of one area should reduce that of other areas for offset. Compared with the prior evaluation approaches, the proposed approach is the only one that satisfies the following conditions simultaneously. 1) The approach considers the property of the “fixed sum” of undesirable outputs. 2) The approach avoids the case in prior approaches (e.g., fixed sum output and zero sum gains DEA approaches) that an infeasible solution may occur when accessing decision making unites (DMUs) with fixed-sum undesirable outputs. 3) The proposed approach inherits all advantages of the GEEFDEA approach such as achieving an equilibrium state by only one step and obtaining a complete ranking order. Finally, the proposed approach is applied to evaluate the performance in China’s industry from 2008 to 2013. Results show China’s industry has significant regional characteristics.

关键词： Generalized equilibrium efficient frontier data envelopment analysis fixed-sum undesirable outputs China’s industry

来源：评论

学校读者我要写书评

暂无评论

Smart surgical telementoring system with patch-to-pixel point tracking method

EngMedicine

引用

EngMedicine 2025年第1期2卷

作者： Yanwei Qu Ling Li Tongtong Li Jieyu Zheng Wentao Tang Xiaojian Li School of Management Hefei University of Technology Hefei 230009 Anhui China Philosophy and Social Sciences Laboratory of Data Science and Smart Society Governance Ministry of Education Hefei 230009 Anhui China Key Laboratory of Process Optimization and Intelligent Decision-making Ministry of Education Hefei 230009 Anhui China Hefei Haochuan Information Technology Co. Ltd Hefei 230088 Anhui China Ministry of Education Engineering Research Center for Intelligent Decision-Making Information System Technologies Hefei 230009 Anhui China

The utilization of surgical telementoring has become increasingly prevalent in enhancing the surgical standards of grassroots hospitals in contemporary times. In the traditional framework of surgical telementoring, remote doctors guide grassroots doctors via video and audio communication, which may encounter obstacles such as inadequate information transfer and challenges in accurately pinpointing the surgical site and path. To mitigate these issues, this study introduces an intelligent surgical telementoring system based on edge computing. This system enables the transmission of points marked by remote doctors to grassroots doctors, updating these points’ coordinates in real-time on the local endoscopic video. In this system, a novel method named P2PTracking (Patch-to-Pixel Point Tracking) is implemented. This process begins with the tracking of a square patch surrounding the point marked by the remote doctor using SiameseFC. Following this, feature matching is performed on the tracked patch in the current frame and the square patch in the labelled frame or template frame. The affine transformation is then calculated based on the feature matching results. Lastly, the point tracking result is derived using the computed affine transformation. Experimental results indicate that the proposed system has a transmission speed of 1.99M/s and a transmission latency of 171 ms when transmitting video at a resolution of 1920 × 1080px, while the proposed method can achieve an accuracy of 96.6 % when the pixel error is 4. The code and data are available at https://***/hfut66/*** .

关键词： Surgical telementoring Patch tracking Point tracking Feature matching Template update mechanism

来源：评论

学校读者我要写书评

暂无评论

A data-driven open decision framework based on adaptive evidential reasoning rule

引用

Computers and Industrial Engineering 2025年 206卷

作者： Fu, Chao Chang, Wenjun Xue, Min Lu, Guangyan School of Management Hefei University of Technology Hefei Box 270 Anhui Hefei230009 China Key Laboratory of Process Optimization and Intelligent Decision-making Ministry of Education Anhui Hefei230009 China Ministry of Education Engineering Research Center for Intelligent Decision-Making & Information System Technologies Anhui Hefei230009 China Department of Operation Management CRRC Qishuyan Instiute Co. Ltd Jiangsu Changzhou213011 China

Data accumulation is beneficial to efficiently make decisions on new cases. However, it is rare to use the historical data of experienced decision makers to help inexperienced decision makers generate solutions to new cases in an open and adaptive way. To address this issue, a data-driven open decision framework is developed based on an adaptive evidential reasoning (ER) rule. Giving two assumptions, criterion weights are learned from historical individual and overall assessments while criterion reliabilities are learned from historical individual assessments and gold standards. The adaptive ER rule is developed based on two abstract functions with the variables of criterion weight and criterion reliability, respectively, whose properties are analyzed. With these foundations, the general situation of the open decision framework is demonstrated from the learning, aggregation, and prediction hierarchies. Three special situations of the framework are presented to make it flexible. The historical data of more experienced decision makers are allowed in the framework to ensure its openness. The applicability of the general situation of the open decision framework is examined by its use in helping diagnose breast lesions. Its performance is highlighted by the comparison with the three special situations of the framework, five representative machine learning algorithms, and the framework with four forms of two abstract functions. © 2025 Elsevier Ltd

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Generation of optimal persistent formations for heterogeneous multi-agent systems with a leader constraint

引用

Chinese Physics B 2018年第2期27卷 645-654页

作者：王国强罗贺胡笑旋 School of Management Hefei University of Technology Key Laboratory of Process Optimization & Intelligent Decision-making Ministry of Education

In this study, we consider the generation of optimal persistent formations for heterogeneous multi-agent systems, with the leader constraint that only specific agents can act as leaders. We analyze three modes to control the optimal persistent formations in two-dimensional space, thereby establishing a model for their constrained generation. Then, we propose an algorithm for generating the optimal persistent formation for heterogeneous multi-agent systems with a leader constraint （LC-HMAS-OPFGA）, which is the exact solution algorithm of the model, and we theoretically prove its validity. This algorithm includes two kernel sub-algorithms, which are optimal persistent graph generating algorithm based on a minimum cost arborescence and the shortest path （MCA-SP-OPGGA）, and the optimal persistent graph adjusting algorithm based on the shortest path （SP-OPGAA）. Under a given agent formation shape and leader constraint, LC-HMAS-OPFGA first generates the network topology and its optimal rigid graph corresponding to this formation shape. Then, LC-HMAS- OPFGA uses MCA-SP-OPGGA to direct the optimal rigid graph to generate the optimal persistent graph. Finally, LC- HMAS-OPFGA uses SP-OPGAA to adjust the optimal persistent graph until it satisfies the leader constraint. We also demonstrate the algorithm, LC-HMAS-OPFGA, with an example and verify its effectiveness.

关键词： leader constraint heterogeneous multi-agent system optimal persistent formation minimum costarborescence

来源：评论

学校读者我要写书评

暂无评论

Improved LMI-based conditions for designing of PD-type ILC laws for linear batch processes over two-dimensional setting

Improved LMI-based conditions for designing of PD-type ILC l...

引用

International Conference on Control, Automation, Robotics and Vision (ICARCV)

作者： Robert Maniarski Wojciech Paszke Hongfeng Tao Shoulin Hao Institute of Automation Electronic and Electrical Engineering University of Zielona Góra Zielona Góra Poland Key Laboratory of Advanced Process Control for Light Industry of Ministry of Education Jiangnan University Wuxi China Laboratory of Intelligent Control and Optimization for Industrial Equipment of Ministry of Education Dalian University of Technology Dalian China

ISBN: (纸本)9781665476881

This paper considers the problem of designing of iterative learning control (ILC) laws for linear batch processes. Unlike the majority of existing results about ILC law design for linear batch processes over repetitive/two-dimensional setting where Lyapunov theory is applied, this study is focused on formulating the ILC law design procedures by transforming it into an equivalent problem of (structural) stability analysis for a linear Roesser model for two-dimensional (2D) systems. Then, based on a non-conservative version of stability and stabilization conditions for linear 2D systems, suitable PD-type ILC laws are derived by the application of the linear matrix inequality (LMI) approach. Finally, a numerical example is given to show the validity of the proposed design procedure and some advantages are emphasized when compared to the existing alternatives.

关键词： State feedback Uncertainty Two dimensional displays Batch production systems Stability analysis Structural engineering Numerical models

来源：评论

学校读者我要写书评

暂无评论

Distributed Event-Triggered Bandit Convex optimization With Time-Varying Constraints

引用

IEEE Transactions on Control of Network Systems 2025年

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

This paper considers the distributed bandit convex optimization problem with time-varying inequality constraints over a network of agents, where the goal is to minimize network regret and cumulative constraint violation. Existing distributed online algorithms solving this problem require that each agent broadcasts its decision to its neighbors at each iteration. However, communication resources are often limited. To better utilize communication resources, we propose a distributed event-triggered online primal-dual algorithm with two-point bandit feedback. Under several classes of appropriately chosen decreasing parameter sequences and non-increasing event-triggered threshold sequences, we establish dynamic network regret and network cumulative constraint violation bounds. These bounds are comparable to the results achieved by distributed event-triggered online algorithms with full-information feedback. Finally, a numerical example is provided to verify the theoretical results. © 2014 IEEE.

关键词： optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：