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

Optimal Wildfire Escape Route Planning for Drones under Dynamic Fire and Smoke

学校读者我要写书评

暂无评论

Optimal Wildfire Escape Route Planning for Drones under Dyna...

International IEEE Conference on Signal-Image Technologies and Internet-Based System

作者： Chang Liu Tamas Sziranyi Department of Networked Systems and Services Budapest University of Technology and Economics Műegyetem rkp. 3H-1111 Budapest Hungary Machine Perception Research Laboratory of HUN-REN Institute for Computer Science and Control (SZTAKI) H-1111 Budapest Kende u. 13-17 Hungary Faculty of Transportation Engineering and Vehicle Engineering Budapest University of Technology and Economics (BME-KJK) Műegyetem rkp. 3 Budapest Hungary

In recent years, the increasing prevalence and intensity of wildfires have posed significant challenges to emergency response teams. The utilization of unmanned aerial vehicles (UAVs), commonly known as drones, has shown promise in aiding wildfire management efforts. This work focuses on the development of an optimal wildfire escape route planning system specifically designed for drones, considering dynamic fire and smoke models. First, the location of the source of the wildfire can be well located by information fusion between UAV and satellite, and the road conditions in the vicinity of the fire can be assessed and analyzed using multichannel remote sensing data. Second, the road network can be extracted and segmented in real time using UAV vision technology, and each road in the road network map can be given priority based on the results of road condition classification. Third, the spread model of dynamic fires calculates the new location of the fire source based on the fire intensity, wind speed and direction, and the radius increases as the wildfire spreads. Smoke is generated around the fire source to create a visual representation of a burning fire. Finally, based on the improved A* algorithm, which considers all the above factors, the UAV can quickly plan an escape route based on the starting and destination locations that avoid the location of the fire source and the area where it is spreading. By considering dynamic fire and smoke models, the proposed system enhances the safety and efficiency of drone operations in wildfire environments.

关键词：

Distributed Event-Triggered Algorithms for Finite-Time Privacy-Preserving Quantized Average Consensus

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Rikos, Apostolos I. Charalambous, Themistoklis Johansson, Karl H. Hadjicostis, Christoforos N. Division of Decision and Control Systems KTH Royal Institute of Technology StockholmSE-100 44 Sweden Department of Electrical Engineering and Automation Aalto University Espoo02150 Finland Department of Electrical and Computer Engineering University of Cyprus Nicosia1678 Cyprus

—In this paper, we consider the problem of privacy preservation in the average consensus problem when communication among nodes is quantized. More specifically, we consider a setting where some nodes in the network are curious but not malicious and they try to identify the initial states of other nodes based on the data they receive during their operation (without interfering in the computation in any other way), while some nodes in the network want to ensure that their initial states cannot be inferred exactly by the curious nodes. We propose two privacy-preserving event-triggered quantized average consensus algorithms that can be followed by any node wishing to maintain its privacy and not reveal the initial state it contributes to the average computation. Every node in the network (including the curious nodes) is allowed to execute a privacy-preserving algorithm or its underlying average consensus algorithm. In the first algorithm, each node initially injects a quantized offset and continues injecting offsets every time a certain event-triggered condition is satisfied, such that, after a finite number of events, the accumulated injected offset becomes equal to zero. In the second algorithm, each node injects a quantized offset to its out-neighboring nodes at the algorithm’s initialization, such that the accumulated sum is equal to zero. Under certain topological conditions, both algorithms allow the nodes who adopt privacy-preserving protocols to preserve the privacy of their initial quantized states and at the same time to obtain, after a finite number of steps, the exact average of the initial states while processing and transmitting quantized information. Illustrative examples demonstrate the validity and performance of our proposed algorithms. A motivating application is presented in which smart meters in a smart grid collect real-time demands for power in a neighborhood and the aggregated demand is distributively computed in a privacy-preserving manner. © 20

关键词： Electric power transmission networks

Stochastic MPC with Distributionally Robust Chance Constraints

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Mark, Christoph Liu, Steven Institute of Control Systems Department of Electrical and Computer Engineering University of Kaiserslautern Kaiserslautern67663 Germany

In this paper we discuss distributional robustness in the context of stochastic model predictive control (SMPC) for linear time-invariant systems. We derive a simple approximation of the MPC problem under an additive zero-mean i.i.d. noise with quadratic cost. Due to the lack of distributional information, chance constraints are enforced as distributionally robust (DR) chance constraints, which we opt to unify with the concept of probabilistic reachable sets (PRS). For Wasserstein ambiguity sets, we propose a simple convex optimization problem to compute the DR-PRS based on finitely many disturbance samples. The paper closes with a numerical example of a double integrator system, highlighting the reliability of the DR-PRS w.r.t. the Wasserstein set and performance of the resulting SMPC. Copyright © 2020, The Authors. All rights reserved.

