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

2023 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2023

作者： Senkerik, Roman Byrski, Aleksander Guzowski, Hubert Janku, Peter Kadavy, Tomas Oplatkova, Zuzana Kominkova Matusu, Radek Pluhacek, Michal Pekar, Libor Smolka, MacIej Viktorin, Adam Tomas Bata University A.I. Lab Faculty of Applied Informatics Department of Informatics and Artificial Intelligence Zlin Czech Republic Tomas Bata University Faculty of Applied Informatics Department of Automation and Control Engineering Zlin Czech Republic Institute of Computer Science Agh University of Science and Technology Krakow Poland

ISBN: (纸本)9798350337020

This paper presents an experimental study that compares the performance of four selected metaheuristic algorithms for optimizing a time delay system model. Time delay system models are complex and challenging to optimize due to their inherent characteristics, such as non-linearity, multi-modality, and constraints. The study includes an explanation of the choice and core functionality of the selected algorithms, which are both baseline and state-of-the-art variants of self-organizing migrating algorithm (SOMA), state-of-the-art variant from the Success-History-based Adaptive Differential Evolution family of algorithms, with emphasis on diverse search (DISH algorithm), and Covariance Matrix Adaptation Evolution Strategy (CMA-ES) algorithm. The hyperparameters of the metaheuristic algorithms were set using the iRace automatic algorithm configuration framework. The paper emphasizes the importance of metaheuristic algorithms in control engineering for time-delay systems to develop more effective and efficient control strategies and precise model identifications. The experimental results highlight the effectiveness of the state-of-the-art algorithms with specific adaptive mechanisms like population organization process, diverse search and adaptation mechanisms ensuring a gradual transition from exploration to exploitation. Overall, this study contributes to understanding the challenges and advantages of using metaheuristic algorithms in control engineering for time delay systems. The results provide valuable insights into the performance of modern metaheuristic algorithms and can help guide the selection of appropriate adaptive mechanisms of metaheuristics. © 2023 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Model predictive control for tracking using artificial references: Fundamentals, recent results and practical implementation 63

Model predictive control for tracking using artificial refer...

引用

63rd IEEE Conference on Decision and control, CDC 2024

作者： Krupa, P. Kohler, J. Ferramosca, A. Alvarado, I. Zeilinger, M.N. Alamo, T. Limon, D. Computer Science Group L'Aquila Italy Institute for Dynamic Systems and Control Eth Zürich ZürichCH-8092 Switzerland University of Bergamo Information and Production Engineering Department of Management Via Marconi 5 BG Dalmine24044 Italy Universidad de Sevilla Department of Systems Engineering and Automation Seville Spain

ISBN: (纸本)9798350316339

This paper provides a comprehensive tutorial on a family of Model Predictive control (MPC) formulations, known as MPC for tracking, which are characterized by including an artificial reference as part of the decision variables in the optimization problem. These formulations have several benefits with respect to the classical MPC formulations, including guaranteed recursive feasibility under online reference changes, as well as asymptotic stability and an increased domain of attraction. This tutorial paper introduces the concept of using an artificial reference in MPC, presenting the benefits and theoretical guarantees obtained by its use. We then provide a survey of the main advances and extensions of the original linear MPC for tracking, including its non-linear extension. Additionally, we discuss its application to learning-based MPC, and discuss optimization aspects related to its implementation. © 2024 IEEE.

关键词： Predictive control systems

来源：评论

学校读者我要写书评

暂无评论

TreeSwap: Data Augmentation for Machine Translation via Dependency Subtree Swapping

arXiv

引用

arXiv 2023年

作者： Nagy, Attila Lakatos, Dorina Barta, Botond Ács, Judit Department of Automation and Applied Informatics Budapest University of Technology and Economics Hungary Institute for Computer Science and Control Hungary

Data augmentation methods for neural machine translation are particularly useful when limited amount of training data is available, which is often the case when dealing with low-resource languages. We introduce a novel augmentation method, which generates new sentences by swapping objects and subjects across bisentences. This is performed simultaneously based on the dependency parse trees of the source and target sentences. We name this method TreeSwap. Our results show that TreeSwap achieves consistent improvements over baseline models in 4 language pairs in both directions on resource-constrained datasets. We also explore domain-specific corpora, but find that our method does not make significant improvements on law, medical and IT data. We report the scores of similar augmentation methods and find that TreeSwap performs comparably. We also analyze the generated sentences qualitatively and find that the augmentation produces a correct translation in most cases. Our code is available on Github. © 2023, CC BY.

关键词： Neural machine translation

来源：评论

学校读者我要写书评

暂无评论

Optimal Linear Deception Attacks on Remote State Estimation with Constrained Alarm Rates: A Low-Dimensional Case 63

Optimal Linear Deception Attacks on Remote State Estimation ...

引用

63rd IEEE Conference on Decision and control, CDC 2024

