Porcellio scaber algorithm (PSA) for solving constrained optimization problems

In this paper, we extend a bio-inspired algorithm called the porcellio scaber algorithm (PSA) to solve constrained optimization problems, including a constrained mixed discrete-continuous nonlinear optimization problem. Our extensive experiment results based on benchmark optimization problems show that the PSA has a better performance than many existing methods or algorithms. The results indicate that the PSA is a promising algorithm for constrained optimization.Comment: 6 pages, 1 figur

A Bio-Inspired Algorithm for Searching Relationships in Social Networks

Proceedings of: Third International Conference on Computational Aspects of Social Networks (CASoN).Took place 2011, October,19-21 , in Salamanca (Sapin).The event Web site is http://www.mirlabs.net/cason11/Nowadays the Social Networks are experiencing a growing importance. The reason of this is that they enable the information exchange among people, meeting people in the same field of work or establishing collaborations with other research groups. In order to manage social networks and to find people inside them, they are usually represented as graphs with persons as nodes and relationships between them as edges. Once this is done, establishing contact with anyone involves searching the chain of people to reach him/her, that is, the search of the path inside the graph which joins two nodes. In this paper, a new algorithm based on nature is proposed to realize this search: SoS-ACO (Sense of Smell - Ant Colony Optimization). This algorithm improves the classical ACO algorithm when it is applied in huge graphs.This study was funded through a competitive grant awarded by the Spanish Ministry of Education and Science for the THUBAN Project (TIN2008-02711) and through MA2VICMR consortium (S2009/TIC-1542, http://www.mavir.net), a network of excellence funded by the Madrid Regional Government.Publicad

A Bio-Inspired Algorithm and Foldable Robot Platform for Collective Excavation

abstract: Existing robotic excavation research has been primarily focused on lunar mining missions or simple traffic control in confined tunnels, however little work attempts to bring collective excavation into the realm of human infrastructure. This thesis explores a decentralized approach to excavation processes, where traffic laws are borrowed from swarms of fire ants (Solenopsis invicta) or termites (Coptotermes formosanus) to create decision rules for a swarm of robots working together and organizing effectively to create a desired final excavated pattern. First, a literature review of the behavioral rules of different types of insect colonies and the resulting structural patterns over the course of excavation was conducted. After identifying pertinent excavation laws, three different finite state machines were generated that relate to construction, search and rescue operations, and extraterrestrial exploration. After analyzing these finite state machines, it became apparent that they all shared a common controller. Then, agent-based NetLogo software was used to simulate a swarm of agents that run this controller, and a model for excavating behaviors and patterns was fit to the simulation data. This model predicts the tunnel shapes formed in the simulation as a function of the swarm size and a time delay, called the critical waiting period, in one of the state transitions. Thus, by controlling the individual agents' behavior, it was possible to control the structural outcomes of collective excavation in simulation. To create an experimental testbed that could be used to physically implement the controller, a small foldable robotic platform was developed, and it's capabilities were tested in granular media. In order to characterize the granular media, force experiments were conducted and parameters were measured for resistive forces during an excavation cycle. The final experiment verified the robot's ability to engage in excavation and deposition, and to determine whether or not to begin the critical waiting period. This testbed can be expanded with multiple robots to conduct small-scale experiments on collective excavation, such as further exploring the effects of the critical waiting period on the resulting excavation pattern. In addition, investigating other factors like tuning digging efficiency or deposition proximity could help to transition the proposed bio-inspired swarm excavation controllers to implementation in real-world applications.Dissertation/ThesisMasters Thesis Mechanical Engineering 201

A multidirectional modified Physarum solver for discrete decision making

In this paper, a bio-inspired algorithm able to incrementally grow decision graphs in multiple directions is presented. The heuristic draws inspiration from the behaviour of the slime mould Physarum Polycephalum. In its main vegetative state, the plasmodium, this large single-celled amoeboid organism extends and optimizes a net of veins looking for food. The algorithm is here used to solve classical problems in operations research (symmetric Traveling Salesman and Vehicle Routing Problems). Simulations on selected test cases demonstrate that a multidirectional modied Physarum solver performs better than a unidirectional one. The ability to evaluate decisions from multiple directions enhances the performance of the solver in the construction and selection of optimal decision sequences

OBAME: Optimized Bio-inspired Algorithm to Maximize Search Efficiency in P2P Databases

AbstractP2P databases are characterized by high site-failure rates, unpredictable network topology and complex management, due to the complete absence of a centralized controller. These characteristics have introduced novel challenges and research issues to the field. Among the most difficult challenges is the process of locating information among various participants in the network. This paper presents an original contribution by proposing an Optimized Bio-inspired Algorithm to maximize search efficiency in P2P databases (OBAME). Experimental results showed that OBAME outperformed Ant- and Bee- Inspired algorithms in terms of network traffic and query response time

Optimal multi-objective discrete decision making using a multidirectional modified Physarum solver

This paper will address a bio-inspired algorithm able to incrementally grow decision graphs in multiple directions for discrete multi-objective optimization. The algorithm takes inspiration from the slime mould Physarum Polycephalum, an amoeboid organism that in its plasmodium state extends and optimizes a net of veins looking for food. The algorithm is here used to solve multi-objective Traveling Salesman and Vehicle Routing Problems selected as representative examples of multi-objective discrete decision making problems. Simulations on selected test case showed that building decision sequences in two directions and adding a matching ability (multidirectional approach) is an advantageous choice if compared with the choice of building decision sequences in only one direction (unidirectional approach). The ability to evaluate decisions from multiple directions enhances the performance of the solver in the construction and selection of optimal decision sequences