Least Squares Based Adaptive Control and Extremum Seeking with Active Vehicle Safety System Applications

On-line parameter estimation is one of the two key components of a typical adaptive control scheme, beside the particular control law to be used. Gradient and recursive least squares (RLS) based parameter estimation algorithms are the most widely used ones among others. Adaptive control studies in the literature mostly utilize gradient based parameter estimators for convenience in nonlinear analysis and Lyapunov analysis based constructive design. However, simulations and real-time experiments reveal that, compared to gradient based parameter estimators, RLS based parameter estimators, with proper selection of design parameters, exhibit better transient performance from the aspects of speed of convergence and robustness to measurement noise. One reason for the control theory researchers' preference of gradient algorithms to RLS ones is that there does not exist a well-established stability and convergence analysis framework for adaptive control schemes involving RLS based parameter estimation. Having this fact as one of the motivators, this thesis is on systematic design, formal stability and convergence analysis, and comparative numerical analysis of RLS parameter estimation based adaptive control schemes and extension of the same framework to adaptive extremum seeking, viz. adaptive search for (local) extremum points of a certain field. Extremum seeking designs apply to (i) finding locations of physical signal sources, (ii) minimum or maximum points of (vector) cost or potential functions for optimization, (iii) calculating optimal control parameters within a feedback control design. In this thesis, firstly, gradient and RLS based on-line parameter estimation schemes are comparatively analysed and a literature review on RLS estimation based adaptive control is provided. The comparative analysis is supported with a set of simulation examples exhibiting transient performance characteristics of RLS based parameter estimators, noting absence of such a detailed comparison study in the literature. The existing literature on RLS based adaptive control mostly follows the indirect adaptive control approach as opposed to the direct one, because of the difficulty in integrating an RLS based adaptive law within the direct approaches starting with a certain Lyapunov-like cost function to be driven to (a neighborhood) of zero. A formal constructive analysis framework for integration of RLS based estimation to direct adaptive control is proposed following the typical steps for gradient adaptive law based direct model reference adaptive control, but constructing a new Lyapunov-like function for the analysis. After illustration of the improved performance with RLS adaptive law via some simple numerical examples, the proposed RLS parameter estimation based direct adaptive control scheme is successfully applied to vehicle antilock braking system control and adaptive cruise control. The performance of the proposed scheme is numerically analysed and verified via Matlab/Simulink and CarSim based simulation tests. Similar to the direct adaptive control works, the extremum seeking approaches proposed in the literature commonly use gradient/Newton based search algorithms. As an alternative to these search algorithms, this thesis studies RLS based on-line estimation in extremum seeking aiming to enhance the transient performance compared to the existing gradient based extremum seeking. The proposed RLS estimation based extremum seeking approach is applied to active vehicle safety system control problems, including antilock braking system control and traction control, supported by Matlab/Simulink and CarSim based simulation results demonstrating the effectiveness of the proposed approach

A Novel Family of Adaptive Filtering Algorithms Based on The Logarithmic Cost

We introduce a novel family of adaptive filtering algorithms based on a relative logarithmic cost. The new family intrinsically combines the higher and lower order measures of the error into a single continuous update based on the error amount. We introduce important members of this family of algorithms such as the least mean logarithmic square (LMLS) and least logarithmic absolute difference (LLAD) algorithms that improve the convergence performance of the conventional algorithms. However, our approach and analysis are generic such that they cover other well-known cost functions as described in the paper. The LMLS algorithm achieves comparable convergence performance with the least mean fourth (LMF) algorithm and extends the stability bound on the step size. The LLAD and least mean square (LMS) algorithms demonstrate similar convergence performance in impulse-free noise environments while the LLAD algorithm is robust against impulsive interferences and outperforms the sign algorithm (SA). We analyze the transient, steady state and tracking performance of the introduced algorithms and demonstrate the match of the theoretical analyzes and simulation results. We show the extended stability bound of the LMLS algorithm and analyze the robustness of the LLAD algorithm against impulsive interferences. Finally, we demonstrate the performance of our algorithms in different scenarios through numerical examples.Comment: Submitted to IEEE Transactions on Signal Processin

Underdetermined-order recursive least-squares adaptive filtering: The concept and algorithms

Published versio

Experimental comparison of parameter estimation methods in adaptive robot control

In the literature on adaptive robot control a large variety of parameter estimation methods have been proposed, ranging from tracking-error-driven gradient methods to combined tracking- and prediction-error-driven least-squares type adaptation methods. This paper presents experimental data from a comparative study between these adaptation methods, performed on a two-degrees-of-freedom robot manipulator. Our results show that the prediction error concept is sensitive to unavoidable model uncertainties. We also demonstrate empirically the fast convergence properties of least-squares adaptation relative to gradient approaches. However, in view of the noise sensitivity of the least-squares method, the marginal performance benefits, and the computational burden, we (cautiously) conclude that the tracking-error driven gradient method is preferred for parameter adaptation in robotic applications

Blind adaptive constrained reduced-rank parameter estimation based on constant modulus design for CDMA interference suppression

This paper proposes a multistage decomposition for blind adaptive parameter estimation in the Krylov subspace with the code-constrained constant modulus (CCM) design criterion. Based on constrained optimization of the constant modulus cost function and utilizing the Lanczos algorithm and Arnoldi-like iterations, a multistage decomposition is developed for blind parameter estimation. A family of computationally efficient blind adaptive reduced-rank stochastic gradient (SG) and recursive least squares (RLS) type algorithms along with an automatic rank selection procedure are also devised and evaluated against existing methods. An analysis of the convergence properties of the method is carried out and convergence conditions for the reduced-rank adaptive algorithms are established. Simulation results consider the application of the proposed techniques to the suppression of multiaccess and intersymbol interference in DS-CDMA systems