10,849 research outputs found
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
UltraSwarm: A Further Step Towards a Flock of Miniature Helicopters
We describe further progress towards the development of a
MAV (micro aerial vehicle) designed as an enabling tool to investigate aerial flocking. Our research focuses on the use of low cost off the shelf vehicles and sensors to enable fast prototyping and to reduce development costs. Details on the design of the embedded electronics and the
modification of the chosen toy helicopter are presented, and the technique used for state estimation is described. The fusion of inertial data through an unscented Kalman filter is used to estimate the helicopter’s state, and this forms the main input to the control system. Since no detailed dynamic model of the helicopter in use is available, a method is proposed for automated system identification, and for subsequent controller design based on artificial evolution. Preliminary results obtained with a dynamic simulator of a helicopter are reported, along with some encouraging results for tackling the problem of flocking
Meta-heuristic algorithms in car engine design: a literature survey
Meta-heuristic algorithms are often inspired by natural phenomena, including the evolution of species in Darwinian natural selection theory, ant behaviors in biology, flock behaviors of some birds, and annealing in metallurgy. Due to their great potential in solving difficult optimization problems, meta-heuristic algorithms have found their way into automobile engine design. There are different optimization problems arising in different areas of car engine management including calibration, control system, fault diagnosis, and modeling. In this paper we review the state-of-the-art applications of different meta-heuristic algorithms in engine management systems. The review covers a wide range of research, including the application of meta-heuristic algorithms in engine calibration, optimizing engine control systems, engine fault diagnosis, and optimizing different parts of engines and modeling. The meta-heuristic algorithms reviewed in this paper include evolutionary algorithms, evolution strategy, evolutionary programming, genetic programming, differential evolution, estimation of distribution algorithm, ant colony optimization, particle swarm optimization, memetic algorithms, and artificial immune system
Efficiency Analysis of Swarm Intelligence and Randomization Techniques
Swarm intelligence has becoming a powerful technique in solving design and
scheduling tasks. Metaheuristic algorithms are an integrated part of this
paradigm, and particle swarm optimization is often viewed as an important
landmark. The outstanding performance and efficiency of swarm-based algorithms
inspired many new developments, though mathematical understanding of
metaheuristics remains partly a mystery. In contrast to the classic
deterministic algorithms, metaheuristics such as PSO always use some form of
randomness, and such randomization now employs various techniques. This paper
intends to review and analyze some of the convergence and efficiency associated
with metaheuristics such as firefly algorithm, random walks, and L\'evy
flights. We will discuss how these techniques are used and their implications
for further research.Comment: 10 pages. arXiv admin note: substantial text overlap with
arXiv:1212.0220, arXiv:1208.0527, arXiv:1003.146
Unsupervised Heart-rate Estimation in Wearables With Liquid States and A Probabilistic Readout
Heart-rate estimation is a fundamental feature of modern wearable devices. In
this paper we propose a machine intelligent approach for heart-rate estimation
from electrocardiogram (ECG) data collected using wearable devices. The novelty
of our approach lies in (1) encoding spatio-temporal properties of ECG signals
directly into spike train and using this to excite recurrently connected
spiking neurons in a Liquid State Machine computation model; (2) a novel
learning algorithm; and (3) an intelligently designed unsupervised readout
based on Fuzzy c-Means clustering of spike responses from a subset of neurons
(Liquid states), selected using particle swarm optimization. Our approach
differs from existing works by learning directly from ECG signals (allowing
personalization), without requiring costly data annotations. Additionally, our
approach can be easily implemented on state-of-the-art spiking-based
neuromorphic systems, offering high accuracy, yet significantly low energy
footprint, leading to an extended battery life of wearable devices. We
validated our approach with CARLsim, a GPU accelerated spiking neural network
simulator modeling Izhikevich spiking neurons with Spike Timing Dependent
Plasticity (STDP) and homeostatic scaling. A range of subjects are considered
from in-house clinical trials and public ECG databases. Results show high
accuracy and low energy footprint in heart-rate estimation across subjects with
and without cardiac irregularities, signifying the strong potential of this
approach to be integrated in future wearable devices.Comment: 51 pages, 12 figures, 6 tables, 95 references. Under submission at
Elsevier Neural Network
Adaptive hybrid optimization strategy for calibration and parameter estimation of physical models
A new adaptive hybrid optimization strategy, entitled squads, is proposed for
complex inverse analysis of computationally intensive physical models. The new
strategy is designed to be computationally efficient and robust in
identification of the global optimum (e.g. maximum or minimum value of an
objective function). It integrates a global Adaptive Particle Swarm
Optimization (APSO) strategy with a local Levenberg-Marquardt (LM) optimization
strategy using adaptive rules based on runtime performance. The global strategy
optimizes the location of a set of solutions (particles) in the parameter
space. The LM strategy is applied only to a subset of the particles at
different stages of the optimization based on the adaptive rules. After the LM
adjustment of the subset of particle positions, the updated particles are
returned to the APSO strategy. The advantages of coupling APSO and LM in the
manner implemented in squads is demonstrated by comparisons of squads
performance against Levenberg-Marquardt (LM), Particle Swarm Optimization
(PSO), Adaptive Particle Swarm Optimization (APSO; the TRIBES strategy), and an
existing hybrid optimization strategy (hPSO). All the strategies are tested on
2D, 5D and 10D Rosenbrock and Griewank polynomial test functions and a
synthetic hydrogeologic application to identify the source of a contaminant
plume in an aquifer. Tests are performed using a series of runs with random
initial guesses for the estimated (function/model) parameters. Squads is
observed to have the best performance when both robustness and efficiency are
taken into consideration than the other strategies for all test functions and
the hydrogeologic application
- …