24,552 research outputs found
Analytical results for the multi-objective design of model-predictive control
In model-predictive control (MPC), achieving the best closed-loop performance
under a given computational resource is the underlying design consideration.
This paper analyzes the MPC design problem with control performance and
required computational resource as competing design objectives. The proposed
multi-objective design of MPC (MOD-MPC) approach extends current methods that
treat control performance and the computational resource separately -- often
with the latter as a fixed constraint -- which requires the implementation
hardware to be known a priori. The proposed approach focuses on the tuning of
structural MPC parameters, namely sampling time and prediction horizon length,
to produce a set of optimal choices available to the practitioner. The posed
design problem is then analyzed to reveal key properties, including smoothness
of the design objectives and parameter bounds, and establish certain validated
guarantees. Founded on these properties, necessary and sufficient conditions
for an effective and efficient solver are presented, leading to a specialized
multi-objective optimizer for the MOD-MPC being proposed. Finally, two
real-world control problems are used to illustrate the results of the design
approach and importance of the developed conditions for an effective solver of
the MOD-MPC problem
A Survey on Compiler Autotuning using Machine Learning
Since the mid-1990s, researchers have been trying to use machine-learning
based approaches to solve a number of different compiler optimization problems.
These techniques primarily enhance the quality of the obtained results and,
more importantly, make it feasible to tackle two main compiler optimization
problems: optimization selection (choosing which optimizations to apply) and
phase-ordering (choosing the order of applying optimizations). The compiler
optimization space continues to grow due to the advancement of applications,
increasing number of compiler optimizations, and new target architectures.
Generic optimization passes in compilers cannot fully leverage newly introduced
optimizations and, therefore, cannot keep up with the pace of increasing
options. This survey summarizes and classifies the recent advances in using
machine learning for the compiler optimization field, particularly on the two
major problems of (1) selecting the best optimizations and (2) the
phase-ordering of optimizations. The survey highlights the approaches taken so
far, the obtained results, the fine-grain classification among different
approaches and finally, the influential papers of the field.Comment: version 5.0 (updated on September 2018)- Preprint Version For our
Accepted Journal @ ACM CSUR 2018 (42 pages) - This survey will be updated
quarterly here (Send me your new published papers to be added in the
subsequent version) History: Received November 2016; Revised August 2017;
Revised February 2018; Accepted March 2018
Telecommunications Network Planning and Maintenance
Telecommunications network operators are on a constant challenge to provide new services which require ubiquitous broadband access. In an attempt to do so, they are faced with many problems such as the network coverage or providing the guaranteed Quality of Service (QoS). Network planning is a multi-objective optimization problem which involves clustering the area of interest by minimizing a cost function which includes relevant parameters, such as installation cost, distance between user and base station, supported traffic, quality of received signal, etc. On the other hand, service assurance deals with the disorders that occur in hardware or software of the managed network. This paper presents a large number of multicriteria techniques that have been developed to deal with different kinds of problems regarding network planning and service assurance. The state of the art presented will help the reader to develop a broader understanding of the problems in the domain
A service oriented architecture for engineering design
Decision making in engineering design can be effectively addressed by using genetic algorithms to solve multi-objective problems. These multi-objective genetic algorithms
(MOGAs) are well suited to implementation in a Service Oriented Architecture. Often the evaluation process of the MOGA is compute-intensive due to the use of a complex computer model to represent the real-world system. The emerging paradigm of Grid Computing offers
a potential solution to the compute-intensive nature of this objective function evaluation, by
allowing access to large amounts of compute resources in a distributed manner. This paper presents a grid-enabled framework for multi-objective optimisation using genetic algorithms (MOGA-G) to aid decision making in engineering design
- …