作者： Shang, Jun Zhang, Hanwen Zhou, Jing Chen, Tongwen Tongji University Shanghai Research Institute for Intelligent Autonomous Systems National Key Laboratory of Autonomous Intelligent Unmanned Systems Frontiers Science Center for Intelligent Autonomous Systems Department of Control Science and Engineering Shanghai200092 China University of Science and Technology Beijing Key Laboratory of Knowledge Automation for Industrial Processes of Ministry of Education School of Automation and Electrical Engineering Beijing100083 China University of Alberta Department of Electrical and Computer Engineering EdmontonABT6G 1H9 Canada

ISBN: (纸本)9798350316339

This study addresses linear attacks on remote state estimation within the context of a constrained alarm rate. Smart sensors, which are equipped with local Kalman filters, transmit innovations instead of raw measurements through a wireless communication network. This transmission is vulnerable to malicious data interception and manipulation by attackers. The aim of this research is to identify the optimal attack strategy that degrades the system performance while adhering to stealthiness constraints. A notable innovation of this paper is the direct association of the attack's stealthiness with the alarm rate, diverging from traditional approaches that rely on the covariance of the innovation or the Kullback-Leibler divergence, which are conventional metrics that have been extensively explored in previous studies. Our findings reveal that the optimal attack strategy exhibits some structural characteristics in systems of low dimensions. The performance of the proposed attack strategy is demonstrated through numerical examples. © 2024 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Stochastic Programming for Hub Energy Management Considering Uncertainty Using Two-Point Estimate Method and Optimization Algorithm

引用

computer Modeling in Engineering & sciences 2023年第12期137卷 2163-2192页

作者： Ali S.Alghamdi Mohana Alanazi Abdulaziz Alanazi Yazeed Qasaymeh Muhammad Zubair Ahmed Bilal Awan M.G.B.Ashiq Department of Electrical Engineering College of EngineeringMajmaah UniversityAl-Majmaah11952Saudi Arabia Department of Electrical Engineering College of EngineeringJouf UniversitySakaka72341Saudi Arabia Department of Electrical Engineering College of EngineeringNorthern Border UniversityAr’Ar73222Saudi Arabia Automation and Control Department College of Engineering TechnologyUniversity of Doha for Science and TechnologyDoha24449Qatar Department of Electrical and Computer Engineering College of Engineering and Information TechnologyAjman UniversityAjman20550United Arab Emirates Department of Physics College of ScienceImam Abdulrahman Bin Faisal UniversityDammam31441Saudi Arabia

To maximize energy profit with the participation of electricity,natural gas,and district heating networks in the day-ahead market,stochastic scheduling of energy hubs taking into account the uncertainty of photovoltaic and wind resources,has been carried *** has been done using a new meta-heuristic algorithm,improved artificial rabbits optimization(IARO).In this study,the uncertainty of solar and wind energy sources is modeled using Hang’s two-point estimating method(TPEM).The IARO algorithm is applied to calculate the best capacity of hub energy equipment,such as solar and wind renewable energy sources,combined heat and power(CHP)systems,steamboilers,energy storage,and electric cars in the *** standard ARO algorithmis developed to mimic the foraging behavior of rabbits,and in this work,the algorithm’s effectiveness in avoiding premature convergence is improved by using the dystudynamic inertia weight *** proposed IARO-based scheduling framework’s performance is evaluated against that of traditional ARO,particle swarm optimization(PSO),and salp swarm algorithm(SSA).The findings show that,in comparison to previous approaches,the suggested meta-heuristic scheduling framework based on the IARO has increased energy profit in day-ahead electricity,gas,and heating markets by satisfying the operational and energy hub ***,the results show that TPEM approach dependability consideration decreased hub energy’s profit by 8.995%as compared to deterministic planning.

关键词： Stochastic energy hub scheduling energy profit uncertainty Hong’s two-point estimate method improved artificial rabbits optimization

来源：评论

学校读者我要写书评

暂无评论

A Primal-Dual SGD Algorithm for Distributed Nonconvex Optimization

引用

IEEE/CAA Journal of Automatica Sinica 2022年第5期9卷 812-833页

作者： Xinlei Yi Shengjun Zhang Tao Yang Tianyou Chai Karl Henrik Johansson Division of Decision and Control Systems School of Electrical Engineering and Computer ScienceKTH Royal Institute of Technologyand also affiliated with the Digital FuturesStockholm 10044Sweden Department of Electrical Engineering University of North TexasDentonTX 76203 USA IEEE State Key Laboratory of Synthetical Automation for Process Industries Northeastern UniversityShenyang 110819China

The distributed nonconvex optimization problem of minimizing a global cost function formed by a sum of n local cost functions by using local information exchange is *** problem is an important component of many machine learning techniques with data parallelism,such as deep learning and federated *** propose a distributed primal-dual stochastic gradient descent(SGD)algorithm,suitable for arbitrarily connected communication networks and any smooth(possibly nonconvex)cost *** show that the proposed algorithm achieves the linear speedup convergence rate O(1/(√nT))for general nonconvex cost functions and the linear speedup convergence rate O(1/(nT)) when the global cost function satisfies the Polyak-Lojasiewicz(P-L)condition,where T is the total number of *** also show that the output of the proposed algorithm with constant parameters linearly converges to a neighborhood of a global *** demonstrate through numerical experiments the efficiency of our algorithm in comparison with the baseline centralized SGD and recently proposed distributed SGD algorithms.