关键词： Linear time-invariant system

Enhancing Deep Reinforcement Learning: A Tutorial on Generative Diffusion Models in Network Optimization

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Du, Hongyang Zhang, Ruichen Liu, Yinqiu Wang, Jiacheng Lin, Yijing Li, Zonghang Niyato, Dusit Kang, Jiawen Xiong, Zehui Cui, Shuguang Ai, Bo Zhou, Haibo Kim, Dong In The School of Computer Science and Engineering The Energy Research Institute @ NTU Interdisciplinary Graduate Program Nanyang Technological University Singapore The School of Computer Science and Engineering Nanyang Technological University Singapore The State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications China The School of Information and Communication Engineering University of Electronic Sciences and Technology of China Chengdu China The School of Automation Guangdong University of Technology China The Pillar of Information Systems Technology and Design Singapore University of Technology and Design Singapore Shenzhen China The State Key Laboratory of Rail Traffic Control and Safety Beijing Jiaotong University Beijing100044 China School of Electronic Science and Engineering Nanjing University Jiangsu Nanjing210093 China The Department of Electrical and Computer Engineering Sungkyunkwan University Suwon16419 Korea Republic of

Generative Diffusion Models (GDMs) have emerged as a transformative force in the realm of Generative Artificial Intelligence (GenAI), demonstrating their versatility and efficacy across various applications. The ability to model complex data distributions and generate high-quality samples has made GDMs particularly effective in tasks such as image generation and reinforcement learning. Furthermore, their iterative nature, which involves a series of noise addition and denoising steps, is a powerful and unique approach to learning and generating data. This paper serves as a comprehensive tutorial on applying GDMs in network optimization tasks. We delve into the strengths of GDMs, emphasizing their wide applicability across various domains, such as vision, text, and audio generation. We detail how GDMs can be effectively harnessed to solve complex optimization problems inherent in networks. The paper first provides a basic background of GDMs and their applications in network optimization. This is followed by a series of case studies, showcasing the integration of GDMs with Deep Reinforcement Learning (DRL), incentive mechanism design, Semantic Communications (SemCom), Internet of Vehicles (IoV) networks, etc. These case studies underscore the practicality and efficacy of GDMs in real-world scenarios, offering insights into network design. We conclude with a discussion on potential future directions for GDM research and applications, providing major insights into how they can continue to shape the future of network optimization. © 2023, CC BY.

关键词： Reinforcement learning

LPV modeling of nonlinear systems: A multi-path feedback linearization approach

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Abbas, Hossam S. Tóth, Roland Petreczky, Mihály Meskin, Nader Velni, Javad Mohammadpour Koelewijn, Patrick J.W. Institute for Electrical Engineering in Medicine University of Lübeck Germany Control Systems Group Department of Electrical Engineering Eindhoven University of Technology Netherlands France Department of Electrical Engineering College of Engineering Qatar University Qatar School of Electrical and Computer Engineering The University of Georgia GA United States Electrical Engineering Department Faculty of Engineering Assiut University Egypt

This paper introduces a systematic approach to synthesize linear parameter-varying (LPV) representations of nonlinear (NL) systems which are described by input affine state-space (SS) representations. The conversion approach results in LPV-SS representations in the observable canonical form. Based on the relative degree concept, first the SS description of a given NL representation is transformed to a normal form. In the SISO case, all nonlinearities of the original system are embedded into one NL function, which is factorized, based on a proposed algorithm, to construct an LPV representation of the original NL system. The overall procedure yields an LPV model in which the scheduling variable depends on the inputs and outputs of the system and their derivatives, achieving a practically applicable transformation of the model in case of low order derivatives. In addition, if the states of the NL model can be measured or estimated, then a modified procedure is proposed to provide LPV models scheduled by these states. Examples are included to demonstrate both approaches. © 2021, CC BY-NC-ND.

关键词： Linear systems

Guidance control for Parallel Parking Tasks

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2020年第1期7卷 301-306页

作者： Jiyuan Tan Chunling Xu Li Li Fei-Yue Wang Dongpu Cao Lingxi Li Key Laboratory of Urban Intelligent Traffic Control Technology North China University of TechnologyBeijing 100144China Beijing Transport Institute Beijing 100073China Department of Automation BNRistTsinghua UniversityBeijing 100084China Key Laboratory of Management and Control for Complex Systems Institute of AutomationChinese Academy of SciencesBeijing 100080China Driver Cognition and Automated Driving Laboratory University of WaterlooWaterloo N2L 3G1Canada Department of Electrical and Computer Engineering Purdue School of Engineering and TechnologyIndiana University-Purdue University IndianapolisIndiana 46202-5132 USA

