Persistent Excitation Research Articles

Robust Adaptive Extremum Seeking Control Without Persistence of Excitation: Theory to Experiment

ABSTRACTIn this article, we develop a novel adaptive extremum‐seeking control (AdESC) algorithm with robustness guarantees and without persistence of excitation (PE). Specifically, this builds on a proportional‐integral (PI)‐like parameter estimator. A zeroth‐order optimization framework is used, where the optimizer/agent can only query the numerical value of the cost function at the current coordinate given an unmodeled bounded disturbance. Since parameter estimation plays a decisive role in the stability and convergence properties of AdESC algorithm, it is also well established in the existing literature that to ensure parameter convergence a stringent PE condition is required. Here, we eliminate the need for a stringent PE condition by utilizing a novel set of weighted integral filter dynamics, while ensuring sufficient richness using a milder condition, called initial excitation (IE). Moreover, to validate the robustness guarantees towards unmodeled bounded disturbance, a detailed Lyapunov function based analysis is performed to establish the closed‐loop stability and convergence in the form of uniform ultimate boundedness (UUB). Furthermore, an experimental study using a unicycle wheeled mobile robot (WMR) is carried out as a proof‐of‐concept considering disturbance and disturbance‐free scenarios.

Observer-based adaptive neural network control: the convergence properties analysis under the influence of persistent excitation level

Observer-based adaptive neural network control: the convergence properties analysis under the influence of persistent excitation level

A continuous-discrete adaptive observer with a diagonal gain matrix and sigma-modification: applications in chaos synchronization and dynamical state estimation

In this paper, we propose an improved continuous-discrete observer with enhanced convergence properties and reduced sensitivity to persistent excitations. Our approach introduces several key innovations, including a customised diagonal gain matrix which improves the convergence speed, a sigma-modification technique that relaxes the persistent excitation conditions, and a weighting factor tailored to optimise the estimation of unknown parameters. Through comprehensive numerical experiments, we illustrate the effectiveness of our observer in two distinct scenarios. Firstly, we demonstrate its application in synchronising a 4-component chaotic dynamical system. Secondly, we showcase its utility in tracking a reduced 2-component chemical engineering process. Our simulation results reveal that the proposed observer outperforms existing methods by achieving quicker convergence and higher estimation accuracy. This study contributes to the advancement of adaptive observer design, offering valuable insights for its application across diverse fields.

Adaptive Inverse Nonlinear Optimal Control Based on Finite-Time Concurrent Learning and Semidefinite Programming.

This article investigates the problem of inverse optimal control (IOC) for a class of nonlinear affine systems. An adaptive IOC approach is proposed to recover the cost functional using only the system state data, which integrates the finite-time concurrent learning (FTCL) technique and the semidefinite programming (SDP) technique. First, an identifier neural network (NN) is employed to approximate the unknown nonlinear control policy, and an FTCL-based update law is proposed to estimate the weights of the identifier NN online, which removes the traditional persistent excitation (PE) condition. Moreover, the finite-time convergence as well as the uniformly ultimately boundness (UUB) of estimation error of the identifier NN weights are analysed according to whether or not there exists the identifier NN approximation error. Then, with the help of a value NN for approximating the value function, an SDP problem with a quadratic objective function can be set up for determining the weighting matrices of the cost functional. Finally, simulation results are presented to validate the proposed method.

Reinforcement learning-based robust formation control for Multi-UAV systems with switching communication topologies

This paper introduces a novel optimal robust formation method for quadcopter multiple unmanned aerial vehicle (multi-UAV) systems. Firstly, a reinforcement learning (RL) algorithm based on a unique gradient descent training approach is proposed to solve the Hamilton–Jacobi–Bellman (HJB) equation, which can effectively eliminate the requirement of the Persistent Excitation (PE) condition. Secondly, the robustness of the controlled system is emphasized, and an Uncertainty and Disturbance Estimator (UDE) observer is developed to suppress model uncertainty and external disturbances through filtering techniques. Furthermore, a switched sliding mode control technique according to the average dwell time (ADT) is employed to convert switching communication topology between UAVs dynamically, and the stability analysis of the corresponding closed-loop control systems is then performed by the use of Lyapunov analysis. Finally, the simulation examples are provided to verify the effectiveness of the designed control strategy.

Robust data-driven predictive control for unknown linear time-invariant systems

