Evolutionary population dynamics and multi-objective optimisation problems

Griffith Sciences, School of Information and Communication TechnologyFull Tex

Methodological review of multicriteria optimization techniques: aplications in water resources

Multi-criteria decision analysis (MCDA) is an umbrella approach that has been applied to a wide range of natural resource management situations. This report has two purposes. First, it aims to provide an overview of advancedmulticriteriaapproaches, methods and tools. The review seeks to layout the nature of the models, their inherent strengths and limitations. Analysis of their applicability in supporting real-life decision-making processes is provided with relation to requirements imposed by organizationally decentralized and economically specific spatial and temporal frameworks. Models are categorized based on different classification schemes and are reviewed by describing their general characteristics, approaches, and fundamental properties. A necessity of careful structuring of decision problems is discussed regarding planning, staging and control aspects within broader agricultural context, and in water management in particular. A special emphasis is given to the importance of manipulating decision elements by means ofhierarchingand clustering. The review goes beyond traditionalMCDAtechniques; it describes new modelling approaches. The second purpose is to describe newMCDAparadigms aimed at addressing the inherent complexity of managing water ecosystems, particularly with respect to multiple criteria integrated with biophysical models,multistakeholders, and lack of information. Comments about, and critical analysis of, the limitations of traditional models are made to point out the need for, and propose a call to, a new way of thinking aboutMCDAas they are applied to water and natural resources management planning. These new perspectives do not undermine the value of traditional methods; rather they point to a shift in emphasis from methods for problem solving to methods for problem structuring. Literature review show successfully integrations of watershed management optimization models to efficiently screen a broad range of technical, economic, and policy management options within a watershed system framework and select the optimal combination of management strategies and associated water allocations for designing a sustainable watershed management plan at least cost. Papers show applications in watershed management model that integrates both natural and human elements of a watershed system including the management of ground and surface water sources, water treatment and distribution systems, human demands,wastewatertreatment and collection systems, water reuse facilities,nonpotablewater distribution infrastructure, aquifer storage and recharge facilities, storm water, and land use

Evolutionary Dynamic Multi-Objective Optimisation : A survey

Peer reviewedPostprin

EVOLUTIONARY MULTI-OBJECTIVE OPTIMIZATION VIA DIFFERENTIAL EVOLUTION

Ph.DDOCTOR OF PHILOSOPH

Smooth 3D Path Planning by Means of Multiobjective Optimization for Fixed-Wing UAVs

