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

Asymptotic state estimation for linear systems with sensor and actuator faults

学校读者我要写书评

暂无评论

science China(Information sciences) 2019年第11期62卷 106-120页

作者： Chun-Hua XIE Hui YANG Dianhui WANG Zhe LI School of Electrical and Automation Engineering East China Jiaotong University Key Laboratory of Advanced Control & Optimization of Jiangxi Province Department of Computer Science and Information Technology La Trobe University College of Electrical and Information Engineering Hunan University

This paper investigates the asymptotic state estimation problem for linear systems with sensor and actuator faults, where the faults are modeled via multiple modes. For the case of sensor faults, we first introduce a new notion of detectability, i.e., detectability of system against sensor faults. The notion helps to address the question of whether it is possible to asymptotically estimate the system state by using the control input and system output, irrespective of which mode the system is in and what values the fault signals are.A necessary and sufficient condition for the system to be detectable against sensor faults is given, and then two switched observers are proposed for asymptotic state estimation with the help of maximin strategy. For the system with ? fault modes, we provide the explicit form of the switched observer, which is based on a bank of ?(?+1)/2 Luenberger-like or sliding-mode observers. Furthermore, extensions to the case of sensor and actuator faults are further studied. Finally, a simulation example of a reduced-order aircraft system is provided to show the effectiveness of the proposed approaches.

关键词： asymptotic state estimation observer linear systems sensor faults actuator faults

Optimization of Directional Landmark Deployment for Visual Observer on SE(3)

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Lei, Zike Chen, Xi Tan, Ying Chen, Xiang Chai, Li The School of Information Science and Engineering Wuhan University of Science and Technology Hubei 430081 China The Engineering Research Center of Metallurgical Automation and Measurement Technology Wuhan University of Science and Technology Hubei 430081 China The School of Electrical Mechanical and Infrastructure Engineering The University of Melbourne VIC3010 Australia The Department of Electrical and Computer Engineering University of Windsor ONN9B 3P4 Canada The College of Control Science and Engineering Zhejiang University Hangzhou310027 China

An optimization method is proposed in this paper for novel deployment of given number of directional landmarks (location and pose) within a given region in the 3-D task space. This new deployment technique is built on the geometric models of both landmarks and the monocular camera. In particular, a new concept of Multiple Coverage Probability (MCP) is defined to characterize the probability of at least n landmarks being covered simultaneously by a camera at a fixed position. The optimization is conducted with respect to the position and pose of the given number of landmarks to maximize MCP through globally exploration of the given 3-D space. By adopting the elimination genetic algorithm, the global optimal solutions can be obtained, which are then applied to improve the convergent performance of the visual observer on SE(3) as a demonstration example. Both simulation and experimental results are presented to validate the effectiveness of the proposed landmark deployment optimization method. © 2022, CC BY-NC-SA.

关键词： Probability

Secure State Estimation against Sparse Attacks on a Time-varying Set of Sensors

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Li, Zishuo Niazi, Muhammad Umar B. Liu, Changxin Mo, Yilin Johansson, Karl H. Department of Automation Tsinghua University Beijing100084 China Division of Decision and Control Systems Digital Futures School of Electrical Engineering and Computer Science KTH Royal Institute of Technology StockholmSE-100 44 Sweden Laboratory for Information and Decision Systems Massachusetts Institute of Technology 77 Massachusetts Avenue CambridgeMA02139 United States

This paper studies the problem of secure state estimation of a linear time-invariant (LTI) system with bounded noise in the presence of sparse attacks on an unknown, time-varying set of sensors. In other words, at each time, the attacker has the freedom to choose an arbitrary set of no more that p sensors and manipulate their measurements without restraint. To this end, we propose a secure state estimation scheme and guarantee a bounded estimation error subject to 2p-sparse observability and a mild, technical assumption that the system matrix has no degenerate eigenvalues. The proposed scheme comprises a design of decentralized observer for each sensor based on the local observable subspace decomposition. At each time step, the local estimates of sensors are fused by a median operator to obtain a secure estimation, which is then followed by a local detection-and-resetting process of the decentralized observers. The estimation error is shown to be upper-bounded by a constant which is determined only by the system parameters and noise magnitudes. Moreover, we design the detector threshold to ensure that the benign sensors never trigger the detector. The efficacy of the proposed algorithm is demonstrated by its application on a benchmark example of IEEE 14-bus system. © 2022, CC BY-NC-ND.

关键词： Fault detection

An Efficient and User-Friendly Software Tool for Ordered Multi-Class Receiver Operating Characteristic Analysis Based on Python

学校读者我要写书评

暂无评论

SSRN

SSRN 2022年