This paper presents a new robust data-driven predictive control scheme for unknown linear time-invariant systems by using input-state-output or input–output data based on whether the state is measurable. To remove the need for the persistently exciting (PE) condition of a sufficiently high order on pre-collected data, a set containing all systems capable of generating such data is constructed. Then, at each time step, an upper bound on a given objective function is derived for all systems in the set, and a feedback controller is designed to minimize this bound. The optimal control gain at each time step is determined by solving a set of linear matrix inequalities. We prove that if the synthesis problem is feasible at the initial time step, it remains feasible for all future time steps. Unlike current data-driven predictive control schemes based on behavioral system theory, our approach requires less stringent conditions for the pre-collected data, facilitating easier implementation. The effectiveness of our proposed methods is demonstrated through application to an unknown and unstable batch reactor.

Binary Mergers in the Centers of Galaxies: Synergy between Stellar Flybys and Tidal Fields

Galactic centers (GCs) are very dynamically active environments, often harboring a nuclear star cluster and supermassive black hole at their cores. Binaries in these environments are subject to strong tidal fields that can efficiently torque its orbit, exciting near-unity eccentricities that ultimately lead to their merger. In turn, frequent close interactions with passing stars impulsively perturb the orbit of the binary, generally softening their orbit until their evaporation, potentially hindering the role of tides to drive these mergers. In this work, we study the evolution of compact object binaries in the GC and their merger rates, focusing for the first time on the combined effect of the cluster’s tidal field and flyby interactions. We find a significant synergy between both processes, where merger rates increase by a factor of ∼10−30 compared to models in which only flybys or tides are taken into account. This synergy is a consequence of the persistent tides-driven eccentricity excitation that is enhanced by the gradual diffusion of j z driven by flybys. The merger efficiency peaks when the diffusion rate is ∼10−100 slower than the tides-driven torquing. Added to this synergy, we also find that the gradual softening of the binary can lift the relativistic quenching of initially tight binaries, otherwise unable to reach extreme eccentricities, and thus expanding the available phase space for mergers. Cumulatively, we conclude that despite the gradual softening of binaries due to flybys, these greatly enhance their merger rates in GCs by promoting the tidal-field-driven eccentricity excitation.

Neural learning control for sampled‐data nonlinear systems based on Euler approximation and first‐order filter

AbstractThe primary focus of this research paper is to explore the realm of dynamic learning in sampled‐data strict‐feedback nonlinear systems (SFNSs) by leveraging the capabilities of radial basis function (RBF) neural networks (NNs) under the framework of adaptive control. First, the exact discrete‐time model of the continuous‐time system is expressed as an Euler strict‐feedback model with a sampling approximation error. We provide the consistency condition that establishes the relationship between the exact model and the Euler model with meticulous detail. Meanwhile, a novel lemma is derived to show the stability condition of a digital first‐order filter. To address the non‐causality issues of SFNSs with sampling approximation error and the input data dimension explosion of NNs, the auxiliary digital first‐order filter and backstepping technology are combined to propose an adaptive neural dynamic surface control (ANDSC) scheme. Such a scheme avoids the ‐step time delays associated with the existing NN updating laws derived by the common ‐step predictor technology. A rigorous recursion method is employed to provide a comprehensive verification of the stability, guaranteeing its overall performance and dependability. Following that, the NN weight error systems are systematically decomposed into a sequence of linear time‐varying subsystems, allowing for a more detailed analysis and understanding. In order to ensure the recurrent nature of the input variables, a recursive design is employed, thereby satisfying the partial persistent excitation condition specifically designed for the RBF NNs. Meanwhile, it can verify that the NN estimated weights converge to their ideal values. Compared with the common ‐step predictor technology, there is no need to redesign the learning rules due to the designed NN weight updating laws without time delays. Subsequently, after capturing and storing the convergence weights, a novel neural learning dynamic surface control (NLDSC) scheme is specifically formulated by leveraging the acquired knowledge. The introduced methodology reduces computational complexity and facilitates practical implementation. Finally, empirical evidence obtained from simulation experiments validates the efficacy and viability of the proposed methodology.

Neural networks-based composite learning control for robotic systems with predefined time error constraints

