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

Event-triggered attitude tracking for rigid spacecraft

Science China(Information Sciences) 2019年第12期62卷 178-193页

作者： Deheng CAI Hengguang ZOU Junzheng WANG Yuan HUANG Dawei SHI State Key Laboratory of Intelligent Control and Decision of Complex Systems School of AutomationBeijing Institute of Technology China Academy of Space Technology

This study aims to investigate the problem of attitude control for a spacecraft with inertial uncertainties, external disturbances, and communication restrictions. An event-triggered active disturbance rejection control approach is proposed for attitude tracking of the spacecraft. An event-triggered mechanism is introduced together with an extended state observer to jointly monitor the system states and total disturbances. The observation error is proved to be uniformly bounded. Based on the proposed control scheme,the integrated tracking system is shown to be asymptotically stable, implying successful attitude tracking of the spacecraft for the desired motion. Numerical results illustrate the effectiveness of the control strategy in achieving satisfactory tracking performance with a reduced data-transmission cost.

关键词： spacecraft attitude tracking active disturbance rejection control event-triggered control extended state observer

来源：评论

学校读者我要写书评

暂无评论

Design of Variance-Constrained H∞state Estimation Algorithm for Delayed Memristive Neural Networks with Attacks: An Adaptive Event-Triggered Approach 8

Design of Variance-Constrained H∞State Estimation Algorithm...

引用

8th IEEE International Conference on Cloud Computing and Intelligence systems, CCIS 2022

作者： Gao, Yan Hu, Jun Yu, Hui Jia, Chaoqing Harbin University of Science and Technology Department of Mathematics Harbin150080 China Harbin University of Science and Technology School of Automation Harbin150080 China Harbin University of Science and Technology Heilongjiang Prov. Key Lab. of Optimization Control and Intelligent Analysis for Complex Systems Harbin150080 China

ISBN: (纸本)9781665477352

This paper studies the algorithm design of variance-constrained H∞ state estimation problem for delayed memristive neural networks with adaptive event-triggered mechanism. The denial-of-service attacks are modeled by a series of random variables obeying the Bernoulli distribution with known probability. In addition, the adaptive event-triggered mechanism is introduced into the sensor-to-estimator to avoid unnecessary resource consumption. Our purpose is to construct a finite-horizon state estimation algorithm, and sufficient condition is obtained for the estimation error system satisfying the H∞ performance requirement and the error variance boundedness. Finally, a numerical example is used to illustrate the feasibility of the presented H∞ state estimation algorithm. © 2022 IEEE.

关键词： state estimation

来源：评论

学校读者我要写书评

暂无评论

Model-Based and Data-Driven control of Event- and Self-Triggered Discrete-Time LTI systems

arXiv

引用

arXiv 2022年

作者： Wang, Xin Berberich, Julian Sun, Jian Wang, Gang Allgöwer, Frank Chen, Jie The Key Laboratory of Intelligent Control and Decision of Complex System Beijing Institute of Technology Beijing10081 China The Beijing Institute of Technology Chongqing Innovation Center Chongqing401120 China The University of Stuttgart Institute for Systems Theory and Automatic Control Stuttgart70550 Germany The Department of Control Science and Engineering Tongji University Shanghai201804 China The State Key Lab of Intelligent Control and Decision of Complex Systems School of Automation Beijing Institute of Technology Beijing100081 China

The present paper considers the model-based and data-driven control of unknown linear time-invariant discretetime systems under event-triggering and self-triggering transmission schemes. To this end, we begin by presenting a dynamic event-triggering scheme (ETS) based on periodic sampling, and a discrete-time looped-functional approach, through which a model-based stability condition is derived. Combining the model-based condition with a recent data-based system representation, a data-driven stability criterion in the form of linear matrix inequalities (LMIs) is established, which also offers a way of co-designing the ETS matrix and the controller. To further alleviate the sampling burden of ETS due to its continuous/periodic detection, a self-triggering scheme (STS) is developed. Leveraging pre-collected input-state data, an algorithm for predicting the next transmission instant is given, while achieving system stability. Finally, numerical simulations showcase the efficacy of ETS and STS in reducing data transmissions as well as of the proposed co-design methods. Copyright © 2022, The Authors. All rights reserved.

关键词： Linear matrix inequalities

来源：评论

学校读者我要写书评

暂无评论

Data-driven Self-triggered control via Trajectory Prediction

arXiv

引用

arXiv 2022年

作者： Liu, Wenjie Sun, Jian Wang, Gang Bullo, Francesco Chen, Jie The State Key Lab of Intelligent Control and Decision of Complex Systems The School of Automation Beijing Institute of Technology Beijing100081 China The Beijing Institute of Technology Chongqing Innovation Center Chongqing401120 China The Mechanical Engineering Department The Center of Control Dynamical Systems and Computation UC Santa BarbaraCA93106-5070 United States The Department of Control Science and Engineering Tongji University Shanghai201804 China The State Key Lab of Intelligent Control and Decision of Complex Systems Beijing Institute of Technology Beijing100081 China

