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

63rd IEEE Conference on Decision and control, CDC 2024

作者： Xu, Gehui Chen, Guanpu Fidan, Baris Hong, Yiguang Qi, Hongsheng Parisini, Thomas Johansson, Karl H. Kth Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Stockholm100 44 Sweden University of Waterloo Department of Mechanical and Mechatronics Engineering WaterlooONN2L 3G1 Canada Tongji University Department of Control Science and Engineering shanghai201804 China Shanghai Research Institute for Intelligent Autonomous Systems Shanghai201210 China Key Laboratory of Systems and Control Academy of Mathematics and Systems Science Beijing China University of Chinese Academy of Sciences School of Mathematical Sciences Beijing China Aalborg University Department of Electronic Systems Denmark Imperial College London Department of Electrical and Electronic Engineering LondonSW7 2AZ United Kingdom University of Trieste Department of Engineering and Architecture Italy

ISBN: (纸本)9798350316339

Sensor network localization (SNL) is a challenging problem due to its inherent non-convexity and the effects of noise in inter-node ranging measurements and anchor node position. We formulate a non-convex SNL problem as a multiplayer non-convex potential game and investigate the existence and uniqueness of a Nash equilibrium (NE) in both the ideal setting without measurement noise and the practical setting with measurement noise. We first show that the NE exists and is unique in the noiseless case, and corresponds to the precise network localization. Then, we study the SNL for the case with errors affecting the anchor node position and the inter-node distance measurements. Specifically, we establish that in case these errors are sufficiently small, the NE exists and is unique. It is shown that the NE is an approximate solution to the SNL problem, and that the position errors can be quantified accordingly. Based on these findings, we apply the results to case studies involving only inter-node distance measurement errors and only anchor position information inaccuracies. © 2024 IEEE.

关键词： Nash equilibrium

来源：评论

学校读者我要写书评

暂无评论

Volt-Var control for Utility-scale Solar PV Plants to Replace SVCs 4

Volt-Var Control for Utility-scale Solar PV Plants to Replac...

引用

4th International Conference on High Voltage engineering and Power systems, ICHVEPS 2023

作者： Shimomukai, Ken Maeda, Haruka Fujita, Goro Shibaura Institute of Technology Functional Control Systems Graduate School of Engineering and Science Tokyo Japan Shibaura Institute of Technology Graduate School of Engineering and Science Department of Electrical Engineering and Computer Science Tokyo Japan Shibaura Institute of Technology Department of Electrical Engineering Tokyo Japan

ISBN: (纸本)9798350318678

One way to increase solar photovoltaic penetration in the grid is management of voltage fluctuations. This is because a photovoltaic plant cannot be interconnected to the grid if it causes voltage violations. Voltage violation is where voltage exceeds the acceptable range. Often, grid operators request photovoltaic plant owners to regulate voltage sufficiently with expensive and space-consuming static Var compensators. Unfortunately, this sometimes makes the project less feasible. This paper argues that there are better ways to regulate voltage. We ran a simulation with a 70 MWp photovoltaic plant as an addition to the grid. Without voltage regulation, voltage violations were found to be significant. This paper found that oversizing the inverter sufficiently would remove all voltage violations without deploying a static Var compensator. This is often a cheaper and space-saving solution for voltage management. This paper argues that economics and spatial efficiency of reactive power compensation devices is key to increasing photovoltaic penetration. © 2023 IEEE.

关键词： Reactive power

来源：评论

学校读者我要写书评

暂无评论

Dormant Neural Trojans 22

Dormant Neural Trojans

引用

22nd IEEE International Conference on Machine Learning and Applications, ICMLA 2023

作者： Fu, Feisi Kiourti, Panagiota Li, Wenchao Boston University Division of Systems Engineering BostonMA02215 United States Boston University Department of Electrical and Computer BostonMA02215 United States

ISBN: (纸本)9798350345346