This paper investigates the neural networks-based control problem for robotic systems with error constraints. By embedding a new predefined time performance function into an asymmetric barrier function, a predefined time constraints method is proposed with the following features: (1) it is a general approach that can handle asymmetric error constraints and can be directly applied to the predefined performance control for other high-order nonlinear systems without any changing; (2) both settling time and convergent compact set can be preassigned by the user; (3) the results are global i.e., the robot can start arbitrarily within the physical domain. By extending the regression operators with online data memory, a prediction error is constructed, by using which, a new neural networks based composite learning law is constructed to handle unknown dynamics. Compared with the traditional method such as gradient descent algorithm, σ-modification and ϵ-modification which cannot guarantee the convergence of the neural networks weights or can only force the weights to stay around preselected values, the neural networks guarantees that the weights converge to the region around the true values, in particular under a weak interval excitation (IE) condition rather than the typically stringent persistent excitation (PE) condition. The benefits and effectiveness of the proposed control are theoretically authenticated and experimentally validated.

Parameter identification of linear systems with heat sensors subject to unknown space-varying parameters

We extend existing works on control of (finite-dimensional) linear systems with (infinite-dimensional) heat sensors [6]. The extension lies on the one hand, in the fact that all system poles and zeros are unknown and, on the other, in the fact that sensor equations include unknown spatially-varying parameters. These uncertainties make the problem of parameter identification quite challenging. The existing adaptive observers for this type of systems prove not to be applicable in the presence of these uncertainties. Presently, we develop an identification method that involves multi-sine exciting input signals. Doing so, the inaccessible signal at the junction point, between the system and the sensor, can be given an affine parameterized form. It turns out that the identification problem of the sensor is decoupled from that of the system. Then, a parameter estimator involving K-filters is designed to get estimates of the sensor parameters as well as those of the inaccessible signal at the junction point. A new persistent excitation concept is introduced that ensures exponential convergence of the sensor parameter estimates and the estimated junction signal. The latter is then used to identify the parameters of the system dynamics.

Human-in-the-Loop Behavior Modeling via an Integral Concurrent Adaptive Inverse Reinforcement Learning.

One goal of artificial intelligence (AI) research is to teach machines how to learn from humans, such that they can perform a certain task in a natural human-like way. In this article, an online adaptive inverse reinforcement learning (IRL) approach to human behavior modeling is proposed to enhance machine intelligence for a class of linear human-in-the-loop (HiTL) systems using the state data only, where the human behavior is described by a linear quadratic optimal control model with an unknown weighting matrix for the quadratic cost function. First, an integral concurrent adaptive law is developed to learn the human feedback gain matrix online using the demonstrated state data only, which removes the persistent excitation (PE) conditions required by traditional adaptive estimation approaches and thus is more in line with real applications. Then, with the learned feedback gain matrix, the IRL problem is formulated as a linear matrix inequality (LMI) optimization problem, which can be efficiently solved to retrieve the weighting matrix of the human cost function. Finally, a simulation example is provided to illustrate the effectiveness of the proposed approach.

A novel concurrent learning-based fixed-time convergent visual depth observer for weakly persistently exciting perspective dynamical systems

The problem of synthesizing a fixed-time depth observer based on monocular image feedback is considered in this study. The key challenge lies in the fact that the perspective dynamical system used to model visual motion is typically characterized as being weakly persistently exciting, which complicates observer synthesis. Furthermore, the key to achieving the task objective (safe obstacle avoidance, for instance) lies in the synthesis of a depth observer that achieves rapid convergence of the (static) obstacle depth estimate to the ground truth in a known fixed-time. To address these challenges, and in contrast with prior schemes that rely on a motion-restrictive persistency of excitation (PE) condition for ensuring exponential convergence, a novel adaptive observer framework is considered in this study that incorporates a concurrent learning (CL) term for ensuring fixed-time observer convergence. In particular, the use of concurrent learning allows for the synthesis of a relaxed finite-time excitation condition that relies on historical data recorded over a dynamic sliding window in the recent past that the proposed observer relies on to ensure fixed-time convergence. Thus, a continuous-time reduced-order observer formulation is presented that relies on camera motion data to achieve fixed-time convergence to a uniform ultimate bound for a suitably large choice of the observer gains. Experimental results are used to demonstrate the efficacy of the proposed scheme in the presence of significant measurement noise. A performance comparison study is also undertaken to demonstrate superior performance of the proposed scheme compared to leading alternative designs. Finally, the practical applicability of the proposed scheme is verified by incorporating the proposed scheme within a reactive navigation scheme to accomplish obstacle avoidance. By incorporating a suitably informative CL term within the observer framework, the proposed scheme eliminates the need to rely on a difficult-to-verify PE condition, thus rendering it more suitable for practical applications like visual target-tracking and visual servo control.