作者： Liu, Shun Yang, Junjie Zeng, Xianxian Song, Haiying Cen, Jian Xu, Weichao Department of Automatic Control School of Automation Guangdong Polytechnic Normal University Guangzhou510650 China Université Paris Saclay CNRS CentraleSupelec Laboratoire des Signaux et Système UMR 8506 Plateau du Moulon 3 Rue Joliot Curie Gif sur Yvette France Guangzhou Intelligent Building Equipment Information Integration and Control Key Laboratory Guangzhou510665 China School of Computer and Science Guangdong Polytechnic Normal University Guangzhou510650 China School of Automation Guangdong University of Technology Guangzhou510006 China

Receiver Operating Characteristic (ROC) analysis is prevalent tool for two-class problems in a wide range of science and engineering areas. The relevant scalar area under the ROC curve (AUC) has been proven to be a robust evaluation index for characterizing the performance of binary statistical models. However, tasks with more than two categories are frequently encountered in practice. As an extension of the ROC curve and AUC in parallel, the hyper ROC surface and the corresponding hyper-volume under the surface (HVUS) have attracted extensive interest. The current mainstream analysis tools of AUC and HVUS are based on the R program language. To provide researchers with an alternative tool for multi-class ROC analysis, in this work, we develop a python-based package and software tool, which allow the users to unbiasedly estimate HVUS, confidently compare HVUSs, flexibly visualize 2D-ROC curve and 3D-ROC surface, etc. © 2022, The Authors. All rights reserved.

关键词： Python

Distributed Online Convex Optimization with Adversarial Constraints: Reduced Cumulative Constraint Violation Bounds under Slater’s Condition

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Yi, Xinlei Li, Xiuxian Yang, Tao Xie, Lihua Hong, Yiguang Chai, Tianyou Johansson, Karl H. Lab for Information & Decision Systems Massachusetts Institute of Technology CambridgeMA02139 United States Department of Control Science and Engineering College of Electronics and Information Engineering Tongji University Shanghai201804 China Shanghai Research Institute for Intelligent Autonomous Systems China The State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China School of Electrical and Electronic Engineering Nanyang Technological University 50 Nanyang Avenue Singapore639798 Singapore Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Digital Futures Stockholm10044 Sweden

This paper considers distributed online convex optimization with adversarial constraints. In this setting, a network of agents makes decisions at each round, and then only a portion of the loss function and a coordinate block of the constraint function are privately revealed to each agent. The loss and constraint functions are convex and can vary arbitrarily across rounds. The agents collaborate to minimize network regret and cumulative constraint violation. A novel distributed online algorithm is proposed and it achieves an O(T max{c,1−c}) network regret bound and an O(T 1−c/2) network cumulative constraint violation bound, where T is the number of rounds and c ∈ (0, 1) is a user-defined trade-off parameter. When Slater’s condition holds (i.e, there is a point that strictly satisfies the inequality constraints), the network cumulative constraint violation bound is reduced to O(T 1−c). Moreover, if the loss functions are strongly convex, then the network regret bound is reduced to O(log(T)), and the network cumulative constraint violation bound is reduced to O(√log(T)T) and O(log(T)) without and with Slater’s condition, respectively. To the best of our knowledge, this paper is the first to achieve reduced (network) cumulative constraint violation bounds for (distributed) online convex optimization with adversarial constraints under Slater’s condition. Finally, the theoretical results are verified through numerical simulations. Copyright © 2023, The Authors. All rights reserved.

关键词： Economic and social effects

Communication Compression for Distributed Nonconvex Optimization

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Yi, Xinlei Zhang, Shengjun Yang, Tao Chai, Tianyou Johansson, Karl H. Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Digital Futures Stockholm100 44 Sweden Department of Electrical Engineering University of North Texas DentonTX76203 United States State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China

This paper considers distributed nonconvex optimization with the cost functions being distributed over agents. Noting that information compression is a key tool to reduce the heavy communication load for distributed algorithms as agents iteratively communicate with neighbors, we propose three distributed primal–dual algorithms with compressed communication. The first two algorithms are applicable to a general class of compressors with bounded relative compression error and the third algorithm is suitable for two general classes of compressors with bounded absolute compression error. We show that the proposed distributed algorithms with compressed communication have comparable convergence properties as state-of-the-art algorithms with exact communication. Specifically, we show that they can find first-order stationary points with sublinear convergence rate O(1/T) when each local cost function is smooth, where T is the total number of iterations, and find global optima with linear convergence rate under an additional condition that the global cost function satisfies the Polyak–Lojasiewicz condition. Numerical simulations are provided to illustrate the effectiveness of the theoretical results. Copyright © 2022, The Authors. All rights reserved.