关键词： Distributed nonconvex optimization linear speedup Polyak-Lojasiewicz(P-L)condition primal-dual algorithm stochastic gradient descent

来源：评论

学校读者我要写书评

暂无评论

Online Learning of Safety function for Markov Decision Processes

Online Learning of Safety function for Markov Decision Proce...

引用

European control Conference (ECC)

作者： Abhijit Mazumdar Rafal Wisniewski Manuela L. Bujorianu Section of Automation & Control Aalborg University Aalborg East Denmark Department of Computer Science University College London UK

In this paper, we aim to study safety specifications for a Markov decision process with stochastic stopping time in an almost model-free setting. Our approach involves characterizing a proxy set of the states that are near in a probabilistic sense to the set of unsafe states - forbidden set. We also provide results that relate safety function with reinforcement learning. Consequently, we develop an online algorithm based on the temporal difference method to compute the safety function. Finally, we provide simulation results that demonstrate our work in a simple example.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A third-party platoon coordination service: Pricing under government subsidies

A third-party platoon coordination service: Pricing under go...

引用

作者： Bai, Ting Johansson, Alexander Li, Shaoyuan Johansson, Karl Henrik Mårtensson, Jonas School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm Sweden KTH Royal Institute of Technology Stockholm Sweden Department of Automation Shanghai Jiao Tong University Shanghai China Key Laboratory of System Control and Information Processing Shanghai Jiao Tong University Shanghai China Digital Futures Stockholm Sweden

This paper models a platooning system consisting of trucks and a third-party service provider (TPSP), which performs platoon coordination, distributes the platooning profit in platoons, and charges trucks in exchange for the services. Government subsidies used to incentivize platooning are also considered. We propose a pricing rule for the TPSP, which keeps part of the platooning profit including the subsidy each time a platoon is formed. In addition, a platoon coordination solution based on the distributed model predictive control (MPC) is proposed, in which the pricing rule under government subsidies is integrated. We perform a realistic simulation over the Swedish road network to evaluate the impact of the pricing rule and subsidies on the achieved profits and fuel savings. Our results show that subsidies are an effective mean to boost fuel savings from platooning. Moreover, the simulation study indicates that high pricing corresponds to a low platooning rate of the system, as trucks' incentives for platooning decrease. © 2023 The Authors. Asian Journal of control published by John Wiley & Sons Australia, Ltd on behalf of Chinese Automatic control Society.

关键词： Trucks

来源：评论

学校读者我要写书评

暂无评论

From MDP to POMDP and Back: Safety and Compositionality

From MDP to POMDP and Back: Safety and Compositionality

引用

European control Conference (ECC)

作者： Manuela L. Bujorianu Tristan Caulfield David Pym Rafael Wisniewski Department of Computer Science University College London UK Section of Automation & Control Aalborg University Aalborg East Denmark

We propose a compositional framework for the stochastic safety of distributed Markov Decision Processes (MDPs) and Partially Observable Markov Decision Processes (POMDPs). We use MDP and POMDPs and their distributed versions as an appropriate modelling paradigm for computational ecosystems, understood in the context of distributed systems. We extend our work on stochastic safety from MDPs to POMDPs, and then to networked MDP/POMDPs. We propose a unifying mathematical framework for stochastic safety for MDPs, their partially observable version and their composition.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Average Communication Rate for Networked Event-Triggered Stochastic control Systems

引用

IEEE Transactions on control of Network Systems 2025年

作者： Zhang, Zengjie Liu, Qingchen Mamduhi, Mohammad H. Hirche, Sandra Eindhoven University of Technology Department of Electrical Engineering Netherlands University of Science and Technology of China Department of Automation Hefei China University of Birmingham School of Computer Science United Kingdom Technical University of Munich Chair of Information-Oriented Control Munich Germany

Quantifying the average communication rate (ACR) of a networked event-triggered stochastic control system (NET-SCS) with deterministic thresholds is challenging due to the non-stationary nature of the system's stochastic processes. For a NET-SCS, the propagation of nonlinear statistics of the network communication status brought up by deterministic thresholds makes the precise computation of ACR difficult. Previous work used to over-simplify the computation using a Gaussian distribution without incorporating this nonlinearity, leading to sacrificed precision. This paper proposes a novel approach to calculate the exact ACR for a NET-SCS using a recursive model. We use theoretical analysis and a numerical study to qualitatively evaluate the deviation gap of the conventional approach that ignores the side information. The accuracy of our proposed method, alongside its comparison with the simplified results of the conventional approach, is validated by experimental studies. Our work is promising to benefit the efficient resource planning of networked control systems with limited communication resources by providing accurate ACR computation. © 2025 IEEE.

关键词： Networked control systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：