[EN] Demand for 3D planning and guidance algorithms is increasing due, in part, to the increase in unmanned vehicle-based applications. Traditionally, two-dimensional (2D) trajectory planning algorithms address the problem by using the approach of maintaining a constant altitude. Addressing the problem of path planning in a three-dimensional (3D) space implies more complex scenarios where maintaining altitude is not a valid approach. The work presented here implements an architecture for the generation of 3D flight paths for fixed-wing unmanned aerial vehicles (UAVs). The aim is to determine the feasible flight path by minimizing the turning effort, starting from a set of control points in 3D space, including the initial and final point. The trajectory generated takes into account the rotation and elevation constraints of the UAV. From the defined control points and the movement constraints of the UAV, a path is generated that combines the union of the control points by means of a set of rectilinear segments and spherical curves. However, this design methodology means that the problem does not have a single solution; in other words, there are infinite solutions for the generation of the final path. For this reason, a multiobjective optimization problem (MOP) is proposed with the aim of independently maximizing each of the turning radii of the path. Finally, to produce a complete results visualization of the MOP and the final 3D trajectory, the architecture was implemented in a simulation with Matlab/Simulink/flightGear.The authors would like to acknowledge the Spanish Ministerio de Ciencia, Innovacion y Universidades for providing funding through the project RTI2018-096904-B-I00 and the local administration Generalitat Valenciana through projects GV/2017/029 and AICO/2019/055. Franklin Samaniego thanks IFTH (Instituto de Fomento al Talento Humano) Ecuador (2015-AR2Q9209), for its sponsorship of this work.Samaniego, F.; Sanchís Saez, J.; Garcia-Nieto, S.; Simarro Fernández, R. (2020). Smooth 3D Path Planning by Means of Multiobjective Optimization for Fixed-Wing UAVs. Electronics. 9(1):1-23. https://doi.org/10.3390/electronics9010051S12391Kyriakidis, M., Happee, R., & de Winter, J. C. F. (2015). Public opinion on automated driving: Results of an international questionnaire among 5000 respondents. Transportation Research Part F: Traffic Psychology and Behaviour, 32, 127-140. doi:10.1016/j.trf.2015.04.014Münzer, S., Zimmer, H. D., Schwalm, M., Baus, J., & Aslan, I. (2006). Computer-assisted navigation and the acquisition of route and survey knowledge. Journal of Environmental Psychology, 26(4), 300-308. doi:10.1016/j.jenvp.2006.08.001Morales, Y., Kallakuri, N., Shinozawa, K., Miyashita, T., & Hagita, N. (2013). Human-comfortable navigation for an autonomous robotic wheelchair. 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems. doi:10.1109/iros.2013.6696743Krotkov, E., & Hebert, M. (s. f.). Mapping and positioning for a prototype lunar rover. Proceedings of 1995 IEEE International Conference on Robotics and Automation. doi:10.1109/robot.1995.525697Rodriguez-Seda, E. J. (2014). Decentralized trajectory tracking with collision avoidance control for teams of unmanned vehicles with constant speed. 2014 American Control Conference. doi:10.1109/acc.2014.6859184Xiaoping Ren, & Zixing Cai. (2010). Kinematics model of unmanned driving vehicle. 2010 8th World Congress on Intelligent Control and Automation. doi:10.1109/wcica.2010.5554512Jun, J.-Y., Saut, J.-P., & Benamar, F. (2016). Pose estimation-based path planning for a tracked mobile robot traversing uneven terrains. Robotics and Autonomous Systems, 75, 325-339. doi:10.1016/j.robot.2015.09.014Li, Y., Ding, L., & Liu, G. (2016). Attitude-based dynamic and kinematic models for wheels of mobile robot on deformable slope. Robotics and Autonomous Systems, 75, 161-175. doi:10.1016/j.robot.2015.10.006Mekonnen, G., Kumar, S., & Pathak, P. M. (2016). Wireless hybrid visual servoing of omnidirectional wheeled mobile robots. Robotics and Autonomous Systems, 75, 450-462. doi:10.1016/j.robot.2015.08.008Xu, J., Wang, M., & Qiao, L. (2015). Dynamical sliding mode control for the trajectory tracking of underactuated unmanned underwater vehicles. Ocean Engineering, 105, 54-63. doi:10.1016/j.oceaneng.2015.06.022Gafurov, S. A., & Klochkov, E. V. (2015). Autonomous Unmanned Underwater Vehicles Development Tendencies. Procedia Engineering, 106, 141-148. doi:10.1016/j.proeng.2015.06.017Qi, X., & Cai, Z. (2018). Three-dimensional formation control based on nonlinear small gain method for multiple underactuated underwater vehicles. Ocean Engineering, 151, 105-114. doi:10.1016/j.oceaneng.2018.01.032Ramasamy, S., Sabatini, R., Gardi, A., & Liu, J. (2016). LIDAR obstacle warning and avoidance system for unmanned aerial vehicle sense-and-avoid. Aerospace Science and Technology, 55, 344-358. doi:10.1016/j.ast.2016.05.020Zhu, L., Cheng, X., & Yuan, F.-G. (2016). A 3D collision avoidance strategy for UAV with physical constraints. Measurement, 77, 40-49. doi:10.1016/j.measurement.2015.09.006Chee, K. Y., & Zhong, Z. W. (2013). Control, navigation and collision avoidance for an unmanned aerial vehicle. Sensors and Actuators A: Physical, 190, 66-76. doi:10.1016/j.sna.2012.11.017Courbon, J., Mezouar, Y., Guénard, N., & Martinet, P. (2010). Vision-based navigation of unmanned aerial vehicles. Control Engineering Practice, 18(7), 789-799. doi:10.1016/j.conengprac.2010.03.004Aguilar, W., & Morales, S. (2016). 3D Environment Mapping Using the Kinect V2 and Path Planning Based on RRT Algorithms. Electronics, 5(4), 70. doi:10.3390/electronics5040070Yan, F., Liu, Y.-S., & Xiao, J.-Z. (2013). Path Planning in Complex 3D Environments Using a Probabilistic Roadmap Method. International Journal of Automation and Computing, 10(6), 525-533. doi:10.1007/s11633-013-0750-9Yeh, H.-Y., Thomas, S., Eppstein, D., & Amato, N. M. (2012). UOBPRM: A uniformly distributed obstacle-based PRM. 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems. doi:10.1109/iros.2012.6385875Liang, Y., & Xu, L. (2009). Global path planning for mobile robot based genetic algorithm and modified simulated annealing algorithm. Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation - GEC ’09. doi:10.1145/1543834.1543875Liu, J., Yang, J., Liu, H., Tian, X., & Gao, M. (2016). An improved ant colony algorithm for robot path planning. Soft Computing, 21(19), 5829-5839. doi:10.1007/s00500-016-2161-7Cao, H., Sun, S., Zhang, K., & Tang, Z. (2016). Visualized trajectory planning of flexible redundant robotic arm using a novel hybrid algorithm. Optik, 127(20), 9974-9983. doi:10.1016/j.ijleo.2016.07.078Duan, H., & Qiao, P. (2014). Pigeon-inspired optimization: a new swarm intelligence optimizer for air robot path planning. International Journal of Intelligent Computing and Cybernetics, 7(1), 24-37. doi:10.1108/ijicc-02-2014-0005Pandey, A., & Parhi, D. R. (2017). Optimum path planning of mobile robot in unknown static and dynamic environments using Fuzzy-Wind Driven Optimization algorithm. Defence Technology, 13(1), 47-58. doi:10.1016/j.dt.2017.01.001Samaniego, F., Sanchis, J., García-Nieto, S., & Simarro, R. (2019). Recursive Rewarding Modified Adaptive Cell Decomposition (RR-MACD): A Dynamic Path Planning Algorithm for UAVs. Electronics, 8(3), 306. doi:10.3390/electronics8030306Dubins, L. E. (1957). On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents. American Journal of Mathematics, 79(3), 497. doi:10.2307/2372560Fleury, S., Soueres, P., Laumond, J.-P., & Chatila, R. (1995). Primitives for smoothing mobile robot trajectories. IEEE Transactions on Robotics and Automation, 11(3), 441-448. doi:10.1109/70.388788Vanegas, G., Samaniego, F., Girbes, V., Armesto, L., & Garcia-Nieto, S. (2018). Smooth 3D path planning for non-holonomic UAVs. 2018 7th International Conference on Systems and Control (ICSC). doi:10.1109/icosc.2018.8587835Brezak, M., & Petrovic, I. (2014). Real-time Approximation of Clothoids With Bounded Error for Path Planning Applications. IEEE Transactions on Robotics, 30(2), 507-515. doi:10.1109/tro.2013.2283928Barsky, B. A., & DeRose, T. D. (1989). Geometric continuity of parametric curves: three equivalent characterizations. IEEE Computer Graphics and Applications, 9(6), 60-69. doi:10.1109/38.41470Kim, H., Kim, D., Shin, J.-U., Kim, H., & Myung, H. (2014). Angular rate-constrained path planning algorithm for unmanned surface vehicles. Ocean Engineering, 84, 37-44. doi:10.1016/j.oceaneng.2014.03.034Isaacs, J., & Hespanha, J. (2013). Dubins Traveling Salesman Problem with Neighborhoods: A Graph-Based Approach. Algorithms, 6(1), 84-99. doi:10.3390/a6010084Masehian, E., & Kakahaji, H. (2014). NRR: a nonholonomic random replanner for navigation of car-like robots in unknown environments. Robotica, 32(7), 1101-1123. doi:10.1017/s0263574713001276Fraichard, T., & Scheuer, A. (2004). From Reeds and Shepp’s to Continuous-Curvature Paths. IEEE Transactions on Robotics, 20(6), 1025-1035. doi:10.1109/tro.2004.833789Pepy, R., Lambert, A., & Mounier, H. (s. f.). Path Planning using a Dynamic Vehicle Model. 2006 2nd International Conference on Information & Communication Technologies. doi:10.1109/ictta.2006.1684472Girbés, V., Vanegas, G., & Armesto, L. (2019). Clothoid-Based Three-Dimensional Curve for Attitude Planning. Journal of Guidance, Control, and Dynamics, 42(8), 1886-1898. doi:10.2514/1.g003551De Lorenzis, L., Wriggers, P., & Hughes, T. J. R. (2014). Isogeometric contact: a review. GAMM-Mitteilungen, 37(1), 85-123. doi:10.1002/gamm.201410005Pigounakis, K. G., Sapidis, N. S., & Kaklis, P. D. (1996). Fairing Spatial B-Spline Curves. Journal of Ship Research, 40(04), 351-367. doi:10.5957/jsr.1996.40.4.351Pérez, L. H., Aguilar, M. C. M., Sánchez, N. M., & Montesinos, A. F. (2018). Path Planning Based on Parametric Curves. Advanced Path Planning for Mobile Entities. doi:10.5772/intechopen.72574Huh, U.-Y., & Chang, S.-R. (2014). A G2 Continuous Path-smoothing Algorithm Using Modified Quadratic Polynomial Interpolation. International Journal of Advanced Robotic Systems, 11(2), 25. doi:10.5772/57340Chang, S.-R., & Huh, U.-Y. (2014). A Collision-Free G2 Continuous Path-Smoothing Algorithm Using Quadratic Polynomial Interpolation. International Journal of Advanced Robotic Systems, 11(12), 194. doi:10.5772/59463Yaochu Jin, & Sendhoff, B. (2008). Pareto-Based Multiobjective Machine Learning: An Overview and Case Studies. IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews), 38(3), 397-415. doi:10.1109/tsmcc.2008.919172Velasco-Carrau, J., García-Nieto, S., Salcedo, J. V., & Bishop, R. H. (2016). Multi-Objective Optimization for Wind Estimation and Aircraft Model Identification. Journal of Guidance, Control, and Dynamics, 39(2), 372-389. doi:10.2514/1.g001294Honig, E., Schucking, E. L., & Vishveshwara, C. V. (1974). Motion of charged particles in homogeneous electromagnetic fields. Journal of Mathematical Physics, 15(6), 774-781. doi:10.1063/1.1666728Iyer, B. R., & Vishveshwara, C. V. (1988). The Frenet-Serret formalism and black holes in higher dimensions. Classical and Quantum Gravity, 5(7), 961-970. doi:10.1088/0264-9381/5/7/005Laumanns, M., Thiele, L., Deb, K., & Zitzler, E. (2002). Combining Convergence and Diversity in Evolutionary Multiobjective Optimization. Evolutionary Computation, 10(3), 263-282. doi:10.1162/106365602760234108Blasco, X., Herrero, J. M., Sanchis, J., & Martínez, M. (2008). A new graphical visualization of n-dimensional Pareto front for decision-making in multiobjective optimization. Information Sciences, 178(20), 3908-3924. doi:10.1016/j.ins.2008.06.01

