Nonlinear system identification and control using state transition algorithm

By transforming identification and control for nonlinear system into optimization problems, a novel optimization method named state transition algorithm (STA) is introduced to solve the problems. In the proposed STA, a solution to a optimization problem is considered as a state, and the updating of a solution equates to a state transition, which makes it easy to understand and convenient to implement. First, the STA is applied to identify the optimal parameters of the estimated system with previously known structure. With the accurate estimated model, an off-line PID controller is then designed optimally by using the STA as well. Experimental results have demonstrated the validity of the methodology, and comparisons to STA with other optimization algorithms have testified that STA is a promising alternative method for system identification and control due to its stronger search ability, faster convergence rate and more stable performance.Comment: 20 pages, 18 figure

Model based control strategies for a class of nonlinear mechanical sub-systems

This paper presents a comparison between various control strategies for a class of mechanical actuators common in heavy-duty industry. Typical actuator components are hydraulic or pneumatic elements with static non-linearities, which are commonly referred to as Hammerstein systems. Such static non-linearities may vary in time as a function of the load and hence classical inverse-model based control strategies may deliver sub-optimal performance. This paper investigates the ability of advanced model based control strategies to satisfy a tolerance interval for position error values, overshoot and settling time specifications. Due to the presence of static non-linearity requiring changing direction of movement, control effort is also evaluated in terms of zero crossing frequency (up-down or left-right movement). Simulation and experimental data from a lab setup suggest that sliding mode control is able to improve global performance parameters

New battery model and state-of-health determination through subspace parameter estimation and state-observer techniques

This paper describes a novel adaptive battery model based on a remapped variant of the well-known Randles' lead-acid model. Remapping of the model is shown to allow improved modeling capabilities and accurate estimates of dynamic circuit parameters when used with subspace parameter-estimation techniques. The performance of the proposed methodology is demonstrated by application to batteries for an all-electric personal rapid transit vehicle from the Urban Light TRAnsport (ULTRA) program, which is designated for use at Heathrow Airport, U. K. The advantages of the proposed model over the Randles' circuit are demonstrated by comparisons with alternative observer/estimator techniques, such as the basic Utkin observer and the Kalman estimator. These techniques correctly identify and converge on voltages associated with the battery state-of-charge (SoC), despite erroneous initial conditions, thereby overcoming problems attributed to SoC drift (incurred by Coulomb-counting methods due to overcharging or ambient temperature fluctuations). Observation of these voltages, as well as online monitoring of the degradation of the estimated dynamic model parameters, allows battery aging (state-of-health) to also be assessed and, thereby, cell failure to be predicted. Due to the adaptive nature of the proposed algorithms, the techniques are suitable for applications over a wide range of operating environments, including large ambient temperature variations. Moreover, alternative battery topologies may also be accommodated by the automatic adjustment of the underlying state-space models used in both the parameter-estimation and observer/estimator stages

Differential evolution with an evolution path: a DEEP evolutionary algorithm

Utilizing cumulative correlation information already existing in an evolutionary process, this paper proposes a predictive approach to the reproduction mechanism of new individuals for differential evolution (DE) algorithms. DE uses a distributed model (DM) to generate new individuals, which is relatively explorative, whilst evolution strategy (ES) uses a centralized model (CM) to generate offspring, which through adaptation retains a convergence momentum. This paper adopts a key feature in the CM of a covariance matrix adaptation ES, the cumulatively learned evolution path (EP), to formulate a new evolutionary algorithm (EA) framework, termed DEEP, standing for DE with an EP. Without mechanistically combining two CM and DM based algorithms together, the DEEP framework offers advantages of both a DM and a CM and hence substantially enhances performance. Under this architecture, a self-adaptation mechanism can be built inherently in a DEEP algorithm, easing the task of predetermining algorithm control parameters. Two DEEP variants are developed and illustrated in the paper. Experiments on the CEC'13 test suites and two practical problems demonstrate that the DEEP algorithms offer promising results, compared with the original DEs and other relevant state-of-the-art EAs