关键词： Iterative methods

Performing DNA Strand Displacement with DNA Polymerase 14th

学校读者我要写书评

暂无评论

Performing DNA Strand Displacement with DNA Polymerase

14th International Conference on Bio-inspired Computing: Theories and Applications, BIC-TA 2019

作者： Wang, Zhiyu Hu, Yingxin Chen, Zhekun Liao, Sulin Huang, Yabing Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan730074 China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan730074 China Department of Pathology Renmin Hospital of Wuhan University Wuhan430060 China

ISBN: (纸本)9789811534140

Significant improvements to the dynamic DNA nano science have emerged in recent years, primarily due to the elaborate design of toehold-mediated DNA strand displacement (TMSD). However, it remains an ongoing challenge to design huge-scaled TMSD based sophisticated dynamic DNA structures without base-pair mismatching or unwanted secondary structures, because the sequence design complexity of TMSD will dramatically increase as the scale increases. Here we report a new polymerase triggered strand displacement (PTSD) mechanism to realize DNA strand displacement with the potential of constructing complicated dynamic DNA nanostructures. By employing proper polymerase with strand displacement activity, the target strand in a duplex will be displaced and freed during the polymerization. In this manner, DNA strand displacement takes place without considering the design complexity of branch migration domain. The mechanism was successfully applied in constructing one-layer and two-layer circuits in which the parameters involved were explored, suggesting that PTSD is feasible and able to be harnessed to construct cascading DNA circuits with high complexity. © 2020, Springer Nature Singapore Pte Ltd.

关键词： DNA

RETRACTED ARTICLE: An evaluation of AI-based college music teaching using AHP and MOORA

学校读者我要写书评

暂无评论

Soft Computing 2023年第2期28卷 689-689页

作者： Han, Xiao Chen, Fuyang Ullah, Ijaz Faisal, Mohammad College of Automation Engineering Control Science and Engineering Nanjing University of Aeronautics and Astronautics Nanjing China University of Rennes 1 Rennes France Department of Computer Science and Information Technology University of Malakand Chakdara Pakistan

A SINS Error Correction Approach Based on Dual-Threshold ZV Detection and Cubature Kalman Filter

学校读者我要写书评

暂无评论

A SINS Error Correction Approach Based on Dual-Threshold ZV ...

IEEE International Conference on Systems, Man and Cybernetics

作者： Ruijie Xu Shichao Chen Wenqiao Sun Yisheng Lv Jialiang Luo Ying Tang The State Key Laboratory for Management and Control of Complex System State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation Chinese Academy of Sciences College of Information Science & Technology Beijing University of Chemical Technology Beijing China The State Key Laboratory for Management and Control of Complex System State Key Laboratory of Multimodal Artificial Intelligence Systems The Center of National Railway Intelligent Transportation System Engineering and Technology Institute of Automation Chinese Academy of Sciences China Academy of Railway Sciences Corporation Limited Beijing China China Academy of Railway Sciences Corporation Limited Transportation and Economics Research Institute and the Center of National Railway Intelligent Transportation System Engineering and Technology Beijing China The State Key Laboratory for Management and Control of Complex System State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation Chinese Academy of Sciences Beijing China The State Key Laboratory for Management and Control of Complex System State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation Chinese Academy of Sciences School of Information Engineering China University of Geosciences Beijing Beijing China Department of Electrical and Computer Engineering Rowan University Glassboro USA

Global Navigation Satellite Systems (GNSS) can provide real-time positioning information for outdoor users, but cannot for indoor scenarios or heavily occluded outdoor scenarios. Strap-down Inertial Navigation System (SINS) are widely used to locate people in complex interior or heavily occluded outdoor scenarios due to its light weight and low power consumption. However, IMU of SINS are noisy, and the sampling data error is large, which is a divergence of the error with time. Therefore, it will generate a positioning accumulation error, which affects the final positioning accuracy. The problem of cumulative IMU errors is usually dealt with by Zero-Velocity Update (ZUPT). The zero-velocity detection part of basic ZUPT method usually uses a single threshold to determine the gait of pedestrian, which often has the problem of gait misjudgment and omission. To address these problems, this paper proposes a composite conditional detection method to solve the problem of misjudgment in the zero-velocity interval. In addition, we redesign the zero-velocity update algorithm and uses the Cubature Kalman filter (CKF) for pedestrian positioning error correction. The experimental results demonstrate that the proposed ZUPT method based on dual-threshold detection can better detect the interval between pedestrian motion and stationery than ones with single threshold. The zero-velocity update algorithm based on CKF has higher performance than conventional EKF and UKF methods, which constrains the cumulative error of SINS to about 0.2% of the whole walking distance.

关键词：