Shift-based density estimation for pareto-based algorithms in many-objective optimization

It is commonly accepted that Pareto-based evolutionary multiobjective optimization (EMO) algorithms encounter difficulties in dealing with many-objective problems. In these algorithms, the ineffectiveness of the Pareto dominance relation for a high-dimensional space leads diversity maintenance mechanisms to play the leading role during the evolutionary process, while the preference of diversity maintenance mechanisms for individuals in sparse regions results in the final solutions distributed widely over the objective space but distant from the desired Pareto front. Intuitively, there are two ways to address this problem: 1) modifying the Pareto dominance relation and 2) modifying the diversity maintenance mechanism in the algorithm. In this paper, we focus on the latter and propose a shift-based density estimation (SDE) strategy. The aim of our study is to develop a general modification of density estimation in order to make Pareto-based algorithms suitable for many-objective optimization. In contrast to traditional density estimation that only involves the distribution of individuals in the population, SDE covers both the distribution and convergence information of individuals. The application of SDE in three popular Pareto-based algorithms demonstrates its usefulness in handling many-objective problems. Moreover, an extensive comparison with five state-of-the-art EMO algorithms reveals its competitiveness in balancing convergence and diversity of solutions. These findings not only show that SDE is a good alternative to tackle many-objective problems, but also present a general extension of Pareto-based algorithms in many-objective optimization. © 2013 IEEE

