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

Harnessing Trend Theory to Enhance Distributed Proximal Point Algorithm Approaches for Multi-Area Economic Dispatch Optimization

引用

computers, Materials & Continua 2025年第3期82卷 4503-4533页

作者： Yaming Ren Xing Deng College of Mechanical and Control Engineering Guilin University of TechnologyGuilin541006China School of Computer Jiangsu University of Science and TechnologyZhenjiang212003China

The exponential growth in the scale of power systems has led to a significant increase in the complexity of dispatch problem resolution,particularly within multi-area interconnected power *** complexity necessitates the employment of distributed solution methodologies,which are not only essential but also highly *** the realm of computational modelling,the multi-area economic dispatch problem(MAED)can be formulated as a linearly constrained separable convex optimization *** proximal point algorithm(PPA)is particularly adept at addressing such mathematical constructs *** study introduces parallel(PPPA)and serial(SPPA)variants of the PPA as distributed algorithms,specifically designed for the computational modelling of the *** PPA introduces a quadratic term into the objective function,which,while potentially complicating the iterative updates of the algorithm,serves to dampen oscillations near the optimal solution,thereby enhancing the convergence ***,the convergence efficiency of the PPA is significantly influenced by the parameter *** address this parameter sensitivity,this research draws on trend theory from stock market analysis to propose trend theory-driven distributed PPPA and SPPA,thereby enhancing the robustness of the computational *** computational models proposed in this study are anticipated to exhibit superior performance in terms of convergence behaviour,stability,and robustness with respect to parameter selection,potentially outperforming existing methods such as the alternating direction method of multipliers(ADMM)and Auxiliary Problem Principle(APP)in the computational simulation of power system dispatch *** simulation results demonstrate that the trend theory-based PPPA,SPPA,ADMM and APP exhibit significant robustness to the initial value of parameter c,and show superior convergence characteristics compared to the residual balancing ADMM.

关键词： Multi-area economic dispatch problem proximal point algorithm trend theory

来源：评论

学校读者我要写书评

暂无评论

An efficient and high-performance WSNs restoration algorithm for fault nodes based on FT in data aggregation scheduling

International Journal of Cognitive Computing in Engineering

引用

International Journal of Cognitive Computing in engineering 2025年 6卷 508-515页

作者： Li, Cheng Zhang, Guoyin College of Computer Science and Technology Harbin Engineering University Heilongjiang Harbin150001 China College of Computer and Control Engineering Qiqihar University Heilongjiang Qiqihar161006 China

In wireless sensor networks(WSNs), data aggregation effectively reduces network traffic, thereby reducing energy consumption and improving network life cycle. Nevertheless, in the process of data aggregation scheduling, if there are fault nodes, the data quality collected by the whole network will decline, and the network performance will decrease, even posing a threat to network security or causing network paralysis. Thus, an efficient and high-performance WSNs restoration algorithm is proposed based on fat tree(FT), which is referred to as the EPRA-FT algorithm. And our goal is to improve the universality, efficiency, and performance retention of the algorithm. Previously, we have conducted a range of the relevant researches on performance improvement of WSNs aggregation scheduling by adopting FT structure, and some successful results have been obtained. On the basis of these results, for the EPRA-FT algorithm, first and foremost, the relationship among nodes is comprehensively recorded in FT construction process. Then, fault nodes are shielded by deleting the known nodes in aggregation tree. Finally, the local reconfiguration of aggregation tree is completed quickly and efficiently. Meanwhile, the aggregation scheduling performance of the original network is maintained to the maximum extent. The feasibility and superiority of our proposed EPRA-FT algorithm are proved by simulation experiments. © 2025

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Neuroadaptive Containment control for Nonlinear Multiagent Systems With Input Saturation: An Event-Triggered Communication Approach

引用

IEEE Transactions on Systems, Man, and Cybernetics: Systems 2025年第5期55卷 3163-3173页

