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

American control Conference (ACC)

作者： Damianos Tranos Alessio Russo Alexandre Proutiere Division of Decision and Control Systems School of Electrical Engineering and Computer Science Royal Institute of Technology (KTH) Stockholm Sweden

We present Self-Tuning Tube-based Model Predictive control (STT-MPC), an adaptive robust control algorithm for uncertain linear systems with additive disturbances based on the least-squares estimator and polytopic tubes. Our algorithm leverages concentration results to bound the system uncertainty set with prescribed confidence, and guarantees robust constraint satisfaction for this set, along with recursive feasibility and input-to-state stability. Persistence of excitation is ensured without compromising the algorithm’s asymptotic performance or increasing its computational complexity. We demonstrate the performance of our algorithm using numerical experiments.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Performance-Guaranteed Solutions for Multi-Agent Optimal Coverage Problems using Submodularity, Curvature, and Greedy Algorithms

Performance-Guaranteed Solutions for Multi-Agent Optimal Cov...

引用

IEEE Conference on Decision and control

作者： Shirantha Welikala Christos G. Cassandras Department of Electrical and Computer Engineering Stevens Institute of Technology Hoboken NJ USA Division of Systems Engineering and Center for Information and Systems Engineering Boston University Brookline MA USA

ISBN: (数字)9798350316339

ISBN: (纸本)9798350316346

We consider a class of multi-agent optimal coverage problems in which the goal is to determine the optimal placement of a group of agents in a given mission space so that they maximize a coverage objective that represents a blend of individual and collaborative event detection capabilities. This class of problems is extremely challenging due to the non-convex nature of the mission space and of the coverage objective. With this motivation, greedy algorithms are often used as means of getting feasible coverage solutions efficiently. Even though such greedy solutions are suboptimal, the submodularity (diminishing returns) property of the coverage objective can be exploited to provide performance bound guarantees. Moreover, we show that improved performance bound guarantees (beyond the standard ($1-1 / \mathrm{e}$) performance bound) can be established using various curvature measures of the coverage problem. In particular, we provide a brief review of all existing popular applicable curvature measures, including a recent curvature measure that we proposed, and discuss their effectiveness and computational complexity, in the context of optimal coverage problems. We also propose novel computationally efficient techniques to estimate some curvature measures. Finally, we provide several numerical results to support our findings and propose several potential future research directions.

关键词： Greedy algorithms Atmospheric measurements Reviews Event detection Space missions Collaboration Particle measurements Computational efficiency Computational complexity Standards

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm with network-independent step-size and event-triggered mechanism for economic dispatch problem

A distributed algorithm with network-independent step-size a...

引用

作者： Chen, Baitong Yang, Jianhua Lu, Wei Pedrycz, Witold Sun, Changhai School of Control Science and Engineering Dalian University of Technology Dalian China Department of Electrical and Computer Engineering University of Alberta EdmontonABT6G 2R3 Canada Institute of Systems Engineering Macau University of Science and Technology SARTaipa 999078 China Research Center of Performance and Productivity Analysis Istinye University Istanbul Turkey School of Electrical Engineering Dalian University of Technology Dalian China

The economic dispatch problem (EDP) poses a significant challenge in energy management for modern power systems, particularly as these systems undergo expansion. This growth escalates the demand for communication resources and increases the risk of communication failures. To address this challenge, we propose a distributed algorithm with network-independent step sizes and an event-triggered mechanism, which reduces communication requirements and enhances adaptability. Unlike traditional methods, our algorithm uses network-independent step sizes derived from each agent's local cost functions, thus eliminating the need for detailed network topology knowledge. The theoretical derivation identifies a range of step size values that depend solely on the objective function's strong convexity and the gradient's Lipschitz continuity. Furthermore, the proposed algorithm is shown to achieve a linear convergence rate, assuming the event triggering threshold criteria are met for linear convergence. Numerical experiments further validate the effectiveness and advantages of our proposed distributed algorithm by demonstrating its ability to maintain good convergence characteristics while reducing communication frequency. © 2024 John Wiley & Sons Ltd.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