Dynamic multi-objective optimisation using deep reinforcement learning::benchmark, algorithm and an application to identify vulnerable zones based on water quality

Dynamic multi-objective optimisation problem (DMOP) has brought a great challenge to the reinforcement learning (RL) research area due to its dynamic nature such as objective functions, constraints and problem parameters that may change over time. This study aims to identify the lacking in the existing benchmarks for multi-objective optimisation for the dynamic environment in the RL settings. Hence, a dynamic multi-objective testbed has been created which is a modified version of the conventional deep-sea treasure (DST) hunt testbed. This modified testbed fulfils the changing aspects of the dynamic environment in terms of the characteristics where the changes occur based on time. To the authors’ knowledge, this is the first dynamic multi-objective testbed for RL research, especially for deep reinforcement learning. In addition to that, a generic algorithm is proposed to solve the multi-objective optimisation problem in a dynamic constrained environment that maintains equilibrium by mapping different objectives simultaneously to provide the most compromised solution that closed to the true Pareto front (PF). As a proof of concept, the developed algorithm has been implemented to build an expert system for a real-world scenario using Markov decision process to identify the vulnerable zones based on water quality resilience in São Paulo, Brazil. The outcome of the implementation reveals that the proposed parity-Q deep Q network (PQDQN) algorithm is an efficient way to optimise the decision in a dynamic environment. Moreover, the result shows PQDQN algorithm performs better compared to the other state-of-the-art solutions both in the simulated and the real-world scenario