We present a novel methodology for neural network backdoor attacks. Unlike existing training-time attacks where the Trojaned network would respond to the Trojan trigger after training, our approach inserts a Trojan that will remain dormant until it is activated. The activation is realized through a specific perturbation to the network's weight parameters only known to the attacker. Our analysis and the experimental results demonstrate that dormant Trojaned networks can effectively evade detection by state-of-the-art backdoor detection methods. © 2023 IEEE.

关键词： AI Security Backdoor attacks Deep Neural Networks

来源：评论

学校读者我要写书评

暂无评论

A Patient Specific Algorithm for Plasmodium Malaria Detection on Cell Images

A Patient Specific Algorithm for Plasmodium Malaria Detectio...

引用

2023 IEEE National Aerospace and Electronics Conference, NAECON 2023

作者： Narayanan, Barath Narayanan De Silva, Manawaduge Supun Hardie, Russell C. University of Dayton Research Institute Sensor and Software Systems Division Dayton United States University of Dayton Department of Electrical and Computer Engineering Dayton United States

ISBN: (纸本)9798350338782

computer-aided detection of plasmodium malaria on cell images from digital microscopy provides an invaluable second opinion to medical experts. Traditionally, well-established deep learning algorithms are widely used to detect plasmodium, but these techniques have not been deployed due to the uninterpretable nature of the decisions made by the network. To address this, we present an ensemble method that fuses the predictions based on the class activation mapping (CAM) results from multiple networks via a novel selector network. We study the performance on a publicly available dataset of cell images by using three convolutional neural network architectures, Xception, ResNet50, and InceptionV3,to produce CAM results for the selector network and performance comparison. Our proposed approach helps enhance doctors' trust and outperforms the traditional methods by 1%. © 2023 IEEE.

关键词： Diseases

来源：评论

学校读者我要写书评

暂无评论

Supremal and Robust control Against Actuator Jamming Attacks in Cyber-Physical systems

IEEE Transactions on Intelligent Vehicles

引用

IEEE Transactions on Intelligent Vehicles 2024年第9期9卷 5435-5447页

作者： Duo, Wenli Wang, Shouguang Zhou, MengChu You, Dan Winiewski, Remigiusz Bazydlo, Grzegorz Albeshri, Aiiad Macau University of Science and Technology Institute of Systems Engineering 999078 China Zhejiang Gongshang University School of Information and Electronic Engineering Hangzhou310018 China New Jersey Institute of Technology Helen and John C. Hartmann Department of Electrical and Computer Engineering NewarkNJ07102 United States University of Zielona Góra Institute of Control and Computation Engineering Zielona Góra65-516 Poland King Abdulaziz University Department of Computer Science Jeddah21481 Saudi Arabia

Cyber-physical systems, such as unmanned aerial vehicles and connected and autonomous vehicles, are vulnerable to cyber attacks, which can cause significant damage to society. This paper examines the attack issue in cyber-physical systems within the framework of discrete event systems. Specifically, we consider a scenario where a malicious intruder injects a jamming signal into an actuator channel. It disrupts the transmission of control commands and prevents an actuator from receiving them. This is termed an actuator jamming attack. In the paper, we first analyze the closed-loop system behavior under such an attack. An attack structure is constructed to illustrate how an intruder exploits a jamming attack to drive a system into unsafe states. Then, we study the supervisory control problem for a system exposed to such an attack. The problem is reduced to a basic supervisory control one in discrete event systems by introducing the concept of dynamically controllable language. A solution to this problem is explored, where we establish an existence condition for a supremal and robust supervisor that is capable of defending against actuator jamming attacks, and design an algorithm to derive it. Finally, the effectiveness of our method is illustrated by an intelligent automated guided vehicle system. © 2016 IEEE.

关键词： Discrete event simulation

来源：评论

学校读者我要写书评

暂无评论

Prioritized Planning for Continuous-time Lifelong Multi-agent Pathfinding

arXiv

引用

arXiv 2025年