Mitigating Voltage Sag in Power systems with Proportional Integral control using Tangent Search Algorithm and Multi-Fidelity Bayesian Neural Network 8

Mitigating Voltage Sag in Power Systems with Proportional In...

引用

8th International Conference on I-SMAC (IoT in Social, Mobile, Analytics and Cloud), I-SMAC 2024

作者： Meena, Radhey Shyam Singh, Harsimran Vasudevan, K. Ekambaram, Saranya Katiyar, Atul Kaliappan, S. Indian Institute of Technology Industry Coordinator Odl Uttar Pradesh Kanpur208016 India Guru Kashi University Department of Electrical Engineering Punjab Bathinda151302 India Parul University Department of Electrical Engineering Gujarat Vadodara391760 India Sri Eshwar College of Engineering Department of Computer Science and Business Systems Tamil Nadu Coimbatore641202 India Mjp Rohilkhand University Bareilly Faculty of Engineering and Technology Department of Electrical Engineering Uttar Pradesh 243006 India Lovely Professional University Division of Research and Development Delhi Jalandhar144411 India

ISBN: (纸本)9798350376425

Mitigation strategies for voltage sag in power systems using dynamic voltage restorers (DVRs) involve compensating for voltage dips by injecting the required voltage to maintain stability. However, DVRs present problems such as high initial costs in installation and subsequent costs in maintenance and replacement;it only corrects voltage sag within its capability to handle severe or long periods of voltage sags. Moreover, DVRs may need complex control algorithms and most accurate tuning for optimal performance under various grid conditions. To overcome these drawbacks, this manuscript proposes a hybrid approach for voltage sag mitigation in power systems with Proportional Integral (PI) controller. The proposed method is the combined execution of both Tangent Search Algorithm (TSA) and Multi-fidelity Bayesian Neural Network (MFBNN). Hence, it is named as hybrid TSA-MFBNN approach. The major aim is to minimize the impact of voltage sags on sensitive equipment and maintain consistent power quality across the network and reduce the integral squared error (ISE) and Total Harmonic Distortion (THD) of the system. The PI controller's gain parameters are optimized by the proposed TSA, and its optimum values are predicted by the MFBNN. By then, the proposed technique is executed in MATLAB and compared with different existing approaches. The proposed method outperforms all existing approaches such as Artificial Neural Network (ANN), Salp Swarm Algorithm (SSA), and Adaptive-Network Fuzzy Inference System (ANFIS). The proposed technique demonstrates a THD of 2.38% and an ISE of 0.00410, indicating superior performance in reducing harmonic distortions and minimizing error. © 2024 IEEE.

关键词： Harmonic distortion

来源：评论

学校读者我要写书评

暂无评论

Observer-Based control of Second-Order Multi-vehicle systems in Bearing-Persistently Exciting Formations

arXiv

引用

arXiv 2024年

作者： Tang, Zhiqi Fidan, Baris Johansson, Karl H. Mårtensson, Jonas Hamel, Tarek Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology StockholmSE-10044 Sweden Mechanical and Mechatronics Engineering Department University of Waterloo ON Canada France

This paper proposes an observer-based formation tracking control approach for multi-vehicle systems with second-order motion dynamics, assuming that vehicles' relative or global position and velocity measurements are unavailable. It is assumed that all vehicles are equipped with sensors capable of sensing the bearings relative to neighboring vehicles and only one leader vehicle has access to its global position. Each vehicle estimates its absolute position and velocity using relative bearing measurements and the estimates of neighboring vehicles received over a communication network. A distributed observer-based controller is designed, relying only on bearing and acceleration measurements. This work further explores the concept of the Bearing Persistently Exciting (BPE) formation by proposing new algorithms for bearing-based localization and state estimation of second-order systems in centralized and decentralized manners. It also examines conditions on the desired formation to guarantee the exponential stability of distributed observer-based formation tracking controllers. In support of our theoretical results, some simulation results are presented to illustrate the performance of the proposed observers as well as the observer-based tracking controllers. © 2024, CC BY-NC-ND.

