Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOn algebraic time-derivative estimation and deadbeat state reconstruction
393
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
This note places into perspective the so-called algebraic time-derivative estimation method recently introduced by Fliess and co-authors with standard results from linear state-space theory for control systems. In particular, it is shown that the algebraic method can in a sense be seen as a special case of deadbeat state estimation based on the reconstructibility Gramian of the considered system.
rate research
Read More
Recently developed control methods with strong disturbance rejection capabilities provide a useful option for control design. The key lies in a general concept of disturbance and effective ways to estimate and compensate the disturbance. This work extends the concept of disturbance as the mismatch between a system model and the true dynamics, and estimates and compensates the disturbance for multi-input multi-output linear/nonlinear systems described in a general form. The results presented do not need to assume the disturbance to be independent of the control inputs or satisfy a certain matching condition, and do not require the system to be expressible in an integral canonical form as required by algorithms previously described in literature. The estimator and controller are designed under a state tracking framework, and sufficient conditions for the closed-loop stability are presented. The performance of the resulting controller relies on a co-design of the system model, the state and disturbance observer, and the controller. Numerical experiments on a first-order system and an inverted pendulum under uncertainties are used to illustrate the control design method and demonstrate its efficacy.
In this paper, an attack-resilient estimation algorithm is presented for linear discrete-time stochastic systems with state and input constraints. It is shown that the state estimation errors of the proposed estimation algorithm are practically exponentially stable.
We develop methods to efficiently reconstruct the topology and line parameters of a power grid from the measurement of nodal variables. We propose two compressed sensing algorithms that minimize the amount of necessary measurement resources by exploiting network sparsity, symmetry of connections and potential prior knowledge about the connectivity. The algorithms are reciprocal to established state estimation methods, where nodal variables are estimated from few measurements given the network structure. Hence, they enable an advanced grid monitoring where both state and structure of a grid are subject to uncertainties or missing information.
This paper deals with traffic density reconstruction using measurements from Probe Vehicles (PVs). The main difficulty arises when considering a low penetration rate, meaning that the number of PVs is small compared to the total number of vehicles on the road. Moreover, the formulation assumes noisy measurements and a partially unknown first-order model. All these considerations make the use of machine learning to reconstruct the state the only applicable solution. We first investigate how the identification and reconstruction processes can be merged and how a sparse dataset can still enable a good identification. Secondly, we propose a pre-training procedure that helps the hyperparameter tuning, preventing the gradient descent algorithm from getting stuck at saddle points. Examples using numerical simulations and the SUMO traffic simulator show that the reconstructions are close to the real density in all cases.
Dynamical systems that are subject to continuous uncertain fluctuations can be modelled using Stochastic Differential Equations (SDEs). Controlling such systems results in solving path constrained SDEs. Broadly, these problems fall under the category of Stochastic Differential-Algebraic Equations (SDAEs). In this article, the focus is on combining ideas from the local theory of Differential-Algebraic Equations with that of Stochastic Differential Equations. The question of existence and uniqueness of the solution for SDAEs is addressed by using contraction mapping theorem in an appropriate Banach space to arrive at a sufficient condition. From the geometric point of view, a necessary condition is derived for the existence of the solution. It is observed that there exists a class of high index SDAEs for which there is no solution. Hence, computational methods to find approximate solution of high index equations are presented. The techniques are illustrated in form of algorithms with examples and numerical computations.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
