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

Data-Driven Distributionally Robust control for Interacting Agents under Logical Constraints

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Kordabad, Arash Bahari Vlahakis, Eleftherios E. Lindemann, Lars Gros, Sebastien Dimarogonas, Dimos V. Soudjani, Sadegh The Max Planck Institute for Software Systems Kaiserslautern Germany The Division of Decision and Control Systems KTH Royal Institute of Technology Stockholm Sweden The Thomas Lord Department of Computer Science the Ming Hsieh Department of Electrical and Computer Engineering Viterbi School of Engineering University of Southern California Los Angeles United States Trondheim Norway

In this paper, we propose a distributionally robust control synthesis for an agent with stochastic dynamics that interacts with other agents under uncertainties and constraints expressed by signal temporal logic (STL). We formulate the control synthesis as a chance-constrained program (CCP) with STL specifications that must be satisfied with high probability under all uncertainty tubes induced by the other agents. To tackle the CCP, we propose two methods based on concentration of measure (CoM) theory and conditional value at risk (CVaR) and compare the required assumptions and resulting optimizations. These approaches convert the CCP into an expectation-constrained program (ECP), which is simpler to solve than the original CCP. To estimate the expectation using a finite set of observed data, we adopt a distributionally robust optimization (DRO) approach. The underlying DRO can be approximated as a robust data-driven optimization that provides a probabilistic under-approximation to the original ECP, where the probability depends on the number of samples. Therefore, under feasibility, the original STL constraints are satisfied with two layers of designed confidence: the confidence of the chance constraint and the confidence of the approximated data-driven optimization, which depends on the number of samples. We then provide details on solving the resulting robust data-driven optimization numerically. Finally, we compare the two proposed approaches through case studies. Copyright © 2025, The Authors. All rights reserved.

关键词： Constrained optimization

Cooperative Nonlinear Guidance Strategies for Guaranteed Pursuit-Evasion

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Kumar, Saurabh Kumar, Shashi Ranjan Sinha, Abhinav Intelligent Systems and Control Lab Department of Aerospace Engineering Indian Institute of Technology Bombay Powai Mumbai400076 India Unmanned Systems Lab Department of Electrical and Computer Engineering The University of Texas at San Antonio San AntonioTX78249 United States

This paper addresses the pursuit-evasion problem involving three agents– a purser, an evader, and a defender. We develop cooperative guidance laws for the evader-defender team that guarantee that the defender intercepts the pursuer before it reaches the vicinity of the evader. Unlike heuristic methods, optimal control, differential game formulation, and recently proposed time-constrained guidance techniques, we propose a geometric solution to safeguard the evader from the pursuer’s incoming threat. The proposed strategy is computationally efficient and expected to be scalable as the number of agents increases. Another alluring feature of the proposed strategy is that the evader-defender team does not require the knowledge of the pursuer’s strategy and that the pursuer’s interception is guaranteed from arbitrary initial engagement geometries. We further show that the necessary error variables for the evader-defender team vanish within a time that can be exactly prescribed prior to the three-body engagement. Finally, we demonstrate the efficacy of the proposed cooperative defense strategy via simulation in diverse engagement scenarios. © 2024, CC BY-NC-ND.

关键词： Heuristic methods

Almost Exact Recovery in Gossip Opinion Dynamics Over Stochastic Block Models

学校读者我要写书评

暂无评论

Almost Exact Recovery in Gossip Opinion Dynamics Over Stocha...

IEEE Conference on Decision and control

作者： Yu Xing Karl H. Johansson Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm Sweden Digital Futures Stockholm Sweden

We study community detection based on state observations from gossip opinion dynamics over stochastic block models (SBM). It is assumed that a network is generated from a two-community SBM where each agent has a community label and each edge exists with probability depending on its endpoints' labels. A gossip process then evolves over the sampled network. We propose two algorithms to detect the communities out of a single trajectory of the process. It is shown that, when the influence of stubborn agents is small and the link probability within communities is large, an algorithm based on clustering transient agent states can achieve almost exact recovery of the communities. That is, the algorithm can recover all but a vanishing part of community labels with high probability. In contrast, when the influence of stubborn agents is large, another algorithm based on clustering time average of agent states can achieve almost exact recovery. Numerical experiments are given for illustration of the two algorithms and the theoretical results of the paper.

关键词：

CNL-ResUnet: A novel deep learning architecture for stroke image segmentation

学校读者我要写书评

暂无评论

CNL-ResUnet: A novel deep learning architecture for stroke i...

International Conference on Advanced Technologies for Signal and Image Processing (ATSIP)

作者： Nesrine Jazzar Besma Mabrouk Ali Douik Networked Objects Control and Communication Systems National Engineering School of Sousse University of Sousse Tunisia National Engineering School of Sfax University of Sfax Tunisia Department of Electrical and Computer Engineering Advanced Technologies for Medicine and Signals ATMS National Engineers School Sfax University Tunisia Networked Objects Control and Communication Systems National Engineering School Sousse Tunisia

ISBN: (数字)9798350351484