关键词： Acceleration measurement

来源：评论

学校读者我要写书评

暂无评论

Equilibrium-Independent control of Continuous-Time Nonlinear systems via the LPV Framework - Extended Version

arXiv

引用

arXiv 2023年

作者： Koelewijn, Patrick J.W. Weiland, Siep Tóth, Roland The Control Systems Group Department of Electrical Engineering Eindhoven University of Technology Eindhoven Netherlands The Systems and Control Laboratory Institute for Computer Science and Control Budapest Hungary

In this paper, we consider the analysis and control of continuous-time nonlinear systems to ensure universal shifted stability and performance, i.e., stability and performance w.r.t. each forced equilibrium point of the system. This "equilibrium-free" concept is especially beneficial for control problems that require the tracking of setpoints and rejection of persistent disturbances, such as input loads. In this paper, we show how the velocity form, i.e., the time-differentiated dynamics of the system, plays a crucial role in characterizing these properties and how the analysis of it can be solved by the application of Linear Parameter-Varying (LPV) methods in a computationally efficient manner. Furthermore, by leveraging the properties of the velocity form and the LPV framework, a novel controller synthesis method is presented which ensures closed-loop universal shifted stability and performance. The proposed controller design is verified in a simulation study and also experimentally on a real system. Additionally, we compare the proposed method to a standard LPV control design, demonstrating the improved stability and performance guarantees of the new approach. Copyright © 2023, The Authors. All rights reserved.

关键词： controllers

来源：评论

学校读者我要写书评

暂无评论

Distributed Optimization via Gradient Descent with Event-Triggered Zooming over Quantized Communication

arXiv

引用

arXiv 2023年

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

In this paper, we study unconstrained distributed optimization strongly convex problems, in which the exchange of information in the network is captured by a directed graph topology over digital channels that have limited capacity (and hence information should be quantized). Distributed methods in which nodes use quantized communication yield a solution at the proximity of the optimal solution, hence reaching an error floor that depends on the quantization level used;the finer the quantization the lower the error floor. However, it is not possible to determine in advance the optimal quantization level that ensures specific performance guarantees (such as achieving an error floor below a predefined threshold). Choosing a very small quantization level that would guarantee the desired performance, requires information packets of very large size, which is not desirable (could increase the probability of packet losses, increase delays, etc) and often not feasible due to the limited capacity of the channels available. In order to obtain a communication-efficient distributed solution and a sufficiently close proximity to the optimal solution, we propose a quantized distributed optimization algorithm that converges in a finite number of steps and is able to adjust the quantization level accordingly. The proposed solution uses a finite-time distributed optimization protocol to find a solution to the problem for a given quantization level in a finite number of steps and keeps refining the quantization level until the difference in the solution between two successive solutions with different quantization levels is below a certain pre-specified threshold. Therefore, the proposed algorithm progressively refines the quantization level, thus eventually achieving low error floor with a reduced communication burden. The performance gains of the proposed algorithm are demonstrated via illustrative examples. © 2023, CC BY.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

Privacy-Preservation for Distributed Quantized k-means Clustering

Privacy-Preservation for Distributed Quantized k-means Clust...

引用

Annual Allerton Conference on Communication, control, and Computing

作者： Apostolos I. Rikos Nicolas E. Manitara Gabriele Oliva Christoforos N. Hadjicostis Department of Electrical and Computer Engineering Division of Systems Engineering Boston University Boston MA USA Department of Electrical and Computer Engineering University of Cyprus Nicosia Cyprus Department of Engineering Unit of Automatic Control Università Campus Bio-Medico di Roma Rome Italy