Evolutionary many-objective optimisation: pushing the boundaries

This thesis was submitted for the award of Doctor of Philosophy and was awarded by Brunel University LondonMany-objective optimisation poses great challenges to evolutionary algorithms. To start with, the ineffectiveness of the Pareto dominance relation, which is the most important criterion in multi-objective optimisation, results in the underperformance of traditional Pareto-based algorithms. Also, the aggravation of the conflict between proximity and diversity, along with increasing time or space requirement as well as parameter sensitivity, has become key barriers to the design of effective many-objective optimisation algorithms. Furthermore, the infeasibility of solutions' direct observation can lead to serious difficulties in algorithms' performance investigation and comparison. In this thesis, we address these challenges, aiming to make evolutionary algorithms as effective in many-objective optimisation as in two- or three-objective optimisation. First, we significantly enhance Pareto-based algorithms to make them suitable for many-objective optimisation by placing individuals with poor proximity into crowded regions so that these individuals can have a better chance to be eliminated. Second, we propose a grid-based evolutionary algorithm which explores the potential of the grid to deal with many-objective optimisation problems. Third, we present a bi-goal evolution framework that converts many objectives of a given problem into two objectives regarding proximity and diversity, thus creating an optimisation problem in which the objectives are the goals of the search process itself. Fourth, we propose a comprehensive performance indicator to compare evolutionary algorithms in optimisation problems with various Pareto front shapes and any objective dimensionality. Finally, we construct a test problem to aid the visual investigation of evolutionary search, with its Pareto optimal solutions in a two-dimensional decision space having similar distribution to their images in a higher-dimensional objective space. The work reported in this thesis is the outcome of innovative attempts at addressing some of the most challenging problems in evolutionary many-objective optimisation. This research has not only made some of the existing approaches, such as Pareto-based or grid-based algorithms that were traditionally regarded as unsuitable, now effective for many-objective optimisation, but also pushed other important boundaries with novel ideas including bi-goal evolution, a comprehensive performance indicator and a test problem for visual investigation. All the proposed algorithms have been systematically evaluated against existing state of the arts, and some of these algorithms have already been taken up by researchers and practitioners in the field.Department of Computer Science, Brunel University Londo

Evolutionary Game Theoretic Multi-Objective Optimization Algorithms and Their Applications

Multi-objective optimization problems require more than one objective functions to be optimized simultaneously. They are widely applied in many science fields, including engineering, economics and logistics where optimal decisions need to be taken in the presence of trade-offs between two or more conicting objectives. Most of the real world multi-objective optimization problems are NP-Hard problems. It may be too computationally costly to find an exact solution but sometimes a near optimal solution is sufficient. In these cases, Multi-Objective Evolutionary Algorithms (MOEAs) provide good approximate solutions to problems that cannot be solved easily using other techniques. However Evolutionary Algorithm is not stable due to its random nature, it may produce very different results every time it runs. This dissertation proposes an Evolutionary Game Theory (EGT) framework based algorithm (EGTMOA) that provides optimality and stability at the same time. EGTMOA combines the notion of stability from EGT and optimality from MOEA to form a novel and promising algorithm to solve multi-objective optimization problems. This dissertation studies three different multi-objective optimization applications, Cloud Virtual Machine Placement, Body Sensor Networks, and Multi-Hub Molecular Communication along with their proposed EGTMOA framework based algorithms. Experiment results show that EGTMOAs outperform many well known multi-objective evolutionary algorithms in stability, performance and runtime