A swarm intelligence based approach to the mine detection problem

This research focuses on the application of swarm intelligence to the problem of mine detection. Swarm Intelligence concepts have captivated the interests of researchers mainly in collective robotics, optimization problems (traveling salesman problem (TSP), quadratic assignment problem, graph coloring etc.), and communication networks (routing) etc [1]. In the mine detection problem we are faced with sub problems such as searching for the mines over the minefield, defusing them effectively, and assuring that the field is clear of mines within the least possible time. In the problem, we assume that the mines can be diffused by the collective action of the robots for which a model based on ant colonies is given. In the first part of the project we study the ant colony system applied to the mine detection problem. The theoretical aspects such as the ant\u27s behavior (reaction of the ants to various circumstances that it faces), their motion over the minefield, and their process of defusing the mines are investigated. In the second section we highlight a certain formulation that the ants may be given for doing the task effectively. The ants do the task effectively when they are able to assure that the minefield is clear of the mines within the least possible time. A compilation of the results obtained by the various studies is tabulated. In the third and final section we talk about our emulations conducted on the Multi Agent Biorobotics Lab-built groundscout robots, which were used for the demonstration of our swarm intelligence-based algorithms at a practical basis. The various projects thus far conducted were a part of the Multi Agent Biorobotics Lab at Rochester Institute of Technology

Load Balancing in a Network using Ant Colony Optimization Technique

This thesis describes a method of achieving load balancing in telecommunications networks. A simulated network models a typical distribution of calls between nodes; nodes carrying an excess of traffic can become congested, causing calls to be lost. In addition to calls, the network also supports a population of simple mobile agents with behaviours modelled on the trail laying abilities of ants. The ants move across the network between randomly chosen pairs of nodes; as they move they deposit simulated pheromones as a function of their distance from their source node, and the congestion encountered on their journey. They select their path at each intermediate node according the distribution of simulated pheromones at each node. Calls between nodes are routed as a function of the pheromone distributions at each intermediate node. The performance of the network is measured by the average no of hops taken to complete the calls. In this thesis ,the results of using the antbased control (ABC) are compared with those achieved by using fixed shortestpath routes,(dijkstra’s algorithm) used in network management. The ABC system is shown to result in fewer call failures than the other methods, while exhibiting many attractive features of distributed control

Accelerating ant colony optimization by using local search

This thesis report is submitted in partial fulfillment of the requirements for the degree of Bachelor of Science in Computer Science and Engineering, 2015.Cataloged from PDF version of thesis report.Includes bibliographical references (page 42-45).Optimization is very important fact in terms of taking decision in mathematics, statistics, computer science and real life problem solving or decision making application. Many different optimization techniques have been developed for solving such functional problem. In order to solving various problem computer Science introduce evolutionary optimization algorithm and their hybrid. In recent years, test functions are using to validate new optimization algorithms and to compare the performance with other existing algorithm. There are many Single Object Optimization algorithm proposed earlier. For example: ACO, PSO, ABC. ACO is a popular optimization technique for solving hard combination mathematical optimization problem. In this paper, we run ACO upon five benchmark function and modified the parameter of ACO in order to perform SBX crossover and polynomial mutation. The proposed algorithm SBXACO is tested upon some benchmark function under both static and dynamic to evaluate performances. We choose wide range of benchmark function and compare results with existing DE and its hybrid DEahcSPX from other literature are also presented here.Nabila TabassumMaruful HaqueB. Computer Science and Engineerin

Fuzzy Expert Ants to speed up big TSP Problems using ACS

Ant colony algorithms are a group of heuristic optimization algorithms that have been inspired by behavior of real ants foraging for food. In these algorithms some simple agents (i.e. ants), search the solution space for finding the suitable solution. Ant colony algorithms have many applications to computer science problems especially in optimization, such as machine drill optimization, and routing. This group of algorithms have some sensitive parameters controlling the behavior of agents, like relative pheromone importance on trail and pheromone decay coefficient. Convergence and efficiency of algorithms is highly related to these parameters. Optimal value of these parameters for a specific problem is determined through trial and error and does not obey any rule. Some approaches proposed to adapt parameter of these algorithms for better answer. The most important feature of the current adaptation algorithms are complication and time overhead. In this paper we have presented a simple and efficient approach based on fuzzy logic for optimizing ACS algorithm and by using different experiments efficiency of this proposed approach has been evaluated and we have shown that the presented concept is one of the most important reasons in success for parameter adapting algorithms

Fruit-Fly Based Searching Algorithm For Cooperative Swarming Robotic System

Swarm intelligence can be described as a complex behaviour generated from a large number of individual agents, where each agent follows very simple rules. It is actually inspired by understanding the decentralized mechanisms in the organization of natural swarms such as the birds, the ants, the bees, the glowworms, and the fireflies. Observation of these biological behaviour has given birth to swarm robotics whereby robots have the capability to work with one another in a group to achieve the same kind of parallelism, robustness and collective capabilities. A collective behaviour movement strategy such as a “source search” and “aggregation” are commonly exhibited by the animals while finding their source of food. However, the situation for the robots is to find the source of odour, light, and sound. Meanwhile, there has been mounting interest, particularly for finding the deepest location in lakes and dams for bathymetric survey systems. Using the existing lawnmower methods incur substantial costs in terms of time, accuracy and reliability. Therefore, the usage of a swarming robotic system is proposed. In this thesis, a simple framework and methodology in developing a bio-inspired algorithm for cooperative swarming robotic application has been developed. The fruit flies or Drosophila Melanogaster movement strategy offers some advantages such as strategic 'search-aggregation' cycle, distribution of moving patterns with Levy Random, information sharing in real-time, and reduction of controller parameters during movements. A number of benchmark function processes were conducted to assess the performance of proposed FOA (Fly Optimisation Algorithm)