In this paper, we enhance a distributed version of the well known k-means algorithm with privacy-preservation features. While ensuring that sensitive or confidential information remains undisclosed to unauthorized entities (in our case these entities are curious nodes within the network), we maintain the desirable features of the distributed algorithm: the transmitted values are quantized, which optimizes bandwidth utilization and alleviates communication bottlenecks, and nodes possess the ability to collectively determine when to terminate the algorithm, which enables the conservation of valuable resources. We introduce a novel privacy-preserving protocol that not only preserves the privacy of a node’s state, but it also ensures confidentiality about its cluster affiliation (i.e., it does not reveal to curious nodes whether a node participates in the update calculation for a specific centroid value). Moreover, we precisely characterize topological conditions that guarantee privacy preservation for individual nodes. Our distributed algorithm allows the formation of exclusive clusters within a finite time frame on any static and strongly connected directed graph.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Robust control of Feeding Speed in Coal Seam Drilling Process Considering Borehole Friction

Robust Control of Feeding Speed in Coal Seam Drilling Proces...

引用

2024 China Automation Congress, CAC 2024

作者： Liu, Xiao Chen, Luefeng Lu, Chengda Fan, Haipeng Wu, Min Pedrycz, Witold School of Automation The Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems The Engineering Research Center of Intelligent Technology for Geo-Exploration Ministry of Education China University of Geosciences Wuhan430074 China Department of Electrical and Computer Engineering University of Alberta EdmontonABT6G 2R3 Canada Systems Research Institute Polish Academy of Sciences Warsaw00-901 Poland Department of Computer Engineering Istinye University Sariyer Istanbul34396 Turkey

ISBN: (纸本)9798350368604

During the coal seam drilling process, the drill string is subject to compressive deformation, compounded by unpredictable variations in formation hardness and borehole wall friction, leading to challenges in maintaining a stable feeding speed. This paper presents a novel approach by introducing uncertain parameters to describe the effects of formation hardness and borehole wall friction. Drill string axial movement model is modeled as a polyhedral system based on a lumped parameter representation. To meet industrial performance requirements, we design a robust H∞ controller to achieve consistent feeding speed control. Our simulation results demonstrate the controller’s effectiveness in ensuring system stability despite fluctuations in formation hardness and drill string friction. © 2024 IEEE.

关键词： Coal deposits

来源：评论

学校读者我要写书评

暂无评论

A Study of Two Types of Introductory Exercise Problems for Network Programming Learning with Python 23

A Study of Two Types of Introductory Exercise Problems for N...

引用

11th International Conference on computer and Communications Management, ICCCM 2023

作者： Lu, Xiqin Funabiki, Nobuo Ueda, Kiyoshi Kao, Wen-Chung Department of Information and Communication Systems Distributed System Design Lab. Okayama University Okayama Japan Department of Computer Science Control Software Lab. Nihon University Koriyama Japan Department of Electrical Engineering National Taiwan Normal University Taipei Taiwan

ISBN: (纸本)9798400707735

Network programming is the act of writing computer codes for communications between programs or processes in different computers across networks. It is crucial for applications and services using networks, including e-commerce, gaming, and social media. However, university courses of educating it are very limited. As a result, it has become important to develop and offer IT tools to support self-studies of network programming by novices. In this paper, we present a study of two types of introductory exercise problems, namely, Grammar-concept Understanding Problem (GUP) and Comment Insertion Problem (CIP), for self-studies of five basic network protocols of TCP/IP, ARP, SMTP, POP3, and SSH with Python. A GUP instance requests to answer the keyword such as a library function in the given source code that corresponds to the grammar concept described in the question. A CIP instance requests to insert the comment at each blank of the code. String matching is adopted to mark any answer at the browser-based answer interface. Through solving them, it is expected to understand the meaning of important words and the code structure for network programming. As preliminary evaluations, we generated six GUP and CIP instances respectively, and assigned them to 10 students in Okayama University, Japan. The results confirmed that the proposal is proper for novices to learn network programming with Python. © 2023 ACM.

关键词： Python

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：