Self-triggered control, a well-documented technique for reducing the communication overhead while ensuring desired system performance, is gaining increasing popularity. However, existing methods for self-triggered control require explicit system models that are assumed perfectly known a priori. An end-to-end control paradigm known as data-driven control learns control laws directly from data, and offers a competing alternative to the routine system identification-then-control method. In this context, the present paper puts forth data-driven self-triggered control schemes for unknown linear systems using data collected offline. Specifically, for output feedback control systems, a data-driven model predictive control (MPC) scheme is proposed, which computes a sequence of control inputs while generating a predicted system trajectory. A data-driven self-triggering law is designed using the predicted trajectory, to determine the next triggering time once a new measurement becomes available. For state feedback control systems, instead of capitalizing on MPC to predict the trajectory, a data-fitting problem using the pre-collected input-state data is solved, whose solution is employed to construct the self-triggering mechanism. Both feasibility and stability are established for the proposed self-triggered controllers, which are validated using numerical examples. © 2022, CC BY.

关键词： Model predictive control

来源：评论

学校读者我要写书评

暂无评论

A Cell Potential and Motion Pattern Driven Multi-robot Coverage Path Planning Algorithm 14th

A Cell Potential and Motion Pattern Driven Multi-robot Cover...

引用

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

作者： Xu, Meng Xin, Bin Dou, Lihua Gao, Guanqiang School of Automation State Key Laboratory of Intelligent Control and Decision of Complex Systems Beijing Advanced Innovation Center for Intelligent Robots and Systems Beijing Institute of Technology Beijing100081 China

ISBN: (纸本)9789811534249

This paper proposes an intelligent "Cell Potential and Motion Pattern driven Coverage (CPMPC)" algorithm to solve a cooperative coverage path planning problem for multiple robots in two-dimensional target environment. The target environment is divided into cell areas according to the detection range of robot, and the cell matrix is given correspondingly. The values in the cell matrix are defined as cell potential, which represents the number of times each cell is detected by robots. The priority of the robot’s neighbor cell is called the motion pattern. At different moments, robots can choose within different motion patterns. Genetic algorithm (GA) is used to optimize the combination of motion patterns. By taking account obstacle avoidance and collision avoidance into consideration, the CPMPC algorithm adopts a double-layer choice strategy driven by cell potential and motion pattern to generate the next waypoint. Furthermore, this algorithm contains two optimal strategies: avoiding collision and jumping out of the detected area. Compared with the pattern-based genetic algorithm, the results obtained by us show that the CPMPC algorithm could solve the multi-robot coverage path planning (MCPP) problem effectively with guarantee of complete coverage, and improved makespan. © 2020, Springer Nature Singapore Pte Ltd.

关键词： Multipurpose robots

来源：评论

学校读者我要写书评

暂无评论

Fast Trajectory Planning for Dubins Vehicles Under Cumulative Probability of Radar Detection

SSRN

引用

SSRN 2022年

作者： Li, Zhuo You, keyou Sun, Jian Song, Shiji State Key Lab of Intelligent Control and Decision of Complex Systems School of Automation Beijing Institute of Technology Beijing100081 China Department of Automation and BNRist Tsinghua University Beijing100084 China Beijing Institute of Technology Chongqing Innovation Center Chongqing401120 China

This paper studies a minimum-time trajectory planning problem under radar detection, where a Dubins vehicle aims to attack a target with a limited probability of being detected. Since the probability is accumulated along the vehicle's trajectory in an integral form, we have to address a non-convex constrained functional optimization problem. To this end, Pontryagin's minimum principle is first adopted to derive the optimality condition, based on which we obtain a set of parameterized trajectories that contains all the optimal ones. Then, fast algorithms are proposed to approximately compute a minimum-time trajectory among the set. Simulations are performed to validate the effectiveness and efficiency of the proposed planning algorithms. © 2022, The Authors. All rights reserved.

关键词： Probability

来源：评论

学校读者我要写书评

暂无评论

Compound Fault Separation and Diagnosis Method Based on FSA-CNN and DAN

Compound Fault Separation and Diagnosis Method Based on FSA-...

引用

Fault Detection, Supervision and Safety for Technical Processes (SAFEPROCESS), CAA Symposium on

作者： Jiechao Dong Liping Yan Yuanqing Xia Key Laboratory of Intelligent Control and Decision of Complex Systems School of Automation Beijing Institute of Technology Beijing China

ISBN: (纸本)9781665401166

