Control Ability with Time Attributy for Linear Continous-time Systems
In this paper, the control ability with time attributy for the linear continuous-time (LCT) systems are defined and analyzed by the volume computing for the controllability region. Firstly, a relation theorem about the open-loop control ability, the control strategy space (\textit{i.e.}, the solution space of the input variable for control problems), and the some closed-loop performance for the LCT systems is purposed and proven. This theorem shows us the necessity to optimize the control ability for the practical engineering problems. Secondly, recurssive volume-computing algorithms with the low computing complexities for the finite-time controllability region are discussed. Finally, two analytical volume computations of the infinite-time controllability region for the systems with $n$ different and repeated real eigenvalues are deduced, and then by deconstructing the volume computing equations, 3 classes of the shape factors are constructed. These analytical volume and shape factors can describe accurately the size and shape of the controllability region. Because the time-attribute control ability for LCT systems is directly related to the controllability region with the unit input variables, based on these analytical expressions on the volume and shape factors, the time-attribute control ability can be computed and optimized conveniently.
Code (0)
등록된 구현이 없습니다.
Tasks
AttributeSimilar Papers 제목 키워드 기반
Transfer Function Analysis and Implementation of Active Disturbance Rejection Control
To support the adoption of active disturbance rejection control (ADRC) in industrial practice, this article aims at improving both understanding and implementation of ADRC using traditional means, in particular via trans…
Computational EfficiencySensitivityExploiting Estimation Bias in Clipped Double Q-Learning for Continous Control Reinforcement Learning Tasks
Continuous control Deep Reinforcement Learning (RL) approaches are known to suffer from estimation biases, leading to suboptimal policies. This paper introduces innovative methods in RL, focusing on addressing and exploi…
Computational Efficiencycontinuous-controlContinuous ControlDeep Reinforcement Learning+2Scalable Distributed Algorithms for Size-Constrained Submodular Maximization in the MapReduce and Adaptive Complexity Models
Distributed maximization of a submodular function in the MapReduce (MR) model has received much attention, culminating in two frameworks that allow a centralized algorithm to be run in the MR setting without loss of appr…
ABM: an automatic supervised feature engineering method for loss based models based on group and fused lasso
A vital problem in solving classification or regression problem is to apply feature engineering and variable selection on data before fed into models.One of a most popular feature engineering method is to discretisize co…
Feature EngineeringVariable SelectionDe-identification In practice
We report our effort to identify the sensitive information, subset of data items listed by HIPAA (Health Insurance Portability and Accountability), from medical text using the recent advances in natural language processi…
De-identification