Rigorous finite-time guarantees for optimization on continuous domains by simulated annealing

Simulated annealing is a popular method for approaching the solution of a global optimization problem. Existing results on its performance apply to discrete combinatorial optimization where the optimization variables can assume only a finite set of possible values. We introduce a new general formulation of simulated annealing which allows one to guarantee finite-time performance in the optimization of functions of continuous variables. The results hold universally for any optimization problem on a bounded domain and establish a connection between simulated annealing and up-to-date theory of convergence of Markov chain Monte Carlo methods on continuous domains. This work is inspired by the concept of finite-time learning with known accuracy and confidence developed in statistical learning theory.

Surface excavation with model predictive control

This paper describes the application of variable-horizon model predictive control to trajectory generation in surface excavation. A nonlinear dynamic model of a surface mining machine digging in oil sand is developed as a test platform. This model is then stabilised with an inner-loop controller before being linearised to generate a prediction model. The linear model is used to design a predictive controller for trajectory generation. A variable horizon formulation is augmented with extra terms in the cost function to allow more control over digging, whilst still preserving the guarantee of finite-time completion. Simulations show the generation of realistic trajectories, motivating new applications of variable horizon MPC for autonomy that go beyond the realm of vehicle path planning. ©2010 IEEE.

Application of the fixed point method for solution in time stepping finite element analysis using the inverse vector Jiles-Atherton model

An implementation of the inverse vector Jiles-Atherton model for the solution of non-linear hysteretic finite element problems is presented. The implementation applies the fixed point method with differential reluctivity values obtained from the Jiles-Atherton model. Differential reluctivities are usually computed using numerical differentiation, which is ill-posed and amplifies small perturbations causing large sudden increases or decreases of differential reluctivity values, which may cause numerical problems. A rule based algorithm for conditioning differential reluctivity values is presented. Unwanted perturbations on the computed differential reluctivity values are eliminated or reduced with the aim to guarantee convergence. Details of the algorithm are presented together with an evaluation of the algorithm by a numerical example. The algorithm is shown to guarantee convergence, although the rate of convergence depends on the choice of algorithm parameters. © 2011 IEEE.

Simulated Annealing: Rigorous finite-time guarantees for optimization on continuous domains

Simulated annealing is a popular method for approaching the solution of a global optimization problem. Existing results on its performance apply to discrete combinatorial optimization where the optimization variables can assume only a finite set of possible values. We introduce a new general formulation of simulated annealing which allows one to guarantee finite-time performance in the optimization of functions of continuous variables. The results hold universally for any optimization problem on a bounded domain and establish a connection between simulated annealing and up-to-date theory of convergence of Markov chain Monte Carlo methods on continuous domains. This work is inspired by the concept of finite-time learning with known accuracy and confidence developed in statistical learning theory.

Min-Max Moving Horizon Estimation for a Class of Hybrid Systems

In this paper, a strategy for min-max Moving Horizon Estimation (MHE) of a class of uncertain hybrid systems is proposed. The class of hybrid systems being considered are Piecewise Affine systems (PWA) with both continuous valued and logic components. Furthermore, we consider the case when there is a (possibly structured) norm bounded uncertainty in each subsystem. Sufficient conditions on the time horizon and the penalties on the state at the beginning of the estimation horizon to guarantee convergence of the MHE scheme will be provided. The MHE scheme will be implemented as a mixed integer semidefinite optimisation for which an efficient algorithm was recently introduced.

Robust variable horizon MPC with move blocking

This paper introduces a new formulation of variable horizon model predictive control (VH-MPC) that utilises move blocking for reducing computational complexity. Various results pertaining to move blocking are derived, following which, a generalised blocked VH-MPC controller is formulated for linear discrete-time systems. Robustness to bounded disturbances is ensured through the use of tightened constraints. The resulting time-varying control scheme is shown to guarantee robust recursive feasibility and finite-time completion. An example is then presented for a particular choice of blocking regime, as would be applicable to vehicle manœuvring problems. Simulations demonstrate the efficacy of the formulation. © 2012 Elsevier B.V. All rights reserved.

Theoretical and experimental studies on Jc and AC losses of 2G HTS coils

This paper begins with introducing the winding techniques of two superconducting double-pancake coils wound using 2G coated conductors. These winding techniques are able to guarantee a good performance for the superconducting coils. Then the coil critical currents were measured and compared with a simulation model. The results were consistent. Finally the coil AC losses were measured using an experimental circuit including a compensation coil. The simulation results are close to the experiment results. © 2010 IEEE.

Automated Detection of Concrete Columns from Visual Data

After earthquakes, licensed inspectors use the established codes to assess the impact of damage on structural elements. It always takes them days to weeks. However, emergency responders (e.g. firefighters) must act within hours of a disaster event to enter damaged structures to save lives, and therefore cannot wait till an official assessment completes. This is a risk that firefighters have to take. Although Search and Rescue Organizations offer training seminars to familiarize firefighters with structural damage assessment, its effectiveness is hard to guarantee when firefighters perform life rescue and damage assessment operations together. Also, the training is not available to every firefighter. The authors therefore proposed a novel framework that can provide firefighters with a quick but crude assessment of damaged buildings through evaluating the visible damage on their critical structural elements (i.e. concrete columns in the study). This paper presents the first step of the framework. It aims to automate the detection of concrete columns from visual data. To achieve this, the typical shape of columns (long vertical lines) is recognized using edge detection and the Hough transform. The bounding rectangle for each pair of long vertical lines is then formed. When the resulting rectangle resembles a column and the material contained in the region of two long vertical lines is recognized as concrete, the region is marked as a concrete column surface. Real video/image data are used to test the method. The preliminary results indicate that concrete columns can be detected when they are not distant and have at least one surface visible.