作者： Wang, Xin Zhang, Sen Li, Huaqing Zhang, Wei Li, Hongyi Huang, Tingwen Southwest University College of Electronic and Information Engineering Chongqing400715 China Shenzhen University of Advanced Technology Faculty of Computer Science and Control Engineering Shenzhen518055 China

In this article, a neuroadaptive event-triggered containment control strategy combined with the dynamic surface control (DSC) approach is proposed for nonlinear multiagent systems (MASs) with input saturation. Based on the event-triggered communication mechanisms, the updates of neural network weight and controllers are implemented solely under triggering conditions of violation, which markedly reduces unnecessary communication resources and minimizes inefficient control costs compared with the traditional control method. Radial basis function neural networks (RBF NNs) are employed to handle the nonlinear uncertainties of MASs. Simultaneously, an adaptive compensatory mechanism is incorporated within the backstepping process to address the nonlinear effect posed by input saturation. Additionally, we demonstrate the system stability by extending the Lyapunov theorem to jump and continuous scenarios while excluding Zeno behavior, realizing that all followers can enter the convex hull constructed by leaders. Finally, the effectiveness of the proposed methodology is verified through application simulations. © 2013 IEEE.

关键词： Radial basis function networks

来源：评论

学校读者我要写书评

暂无评论

Data-driven output regulation control for constrained linear systems

引用

science China(Information sciences) 2025年第3期68卷 338-353页

作者： Chaoyu XIA Yi DONG Chaoli WANG Shengyuan XU Shanghai Research Institute for Intelligent Autonomous Systems Tongji University College of Electronic and Information Engineering Shanghai Research Institute for Intelligent Autonomous SystemsTongji University Department of Control Science and Engineering School of Optical-Electrical and Computer EngineeringUniversity of Shanghai for Science and Technology Department of Automation Nanjing University of Science and Technology

This study introduces a data-driven approach for state and output feedback control addressing the constrained output regulation problem in unknown linear discrete-time systems. Our method ensures effective tracking performance while satisfying the state and input constraints, even when system matrices are not available. We first establish a sufficient condition necessary for the existence of a solution pair to the regulator equation and propose a data-based approach to obtain the feedforward and feedback control gains for state feedback control using linear programming. Furthermore, we design a refined Luenberger observer to accurately estimate the system state, while keeping the estimation error within a predefined set. By combining output regulation theory, we develop an output feedback control strategy. The stability of the closed-loop system is rigorously proved to be asymptotically stable by further leveraging the concept of λ-contractive sets.

关键词： output regulation constrained system data-driven.

来源：评论

学校读者我要写书评

暂无评论

Minimum Initial Marking Estimation in Labeled Petri Nets Using Minimum Token Number Prediction

引用

IEEE Transactions on Automatic control 2025年第5期70卷 3296-3302页

作者： Yue, Hao Xu, Yakun Hu, Hesuan Wu, Weimin Li, Lingxi College of Computer Science and Technology Qingdao266580 China Xidian University School of Electro-Mechanical Engineering Xi'an710071 China Nanyang Technological University School of Computer Science and Engineering College of Engineering 639798 Singapore Zhejiang University State Key Laboratory of Industrial Control Technology Hangzhou310027 China Zhejiang University Institute of Cyber-Systems and Control Hangzhou310027 China Purdue University Elmore Family School of Electrical and Computer Engineering College of Engineering IndianapolisIN46202 United States

This article proposes an approach to addressing the problem of minimum initial marking (MuIM) estimation for labeled Petri nets (LPNs). We introduce the important concept of a label synthesis net for LPNs and develop a method for predicting the minimum number of tokens. By using this prediction method, we develop an algorithm that has polynomial complexity in the length of the observed label sequence for estimating MuIMs. An illustrative example is provided to show the effectiveness and efficiency of our proposed approach. Moreover, experimental results demonstrate its advantage over existing work. Finally, we provide a comparison of some representative studies in the literature for MuIM estimation. © 1963-2012 IEEE.

关键词： Discrete event simulation

来源：评论