ISBN: (纸本)9798350351491

Segmentation of stroke lesions holds significant importance in enabling timely diagnosis and subsequent treatment by medical professionals. Automating this process presents technical challenges given the diverse appearance and evolving nature of lesions, discrepancies among medical experts, limited dataset availability, and the necessity for multiple MRI modalities for comprehensive imaging. This research presents an innovative method called CNL-ResUNet, specifically designed for 2D stroke image segmentation. CNL-ResUNet ingeniously incorporates residual blocks into its architecture, capitalizing on their innate capacity to facilitate seamless information flow across layers, thereby empowering the network to efficiently distill complex patterns from sparse datasets. It integrates customized skip connections to reduce semantic disparities between the encoder and decoder layers. Additionally, the architecture incorporates an innovative Classifier and Localizer (CNL) module, providing supplementary classification and localization insights with enhanced accuracy. By combining these insights with the segmentation results, CNL-ResUNet adeptly reduces the occurrence of false positives and false negatives. To evaluate the model’s performance, experiments were conducted utilizing the SISS dataset from the Ischemic Stroke Lesion Segmentation Challenge 2015. The outcomes from these experiments highlight the superiority of our approach, revealing significant qualitative and quantitative improvements across standard evaluation metrics like the Dice coefficient and Accuracy. Our proposed network demonstrates potential for advancing automated tools in stroke segmentation.

关键词： Deep learning Training Image segmentation Accuracy Semantics Stroke (medical condition) Robustness

Distributed Optimization with Finite Bit Adaptive Quantization for Efficient Communication and Precision Enhancement

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Rikos, Apostolos I. Jiang, Wei Charalambous, Themistoklis Johansson, Karl H. Guangzhou China Department of Computer Science and Engineering The Hong Kong University of Science and Technology Clear Water Bay Hong Kong Department of Electrical Engineering and Automation School of Electrical Engineering Aalto University Espoo Finland Department of Electrical and Computer Engineering School of Engineering University of Cyprus Nicosia1678 Cyprus Division of Decision and Control Systems KTH Royal Institute of Technology StockholmSE-100 44 Sweden

In realistic distributed optimization scenarios, individual nodes possess only partial information and communicate over bandwidth constrained channels. For this reason, the development of efficient distributed algorithms is essential. In our paper we addresses the challenge of unconstrained distributed optimization. In our scenario each node’s local function exhibits strong convexity with Lipschitz continuous gradients. The exchange of information between nodes occurs through 3-bit bandwidth-limited channels (i.e., nodes exchange messages represented by a only 3-bits). Our proposed algorithm respects the network’s bandwidth constraints by leveraging zoom-in and zoom-out operations to adjust quantizer parameters dynamically. We show that during our algorithm’s operation nodes are able to converge to the exact optimal solution. Furthermore, we show that our algorithm achieves a linear convergence rate to the optimal solution. We conclude the paper with simulations that highlight our algorithm’s unique characteristics. © 2024, CC BY.

关键词： Optimization algorithms

Survey of Distributed Algorithms for Resource Allocation over Multi-Agent systems

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Doostmohammadian, Mohammadreza Aghasi, Alireza Pirani, Mohammad Nekouei, Ehsan Zarrabi, Houman Keypour, Reza Rikos, Apostolos I. Johansson, Karl H. Faculty of Mechanical Engineering Semnan University Semnan Iran Department of Electrical Engineering and Computer Science Oregon State University United States Department of Mechanical Engineering University of Ottawa OttawaON Canada City University of Hong Kong China Tehran Iran Faculty of Electrical Engineering Semnan University Semnan Iran Department of Electrical and Computer Engineering Division of Systems Engineering Boston University BostonMA United States Division of Decision and Control Systems KTH Royal Institute of Technology Sweden

Resource allocation and scheduling in multi-agent systems present challenges due to complex interactions and decentralization. This survey paper provides a comprehensive analysis of distributed algorithms for addressing the distributed resource allocation (DRA) problem over multi-agent systems. It covers a significant area of research at the intersection of optimization, multiagent systems, and distributed consensus-based computing. The paper begins by presenting a mathematical formulation of the DRA problem, establishing a solid foundation for further exploration. Real-world applications of DRA in various domains are examined to underscore the importance of efficient resource allocation, and relevant distributed optimization formulations are presented. The survey then delves into existing solutions for DRA, encompassing linear, nonlinear, primal-based, and dual-formulation-based approaches. Furthermore, this paper evaluates the features and properties of DRA algorithms, addressing key aspects such as feasibility, convergence rate, and network reliability. The analysis of mathematical foundations, diverse applications, existing solutions, and algorithmic properties contributes to a broader comprehension of the challenges and potential solutions for this domain. © 2024, CC BY.

关键词： Multi agent systems

Periodic-Enhanced Informer Model for Short-Term Wind Power Forecasting Using SCADA Data

学校读者我要写书评

暂无评论

IEEE Transactions on Sustainable Energy 2025年

