Detection of Flock Movement in Spatio-Temporal Database using Clustering Techniques - an Experience

In this paper, moving flock patterns are mined from spatio- temporal datasets by incorporating a clustering algorithm. A flock is defined as the set of data that move together for a certain continuous amount of time. Finding out moving flock patterns using clustering algorithms is a potential method to find out frequent patterns of movement in large trajectory datasets. In this approach, SPatial clusteRing algoRithm thrOugh sWarm intelligence (SPARROW) is the clustering algorithm used. The advantage of using SPARROW algorithm is that it can effectively discover clusters of widely varying sizes and shapes from large databases. Variations of the proposed method are addressed and also the experimental results show that the problem of scalability and duplicate pattern formation is addressed. This method also reduces the number of patterns produced

Communicating neurons: a connectionist spiking neuron implementation of stochastic diffusion search

An information processing paradigm in the brain is proposed, instantiated in an artificial neural network using biologically motivated temporal encoding. The network will locate within the external world stimulus, the target memory, defined by a specific pattern of micro-features. The proposed network is robust and efficient. Akin in operation to the swarm intelligence paradigm, stochastic diffusion search, it will find the best-fit to the memory with linear time complexity. information multiplexing enables neurons to process knowledge as 'tokens' rather than 'types'. The network illustrates possible emergence of cognitive processing from low level interactions such as memory retrieval based on partial matching. (C) 2007 Elsevier B.V. All rights reserved.

Formation of networked mobile robots

This thesis presents a novel approach for controlling a robotic swarm to generate a geometric pattern described by a given contour, and a suitable communication scheme which enables the robots to communicate with each other as an all-to-all network.

Autonomous underwater vehicles in a hazardous non-deterministic environment

This research investigated the cooperation of multi underwater robots to perform a task. This combined engineering design, electronics and consensus control to create systems capable of achieving the task. Challenges such as underwater radio communications were researched and a simulation framework was created and tested on virtual and real systems.

A probabilistic movement model for shortest path formation in virtual ant-like agents

We propose a probabilistic movement model for controlling ant-like agents foraging between two points. Such agents are all identical, simple, autonomous and can only communicate indirectly through the environment. These agents secrete two types of pheromone, one to mark trails towards the goal and another to mark trails back to the starting point. Three pheromone perception strategies are proposed (Strategy A, B and C). Agents that use strategy A perceive the desirability of a neighbouring location as the difference between levels of attractive and repulsive pheromone in that location. With strategy B, agents perceive the desirability of a location as the quotient of levels of attractive and repulsive pheromone. Agents using strategy C determine the product of the levels of attractive pheromone with the complement of levels of repulsive pheromone. We conduct experiments to confirm directionality as emergent property of trails formed by agents that use each strategy. In addition, we compare path formation speed and the quality of the formed path under changes in the environment. We also investigate each strategy's robustness in environments that contain obstacles. Finally, we investigate how adaptive each strategy is when obstacles are eventually removed from the scene and find that the best strategy of these three is strategy A. Such a strategy provides useful guidelines to researchers in further applications of swarm intelligence metaphors for complex problem solving.

An improved Gbest guided artificial bee colony (IGGABC) algorithm for classification and prediction tasks

Artificial Neural Networks (ANN) performance depends on network topology, activation function, behaviors of data, suitable synapse's values and learning algorithms. Many existing works used different learning algorithms to train ANN for getting high performance. Artificial Bee Colony (ABC) algorithm is one of the latest successfully Swarm Intelligence based technique for training Multilayer Perceptron (MLP). Normally Gbest Guided Artificial Bee Colony (GGABC) algorithm has strong exploitation process for solving mathematical problems, however the poor exploration creates problems like slow convergence and trapping in local minima. In this paper, the Improved Gbest Guided Artificial Bee Colony (IGGABC) algorithm is proposed for finding global optima. The proposed IGGABC algorithm has strong exploitation and exploration processes. The experimental results show that IGGABC algorithm performs better than that standard GGABC, BP and ABC algorithms for Boolean data classification and time-series prediction tasks.

A new color space based on K-medoids clustering for fire detection

Pixel color has proven to be a useful and robust cue for detection of most objects of interest like fire. In this paper, a hybrid intelligent algorithm is proposed to detect fire pixels in the background of an image. The proposed algorithm is introduced by the combination of a computational search method based on a swarm intelligence technique and the Kemdoids clustering method in order to form a Fire-based Color Space (FCS), in fact, the new technique converts RGB color system to FCS through a 3*3 matrix. This algorithm consists of five main stages:(1) extracting fire and non-fire pixels manually from the original image. (2) using K-medoids clustering to find a Cost function to minimize the error value. (3) applying Particle Swarm Optimization (PSO) to search and find the best W components in order to minimize the fitness function. (4) reporting the best matrix including feature weights, and utilizing this matrix to convert the all original images in the database to the new color space. (5) using Otsu threshold technique to binarize the final images. As compared with some state-of-the-art techniques, the experimental results show the ability and efficiency of the new method to detect fire pixels in color images.

