Open AccessDissertation
Addressing real-time control problems in complex environments using dynamic multi-objective evolutionary approaches
Jevgenijs Butans
- 01 Oct 2011
9
TL;DR: A framework for on-line optimisation of dynamic problems that is capable of representing problems in a quantitative way, identifying optimal solutions using multi-objective evolutionary algorithms, and automatically selecting an optimal solution among alternatives is developed.
read more
Abstract: The demand for increased automation of industrial processes generates control problems
that are dynamic, multi-objective and noisy at the same time. The primary
hypothesis underlying this research is that dynamic evolutionary methods could be
used to address dynamic control problems where con
icting control criteria are necessary.
The aim of this research is to develop a framework for on-line optimisation
of dynamic problems that is capable of a) representing problems in a quantitative
way, b) identifying optimal solutions using multi-objective evolutionary algorithms,
and c) automatically selecting an optimal solution among alternatives.
A literature review identi es key problems in the area of dynamic multi-objective
optimisation, discusses the on-line decision making aspect, analyses existing Multi-
Objective Evolutionary Algorithms (MOEA) applications and identi es research
gap. Dynamic evolutionary multi-objective search and on-line a posteriori decision
maker are integrated into an evolutionary multi-objective controller that uses an
internal process model to evaluate the tness of solutions.
Using a benchmark multi-objective optimisation problem, the MOEA ability
to track the moving optima is examined with di erent parameter values, namely,
length of pre-execution, frequency of change, length of prediction interval and static
mutation rate. A dynamic MOEA with restricted elitism is suggested for noisy
environments.To address the on-line decision making aspect of the dynamic multi-objective
optimisation, a novel method for constructing game trees for real-valued multiobjective
problems is presented. A novel decision making algorithm based on game
trees is proposed along with a baseline random decision maker.
The proposed evolutionary multi-objective controller is systematically analysed
using an inverted pendulum problem and its performance is compared to Proportional{
Integral{Derivative (PID) and nonlinear Model Predictive Control (MPC) approaches.
Finally, the proposed control approach is integrated into a multi-agent framework
for coordinated control of multiple entities and validated using a case study of a
tra c scheduling problem.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Evolutionary Dynamic Multi-objective Optimisation: A Survey
TL;DR: A broad survey and taxonomy of existing research on evolutionary dynamic multi-objective optimisation (EDMO) can be found in this article , where multiple research opportunities are highlighted to further promote the development of the field.
A Scalable Test Suite for Continuous Dynamic Multiobjective Optimization
TL;DR: A scalable continuous test suite is developed, which includes a number of dynamics or features that have been rarely considered in literature but frequently occur in real life and can also test algorithms in ways that existing test suites cannot.
•Journal Article
Steady State Genetic Algorithms with Aging of Individuals
Ashish Ghosh,茂義 筒井,英夫 田中 +2 more
TL;DR: The authors explore the utility of the concept of aging of individuals in the context of steady state GAs for nonstationary function optimization by using age as an additional factor in addition to the objective functional value to determine its effective fitness value.
42
A random benchmark suite and a new reaction strategy in dynamic multiobjective optimization
TL;DR: This proposed benchmark suite has eight random instances in which the randomness is produced by designed random time sequences and a center matching strategy (CMS) is suggested to track random changes in these problems, which applies the history individual information in a global scope for population prediction.
13
References
A fast and elitist multiobjective genetic algorithm: NSGA-II
TL;DR: This paper suggests a non-dominated sorting-based MOEA, called NSGA-II (Non-dominated Sorting Genetic Algorithm II), which alleviates all of the above three difficulties, and modify the definition of dominance in order to solve constrained multi-objective problems efficiently.
•Book
Artificial Intelligence: A Modern Approach
Stuart Russell,Peter Norvig +1 more
- 01 Jan 2020
TL;DR: In this article, the authors present a comprehensive introduction to the theory and practice of artificial intelligence for modern applications, including game playing, planning and acting, and reinforcement learning with neural networks.
21.4K
Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach
Eckart Zitzler,Lothar Thiele +1 more
TL;DR: The proof-of-principle results obtained on two artificial problems as well as a larger problem, the synthesis of a digital hardware-software multiprocessor system, suggest that SPEA can be very effective in sampling from along the entire Pareto-optimal front and distributing the generated solutions over the tradeoff surface.
8.6K
•Book
On the Origin of Species by Means of Natural Selection, or, The Preservation of Favoured Races in the Struggle for Life
Charles Darwin
- 03 Sep 2009
TL;DR: The "Penguin Classics" edition of "On the Origin of Species" as discussed by the authors contains an introduction and notes by William Bynum, and features a cover designed by Damien Hirst.
7.8K
Muiltiobjective optimization using nondominated sorting in genetic algorithms
N. Srinivas,Kalyanmoy Deb +1 more
TL;DR: Goldberg's notion of nondominated sorting in GAs along with a niche and speciation method to find multiple Pareto-optimal points simultaneously are investigated and suggested to be extended to higher dimensional and more difficult multiobjective problems.
7.1K