With the industry becoming larger and more complicated, the technology of fault diagnosis becomes more and more important. Due to the strong coupling and non-stationarity of the compound fault, the existing fault diagnosis methods cannot accurately identify all single faults’ detailed information contained in the compound fault. This paper proposes a compound fault separation and diagnosis method based on FSACNN and DAN. Firstly, in order to highlight certain frequency segments, frequency segment attention module is added to CNN. Secondly, a compound fault feature separation framework based on DAN is proposed, which can separate compound fault to two fault components accurately. Thiredly, a signature matrix is introduced into ELM to improve the performance of the classifier. Finally, ablation experiments are designed to prove the advantage of the proposed method.

关键词： Fault diagnosis Industries Couplings Fault detection Feature extraction Safety Compounds

来源：评论

学校读者我要写书评

暂无评论

Generating Waste Heat Energy from CPU Based on Thermoelectric Power Generator

Generating Waste Heat Energy from CPU Based on Thermoelectri...

引用

Chinese automation Congress (CAC)

作者： Kun Qian Yeyun Cai Kun Xu Fang Deng School of Automation Beijing Institute of Technology Beijing China Key Laboratory of Intelligent Control and Decision of Complex Systems

ISBN: (纸本)9781665426480

Heat dissipation is extremely important for electronic component such as CPU or GPU of the computer. Now most researchers only design optimal heat sink for CPU for better heat dissipation, while few of them consider waste heat recycling of CPU. The CPU can be used as the heat source, while the original system has fan and heat sink as the cooling system. Thus, the original CPU working condition is very suitable for thermoelectric power generation and will bring great benefit to system itself. However, adding thermoelectric generator will increase the temperature of CPU, which will decrease the performance of the computer. It is necessary to reduce the hot side temperature while generating energy as much as possible. To achieve this, this paper designed a kind of intelligent waste heat generation system based on thermoelectric power generator. Three different shape heat sinks are designed, contrasted, and tested. By building experimental platform and establishing simulation model, the power of thermoelectric power generation and temperature change of the three heat sink structures are compared. The fin shaped heat sink is considered has the best output performance while keeping the hot side temperature within the acceptance range. The maximum output power is 10.67mW, and the maximum hot side temperature is 72°C during the experiment.

关键词： Temperature distribution Shape Cogeneration Generators Central Processing Unit Waste heat Trigeneration

来源：评论

学校读者我要写书评

暂无评论

Aerial battlefield targets grouping based on DTW-DBSCAN algorithm

Aerial battlefield targets grouping based on DTW-DBSCAN algo...

引用

第40届中国控制会议

作者： Shao Zhuang Chen Chen School of Automation Beijing Institute of Technology State Key Laboratory of Intelligent Control and Decision of Complex System

Targets grouping is the basis of second-level information fusion,which can effectively assist commanders to make *** aerial targets grouping algorithm only takes the radar acquisition data at the current time as the object and cannot update the clustering results automatically.A grouping method combining dynamic time warping(DTW) and the algorithm Density-Based Spatial Clustering of Applications with Noise(DBSCAN) is *** DTW distance of each attribute historical time-series data is used to measure the similarity between ***,an improved DBSCAN algorithm is used for *** simulation results show that the method has better grouping effect and can automatically cluster regularly.

关键词： targets grouping dynamic time warping density clustering

来源：评论

学校读者我要写书评

暂无评论

A-STC: auction-based spanning tree coverage algorithm for motion planning of cooperative robots

引用

Frontiers of Information Technology & Electronic Engineering 2019年第1期20卷 18-31页

作者： Guan-qiang GAO Bin XIN School of Automation Beijing Institute of Technology Key Laboratory of Intelligent Control and Decision of Complex Systems Beijing Advanced Innovation Center for Intelligent Robots and Systems

The multi-robot coverage motion planning(MCMP) problem in which every reachable area must be covered is common in multi-robot systems. To deal with the MCMP problem, we propose an efficient, complete, and off-line algorithm, named the "auction-based spanning tree coverage(A-STC)" algorithm. First, the configuration space is divided into mega cells whose size is twice the minimum coverage range of a robot. Based on connection relationships among mega cells, a graph structure can be obtained. A robot that circumnavigates a spanning tree of the graph can generate a coverage trajectory. Then, the proposed algorithm adopts an auction mechanism to construct one spanning tree for each robot. In this mechanism, an auctioneer robot chooses a suitable vertex of the graph as an auction item from neighboring vertexes of its spanning tree by heuristic rules. A bidder robot submits a proper bid to the auctioneer according to the auction vertexes' relationships with the spanning tree of the robot and the estimated length of its trajectory. The estimated length is calculated based on vertexes and edges in the spanning tree. The bidder with the highest bid is selected as a winner to reduce the makespan of the coverage task. After auction processes, acceptable coverage trajectories can be planned rapidly. Computational experiments validate the effectiveness of the proposed MCMP algorithm and the method for estimating trajectory lengths. The proposed algorithm is also compared with the state-of-the-art algorithms. The comparative results show that the A-STC algorithm has apparent advantages in terms of the running time and the makespan for large crowded configuration spaces.

关键词： Coverage motion planning Multi-robot system Auction algorithm Spanning tree coverage algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：