作者： Combrink, Alvin Roselli, Sabino Francesco Fabian, Martin Division of Systems and Control Department of Electrical Engineering Chalmers University of Technology Göteborg Sweden

Multi-agent Path Finding (MAPF) is the problem of planning collision-free movements of agents such that they get from where they are to where they need to be. Commonly, agents are located on a graph and can traverse edges. This problem has many variations and has been studied for decades. Two such variations are the continuous-time and the lifelong MAPF problems. In the continuous-time MAPF problem, edges can have non-unit lengths and agents can traverse them at any real-valued time. Additionally, agent volumes are often included. In the lifelong MAPF problem, agents must attend to a continuous stream of incoming tasks. Much work has been devoted to designing solution methods within these two areas. However, to our knowledge, the combined problem of continuous-time lifelong MAPF has yet to be addressed. This work addresses continuous-time lifelong MAPF with agent volumes by presenting the fast and sub-optimal Continuous-time Prioritized Lifelong Planner (CPLP). CPLP continuously re-prioritizes tasks, assigns agents to them, and computes agent plans using a combination of two path planners;one based on CCBS and the other on SIPP. Experimental results with up to 400 agents on graphs with 4000 vertices demonstrate average computation times below 20 ms per call. In online settings where available time to compute plans is limited, CPLP ensures collision-free movement even when failing to meet these time limits. Therefore, the robustness of CPLP highlights its potential for real-world applications. Copyright © 2025, The Authors. All rights reserved.

关键词： Continuous time systems

来源：评论

学校读者我要写书评

暂无评论

Turbulent self-quenching mechanism of high-temperature-gradient arc plasma in a converging–diverging cylinder: a numerical study

引用

International Journal of Heat and Mass Transfer 2025年 250卷

作者： Shigeta, Masaya Inada, Yuki Tanaka, Yasunori Department of Mechanical Systems Engineering Tohoku University Miyagi Japan Department of Electrical and Electronic Systems Saitama University Saitama Japan Division of Electrical Engineering and Computer Science Kanazawa University Ishikawa Japan

Thermofluid dynamic behaviours of SF6 and air flows including arc plasma and non-ionized gas in a converging–diverging cylinder were studied numerically. The arc plasma in SF6 gas was constricted with high temperatures exceeding 20 000 K. It formed a slightly compressible and subsonic flow, whereas the ambient non-ionized gas had temperatures below 1000 K and a compressible flow with island-like supersonic flow zones. The arc plasma in air gas had temperatures lower than 12 000 K and a blurred fringe with a low gradient. The entire fluid region including the plasma formed an incompressible and subsonic flow. The different temperature distributions were attributed to differences of their thermal diffusivities and Reynolds numbers. For the SF6 flow system, SF6 molecules dissociated in the arc plasma to seven atoms. They were ionized to their ions and electrons, causing considerably greater volume expansion and generating both forward and backward flows locally. Impingements of those flows occurred locally. The generated vortices conveyed the thermal energy outward. Great degrees of turbulent mixing of the thermal energy occurred with the mass density fluctuation, which produced outward heat flux much stronger than that produced by either convection or conduction. The arc plasma was quenched effectively. © 2025 The Author(s)

关键词： Turbulent flow

来源：评论

学校读者我要写书评

暂无评论

Stress Matrix-Based Formation control of Multi-Agent systems with Discrete-Time Communication 12

Stress Matrix-Based Formation Control of Multi-Agent Systems...

引用

2024 12th International Conference on systems and control, ICSC 2024

作者： Onuoha, Okechi Ubochi, Brendan Chijioke Kurawa, Suleiman Tang, Zezhi Wu, Changshun Dong, Yi University of Hertfordshire United Kingdom Federal University of Technology The Department of Electrical and Electronic Engineering Akure Nigeria University of Manchester The Department of Electrical Engineering United Kingdom University of Sheffield The Department of Automatic Control and Systems Engineering United Kingdom University Grenoble Alpes Grenoble38000 France The School of Electronics & Computer Science University of Southampton United Kingdom