学校读者我要写书评

暂无评论

A Survey of Distributed Algorithms for Aggregative Games

引用

IEEE/CAA Journal of Automatica Sinica 2025年第5期12卷 859-871页

作者： Li, Huaqing Li, Jun Ran, Liang Zheng, Lifeng Huang, Tingwen College of Electronic and Information Engineering Southwest University Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing Chongqing400715 China College of Computer Science and Engineering Chongqing University of Technology Chongqing400054 China School of Computer Science and Control Engineering Shenzhen University of Advanced Technology Shenzhen518107 China

Game theory-based models and design tools have gained substantial prominence for controlling and optimizing behavior within distributed engineering systems due to the inherent distribution of decisions among individuals. In non-cooperative settings, aggregative games serve as a mathematical framework model for the interdependent optimal decision-making problem among a group of non-cooperative players. In such scenarios, each player's decision is influenced by an aggregation of all players' decisions. Nash equilibrium (NE) seeking in aggregative games has emerged as a vibrant topic driven by applications that harness the aggregation property. This paper presents a comprehensive overview of the current research on aggregative games with a focus on communication topology. A systematic classification is conducted on distributed algorithm research based on communication topologies such as undirected networks, directed networks, and time-varying networks. Furthermore, it sorts out the challenges and compares the algorithms' convergence performance. It also delves into real-world applications of distributed optimization techniques grounded in aggregative games. Finally, it proposes several challenges that can guide future research directions. © 2014 Chinese Association of Automation.

关键词： Nash equilibrium

来源：评论

学校读者我要写书评

暂无评论

MATM-SN: A Deep-Reinforcement-Learning Model for Ocean Sensing Task Allocation Based on Generative Social Network

引用

IEEE Internet of Things Journal 2025年第10期12卷 13477-13486页

作者： Guo, Shuai Xia, Menglei Xue, Huanqun Song, Yutong Zhang, Zhitian Liu, Chao Qingdao University of Technology College of Information and Control Engineering Qingdao266520 China Qingdao University of Technology College of Science Qingdao266520 China Ocean University of China Department of Computer Science and Technology Qingdao266100 China

Due to the complexity of ocean sensing tasks, buoy detection in traditional ocean observation methods has the disadvantages of high cost and insufficient real-time performance. Ocean mobile crowd sensing technology collects high-resolution data in real-time through shipborne sensors and has significant potential for future development in the ocean Internet of Things. In this article, we consider a cooperative vessel activity that performs sensing tasks, incentivizing multiple vessels through dynamic external task profits. To spontaneously incentivize the team to take part in tasks and maximize the total profit of the vessels, we propose a multiagent task allocation model (MATM-SN) based on deep reinforcement learning (DRL). This model uses a generative adversarial network to predict the trajectory of the vessels, and STGCN is used to extract synergistic features between vessels effectively. DRL training provides an optimal task allocation strategy for vessels. Finally, we compared four baselines and demonstrated that the MATM-SN model outperformed other baselines regarding task completion rate and total efficiency. © 2014 IEEE.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Frequency Attacks Based on Invertible Neural Networks

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年第2期6卷 292-300页

作者： Shao, Ming-Wen Yang, Jian-Xin Meng, Ling-Zhuang Hu, Zhi-Yong China University of Petroleum School of Computer Science and Technology East China Qingdao266580 China China University of Petroleum College of Control Science and Engineering East China Qingdao266580 China

