Mechanical Engineering - Research Publications
Permanent URI for this collection
Search Results
1 - 7 of 7
-
ItemExtremum seeking control for nonlinear systems on compact Riemannian manifolds(IEEE Press, 2014)This paper formulates the extremum seeking control problem for nonlinear dynamical systems which evolve on Riemannian manifolds and presents stability results for a class of numerical algorithms defined in this context. The results are obtained based upon an extension of extremum seeking algorithms in Euclidean spaces and a generalization of Lyapunov stability theory for dynamical systems defined on Rimannian manifolds. We employ local properties of Lyapunov functions to extend the singular perturbation analysis on Riemannian manifolds. Consequently, the results of the singular perturbation on manifolds are used to obtain the convergence of extremum seeking algorithms for dynamical systems on Riemannian manifolds.
-
ItemExtremum Seeking Methods for Online Automotive Calibration(Springer, 2014-01-01)The automotive calibration process is becoming increasingly difficult as the degrees of freedom in modern engines rises with the number of actuators. This is coupled with the desire to utilise alternative fuels to gasoline and diesel for the promise of lower CO2 levels in transportation. However, the range of fuel blends also leads to variability in the combustion properties, requiring additional sensing and calibration effort for the engine control unit (ECU). Shifting some of the calibration effort online whereby the engine controller adjusts its operation to account for the current operating conditions may be an effective alternative if the performance of the controller can be guaranteed within some performance characteristics. This tutorial chapter summarises recent developments in extremum seeking control, and investigates the potential of these methods to address some of the complexity in developing fuel-flexible controllers for automotive powertrains.
-
ItemMulti-agent gradient climbing via extremum seeking control(IFAC - International Federation of Automatic Control, 2014)A unified framework based on discrete-time gradient-based extremum seeking control is proposed to localise an extremum of an unknown scalar field distribution using a group of equipped with sensors. The controller utilises estimates of gradients of the field from local dithering sensor measurements collected by the mobile agents. It is assumed that distributed coordination which ensures uniform asymptotic stability with respect to a prescribed formation of the agents is employed. The framework is useful in that a broad range of nonlinear programming algorithms can be combined with a wide class of cooperative control laws to perform extreme source seeking. Semi-global practical asymptotically stable convergence to local extrema is established in the presence of bounded field sampling noise.
-
ItemImproving L₂ Gain Performance of Linear Systems by Reset Control(IFAC - International Federation of Automatic Control, 2014)In this paper, new Lyapunov-based reset rules are constructed to improve C2 gain performance of linear-time-invariant (LTI) systems. By using the hybrid system framework, sufficient conditions for exponential and finite gain C2 stability are presented. It is shown that the C2 gain of the closed loop system with resets can be improved compared with the base system. Numerical example supports our results.
-
ItemOnline optimization of spark advance in alternative fueled engines using extremum seeking control(Elsevier, 2014-08-01)Alternative fueled engines offer greater challenges for engine control courtesy of uncertain fuel composition. This makes optimal tuning of input parameters like spark advance extremely difficult in most existing ECU architectures. This paper proposes the use of grey-box extremum seeking techniques to provide real-time optimization of the spark advance in alternative fueled engines. Since practical implementation of grey-box extremum seeking methods is typically done using digital technology, this paper takes advantage of emulation design methods to port the existing continuous-time grey-box extremum seeking methods to discrete-time frameworks. The ability and flexibility of the proposed discrete-time framework is demonstrated through simulations and in practical situation using a natural gas fueled engine.
-
ItemMulti-agent source seeking via discrete-time extremum seeking control(PERGAMON-ELSEVIER SCIENCE LTD, 2014-09)Recent developments in extremum seeking theory have established a general framework for the methodology, although the specific implementations, particularly in the context of multi-agent systems, have not been demonstrated. In this work, a group of sensor-enabled vehicles is used in the context of the extremum seeking problem using both local and global optimisation algorithms to locate the extremum of an unknown scalar field distribution. For the former, the extremum seeker exploits estimates of gradients of the field from local dithering sensor measurements collected by the mobile agents. It is assumed that a distributed coordination which ensures uniform asymptotic stability with respect to a prescribed formation of the agents is employed. An inherent advantage of the frameworks is that a broad range of nonlinear programming algorithms can be combined with a wide class of cooperative control laws to perform extreme source seeking. Semi-global practical asymptotically stable convergence to local extrema is established in the presence of field sampling noise. Subsequently, global extremum seeking with multiple agents is investigated and shown to give rise to robust practical convergence whose speed can be improved via computational parallelism. Nonconvex field distributions with local extrema can be accommodated within this global framework.
-
ItemOptimization Methods on Riemannian Manifolds via Extremum Seeking Algorithms( 2014-12-09)This paper formulates the problem of Extremum Seeking for optimization of cost functions defined on Riemannian manifolds. We extend the conventional extremum seeking algorithms for optimization problems in Euclidean spaces to optimization of cost functions defined on smooth Riemannian manifolds. This problem falls within the category of online optimization methods. We introduce the notion of geodesic dithers which is a perturbation of the optimizing trajectory in the tangent bundle of the ambient state manifolds and obtain the extremum seeking closed loop as a perturbation of the averaged gradient system. The main results are obtained by applying closeness of solutions and averaging theory on Riemannian manifolds. The main results are further extended for optimization on Lie groups. Numerical examples on Riemannian manifolds (Lie groups) SOp3q and SEp3q are also presented at the end of the paper.