ISBN: (纸本)9798331531812

This study addresses the affine formation maneuver control of cooperative multi-agent systems (MAS) having periodic inter-agent communication for both static and dynamic leader cases. Here, we focus on the leader-follower MASs. The primary aim of the control system is to steer the entire collection of agents to produce required patterns (geometric) along with any required maneuver through the direct control of only few a selected agents referred to as leaders. Most of the existing works are constrained to either the individual agents communicate with each other in continuous-time or the sample-data scenario where the leaders are stationary or have constant acceleration or velocities. Here, we consider the scenarios where the velocities of the leaders can be time-varying or constant. Here, different cases are addressed and some control laws are proposed. Conditions are established to help guarantee the overall stability of the systems. A simulation study is employed for the illustration of our proposed laws. © 2024 IEEE.

关键词： Continuous time systems

来源：评论

学校读者我要写书评

暂无评论

A Unifying Complexity-Certification Framework for Branch-and-Bound Algorithms for Mixed-Integer Linear and Quadratic Programming

arXiv

引用

arXiv 2025年

作者： Shoja, Shamisa Arnström, Daniel Axehill, Daniel Division of Automatic Control Department of Electrical Engineering Linköping University Sweden Division of Systems and Control Department of Information Technology Uppsala University Sweden

In model predictive control (MPC) for hybrid systems, solving optimization problems efficiently and with guarantees on worst-case computational complexity is critical to satisfy the real-time constraints in these applications. These optimization problems often take the form of mixed-integer linear programs (MILPs) or mixed-integer quadratic programs (MIQPs) that depend on system parameters. A common approach for solving such problems is the branch-and-bound (B&B) method. This paper extends existing complexity certification methods by presenting a unified complexity-certification framework for B&B-based MILP and MIQP solvers, specifically for the family of multi-parametric MILP and MIQP problems that arise in, e.g., hybrid MPC applications. The framework provides guarantees on worst-case computational measures, including the maximum number of iterations or relaxations B&B algorithms require to reach optimality. It systematically accounts for different branching and node selection strategies, as well as heuristics integrated into B&B, ensuring a comprehensive certification framework. By offering theoretical guarantees and practical insights for solver customization, the proposed framework enhances the reliability of B&B for real-time application. The usefulness of the proposed framework is demonstrated through numerical experiments on both random MILPs and MIQPs, as well as on MIQPs arising from a hybrid MPC problem. © 2025, CC BY.

关键词： Branch and bound method

来源：评论

学校读者我要写书评

暂无评论

Parallel Domain-Decomposition Algorithms for Complexity Certification of Branch-and-Bound Algorithms for Mixed-Integer Linear and Quadratic Programming

arXiv

引用

arXiv 2025年

When implementing model predictive control (MPC) for hybrid systems with a linear or a quadratic performance measure, a mixed-integer linear program (MILP) or a mixed-integer quadratic program (MIQP) needs to be solved, respectively, at each sampling instant. Recent work has introduced the possibility to certify the computational complexity of branch-and-bound (B&B) algorithms when solving MILP and MIQP problems formulated as multi-parametric MILPs (mp-MILPs) and mp-MIQPs. Such a framework allows for computing the worst-case computational complexity of standard B&B-based MILP and MIQP solvers, quantified by metrics such as the total number of LP/QP iterations and B&B nodes. These results are highly relevant for real-time hybrid MPC applications. In this paper, we extend this framework by developing parallel, domain-decomposition versions of the previously proposed algorithm, allowing it to scale to larger problem sizes and enable the use of high-performance computing (HPC) resources. Furthermore, to reduce peak memory consumption, we introduce two novel modifications to the existing (serial) complexity certification framework, integrating them into the proposed parallel algorithms. Numerical experiments show that the parallel algorithms significantly reduce computation time while maintaining the correctness of the original framework. © 2025, CC BY.

关键词： Integer linear programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：