ELECT Pilot power allocation is investigated under the framework of physical layer secure communications in time-division duplex systems, where the secret keys are generated from the estimates of sparse wireless channels. The joint optimisation of secret key capacity and sparse channel estimation performance based on pilot power allocation is formulated as a convex optimisation problem. Conside...

Over recent years, optimisation and evolutionary search have seen substantial interest in the MDE research community. Many of these techniques require the specification of an optimisation problem to include a set of model transformations for deriving new solution candidates from existing ones. For some problems—for example, planning problems, where the domain only allows specific actions to be ...

Guided Local Search originally proposed by Voudouris and Tsang [29] is a general optimisation technique suitable for a wide range of combinatorial optimisation problems. Successful applications of the technique so far include practical problems such as Frequency Allocation [29], Workforce Scheduling [28] and Vehicle Routing [2, 18] and also classic problems such as the Travelling Salesman Probl...

In robot odometry and SLAM applications the real trajectory is estimated incrementally. This produces an accumulation of errors which gives raise to a drift in the trajectory. When revisiting a previous position this drift becomes observable and thus it can be corrected by applying loop closing techniques. Ultimately a loop closing process leads to an optimisation problem where new constraints ...

In biomechanics, musculoskeletal models are typically redundant. This situation is referred to as the distribution problem. Often, static, non-linear optimisation methods of the form "min: phi(f) subject to mechanical and muscular constraints" have been used to extract a unique set of muscle forces. Here, we present a method for validating this class of non-linear optimisation approaches where ...

Restricted complexity controller design for the active suspension benchmark problem [1] is considered. The control design specifications of the benchmark is firstly recast into a mixed H∞/l1 optimisation problem, which is solved via a convex optimisation approach. A globally optimal Pareto curve is produced via the optimisation. It presents the limits of performance and is served as a reference...

We propose the bounded multi-objective max-sum algorithm (B-MOMS), the first decentralised coordination algorithm for multi-objective optimisation problems. B-MOMS extends the max-sum message-passing algorithm for decentralised coordination to compute bounded approximate solutions to multi-objective decentralised constraint optimisation problems (MO-DCOPs). Specifically, we prove the optimality...

1. Abstract In order to account for current and future requirements regarding the further improvement of the dynamical behaviour of a chain CVT (Continuous Variable Transmission) optimisation methods are substantial. The primary focus lies on the chain, which is the central part of the gear. In this work a concept to deal with this challenging task is introduced, leading to an optimisation tool...

In this paper, I view and present the multiobjective discrete optimisation problem as a particular case of disjunctive programming where one seeks to identify efficient solutions from within a disjunction formed by a set of systems. The proposed approach lends itself to a simple yet effective iterative algorithm that is able to yield the set of all nondominated points, both supported and nonsup...