Adversarial attacks reveal the vulnerability of classifiers based on deep neural networks to well-designed perturbations. Most existing attack methods focus on adding perturbations directly to the pixel space. However, the perturbations generated by these methods may be easily perceived by humans. To alleviate the aforementioned problem, we propose a novel high-frequency attack based on invertible neural networks (HA-INN) that relies on INNs to adds perturbations to the high-frequency space of the image instead of the pixel space. In this way, we can fool the classifier while the perturbations are not easily detected by humans. Specifically, we introduce INNs to separate the high-frequency and low-frequency components of the image. And the low-frequency components are guaranteed to be reconstructed as the original image, while the high-frequency components are replaced with resampled high-frequency latent variables with additional adversarial information. Then, the low-frequency components and the high-frequency components with adversarial information are inversely fed into the INN to generate effective adversarial examples. Extensive experiments on two datasets (CIFAR-10 and CIFAR-100) show that our method can generate misleading and transferable cross-architectural adversarial examples with greatly reduced computational resource requirements. Under the white-box setting, the attack success rate of CIFAR10 and CIFAR100 is 99.8% and 99.74%, respectively. Further, under the black-box setting, the adversarial examples generated by our method are more effective than the other methods. © 2020 IEEE.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Nonsingular fast predefined time convergence sliding mode control for construction robot

引用

ISA Transactions 2025年 161卷 109-121页

作者： Yin, Chun-Wu Ding, Yun-Peng Sun, Hou-Jun College of Information and Control Engineering Xi'an University of Architecture and Technology Shaanxi Xi'an710055 China School of Computer Science Northwestern Polytechnical University Xi'an710072 China

To solve the practical engineering problem that the angle of a construction robot with an arbitrary initial value completely and accurately track the desired trajectory, this paper presents a control strategy for extending the desired trajectory, and a sliding mode controller with predefined time convergence is designed for an uncertain construction robot. Firstly, the special characteristics of the construction robot's trajectory tracking control are analyzed, an extended desired trajectory control strategy including the arrival phase and the precise tracking phase is proposed, and the design method of the extended desired trajectory in the arrival stage is given. Then, based on the improved non-singular fast sliding mode surface and a novel stability criterion of predefined time convergence, a predefined time convergence sliding mode controller based on a state observer was designed for the construction robot, which enables the angle tracking error of the construction robot to converge to zero within the specified time, ensures the angle completely and accurately tracking the original desired trajectory. Comparative simulation results show that the angle tracking error based on the proposed algorithm reaches 0.0004 rad, with an accuracy improvement of 33 %, and solves the problem of control torque chattering. © 2025 ISA

关键词： Sliding mode control

来源：评论

学校读者我要写书评

暂无评论

Virtualizing Next-Generation Programmable Networks: Techniques, Use Cases, and Promising Future Directions

引用

IEEE Network 2025年第3期39卷 148-155页

作者： Chen, Xiang Du, Hongyang Liu, Wenjing Liu, Hongyan Zhang, Jianshan Yang, Xu Zhang, Dong Wu, Chunming Liu, Xuan Niyato, Dusit Zhejiang University College of Computer Science and Technology Hangzhou310027 China The University of Hong Kong Department of Electrical and Electronic Engineering Pokfulam Hong Kong Zhejiang Media Group Hangzhou310005 China Minjiang University Fujian Provincial Key Laboratory of Information Processing and Intelligent Control College of Computer and Data Science Fuzhou350108 China Fuzhou University College of Computer and Data Science Fuzhou350108 China Yangzhou University College of Information Engineering College of Artificial Intelligence Yangzhou225009 China Nanyang Technological University College of Computing and Data Science Jurong West 639798 Singapore

For decades, network virtualization plays a crucial role in modern networks, e.g., 6G mobile networks: tenants construct arbitrary virtual networks on the same physical network. However, production networks are becoming programmable and need more ways of network configurations. So prior techniques like SDN hypervisors are deprecated since they cannot configure programmable networks. In response, a new category of network virtualization techniques has emerged recently to virtualize programmable networks, i.e., programmable network hypervisors (PNHs). This article first reviews this trend to comprehensively survey PNHs. To understand their benefits, we build a testbed with hardware switches and sophisticated topologies. Our testbed experiments stress-test hypervisors and demonstrate that they outperform prior works with higher acceptance ratios of virtual networks under large-scale scenarios and heavy loads. Finally, we highlight the open issues of these techniques to shed light on the future directions in this promising topic. © 1986-2012 IEEE.

关键词： Virtualization

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：