Disturbance observer‐based matrix‐weighted consensus

AbstractIn this paper, we proposed several disturbance observer‐based matrix‐weighted consensus algorithms. A new disturbance observer is firstly designed for linear systems with unknown matched or mismatched disturbances representable as the multiplication of a known time‐varying matrix with a unknown constant vector. Under some assumptions on the boundedness and persistent excitation of the regression matrix, the disturbances can be estimated at an exponential rate. Then, a suitable compensation input is provided to compensate the unknown disturbances. Second, disturbance‐observer based consensus algorithms are proposed for matrix‐weighted networks of single‐ and double‐integrators with matched or mismatched disturbances. We show that both matched and mismatched disturbances can be estimated and actively compensated, and the consensus system uniformly globally asymptotically converges to a fixed point in the kernel of the matrix‐weighted Laplacian. Depending on the network connectivity, the system can asymptotically achieve a consensus or a cluster configuration. The disturbance‐observer based consensus design is further extended for a network of higher‐order integrators subjected to disturbances. Finally, simulation results are provided to support the mathematical analysis.

Improving breathing effort estimation in mechanical ventilation via optimal experiment design

Estimation of the breathing effort and relevant lung parameters of a ventilated patient is essential to keep track of a patient’s clinical condition. The aim of this paper is to increase estimation accuracy through experiment design. The main method is an experiment design approach across multiple breaths within a linear regression framework to accurately identify the patient’s condition. Identifiability and persistence of excitation are used to formulate an estimation problem with a unique solution. Furthermore, Fisher information is used for assessing the parameters sensitivity to slight changes of the ventilator settings to improve the variance of the estimation. The estimation method is applied to simulated patients who breathe regularly but also to patients who have variable breathing patterns. A virtual experiment is conducted for both situations to generate estimation results. The results are analyzed using mathematical tools and show that uniquely estimating the lung parameters and breathing effort over multiple breaths for both regularly and variably breathing patients is possible in the presented framework. The proposed estimation method obtains clinically relevant estimates for a large set of breathing disturbances from the simulation case-study.

Distributed Optimal Attitude Synchronization Control of Multiple QUAVs via Adaptive Dynamic Programming.

This article proposes a distributed optimal attitude synchronization control strategy for multiple quadrotor unmanned aerial vehicles (QUAVs) through the adaptive dynamic programming (ADP) algorithm. The attitude systems of QUAVs are modeled as affine nominal systems subject to parameter uncertainties and external disturbances. Considering attitude constraints in complex flying environments, a one-to-one mapping technique is utilized to transform the constrained systems into equivalent unconstrained systems. An improved nonquadratic cost function is constructed for each QUAV, which reflects the requirements of robustness and the constraints of control input simultaneously. To overcome the issue that the persistence of excitation (PE) condition is difficult to meet, a novel tuning rule of critic neural network (NN) weights is developed via the concurrent learning (CL) technique. In terms of the Lyapunov stability theorem, the stability of the closed-loop system and the convergence of critic NN weights are proved. Finally, simulation results on multiple QUAVs show the effectiveness of the proposed control strategy.

Zero‐sum game‐based H∞ optimal finite‐time prescribed performance control for nonlinear multiagent systems with actuator faults

AbstractThis article proposes an optimal leader‐follower consensus control protocol with finite‐time prescribed performance for nonlinear multiagent systems suffering from the actuator fault based on the zero‐sum game framework. First, to guarantee the specified performance of the system within a finite time frame, a novel error transformation function (ETF) is constructed. The ETF proposed in this paper can adjust the mapping range of error transformation to achieve better error convergence performance, thereby enhancing the flexibility of the controller design. Then, to compensate for the negative impact of actuator fault, an error‐related item is separated from the optimal performance index function to design an online fault estimator, which can obtain a better error estimation accuracy. Furthermore, to lessen the need for difficult‐to‐verify persistent excitation signal in adaptive dynamic programming algorithm, both historical and real‐time data are applied to adjust the updating law of neural network weight. Moreover, it demonstrates that the signals within the closed‐loop system are bounded and the expected finite‐time prescribed performance can be ensured in the presence of faults. Finally, a numerical example of multiple single‐link robots manipulator system is executed to validate the efficacy of the developed scheme.