Um Estudo de coordenação dinâmica de agentes aplicado ao gerenciamento de tráfego veicular urbano

Em sistemas de controle de tráfego veicular urbano existem diversas abordagens que lidam com o problema da redução do congestionamento de tráfego. Uma classe destas abordagens aplica a sincronização de semáforos a m de permitir que os veículos que viajam em um sentido possam passar diversos cruzamentos sem paradas. Este trabalho apresenta dois métodos de coordenação de agentes aplicados à sincroniza ção de semáforos. O primeiro método inspira-se em mecanismos de coordenação observados em insetos sociais e o segundo modela o problema de coordenação de semá- foros como um problema de otimização de restrições distribuído e faz sua resolução em tempo real utilizando mediação cooperativa. Inicialmente são apresentados conceitos básicos de sistemas de tráfego urbano, Swarm Intelligence e problemas de otimização de restrições. A partir dos conceitos iniciais, são apresentados os modelos propostos. Os resultados mostram que as abordagens propostas geram a coordenação entre os sem áforos sendo que o modo que os agentes estão coordenados pode mudar para se adaptar às mudanças nas condições do ambiente, gerando melhores condições de uxo de tráfego.

Detecção de falhas em estruturas inteligentes usando otimização por nuvem de partículas: fundamentos e estudo de casos

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Fundamentos de otimização por inteligência de enxames: uma visão geral

Este artigo apresenta uma breve revisão de alguns dos mais recentes métodos bioinspirados baseados no comportamento de populações para o desenvolvimento de técnicas de solução de problemas. As metaheurísticas tratadas aqui correspondem às estratégias de otimização por colônia de formigas, otimização por enxame de partículas, algoritmo shuffled frog-leaping, coleta de alimentos por bactérias e colônia de abelhas. Os princípios biológicos que motivaram o desenvolvimento de cada uma dessas estratégias, assim como seus respectivos algoritmos computacionais, são introduzidos. Duas aplicações diferentes foram conduzidas para exemplificar o desempenho de tais algoritmos. A finalidade é enfatizar perspectivas de aplicação destas abordagens em diferentes problemas da área de engenharia.

Binary Bat Algorithm for Feature Selection

Feature selection aims to find the most important information to save computational efforts and data storage. We formulated this task as a combinatorial optimization problem since the exponential growth of possible solutions makes an exhaustive search infeasible. In this work, we propose a new nature-inspired feature selection technique based on bats behavior, namely, binary bat algorithm The wrapper approach combines the power of exploration of the bats together with the speed of the optimum-path forest classifier to find a better data representation. Experiments in public datasets have shown that the proposed technique can indeed improve the effectiveness of the optimum-path forest and outperform some well-known swarm-based techniques. © 2013 Copyright © 2013 Elsevier Inc. All rights reserved.

A wrapper approach for feature selection based on Bat Algorithm and Optimum-Path Forest

Besides optimizing classifier predictive performance and addressing the curse of the dimensionality problem, feature selection techniques support a classification model as simple as possible. In this paper, we present a wrapper feature selection approach based on Bat Algorithm (BA) and Optimum-Path Forest (OPF), in which we model the problem of feature selection as an binary-based optimization technique, guided by BA using the OPF accuracy over a validating set as the fitness function to be maximized. Moreover, we present a methodology to better estimate the quality of the reduced feature set. Experiments conducted over six public datasets demonstrated that the proposed approach provides statistically significant more compact sets and, in some cases, it can indeed improve the classification effectiveness. © 2013 Elsevier Ltd. All rights reserved.

Previsão de séries temporais financeiras por meio de redes neurais dinâmicas e processos de transformação de dados: uma abordagem empírico-comparativa

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Hybrid heuristic-waterfilling game theory approach in MC-CDMA resource allocation

This paper discusses the power allocation with fixed rate constraint problem in multi-carrier code division multiple access (MC-CDMA) networks, that has been solved through game theoretic perspective by the use of an iterative water-filling algorithm (IWFA). The problem is analyzed under various interference density configurations, and its reliability is studied in terms of solution existence and uniqueness. Moreover, numerical results reveal the approach shortcoming, thus a new method combining swarm intelligence and IWFA is proposed to make practicable the use of game theoretic approaches in realistic MC-CDMA systems scenarios. The contribution of this paper is twofold: (i) provide a complete analysis for the existence and uniqueness of the game solution, from simple to more realist and complex interference scenarios; (ii) propose a hybrid power allocation optimization method combining swarm intelligence, game theory and IWFA. To corroborate the effectiveness of the proposed method, an outage probability analysis in realistic interference scenarios, and a complexity comparison with the classical IWFA are presented. (C) 2011 Elsevier B.V. All rights reserved.