Towards a dynamic modeling of the predator prey problem

This article addresses a new dynamic optimization problem (DOP) based on the Predator-Prey (PP) relationship in nature. Indeed, a PP system involves two adversary species where the predator’s objective is to hunt the prey while the prey’s objective is to escape from its predator. By analogy to dynamic optimization, a DOP can be seen as a predation between potential solution(s) in the search space, which represents the predator, and the moving optimum, as the prey. Therefore we define the dynamic predator-prey problem (DPP) whose objective is to keep track of the moving prey, so as to minimize the distance to the optimum. To solve this problem, a dynamic approach that continuously adapts to the changing environment is required. Accordingly, we propose a new evolutionary approach based on three main techniques for DOPs, namely: multi-population scheme, random immigrants, and memory of past solutions. This hybridization of methods aims at improving the evolutionary approaches ability to deal with DOPs and to restrain as much as possible their drawbacks. Our computational experiments show that the proposed approach achieves high performance for DPP and and competes with state of the art approaches.     

Optimization of anisotropic composite panels with T-shaped stiffeners including transverse shear effects and out-of-plane loading

A two-step method to optimize anisotropic composite panels with T-shaped stiffeners, including a new formulation of the transverse shear properties and an approximation of the ply contiguity (blocking) constraints as functions of the lamination parameters is provided. At the first step, a representative element of the stiffened panel (superstiffener) is optimized using mathematical programming and lamination parameters subjected to combined loading (in-plane and out-of-plane) under strength (laminate or ply failure), buckling and practical design constraints. Ply blocking constraints are imposed at this step to improve convergence towards practical laminates. At the second step, the actual superstiffener’s laminates are obtained by using a genetic algorithm. Results, for the case considered, show that the inclusion of transverse shear effects has an associated 2.5% mass penalty and that neglecting its effects might invoke earlier buckling failure. In addition, the influence of designing for failure strength at laminate or ply level is assessed.     

Guidance of a mobile robot using an array of static cameras located in the environment

This paper presents a new proposal for positioning and guiding mobile robots in indoor environments. The proposal is based on the information provided by static cameras located in the movement environment. This proposal falls within the scope of what are known as intelligent environments; in this case, the environment is provided with cameras that, once calibrated, allow the position of the robots to be obtained. Based on this information, control orders for the robots can be generated using a radio frequency link. In order to facilitate identification of the robots, even under extremely adverse ambient lighting conditions, a beacon consisting of four circular elements constructed from infrared diodes is mounted on board the robots. In order to identify the beacon, an edge detection process is carried out. This is followed by a process that, based on the algebraic distance, obtains the estimated ellipses associated with each element of the beacon. Once the beacon has been identified, the coordinates of the centroids for the elements that make up the beacon are obtained on the various image planes. Based on these coordinates, an algorithm is proposed that takes into account the standard deviation of the error produced in the various cameras in ascertaining the coordinates of the beacon’s elements. An odometric system is also used in guidance that, in conjunction with a Kalman Filter, allows the position of the robot to be estimated during the time intervals required to process the visual information provided by the cameras.

Robust quantification of the exposure to operational risk: Bringing economic sense to economic capital

Operational risk is commonly analyzed in terms of the distribution of aggregate yearly losses. Risk measures can then be computed as statistics of this distribution that focus on the region of extreme losses. Assuming independence among the operational risk events and between the likelihood that they occur and their magnitude, separate models are made for the frequency and for the severity of the losses. These are then combined to estimate the distribution of aggregate losses. While the detailed form of the frequency distribution does not significantly affect the risk analysis, the choice of model for the severity often has a significant impact on operational risk measures. For heavy-tailed distributions these measures are dominated by extreme losses, whose probability cannot be reliably extrapolated from the available data. With limited empirical evidence, it is difficult to distinguish among alternative models that produce very different values of the risk measures. Furthermore, the estimates obtained can be unstable and overly sensitive to the presence or absence of single extreme events. Setting a bound on the maximum amount that can be lost in a single event reduces the dependence on the distributional assumptions and improves the robustness and stability of the risk measures, while preserving their sensitivity to changes in the risk profile. This bound should be determined by expert assessment on the basis of economic arguments and validated by the regulator, so that it can be used as a control parameter in the risk analysis.     

A direct calculation of moments of the sample variance

A systematic method to deal with the interrelations of systems with multi-index quantities (random variables) is proposed. The method differs of the well-known Polykays. An application of the theoretical results here presented is the calculation of the moments of the sample variance for general populations in a direct way. The main advantage of the proposed methodology is that no conversion formulae and other complicated Polykays rules are needed. However, the proposed method is compatible with Polykays philosophy and conversion formulae and multiplication rules can be derived by using the theoretical results of this work. For practical purposes, two algorithms for the calculation of the moments of the sample variance are proposed.     

Exploring different technological platforms for supporting co-located collaborative games in the classroom

Computer Supported Collaborative Learning is a pedagogical approach that can be used for deploying educational games in the classroom. However, there is no clear understanding as to which technological platforms are better suited for deploying co-located collaborative games, nor the general affordances that are required. In this work we explore two different technological platforms for developing collaborative games in the classroom: one based on augmented reality technology and the other based on multiple-mice technology. In both cases, the same game was introduced to teach electrostatics and the results were compared experimentally using a real class.     

Multi‐objective optimization using metaheuristics: non‐standard algorithms

In recent years, the application of metaheuristic techniques to solve multi‐objective optimization problems has become an active research area. Solving this kind of problems involves obtaining a set of Pareto‐optimal solutions in such a way that the corresponding Pareto front fulfils the requirements of convergence to the true Pareto front and uniform diversity. Most of the studies on metaheuristics for multi‐objective optimization are focused on Evolutionary Algorithms, and some of the state‐of‐the‐art techniques belong this class of algorithms. Our goal in this paper is to study open research lines related to metaheuristics but focusing on less explored areas to provide new perspectives to those researchers interested in multi‐objective optimization. In particular, we focus on non‐evolutionary metaheuristics, hybrid multi‐objective metaheuristics, parallel multi‐objective optimization and multi‐objective optimization under uncertainty. We analyze these issues and discuss open research lines.