Make Robots Be Bats: Specializing Robotic Swarms to the Bat Algorithm

Total Page:16

File Type:pdf, Size:1020Kb

Make Robots Be Bats: Specializing Robotic Swarms to the Bat Algorithm Swarm and Evolutionary Computation 44 (2019) 113–129 Contents lists available at ScienceDirect Swarm and Evolutionary Computation journal homepage: www.elsevier.com/locate/swevo Make robots be bats: specializing robotic swarms to the Bat algorithm Patricia Suárez a,AndrésIglesiasa,b,*,AkemiGálveza,b a Department of Applied Mathematics and Computational Sciences, E.T.S.I. Caminos, Canales y Puertos, University of Cantabria, Avda. de los Castros, s/n, 39005, Santander, Spain b Department of Information Science, Faculty of Sciences, Toho University, 2-2-1 Miyama 274-8510, Funabashi, Japan ARTICLE INFO ABSTRACT Keywords: Bat algorithm is a powerful nature-inspired swarm intelligence method proposed by Prof. Xin-She Yang in 2010, Swarm computation with remarkable applications in industrial and scientific domains. However, to the best of authors’ knowledge, Swarm robotics this algorithm has never been applied so far in the context of swarm robotics. With the aim to fill this gap, this Bat algorithm paper introduces the first practical implementation of the bat algorithm in swarm robotics. Our implementation Unknown target location Behavioral patterns is performed at two levels: a physical level, where we design and build a real robotic prototype; and a computa- tional level, where we develop a robotic simulation framework. A very important feature of our implementation is its high specialization: all (physical and logical) components are fully optimized to replicate the most relevant features of the real microbats and the bat algorithm as faithfully as possible. Our implementation has been tested by its application to the problem of finding a target location within unknown static indoor 3D environments. Our experimental results show that the behavioral patterns observed in the real and the simulated robotic swarms are very similar. This makes our robotic swarm implementation an ideal tool to explore the potential and limitations of the bat algorithm for real-world practical applications and their computer simulations. 1. Introduction In this context, one of the most exciting breakthroughs in artifi- cial intelligence during the last decades is the adoption and subse- 1.1. Swarm intelligence quent popularization of this collective intelligence arising from a col- lection of simple, unsophisticated, and generally homogeneous agents For many years, the concept of intelligence was generally perceived collaborating together to solve a complex problem. This field, globally to be an exclusive attribute of highly sophisticated individuals. Not sur- known as swarm intelligence [5,6], is overcoming the traditional math- prisingly, this was also the approach taken in the early days of the ematical approaches for solving optimization problems and laying the artificial intelligence field. However, nature provides several examples foundations for a new computational paradigm: the swarm computation of groups of animals that exhibit a more sophisticated social behavior [13,27]. Under this new paradigm, there is no centralized intelligence than what would be possible through the simple aggregation of individ- controlling the swarm, taking decisions, and dictating how the swarm ual behavioral patterns. As a result, the social group is able to carry out units should behave. Instead, local and (at some extent) random inter- complex tasks that their individual members cannot intend for. Take, actions between simple agents lead to the emergence of global sophisti- for instance, the colonies of social insects (ants, termites, bees, fire- cated “intelligent” behaviors, unknown to the individual agents. flies), and other animal formations (fish schooling, bird flocking, animal Nowadays, swarm intelligence is attracting increasing attention herding, and so on). They come up with astonishingly complex social from researchers and practitioners owing to its potential applications behaviors from the combined efforts of individuals with extremely lim- to many problems. For instance, military and civil applications related ited intelligence. Amazingly, this complex collective behavior emerges to the control of unmanned vehicles have been described in Refs. from a small set of simple behavioral rules exploiting only low-level [45,46,54]. Many other applications can also been found in the sci- interactions between individuals and with the environment (stigmergy) using decentralized control and self-organization. * Corresponding author. Department of Applied Mathematics and Computational Sciences, E.T.S.I. Caminos, Canales y Puertos, University of Cantabria, Avda. de los Castros, s/n, 39005, Santander, Spain. E-mail address: [email protected] (A. Iglesias). URL: http://personales.unican.es/iglesias (A. Iglesias). https://doi.org/10.1016/j.swevo.2018.01.005 Received 24 July 2017; Received in revised form 20 November 2017; Accepted 9 January 2018 Available online 14 February 2018 2210-6502/© 2018 Elsevier B.V. All rights reserved. P. Suárez et al. Swarm and Evolutionary Computation 44 (2019) 113–129 entific literature; see Refs. [5,19,63] for several illustrative examples in microbats (see Section 3 for details). In our experience, the bat algo- different fields. The interested reader is also referred to [13,27]fora rithm has shown to be a very effective method to solve complex mul- comprehensive overview about the field of swarm intelligence, its his- timodal nonlinear continuous optimization problems involving a large tory, main techniques, and applications. number of variables, such as data fitting through free-form paramet- ric curves [20,21,23]andsurfaces[22], and multi-objective problems 1.2. Swarm robotics [59]. On the other hand, the fundamental principle of the bat algorithm (namely, the echolocation through ultrasounds) along with some of its One of most relevant applications of swarm intelligence is robotics. most important features and parameters (operating frequency, operat- Several scientific papers and research projects have shown that self- ing time, number of cycles per bust, accuracy range, traveling range of organizing swarm robots can potentially accomplish complex tasks and pulses, and so on) can readily be reproduced with current hardware (see thus replace sophisticated and expensive robots by simple inexpen- Section 4 for details). This makes the bat algorithm an excellent method sive drones, a research subfield usually referred to as swarm robotics for potential applications in swarm robotics. Furthermore, some recent [3,14,64]. The reader is kindly referred to [56] for some illustrative papers have reported successful applications of the bat algorithm to early examples and applications of swarm robotics; see also [50]fora some problems in robotics [15,16]. However, these works are mostly more updated survey on recent advances in the field. As remarked by focused on the problem of parameter tuning of PI-controllers for opti- several authors [1,6], swarm robotic systems offer several interesting mal positioning of robotic arms for safety and functionality, and have advantages, such as: no direct relationship with the area of swarm robotics. Clearly, the application of bat algorithm to swarm robotics is a very promising yet • Improved performance by parallelization: swarm intelligence systems unexplored field. In this paper we are aimed at filling this gap. Conse- are very well suited for parallelization, because the swarm mem- quently, this is the algorithm used in this paper. bers can perform different actions at different locations simultane- ously.Thisfeaturemakestheswarmmoreflexibleandefficientfor 1.4. Main contributions and structure of the paper complex tasks, as individual robots (or groups of them) can solve different parts of a complex task independently. Despite of its remarkable features, to the best of our knowledge, the • Task enablement: groups of robots can do certain tasks that are bat algorithm has never been applied so far in the context of swarm impossible or very difficult for a single robot (e.g., collective trans- robotics. Aimed at filling this gap, a previous paper in Ref. [49]pre- port of too heavy items, dynamic target tracking, cooperative envi- sented some initial ideas about the application of the bat algorithm to ronment monitoring, autonomous surveillance of large areas). swarm robotics. However, that paper was based on very preliminary • Scalability: inclusion of new robots into a swarm does not require work and strongly affected by limitations of space. This paper is a sub- reprogramming the whole swarm. Furthermore, because interac- stantial extension in several ways. The main contributions of this paper tions between robots involve only neighboring individuals, the total are: number of interactions within the system does not increase dramat- ically by adding new units. 1. First and utmost contribution of this work is the first practical imple- • Distributed sensing and action: a swarm of simple interconnected mentation of the bat algorithm for swarm robotics. To the best of our mobile robots deployed throughout a large search space possesses knowledge, no previous application of the bat algorithm to swarm greater exploratory capacity and a wider range of sensing than a robotics has been reported so far in the literature. sophisticated robot. This makes the swarm much more effective 2. Our implementation is performed at two levels: we introduce both in several tasks: exploration and navigation (e.g., in disaster res- a physical robotic prototype (described in Section 4.1)andacomputa- cue missions), nanorobotics-based manufacturing, microbotics
Recommended publications
  • An Overview of Mutation Strategies in Bat Algorithm
    (IJACSA) International Journal of Advanced Computer Science and Applications, Vol. 9, No. 8, 2018 An Overview of Mutation Strategies in Bat Algorithm 3 Waqas Haider Bangyal1 Hafiz Tayyab Rauf Member IEEE SMC Department of Computer Science, Department of Computer Science, University of Gujrat, Iqra University, Islamabad, Pakistan Gujrat, Pakistan 4 Jamil Ahmad2 Sobia Pervaiz Senior Member IEEE, Professor Computer Science Department of Software Engineering, Department of Computer Science, University of Gujrat, Kohat University of Science and Technology (KUST), Gujrat, Pakistan Kohat, Pakistan Abstract—Bat algorithm (BA) is a population based stochastic embedding the qualities of social insects’ behavior in the form search technique encouraged from the intrinsic manner of bee of swarms such as bees, wasps and ants, and flocks of fishes swarm seeking for their food source. BA has been mostly used to and birds. SI first inaugurated by Beni [4] in cellular robotics resolve diverse kind of optimization problems and one of major system. Researchers are attracted with the behavior of flocks of issue faced by BA is frequently captured in local optima social insects from many years. The individual member of meanwhile handling the complex real world problems. Many these flocks can achieve hard tasks with the help of authors improved the standard BA with different mutation collaboration among others [5]; however, such colonies behave strategies but an exhausted comprehensive overview about without any centralized control. SI is very famous in bio- mutation strategies is still lacking. This paper aims to furnish a inspired algorithms, computer science, and computational concise and comprehensive study of problems and challenges that intelligence.
    [Show full text]
  • An Improved Bees Algorithm Local Search Mechanism for Numerical Dataset
    An Improved Bees Algorithm Local Search Mechanism for Numerical dataset Prepared By: Aras Ghazi Mohammed Al-dawoodi Supervisor: Dr. Massudi bin Mahmuddin DISSERTATION SUBMITTED TO THE AWANG HAD SALLEH GRADUATE SCHOOL OF COMPUTING UUM COLLEGE OF ARTS AND SCIENCES UNIVERSITI UTARA MALAYSIA IN PARITIAL FULFILLMENT OF THE REQUIREMENT FOR THE DEGREE OF MASTER IN (INFORMATION TECHNOLOGY) 2014 - 2015 Permission to Use In presenting this dissertation report in partial fulfilment of the requirements for a postgraduate degree from University Utara Malaysia, I agree that the University Library may make it freely available for inspection. I further agree that permission for the copying of this report in any manner, in whole or in part, for scholarly purpose may be granted by my supervisor(s) or, in their absence, by the Dean of Awang Had Salleh Graduate School of Arts and Sciences. It is understood that any copying or publication or use of this report or parts thereof for financial gain shall not be allowed without my written permission. It is also understood that due recognition shall be given to me and to University Utara Malaysia for any scholarly use which may be made of any material from my report. Requests for permission to copy or to make other use of materials in this project report, in whole or in part, should be addressed to: Dean of Awang Had Salleh Graduate School of Arts and Sciences UUM College of Arts and Sciences University Utara Malaysia 06010 UUM Sintok i Abstrak Bees Algorithm (BA), satu prosedur pengoptimuman heuristik, merupakan salah satu teknik carian asas yang berdasarkan kepada aktiviti pencarian makanan lebah.
    [Show full text]
  • Make Robots Be Bats: Specializing Robotic Swarms to the Bat Algorithm
    © <2019>. This manuscript version is made available under the CC- BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc- nd/4.0/ Accepted Manuscript Make robots Be Bats: Specializing robotic swarms to the Bat algorithm Patricia Suárez, Andrés Iglesias, Akemi Gálvez PII: S2210-6502(17)30633-8 DOI: 10.1016/j.swevo.2018.01.005 Reference: SWEVO 346 To appear in: Swarm and Evolutionary Computation BASE DATA Received Date: 24 July 2017 Revised Date: 20 November 2017 Accepted Date: 9 January 2018 Please cite this article as: P. Suárez, André. Iglesias, A. Gálvez, Make robots Be Bats: Specializing robotic swarms to the Bat algorithm, Swarm and Evolutionary Computation BASE DATA (2018), doi: 10.1016/j.swevo.2018.01.005. This is a PDF file of an unedited manuscript that has been accepted for publication. As a service to our customers we are providing this early version of the manuscript. The manuscript will undergo copyediting, typesetting, and review of the resulting proof before it is published in its final form. Please note that during the production process errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal pertain. ACCEPTED MANUSCRIPT Make Robots Be Bats: Specializing Robotic Swarms to the Bat Algorithm Patricia Su´arez1, Andr´esIglesias1;2;:, Akemi G´alvez1;2 1Department of Applied Mathematics and Computational Sciences E.T.S.I. Caminos, Canales y Puertos, University of Cantabria Avda. de los Castros, s/n, 39005, Santander, SPAIN 2Department of Information Science, Faculty of Sciences Toho University, 2-2-1 Miyama 274-8510, Funabashi, JAPAN :Corresponding author: [email protected] http://personales.unican.es/iglesias Abstract Bat algorithm is a powerful nature-inspired swarm intelligence method proposed by Prof.
    [Show full text]
  • Ants Meeting Algorithms
    Ants Meeting Algorithms Asaf Shiloni, Alon Levy Ariel Felner, Meir Kalech The MAVERICK Group Department of Information System Engineering Computer Science Department Deutsche Telekom Labs Bar-Ilan University, Israel Ben-Gurion University, Israel {asafshiloni,alonlevy1}@gmail.com {felner,kalech}@bgu.ac.il ABSTRACT Furthermore, ants were shown to be practical in real-world applica- Ant robots have very low computational power and limited memory. They tions. For example, the advantage of ants over convectional robots communicate by leaving pheromones in the environment. In order to create in practice is found in the micron-scale environments such as the a cooperative intelligent behavior, ants may need to get together; however, blood stream and other parts of the human body. The robots acting they may not know the locations of other ants. Hence, we focus on an ant in these environments cannot be equipped with abundant memory or high-end sensors, nor with high computational performance ca- variant of the rendezvous problem, in which two ants are to be brought to the same location in finite time. We introduce two algorithms that solve pabilities. Thus, only robots with light hardware capabilities must this problem for two ants by simulating a bidirectional search in different be used [5, 6]. environment settings. An algorithm for an environment with no obstacles Algorithms for ant robots often require cooperation between mul- and a general algorithm that handles all types of obstacles. We provide tiple ants. These algorithms usually assume that the ants start ex- detailed discussion on the different attributes, size of pheromone required, ecuting the algorithm while located at the same location, or in a and the performance of these algorithms.
    [Show full text]
  • An Analysis of Foraging and Echolocation Behavior of Swarm Intelligence Algorithms in Optimization: ACO, BCO and BA
    International Journal of Intelligence Science, 2018, 8, 1-27 http://www.scirp.org/journal/ijis ISSN Online: 2163-0356 ISSN Print: 2163-0283 An Analysis of Foraging and Echolocation Behavior of Swarm Intelligence Algorithms in Optimization: ACO, BCO and BA Tanzila Islam, Md Ezharul Islam, Mohammad Raihan Ruhin Department of Computer Science and Engineering, Jahangirnagar University, Dhaka, Bangladesh How to cite this paper: Islam, T., Islam, Abstract M.E. and Ruhin, M.R. (2018) An Analysis of Foraging and Echolocation Behavior of Optimization techniques are stimulated by Swarm Intelligence wherever the Swarm Intelligence Algorithms in Optimi- target is to get a decent competency of a problem. The knowledge of the beha- zation: ACO, BCO and BA. International vior of animals or insects has a variety of models in Swarm Intelligence. Journal of Intelligence Science, 8, 1-27. Swarm Intelligence has become a potential technique for evolving many ro- https://doi.org/10.4236/ijis.2018.81001 bust optimization problems. Researchers have developed various algorithms Received: December 19, 2017 by modeling the behaviors of the different swarm of animals or insects. This Accepted: January 28, 2018 paper explores three existing meta-heuristic methods named as Ant Colony Published: January 31, 2018 Optimization (ACO), Bee Colony Optimization (BCO) and Bat Algorithm (BA). Ant Colony Optimization was stimulated by the nature of ants. Bee Co- Copyright © 2018 by authors and Scientific Research Publishing Inc. lony Optimization was inspired by the plundering behavior of honey bees. Bat This work is licensed under the Creative Algorithm was emerged on the echolocation characteristics of micro bats.
    [Show full text]
  • Survivable Networks Via UAV Swarms Guided by Decentralized Real-Time
    Survivable Networks via UAV Swarms Guided by Decentralized Real-Time Evolutionary Computation George Leu Jiangjun Tang School of Engineering and Information Technology School of Engineering and Information Technology UNSW Canberra UNSW Canberra Canberra, Australia Canberra, Australia [email protected] [email protected] Abstract—The survivable network concept refers to contexts to provide ground network survivability regardless of the where the wireless communication between ground agents needs ground agents’ movements. To address the challenges men- to be maintained as much as possible at all times, regardless tioned above, we propose an implementation of the UAVs’ of any adverse conditions that may arise. In this paper we propose a nature-inspired approach to survivable networks, in mobility which is inspired from the classic boids model of which we bring together swarm intelligence and evolutionary Reynolds [4]. The proposed model uses modified versions computation. We use an on-line real-time Genetic Algorithm to of the two key concepts of the classic boids: the interaction optimize the movements of an UAV swarm towards maintain- based on the concept of neighborhood, and the position update ing communication between the ground agents. The proposed rule based on the weighted sum of a set of primitive forces. approach models the ground agents and the UAVs as boids- based swarms, and optimizes the movement of the UAVs using The modifications we propose are that the neighborhood is different instances of the GA running independently on each UAV. network-based [5] instead of the classic vision-based [4], and The UAV coordination mechanism is an implicit one, embedded the update rule includes forces from outside the swarm, not in the fitness function of the Genetic Algorithm instances.
    [Show full text]
  • Stigmergic Masa: a Stigmergy Based Algorithm 1479
    Proceedings of the 2014 Federated Conference on DOI: 10.15439/2014F395 Computer Science and Information Systems pp. 1477–1485 ACSIS, Vol. 2 S-MASA: A Stigmergy Based Algorithm for Multi-Target Search Ouarda Zedadra and Hamid Seridi Nicolas Jouandeau Giancarlo Fortino LabSTIC Laboratory, 8 may 1945 University Advanced Computing laboratory DIMES, Universita’ P.O.Box 401, 24000 Guelma, Algeria of saint-Denis Paris 8 University della Calabria Department of computer science Badji Mokhtar Saint Denis 93526, France Via P. Bucci, cubo 41c - 87036 Annaba University P.O.Box 12, 23000 Annaba, Algeria Email: [email protected] - Rende (CS) - Italy Email: zedadra nawel1, [email protected] Email:[email protected] Abstract—We explore the on-line problem of coverage where 1) it is of very low computational complexity, in which multiple agents have to find a target whose position is unknown, agents have a very low-range of sensors; and without a prior global information about the environment. 2) it executes a search in nearby locations first by adopting In this paper a novel algorithm for multi-target search is described, it is inspired from water vortex dynamics and based spiral turns around the starting cell and around agents on the principle of pheromone-based communication. Accord- each other; ing to this algorithm, called S-MASA (Stigmergic Multi Ant 3) agents use stigmergic communication via digital Search Area), the agents search nearby their base incrementally pheromone; using turns around their center and around each other, until 4) it can be executed on known or unknown static obstacle- the target is found, with only a group of simple distributed cooperative Ant like agents, which communicate indirectly via free environments or obstacle environments.
    [Show full text]
  • Control of Ad-Hoc Formations for Autonomous Airport Snow Shoveling
    The 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems October 18-22, 2010, Taipei, Taiwan Control of ad-hoc formations for autonomous airport snow shoveling Martin Saska and Vojtechˇ Vonasek´ and Libor Preuˇ cilˇ Abstract— In this paper, we present a framework that applies example of decentralized cleaning algorithm is a method multiple groups of autonomous snowploughs for efficiently inspired by cooperative behavior of ants introduced in [10]. removing the snow from airfields. The proposed approach in- Projecting the problem of cooperative sweeping onto the cludes formation stabilization into variable shapes depending on the width of runways. The paper is focused on trajectory plan- airfield, the snow shoveling task generates some problems ning and control during splitting and coupling of formations that have not yet been solved. Our approach considers the for cleaning smaller auxiliary roads surrounding main runways. nonholonomic kinematics of usual snowploughs as well We propose a general method using a receding horizon control as the position and orientation of the ploughs’ shovels. for iterative formation assignment. The algorithm is adapted for Furthermore, the working space is more structured due to the kinematics of car-like robots and can be utilized in arbitrary static and dynamic airport assemblage. The proposed approach the airfield environment. has been verified by simulations and by hardware experiments. As was mentioned above, the safety requirements at the airport predestinates the utilization of autonomous forma- I. INTRODUCTION tions, which has not yet been investigated in terms of sweep- The main task of the ground staff at the airport is to ing. In the classical literature, formation driving approaches maintain airports’ operations safe and uninterrupted.
    [Show full text]
  • Of Robot Ants and Elephants: a Computational Comparison
    Theoretical Computer Science 412 (2011) 5771–5788 Contents lists available at SciVerse ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs Review Of robot ants and elephants: A computational comparison Asaf Shiloni ⇤, Noa Agmon, Gal A. Kaminka The MAVERICK Group, Computer Science Department, Bar Ilan University, Israel article info abstract Article history: In the robotics community, there exist implicit assumptions concerning the computational Received 19 July 2010 capabilities of robots. Two computational classes of robots emerge as focal points of recent Received in revised form 27 April 2011 research: robot ants and robot elephants. Ants have poor memory and communication Accepted 22 June 2011 capabilities, but are able to communicate using pheromones, in effect, turning their work Communicated by G. Ausiello area into a shared memory. By comparison, elephants are computationally stronger, have large memory, and are equipped with strong sensing and communication capabilities. Unfortunately, not much is known about the relation between the capabilities of these models in terms of the tasks they can address. In this paper, we present formal models of both ants and elephants, and investigate if one dominates the other. We present two algorithms: AntEater, which allows elephant robots to execute ant algorithms and ElephantGun, which converts elephant algorithms – specified as Turing machines – into ant algorithms. By exploring the computational capabilities of these algorithms, we reach interesting
    [Show full text]
  • Arxiv:1303.6310V3 [Cs.NE] 5 Jun 2013
    A Hybrid Bat Algorithm Iztok Fister Jr.,∗ DuˇsanFister,† and Xin-She Yang‡ Abstract Swarm intelligence is a very powerful technique to be used for optimization purposes. In this paper we present a new swarm intelligence algorithm, based on the bat algorithm. The Bat algorithm is hybridized with differential evolution strategies. Besides showing very promising results of the standard benchmark functions, this hybridization also significantly improves the original bat algorithm. To cite paper as follows: I. Jr. Fister, D. Fister, X.-S Yang. A hybrid bat algorithm. Elek- trotehniˇskivestnik, 2013, in press. arXiv:1303.6310v3 [cs.NE] 5 Jun 2013 ∗University of Maribor, Faculty of electrical engineering and computer science Smetanova 17, 2000 Maribor; Electronic address: iztok.fi[email protected] †University of Maribor, Faculty of mechanical engineering Smetanova 17, 2000 Maribor; Electronic address: dusan.fi[email protected] ‡Middlesex University, School of Science and Technology London NW4 4BT, UK; Electronic address: [email protected] 1 I. INTRODUCTION Nature has always been an inspiration for researchers. In the past, many new nature- inspired algorithms have been developed to solve hard problems in optimization. In general, there are two main concepts developed in bio-inspired computation: 1. evolutionary algorithms, 2. swarm intelligence algorithms. The Evolutionary algorithms are optimization techniques [7] that base on the Darwin's principle of survival of the fittest [5]. It states that in nature the fittest indivi- duals have greater chances to survive. The Evolutionary algorithms consist of the follow- ing disciplines: genetic algorithms, evolution strategies, genetic programming, evolutionary programming, differential evolution. Although all these algorithms or methods have been developed independently, they share similar characteristics (like variation operators, selection operators) when solving problems.
    [Show full text]
  • Bat Algorithm Based Investigation and Application on Several Domains
    Citation Umar, S.U. and Rashid, T.A. (2021), "Critical analysis: bat algorithm-based investigation and application on several domains", World Journal of Engineering, Vol. ahead-of-print No. ahead-of-print. https://doi.org/10.1108/WJE-10-2020-0495 Critical Analysis: Bat Algorithm based Investigation and Application on Several Domains Shahla U. Umar1,2,*, Tarik A. Rashid3 1Technical College of Informatics, Sulaimani Polytechnic University, Sulaimani, KRG, Iraq 2Network Department, College of Computer Science and Information Technology, Kirkuk University, Kirkuk, Iraq. 3Computer Science and Engineering, School of Science and Engineering, University of Kurdistan Hewler, Erbil- KRG, Iraq. *corresponding author: [email protected] Abstract In recent years several swarm optimization algorithms, such as Bat Algorithm (BA) have emerged, which was proposed by Xin-She Yang in 2010. The idea of the algorithm was taken from the echolocation ability of bats. Purpose- The purpose of this study is to provide the reader with a full study of the Bat Algorithm, including its limitations, the fields that the algorithm has been applied, versatile optimization problems in different domains, and all the studies that assess its performance against other meta-heuristic algorithms. Design/Methodology/Approach- Bat Algorithm is given in-depth in terms of backgrounds, characteristics, limitations, it has also displayed the algorithms that hybridized with BA (K-Medoids, Back-propagation neural network, Harmony Search Algorithm, Differential Evaluation Strategies, Enhanced Particle Swarm Optimization, and Cuckoo Search Algorithm) and their theoretical results, as well as to the modifications that have been performed of the algorithm (Modified Bat Algorithm (MBA), Enhanced Bat Algorithm (EBA), Bat Algorithm with Mutation (BAM), Uninhabited Combat Aerial Vehicle-Bat algorithm with Mutation (UCAV-BAM), Nonlinear Optimization).
    [Show full text]
  • Anticipating and Preparing for Emerging Skills and Jobs Key Issues, Concerns, and Prospects Education in the Asia-Pacific Region: Issues, Concerns and Prospects
    Education in the Asia-Pacific Region: Issues, Concerns and Prospects 55 Brajesh Panth Rupert Maclean Editors Anticipating and Preparing for Emerging Skills and Jobs Key Issues, Concerns, and Prospects Education in the Asia-Pacific Region: Issues, Concerns and Prospects Volume 55 Series Editors Rupert Maclean, RMIT University, Melbourne, Australia Lorraine Pe Symaco, Zhejiang University, Hangzhou, Zhejiang, China Editorial Board Bob Adamson, The Education University of Hong Kong, Hong Kong, China Robyn Baker, New Zealand Council for Educational Research, Wellington, New Zealand Michael Crossley, University of Bristol, Bristol, UK Shanti Jagannathan, Asian Development Bank, Manila, Philippines Yuto Kitamura, University of Tokyo, Tokyo, Japan Colin Power, Graduate School of Education, University of Queensland, Brisbane, Australia Konai Helu Thaman, University of the South Pacific, Suva, Fiji Advisory Editors Mark Bray, UNESCO Chair, Comparative Education Research Centre, The University of Hong Kong, Hong Kong, China Yin Cheong Cheng, The Education University of Hong Kong, Hong Kong, China John Fien, RMIT University, Melbourne, Australia Pham Lan Huong, International Educational Research Centre, Ho Chi Minh City, Vietnam Chong-Jae Lee, Korean Educational Development Institute (KEDI), Seoul, Korea (Republic of) Naing Yee Mar, GIZ, Yangon, Myanmar Geoff Masters, Australian Council for Educational Research, Melbourne, Australia Margarita Pavlova, The Education University of Hong Kong, Hong Kong, China Max Walsh, Secondary Education Project, Manila, Philippines Uchita de Zoysa, Global Sustainability Solutions (GLOSS), Colombo, Sri Lanka The purpose of this Series is to meet the needs of those interested in an in-depth analysis of current developments in education and schooling in the vast and diverse Asia-Pacific Region. The Series will be invaluable for educational researchers, policy makers and practitioners, who want to better understand the major issues, concerns and prospects regarding educational developments in the Asia-Pacific region.
    [Show full text]