Asymptotically efficient Quasi-Newton type identification with quantized observations under bounded persistent excitations

This paper is concerned with the optimal identification problem of dynamical systems in which only quantized output observations are available under the assumption of fixed thresholds and bounded persistent excitations. Based on a time-varying projection, a weighted Quasi-Newton type projection (WQNP) algorithm is proposed. With some mild conditions on the weight coefficients, the algorithm is proved to be mean square and almost surely convergent, and the convergence rate can be the reciprocal of the number of observations, which is the same order as the optimal estimate under accurate measurements. Furthermore, inspired by the structure of the Cramér–Rao lower bound, an information-based identification (IBID) algorithm is constructed with an adaptive design about weight coefficients of the WQNP algorithm, where the weight coefficients are related to the parameter estimates which leads to the essential difficulty of algorithm analysis. Beyond the convergence properties, this paper demonstrates that the IBID algorithm tends asymptotically to the Cramér–Rao lower bound, and hence is asymptotically efficient. A numerical example is simulated to show the effectiveness of the proposed algorithms.

Adaptive accelerated proximal gradient algorithm for auto-regressive exogenous models with outliers

This study introduces an enhanced recursive least-squares algorithm that applies the adaptive accelerated proximal gradient method to identify Auto-Regressive Exogenous models with output outliers. First, the outlier problem was converted into a robust principal component analysis problem. The adaptive accelerated proximal gradient method is then introduced to recover the information matrix, and the recursive least squares algorithm is applied to estimate the model parameters. Furthermore, we demonstrated that the parameter estimation is unbiased and that the parameter estimation error converges to zero under persistent excitation. A series of bench tests consistently highlighted the practicality and effectiveness of the proposed algorithm.

Self-error learning framework-based algorithm for parameter recovery of extended Wiener–Hammerstein systems subject to quantised measurements

In this study, a novel estimation scheme is proposed for identifying extended Wiener–Hammerstein systems with hysteresis nonlinearity subject to quantised measurements. The proposed scheme is established in a self-error learning framework to achieve high-performance parameter estimation compared with classic error feedback learning estimation algorithms. Initially, the useful identification data can be extracted from contaminated system data by introducing an adaptive filter. Then, with the help of the filtered data, the identification error expression used to establish the estimator is derived. Subsequently, an online compensation estimation error variable is proposed to eliminate the effect of the regression vector on the convergence performance. A new adaptive law is designed with adaptive recursive gain, considering the compensation estimation error data and parameter initial error data. Under general persistent excitation (PE) condition, the PE condition of the regressor information is verified online, and the estimator convergence is strictly proven. Finally, the statistical results of two illustrated examples and a real-word example are provided to validate the positive features and effectiveness of the proposed estimation scheme.

Concurrent Learning Robust Adaptive Fault Tolerant Boundary Regulation of Hyperbolic Distributed Parameter Systems.

This article develops a robust adaptive boundary output regulation approach for a class of complex anticollocated hyperbolic partial differential equations subjected to multiplicative unknown faults in both the boundary sensor and actuator. The regulator design is based on the internal model principle, which amounts to stabilize a coupled cascade system, which consists of a finite-dimensional internal model driven by a hyperbolic distributed parameter system (DPS). To this end, a systematic sliding mode equipped with a backstepping approach is developed such that the robust state feedback control can be realized. Moreover, since the available information is a faulty boundary measurement at the right side point, state estimation is required. However, due to the presence of boundary unknown faults, we need to solve an issue of joint fault-state estimation. Restrictive persistent excitation conditions are usually required to guarantee the exact estimation of faults but are unrealistic in practice. To this end, a novel concurrent learning (CL) adaptive observer is proposed so that exponential convergence is obtained. It is the first time that the spirit of CL is introduced to the field of DPSs. Consequently, the observer-based adaptive boundary fault tolerant control scheme is developed, and rigorous theoretical analysis is given such that the exponential output regulation can be achieved. Finally, the effectiveness of the proposed methodology is demonstrated via comparative simulations.