Minimum sensor duty cycle with guaranteed estimator performance

In this paper, we consider Kalman filtering over a network and construct the optimal sensor data scheduling schemes which minimize the sensor duty cycle and guarantee a bounded error or a bounded average error at the remote estimator. Depending on the computation capability of the sensor, we can either give a closed-form expression of the minimum sensor duty cycle or provide tight lower and upper bounds of it. Examples are provided throughout the paper to demonstrate the results. © 2012 IEEE.

Verification of periodically controlled hybrid systems: Application to an autonomous vehicle

This article introduces Periodically Controlled Hybrid Automata (PCHA) for modular specification of embedded control systems. In a PCHA, control actions that change the control input to the plant occur roughly periodically, while other actions that update the state of the controller may occur in the interim. Such actions could model, for example, sensor updates and information received from higher-level planning modules that change the set point of the controller. Based on periodicity and subtangential conditions, a new sufficient condition for verifying invariant properties of PCHAs is presented. For PCHAs with polynomial continuous vector fields, it is possible to check these conditions automatically using, for example, quantifier elimination or sum of squares decomposition. We examine the feasibility of this automatic approach on a small example. The proposed technique is also used to manually verify safety and progress properties of a fairly complex planner-controller subsystem of an autonomous ground vehicle. Geometric properties of planner-generated paths are derived which guarantee that such paths can be safely followed by the controller. © 2012 ACM.

Representations and algorithms for finite-state bisimulations of linear discrete-time control systems

While a large amount of research over the past two decades has focused on discrete abstractions of infinite-state dynamical systems, many structural and algorithmic details of these abstractions remain unknown. To clarify the computational resources needed to perform discrete abstractions, this paper examines the algorithmic properties of an existing method for deriving finite-state systems that are bisimilar to linear discrete-time control systems. We explicitly find the structure of the finite-state system, show that it can be enormous compared to the original linear system, and give conditions to guarantee that the finite-state system is reasonably sized and efficiently computable. Though constructing the finite-state system is generally impractical, we see that special cases could be amenable to satisfiability based verification techniques. ©2009 IEEE.

Preliminary evaluation of a nuclear scenario involving innovative gas cooled reactors

In order to guarantee a sustainable supply of future energy demand without compromising the environment, some actions for a substantial reduction of CO 2 emissions are nowadays deeply analysed. One of them is the improvement of the nuclear energy use. In this framework, innovative gas-cooled reactors (both thermal and fast) seem to be very attractive from the electricity production point of view and for the potential industrial use along the high temperature processes (e.g., H 2 production by steam reforming or I-S process). This work focuses on a preliminary (and conservative) evaluation of possible advantages that a symbiotic cycle (EPR-PBMR-GCFR) could entail, with special regard to the reduction of the HLW inventory and the optimization of the exploitation of the fuel resources. The comparison between the symbiotic cycle chosen and the reference one (once-through scenario, i.e., EPR-SNF directly disposed) shows a reduction of the time needed to reach a fixed reference level from ∼170000 years to ∼1550 years (comparable with typical human times and for this reason more acceptable by the public opinion). In addition, this cycle enables to have a more efficient use of resources involved: the total electric energy produced becomes equal to ∼630 TWh/year (instead of only ∼530 TWh/year using only EPR) without consuming additional raw materials. © 2009 Barbara Vezzoni et al.

Reconfigurable predictive control for redundantly actuated systems with parameterised input constraints

A method is proposed for on-line reconfiguration of the terminal constraint used to provide theoretical nominal stability guarantees in linear model predictive control (MPC). By parameterising the terminal constraint, its complete reconstruction is avoided when input constraints are modified to accommodate faults. To enlarge the region of feasibility of the terminal control law for a certain class of input faults with redundantly actuated plants, the linear terminal controller is defined in terms of virtual commands. A suitable terminal cost weighting for the reconfigurable MPC is obtained by means of an upper bound on the cost for all feasible realisations of the virtual commands from the terminal controller. Conditions are proposed that guarantee feasibility recovery for a defined subset of faults. The proposed method is demonstrated by means of a numerical example. © 2013 Elsevier B.V. All rights reserved.

Adaptive combustion instability control with saturation

The control of a class of combustion systems, suceptible to damage from self-excited combustion oscillations, is considered. An adaptive stable controller, called Self-Tuning Regulator (STR), has recently been developed, which meets the apparently contradictory challenge of relying as little as possible on a particular combustion model while providing some guarantee that the controller will cause no harm. The controller injects some fuel unsteadily into the burning region, thereby altering the heat release, in response to an input signal detecting the oscillation. This paper focuses on an extension of the STR design, when, due to stringent emission requirements and to the danger of flame extension, the amount of fuel used for control is limited in amplitude. A Lyapunov stability analysis is used to prove the stability of the modified STR when the saturation constraint is imposed. The practical implementation of the modified STR remains straightforward, and simulation results, based on the nonlinear premixed flame model developed by Dowling, show that in the presence of a saturation constraint, the self-excited oscillations are damped more rapidly with the modified STR than with the original STR. © 2001 by S. Evesque. Published by the American Institute of Aeronautics and Astronautics, Inc.