作者： Liu, Zhao-Hua Li, Long-Wei Wei, Hua-Liang Li, Ming Lv, Ming-Yang Zhang, Ying-Jie Hunan University of Science and Technology School of Information and Electrical Engineering Xiangtan411201 China University of Sheffield Department of Automatic Control and Systems Engineering SheffieldS1 3JD United Kingdom Hunan University College of Computer Science and Electronic Engineering Changsha410082 China

Supervisory control and Data Acquisition (SCADA) systems can collect abundant information about wind farm operation and environment. To better make use of SCADA data, a periodic-enhanced informer model for short-term wind power forecasting using scada data is proposed. Firstly, to effectively filter out noise in SCADA data, a v-p curve-based method is adopted by incorporating a quartile approach to remove sparse outliers;a density-based spatial clustering of applications with noise (DBSCAN) algorithm is then employed to eliminate stacked outliers from the power curve. Secondly, a multi-feature input set selection method based on Maximization Information Coefficient is introduced to make better use of the SCADA system data by reducing the number of features. Thirdly, a Temporal Convolutional Network (TCN) is designed to extract the scalar projection of the input set, followed by fusing the local time stamp and global time stamp to build the periodic information enhanced prediction model embedding layer. Subsequently, the enhanced input set is fed into an informer model to predict future wind power. Finally, considering the multiple temporal scales structure characteristics present in the dataset, a multi-scale deep fusion module is established in the informer model to deeply integrate the features of different scales. It can simultaneously avoid the resource waste and overfitting problems caused by increasing the network depth. The experimental results, which are obtained from several deep learning methods on real SCADA data, demonstrate that the suggested approach has good predictive capability. © 2010-2012 IEEE.

关键词： Wind forecasting

Learning Communities from Equilibria of Nonlinear Opinion Dynamics

学校读者我要写书评

暂无评论

Learning Communities from Equilibria of Nonlinear Opinion Dy...

IEEE Conference on Decision and control

作者： Yu Xing Anastasia Bizyaeva Karl H. Johansson Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology and with Digital Futures Stockholm Sweden Sibley School of Mechanical and Aerospace Engineering Cornell University Ithaca NY USA

ISBN: (数字)9798350316339

ISBN: (纸本)9798350316346

This paper studies community detection for a nonlinear opinion dynamics model from its equilibria. It is assumed that the underlying network is generated from a stochastic block model with two communities, where agents are assigned with community labels and edges are added independently based on these labels. Agents update their opinions following a nonlinear rule that incorporates saturation effects on interactions. It is shown that clustering based on a single equilibrium can detect most community labels (i.e., achieving almost exact recovery), if the two communities differ in size and link probabilities. When the two communities are identical in size and link probabilities, and the intercommunity connections are denser than intra-community ones, the algorithm can achieve almost exact recovery under negative influence weights but fails under positive influence weights. Utilizing fixed point equations and spectral methods, we also propose a detection algorithm based on multiple equilibria, which can detect communities with positive influence weights. Numerical experiments demonstrate the performance of the proposed algorithms.

关键词： Accuracy Heuristic algorithms Image edge detection Stochastic processes Clustering algorithms Mathematical models Numerical models Detection algorithms

Flexible control of the Interline DC Power Flow controller Using Virtual Capacitor in VSC-HVDC Grids

学校读者我要写书评

暂无评论

Flexible Control of the Interline DC Power Flow Controller U...

Power Electronic and Drive systems and Technologies Conference (PEDSTC)

作者： Mirhamed Pourmirasghariyan Mirsajed Pourmirasghariyan Seyed Saeid Heidari Yazdi Seyyed Yousef Mousazadeh Mousavi Kumars Rouzbehi G. B. Gharehpetian Departement of Electrical and Computer Engineering Amirkabir University of Technology Tehran Iran School of Electrical and Computer Engineering College of Engineering University of Tehran Tehran Iran Department of Electrical & Computer Engineering School of Engineering and Digital Science Nazarbayev University Nur-Sultan Kazakhstan Faculty of Engineering and Technology University of Mazandaran Sari Iran Department of Systems and Automatic Control Engineering University of Seville Seville Spain

The performance of Interline DC Power Flow controllers (IDC-PFCs) in Voltage Source Converters (VSC)-based High Voltage Direct Current (HVDC) grids, can be affected due to different issues. The current limitation of HVDC lines, the voltage limitation of HVDC buses, and DC voltage of the IDC-PFC intermediary capacitor prevent effective and efficient operation of IDC-PFCs. In this paper, it is shown that this issue can be overcome by using a virtual capacitor in parallel with the IDC-PFC intermediary capacitor. Also, an energy control-based scheme is proposed for the operation of IDC-PFCs in VSC-HVDC grid. The benefits of using the virtual capacitor are: widening the operational area of the IDC-PFCs for the determined duty cycle and injecting more voltage in series to the interconnected HVDC line to control the related HVDC line current. The proposed solution is successfully evaluated on a CIGRE three-terminal VSC-HVDC grid which is modeled by linearized space-state equations.

关键词： Fluctuations HVDC transmission Capacitors High-voltage techniques Boosting Mathematical models Power conversion