Parking into small berths remains difficult for unskilled drivers. Researchers had proposed different automatic parking systems to solve this problem. The first kind of strategies(called parking trajectory planning) designs a detailed reference trajectory that links the start and ending points of a special parking task and let the vehicle track this reference trajectory so as to park into the berth. The second kind of strategies(called guidance control) just characterizes several regimes of driving actions as well as the important switching points in certain rule style and let the vehicle follows the pre-selected series of actions so as to park into the berth. Parking guidance control is simpler than parking trajectory planning. However, no studies thoroughly validated parking guidance control before. In this paper, a new automatic parking method is presented, which could characterize the desired control actions directly. Then the feasibility is examined carefully. Tests show that a simple parking guidance control strategy can work in most parallel parking tasks, if the available parking berth is not too small. This finding helps to build more concise automatic parking systems that can efficiently guide human drivers.

关键词： Automatic parking guidance control trajectory planning

Krasovskii and Shifted Passivity Based Output Consensus

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Kawano, Yu Cucuzzella, Michele Feng, Shuai Scherpen, Jacquelien M.A. Graduate School of Advanced Science and Engineering Hiroshima University Higashi-Hiroshima739-8527 Japan Department of Electrical Computer and Biomedical Engineering University of Pavia PV Pavia27100 Italy School of Automation Nanjing University of Science and Technology Nanjing210094 China Jan C. Willems Center for Systems and Control ENTEG Faculty of Science and Engineering University of Groningen Groningen9747 AG Netherlands

Motivated by current sharing in power networks, we consider a class of output consensus (also called agreement) problems for nonlinear systems, where the consensus value is determined by external disturbances, e.g., power demand. This output consensus problem is solved by a simple distributed output feedback controller if a system is either Krasovskii or shifted passive, which is the only essential requirement. The effectiveness of the proposed controller is shown in simulation on an islanded DC power network. Copyright © 2022, The Authors. All rights reserved.

关键词： Nonlinear systems

Bounding the difference between model predictive control and neural networks

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Drummond, Ross Duncan, Stephen R. Turner, Matthew C. Pauli, Patricia Allgöwer, Frank Department of Engineering Science University of Oxford 17 Parks Road OxfordOX1 3PJ United Kingdom Department of Electronics and Computer Science University of Southampton SouthamptonSO17 1BJ United Kingdom Institute for Systems Theory and Automatic Control University of Stuttgart Stuttgart70569 Germany

There is a growing debate on whether the future of feedback control systems will be dominated by data-driven or model-driven approaches. Each of these two approaches has their own complimentary set of advantages and disadvantages, however, only limited attempts have, so far, been developed to bridge the gap between them. To address this issue, this paper introduces a method to bound the worst-case error between feedback control policies based upon model predictive control (MPC) and neural networks (NNs). This result is leveraged into an approach to automatically synthesize MPC policies minimising the worst-case error with respect to a NN. Numerical examples highlight the application of the bounds, with the goal of the paper being to encourage a more quantitative understanding of the relationship between data-driven and model-driven control. © 2022, CC BY.

关键词： Model predictive control

A Bayesian Nash equilibrium-based moving target defense against stealthy sensor attacks

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Umsonst, David Saritaş, Serkan Dán, György Sandberg, Henrik Ericsson Research Stockholm Sweden The Division of Decision and Control Systems The School of Electrical Engineering and Computer Science The KTH Royal Institute of Technology Stockholm10044 Sweden The Department of Electrical and Electronics Engineering Middle East Technical University Ankara06800 Turkey The Division of Division of Network and Systems Engineering The School of Electrical Engineering and Computer Science The KTH Royal Institute of Technology Stockholm10044 Sweden

We present a moving target defense strategy to reduce the impact of stealthy sensor attacks on feedback systems. The defender periodically and randomly switches between thresholds from a discrete set to increase the uncertainty for the attacker and make stealthy attacks detectable. However, the defender does not know the exact goal of the attacker but only the prior of the possible attacker goals. Here, we model one period with a constant threshold as a Bayesian game and use the Bayesian Nash equilibrium concept to find the distribution for the choice of the threshold in that period, which takes the defender's uncertainty about the attacker into account. To obtain the equilibrium distribution, the defender minimizes its cost consisting of the cost for false alarms and the cost induced by the attack. We present a necessary and sufficient condition for the existence of a moving target defense and formulate a linear program to determine the moving target defense. Furthermore, we present a closed-form solution for the special case when the defender knows the attacker's goals. The results are numerically evaluated on a four-tank process. Copyright © 2021, The Authors. All rights reserved.

关键词： Game theory