Foraging on the potential energy surface: A swarm intelligence-based optimizer for molecular geometry

NASA Astrophysics Data System (ADS)

Wehmeyer, Christoph; Falk von Rudorff, Guido; Wolf, Sebastian; Kabbe, Gabriel; Schärf, Daniel; Kühne, Thomas D.; Sebastiani, Daniel

2012-11-01

We present a stochastic, swarm intelligence-based optimization algorithm for the prediction of global minima on potential energy surfaces of molecular cluster structures. Our optimization approach is a modification of the artificial bee colony (ABC) algorithm which is inspired by the foraging behavior of honey bees. We apply our modified ABC algorithm to the problem of global geometry optimization of molecular cluster structures and show its performance for clusters with 2-57 particles and different interatomic interaction potentials.

Firefly as a novel swarm intelligence variable selection method in spectroscopy.

PubMed

Goodarzi, Mohammad; dos Santos Coelho, Leandro

2014-12-10

A critical step in multivariate calibration is wavelength selection, which is used to build models with better prediction performance when applied to spectral data. Up to now, many feature selection techniques have been developed. Among all different types of feature selection techniques, those based on swarm intelligence optimization methodologies are more interesting since they are usually simulated based on animal and insect life behavior to, e.g., find the shortest path between a food source and their nests. This decision is made by a crowd, leading to a more robust model with less falling in local minima during the optimization cycle. This paper represents a novel feature selection approach to the selection of spectroscopic data, leading to more robust calibration models. The performance of the firefly algorithm, a swarm intelligence paradigm, was evaluated and compared with genetic algorithm and particle swarm optimization. All three techniques were coupled with partial least squares (PLS) and applied to three spectroscopic data sets. They demonstrate improved prediction results in comparison to when only a PLS model was built using all wavelengths. Results show that firefly algorithm as a novel swarm paradigm leads to a lower number of selected wavelengths while the prediction performance of built PLS stays the same. Copyright © 2014. Published by Elsevier B.V.

VDLLA: A virtual daddy-long legs optimization

NASA Astrophysics Data System (ADS)

Yaakub, Abdul Razak; Ghathwan, Khalil I.

2016-08-01

Swarm intelligence is a strong optimization algorithm based on a biological behavior of insects or animals. The success of any optimization algorithm is depending on the balance between exploration and exploitation. In this paper, we present a new swarm intelligence algorithm, which is based on daddy long legs spider (VDLLA) as a new optimization algorithm with virtual behavior. In VDLLA, each agent (spider) has nine positions which represent the legs of spider and each position represent one solution. The proposed VDLLA is tested on four standard functions using average fitness, Medium fitness and standard deviation. The results of proposed VDLLA have been compared against Particle Swarm Optimization (PSO), Differential Evolution (DE) and Bat Inspired Algorithm (BA). Additionally, the T-Test has been conducted to show the significant deference between our proposed and other algorithms. VDLLA showed very promising results on benchmark test functions for unconstrained optimization problems and also significantly improved the original swarm algorithms.

Applying Adaptive Swarm Intelligence Technology with Structuration in Web-Based Collaborative Learning

ERIC Educational Resources Information Center

Huang, Yueh-Min; Liu, Chien-Hung

2009-01-01

One of the key challenges in the promotion of web-based learning is the development of effective collaborative learning environments. We posit that the structuration process strongly influences the effectiveness of technology used in web-based collaborative learning activities. In this paper, we propose an ant swarm collaborative learning (ASCL)…

A joint swarm intelligence algorithm for multi-user detection in MIMO-OFDM system

NASA Astrophysics Data System (ADS)

Hu, Fengye; Du, Dakun; Zhang, Peng; Wang, Zhijun

2014-11-01

In the multi-input multi-output orthogonal frequency division multiplexing (MIMO-OFDM) system, traditional multi-user detection (MUD) algorithms that usually used to suppress multiple access interference are difficult to balance system detection performance and the complexity of the algorithm. To solve this problem, this paper proposes a joint swarm intelligence algorithm called Ant Colony and Particle Swarm Optimisation (AC-PSO) by integrating particle swarm optimisation (PSO) and ant colony optimisation (ACO) algorithms. According to simulation results, it has been shown that, with low computational complexity, the MUD for the MIMO-OFDM system based on AC-PSO algorithm gains comparable MUD performance with maximum likelihood algorithm. Thus, the proposed AC-PSO algorithm provides a satisfactory trade-off between computational complexity and detection performance.

Swarm Intelligence Optimization and Its Applications

NASA Astrophysics Data System (ADS)

Ding, Caichang; Lu, Lu; Liu, Yuanchao; Peng, Wenxiu

Swarm Intelligence is a computational and behavioral metaphor for solving distributed problems inspired from biological examples provided by social insects such as ants, termites, bees, and wasps and by swarm, herd, flock, and shoal phenomena in vertebrates such as fish shoals and bird flocks. An example of successful research direction in Swarm Intelligence is ant colony optimization (ACO), which focuses on combinatorial optimization problems. Ant algorithms can be viewed as multi-agent systems (ant colony), where agents (individual ants) solve required tasks through cooperation in the same way that ants create complex social behavior from the combined efforts of individuals.

Swarm Intelligence for Urban Dynamics Modelling

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ghnemat, Rawan; Bertelle, Cyrille; Duchamp, Gerard H. E.

2009-04-16

In this paper, we propose swarm intelligence algorithms to deal with dynamical and spatial organization emergence. The goal is to model and simulate the developement of spatial centers using multi-criteria. We combine a decentralized approach based on emergent clustering mixed with spatial constraints or attractions. We propose an extension of the ant nest building algorithm with multi-center and adaptive process. Typically, this model is suitable to analyse and simulate urban dynamics like gentrification or the dynamics of the cultural equipment in urban area.

Swarm Intelligence for Urban Dynamics Modelling

NASA Astrophysics Data System (ADS)

Ghnemat, Rawan; Bertelle, Cyrille; Duchamp, Gérard H. E.

2009-04-01

In this paper, we propose swarm intelligence algorithms to deal with dynamical and spatial organization emergence. The goal is to model and simulate the developement of spatial centers using multi-criteria. We combine a decentralized approach based on emergent clustering mixed with spatial constraints or attractions. We propose an extension of the ant nest building algorithm with multi-center and adaptive process. Typically, this model is suitable to analyse and simulate urban dynamics like gentrification or the dynamics of the cultural equipment in urban area.

Deploying swarm intelligence in medical imaging identifying metastasis, micro-calcifications and brain image segmentation.

PubMed

al-Rifaie, Mohammad Majid; Aber, Ahmed; Hemanth, Duraiswamy Jude

2015-12-01

This study proposes an umbrella deployment of swarm intelligence algorithm, such as stochastic diffusion search for medical imaging applications. After summarising the results of some previous works which shows how the algorithm assists in the identification of metastasis in bone scans and microcalcifications on mammographs, for the first time, the use of the algorithm in assessing the CT images of the aorta is demonstrated along with its performance in detecting the nasogastric tube in chest X-ray. The swarm intelligence algorithm presented in this study is adapted to address these particular tasks and its functionality is investigated by running the swarms on sample CT images and X-rays whose status have been determined by senior radiologists. In addition, a hybrid swarm intelligence-learning vector quantisation (LVQ) approach is proposed in the context of magnetic resonance (MR) brain image segmentation. The particle swarm optimisation is used to train the LVQ which eliminates the iteration-dependent nature of LVQ. The proposed methodology is used to detect the tumour regions in the abnormal MR brain images.

Improved discrete swarm intelligence algorithms for endmember extraction from hyperspectral remote sensing images

NASA Astrophysics Data System (ADS)

Su, Yuanchao; Sun, Xu; Gao, Lianru; Li, Jun; Zhang, Bing

2016-10-01

Endmember extraction is a key step in hyperspectral unmixing. A new endmember extraction framework is proposed for hyperspectral endmember extraction. The proposed approach is based on the swarm intelligence (SI) algorithm, where discretization is used to solve the SI algorithm because pixels in a hyperspectral image are naturally defined within a discrete space. Moreover, a "distance" factor is introduced into the objective function to limit the endmember numbers which is generally limited in real scenarios, while traditional SI algorithms likely produce superabundant spectral signatures, which generally belong to the same classes. Three endmember extraction methods are proposed based on the artificial bee colony, ant colony optimization, and particle swarm optimization algorithms. Experiments with both simulated and real hyperspectral images indicate that the proposed framework can improve the accuracy of endmember extraction.

A New Stochastic Technique for Painlevé Equation-I Using Neural Network Optimized with Swarm Intelligence

PubMed Central

Raja, Muhammad Asif Zahoor; Khan, Junaid Ali; Ahmad, Siraj-ul-Islam; Qureshi, Ijaz Mansoor

2012-01-01

A methodology for solution of Painlevé equation-I is presented using computational intelligence technique based on neural networks and particle swarm optimization hybridized with active set algorithm. The mathematical model of the equation is developed with the help of linear combination of feed-forward artificial neural networks that define the unsupervised error of the model. This error is minimized subject to the availability of appropriate weights of the networks. The learning of the weights is carried out using particle swarm optimization algorithm used as a tool for viable global search method, hybridized with active set algorithm for rapid local convergence. The accuracy, convergence rate, and computational complexity of the scheme are analyzed based on large number of independents runs and their comprehensive statistical analysis. The comparative studies of the results obtained are made with MATHEMATICA solutions, as well as, with variational iteration method and homotopy perturbation method. PMID:22919371

Swarm intelligence in humans: A perspective of emergent evolution

NASA Astrophysics Data System (ADS)

Tao, Yong

2018-07-01

The origin of intelligence has fascinated scientists for a long time. Over the past 100 years, many scholars have observed the connection between entropy and intelligence. In the present study, we investigated a potential origin of the swarm intelligence in humans. The present study shows that a competitive economy consisting of a large number of self-interested agents can be mapped to a Boltzmann-like system, where entropy and energy play roles of swarm intelligence and income, respectively. However, different from the physical entropy in the Boltzmann system, the entropy (or swarm intelligence) in the economic system is a self-referential variable, which may be a key characteristic for distinguishing between biological and physical systems. Furthermore, we employ the household income data from 66 countries and Hong Kong SAR to test the validity of the Boltzmann-like distribution. Remarkably, the empirical data are perfectly consistent with the theoretical results. This finding implies that the competitive behaviors among a colony of self-interested agents will spontaneously prompt the colony to evolve to a state of higher technological level, although each agent has no willingness to evolve.

Software Engineering and Swarm-Based Systems

NASA Technical Reports Server (NTRS)

Hinchey, Michael G.; Sterritt, Roy; Pena, Joaquin; Rouff, Christopher A.

2006-01-01

We discuss two software engineering aspects in the development of complex swarm-based systems. NASA researchers have been investigating various possible concept missions that would greatly advance future space exploration capabilities. The concept mission that we have focused on exploits the principles of autonomic computing as well as being based on the use of intelligent swarms, whereby a (potentially large) number of similar spacecraft collaborate to achieve mission goals. The intent is that such systems not only can be sent to explore remote and harsh environments but also are endowed with greater degrees of protection and longevity to achieve mission goals.

Swarm intelligence inspired shills and the evolution of cooperation.

PubMed

Duan, Haibin; Sun, Changhao

2014-06-09

Many hostile scenarios exist in real-life situations, where cooperation is disfavored and the collective behavior needs intervention for system efficiency improvement. Towards this end, the framework of soft control provides a powerful tool by introducing controllable agents called shills, who are allowed to follow well-designed updating rules for varying missions. Inspired by swarm intelligence emerging from flocks of birds, we explore here the dependence of the evolution of cooperation on soft control by an evolutionary iterated prisoner's dilemma (IPD) game staged on square lattices, where the shills adopt a particle swarm optimization (PSO) mechanism for strategy updating. We demonstrate that not only can cooperation be promoted by shills effectively seeking for potentially better strategies and spreading them to others, but also the frequency of cooperation could be arbitrarily controlled by choosing appropriate parameter settings. Moreover, we show that adding more shills does not contribute to further cooperation promotion, while assigning higher weights to the collective knowledge for strategy updating proves a efficient way to induce cooperative behavior. Our research provides insights into cooperation evolution in the presence of PSO-inspired shills and we hope it will be inspirational for future studies focusing on swarm intelligence based soft control.

Intelligent ensemble T-S fuzzy neural networks with RCDPSO_DM optimization for effective handling of complex clinical pathway variances.

PubMed

Du, Gang; Jiang, Zhibin; Diao, Xiaodi; Yao, Yang

2013-07-01

Takagi-Sugeno (T-S) fuzzy neural networks (FNNs) can be used to handle complex, fuzzy, uncertain clinical pathway (CP) variances. However, there are many drawbacks, such as slow training rate, propensity to become trapped in a local minimum and poor ability to perform a global search. In order to improve overall performance of variance handling by T-S FNNs, a new CP variance handling method is proposed in this study. It is based on random cooperative decomposing particle swarm optimization with double mutation mechanism (RCDPSO_DM) for T-S FNNs. Moreover, the proposed integrated learning algorithm, combining the RCDPSO_DM algorithm with a Kalman filtering algorithm, is applied to optimize antecedent and consequent parameters of constructed T-S FNNs. Then, a multi-swarm cooperative immigrating particle swarm algorithm ensemble method is used for intelligent ensemble T-S FNNs with RCDPSO_DM optimization to further improve stability and accuracy of CP variance handling. Finally, two case studies on liver and kidney poisoning variances in osteosarcoma preoperative chemotherapy are used to validate the proposed method. The result demonstrates that intelligent ensemble T-S FNNs based on the RCDPSO_DM achieves superior performances, in terms of stability, efficiency, precision and generalizability, over PSO ensemble of all T-S FNNs with RCDPSO_DM optimization, single T-S FNNs with RCDPSO_DM optimization, standard T-S FNNs, standard Mamdani FNNs and T-S FNNs based on other algorithms (cooperative particle swarm optimization and particle swarm optimization) for CP variance handling. Therefore, it makes CP variance handling more effective. Copyright © 2013 Elsevier Ltd. All rights reserved.

EEG/ERP adaptive noise canceller design with controlled search space (CSS) approach in cuckoo and other optimization algorithms.

PubMed

Ahirwal, M K; Kumar, Anil; Singh, G K

2013-01-01

This paper explores the migration of adaptive filtering with swarm intelligence/evolutionary techniques employed in the field of electroencephalogram/event-related potential noise cancellation or extraction. A new approach is proposed in the form of controlled search space to stabilize the randomness of swarm intelligence techniques especially for the EEG signal. Swarm-based algorithms such as Particles Swarm Optimization, Artificial Bee Colony, and Cuckoo Optimization Algorithm with their variants are implemented to design optimized adaptive noise canceler. The proposed controlled search space technique is tested on each of the swarm intelligence techniques and is found to be more accurate and powerful. Adaptive noise canceler with traditional algorithms such as least-mean-square, normalized least-mean-square, and recursive least-mean-square algorithms are also implemented to compare the results. ERP signals such as simulated visual evoked potential, real visual evoked potential, and real sensorimotor evoked potential are used, due to their physiological importance in various EEG studies. Average computational time and shape measures of evolutionary techniques are observed 8.21E-01 sec and 1.73E-01, respectively. Though, traditional algorithms take negligible time consumption, but are unable to offer good shape preservation of ERP, noticed as average computational time and shape measure difference, 1.41E-02 sec and 2.60E+00, respectively.

Swarm Intelligence in Text Document Clustering

DOE Office of Scientific and Technical Information (OSTI.GOV)

Cui, Xiaohui; Potok, Thomas E

2008-01-01

Social animals or insects in nature often exhibit a form of emergent collective behavior. The research field that attempts to design algorithms or distributed problem-solving devices inspired by the collective behavior of social insect colonies is called Swarm Intelligence. Compared to the traditional algorithms, the swarm algorithms are usually flexible, robust, decentralized and self-organized. These characters make the swarm algorithms suitable for solving complex problems, such as document collection clustering. The major challenge of today's information society is being overwhelmed with information on any topic they are searching for. Fast and high-quality document clustering algorithms play an important role inmore » helping users to effectively navigate, summarize, and organize the overwhelmed information. In this chapter, we introduce three nature inspired swarm intelligence clustering approaches for document clustering analysis. These clustering algorithms use stochastic and heuristic principles discovered from observing bird flocks, fish schools and ant food forage.« less

Application of ant colony Algorithm and particle swarm optimization in architectural design

NASA Astrophysics Data System (ADS)

Song, Ziyi; Wu, Yunfa; Song, Jianhua

2018-02-01

By studying the development of ant colony algorithm and particle swarm algorithm, this paper expounds the core idea of the algorithm, explores the combination of algorithm and architectural design, sums up the application rules of intelligent algorithm in architectural design, and combines the characteristics of the two algorithms, obtains the research route and realization way of intelligent algorithm in architecture design. To establish algorithm rules to assist architectural design. Taking intelligent algorithm as the beginning of architectural design research, the authors provide the theory foundation of ant colony Algorithm and particle swarm algorithm in architectural design, popularize the application range of intelligent algorithm in architectural design, and provide a new idea for the architects.

Adaptive routing in wireless communication networks using swarm intelligence

NASA Technical Reports Server (NTRS)

Arabshahi, P.; Gray, A.; Kassabalidis, I.; Das, A.; Narayanan, S.; Sharkawi, M. El; Marks, R. J.

2001-01-01

In this paper we focus on the network routing problem, and survey swarm intelligent approaches for its efficient solution, after a brief overview of power-aware routing schemes, which are important in the network examples outlined above.

Verification of NASA Emergent Systems

NASA Technical Reports Server (NTRS)

Rouff, Christopher; Vanderbilt, Amy K. C. S.; Truszkowski, Walt; Rash, James; Hinchey, Mike

2004-01-01

NASA is studying advanced technologies for a future robotic exploration mission to the asteroid belt. This mission, the prospective ANTS (Autonomous Nano Technology Swarm) mission, will comprise of 1,000 autonomous robotic agents designed to cooperate in asteroid exploration. The emergent properties of swarm type missions make them powerful, but at the same time are more difficult to design and assure that the proper behaviors will emerge. We are currently investigating formal methods and techniques for verification and validation of future swarm-based missions. The advantage of using formal methods is their ability to mathematically assure the behavior of a swarm, emergent or otherwise. The ANT mission is being used as an example and case study for swarm-based missions for which to experiment and test current formal methods with intelligent swam. Using the ANTS mission, we have evaluated multiple formal methods to determine their effectiveness in modeling and assuring swarm behavior.

KANTS: a stigmergic ant algorithm for cluster analysis and swarm art.

PubMed

Fernandes, Carlos M; Mora, Antonio M; Merelo, Juan J; Rosa, Agostinho C

2014-06-01

KANTS is a swarm intelligence clustering algorithm inspired by the behavior of social insects. It uses stigmergy as a strategy for clustering large datasets and, as a result, displays a typical behavior of complex systems: self-organization and global patterns emerging from the local interaction of simple units. This paper introduces a simplified version of KANTS and describes recent experiments with the algorithm in the context of a contemporary artistic and scientific trend called swarm art, a type of generative art in which swarm intelligence systems are used to create artwork or ornamental objects. KANTS is used here for generating color drawings from the input data that represent real-world phenomena, such as electroencephalogram sleep data. However, the main proposal of this paper is an art project based on well-known abstract paintings, from which the chromatic values are extracted and used as input. Colors and shapes are therefore reorganized by KANTS, which generates its own interpretation of the original artworks. The project won the 2012 Evolutionary Art, Design, and Creativity Competition.

Escalated convergent artificial bee colony

NASA Astrophysics Data System (ADS)

Jadon, Shimpi Singh; Bansal, Jagdish Chand; Tiwari, Ritu

2016-03-01

Artificial bee colony (ABC) optimisation algorithm is a recent, fast and easy-to-implement population-based meta heuristic for optimisation. ABC has been proved a rival algorithm with some popular swarm intelligence-based algorithms such as particle swarm optimisation, firefly algorithm and ant colony optimisation. The solution search equation of ABC is influenced by a random quantity which helps its search process in exploration at the cost of exploitation. In order to find a fast convergent behaviour of ABC while exploitation capability is maintained, in this paper basic ABC is modified in two ways. First, to improve exploitation capability, two local search strategies, namely classical unidimensional local search and levy flight random walk-based local search are incorporated with ABC. Furthermore, a new solution search strategy, namely stochastic diffusion scout search is proposed and incorporated into the scout bee phase to provide more chance to abandon solution to improve itself. Efficiency of the proposed algorithm is tested on 20 benchmark test functions of different complexities and characteristics. Results are very promising and they prove it to be a competitive algorithm in the field of swarm intelligence-based algorithms.

Swarm intelligence in bioinformatics: methods and implementations for discovering patterns of multiple sequences.

PubMed

Cui, Zhihua; Zhang, Yi

2014-02-01

As a promising and innovative research field, bioinformatics has attracted increasing attention recently. Beneath the enormous number of open problems in this field, one fundamental issue is about the accurate and efficient computational methodology that can deal with tremendous amounts of data. In this paper, we survey some applications of swarm intelligence to discover patterns of multiple sequences. To provide a deep insight, ant colony optimization, particle swarm optimization, artificial bee colony and artificial fish swarm algorithm are selected, and their applications to multiple sequence alignment and motif detecting problem are discussed.

Swarm intelligence applied to the risk evaluation for congenital heart surgery.

PubMed

Zapata-Impata, Brayan S; Ruiz-Fernandez, Daniel; Monsalve-Torra, Ana

2015-01-01

Particle Swarm Optimization is an optimization technique based on the positions of several particles created to find the best solution to a problem. In this work we analyze the accuracy of a modification of this algorithm to classify the levels of risk for a surgery, used as a treatment to correct children malformations that imply congenital heart diseases.

On the spatial dynamics and oscillatory behavior of a predator-prey model based on cellular automata and local particle swarm optimization.

PubMed

Molina, Mario Martínez; Moreno-Armendáriz, Marco A; Carlos Seck Tuoh Mora, Juan

2013-11-07

A two-dimensional lattice model based on Cellular Automata theory and swarm intelligence is used to study the spatial and population dynamics of a theoretical ecosystem. It is found that the social interactions among predators provoke the formation of clusters, and that by increasing the mobility of predators the model enters into an oscillatory behavior. © 2013 Elsevier Ltd. All rights reserved.

Swarm Intelligence-Enhanced Detection of Non-Small-Cell Lung Cancer Using Tumor-Educated Platelets.

PubMed

Best, Myron G; Sol, Nik; In 't Veld, Sjors G J G; Vancura, Adrienne; Muller, Mirte; Niemeijer, Anna-Larissa N; Fejes, Aniko V; Tjon Kon Fat, Lee-Ann; Huis In 't Veld, Anna E; Leurs, Cyra; Le Large, Tessa Y; Meijer, Laura L; Kooi, Irsan E; Rustenburg, François; Schellen, Pepijn; Verschueren, Heleen; Post, Edward; Wedekind, Laurine E; Bracht, Jillian; Esenkbrink, Michelle; Wils, Leon; Favaro, Francesca; Schoonhoven, Jilian D; Tannous, Jihane; Meijers-Heijboer, Hanne; Kazemier, Geert; Giovannetti, Elisa; Reijneveld, Jaap C; Idema, Sander; Killestein, Joep; Heger, Michal; de Jager, Saskia C; Urbanus, Rolf T; Hoefer, Imo E; Pasterkamp, Gerard; Mannhalter, Christine; Gomez-Arroyo, Jose; Bogaard, Harm-Jan; Noske, David P; Vandertop, W Peter; van den Broek, Daan; Ylstra, Bauke; Nilsson, R Jonas A; Wesseling, Pieter; Karachaliou, Niki; Rosell, Rafael; Lee-Lewandrowski, Elizabeth; Lewandrowski, Kent B; Tannous, Bakhos A; de Langen, Adrianus J; Smit, Egbert F; van den Heuvel, Michel M; Wurdinger, Thomas

2017-08-14

Blood-based liquid biopsies, including tumor-educated blood platelets (TEPs), have emerged as promising biomarker sources for non-invasive detection of cancer. Here we demonstrate that particle-swarm optimization (PSO)-enhanced algorithms enable efficient selection of RNA biomarker panels from platelet RNA-sequencing libraries (n = 779). This resulted in accurate TEP-based detection of early- and late-stage non-small-cell lung cancer (n = 518 late-stage validation cohort, accuracy, 88%; AUC, 0.94; 95% CI, 0.92-0.96; p < 0.001; n = 106 early-stage validation cohort, accuracy, 81%; AUC, 0.89; 95% CI, 0.83-0.95; p < 0.001), independent of age of the individuals, smoking habits, whole-blood storage time, and various inflammatory conditions. PSO enabled selection of gene panels to diagnose cancer from TEPs, suggesting that swarm intelligence may also benefit the optimization of diagnostics readout of other liquid biopsy biosources. Copyright © 2017 The Authors. Published by Elsevier Inc. All rights reserved.

Industry Cluster's Adaptive Co-competition Behavior Modeling Inspired by Swarm Intelligence

NASA Astrophysics Data System (ADS)

Xiang, Wei; Ye, Feifan

Adaptation helps the individual enterprise to adjust its behavior to uncertainties in environment and hence determines a healthy growth of both the individuals and the whole industry cluster as well. This paper is focused on the study on co-competition adaptation behavior of industry cluster, which is inspired by swarm intelligence mechanisms. By referencing to ant cooperative transportation and ant foraging behavior and their related swarm intelligence approaches, the cooperative adaptation and competitive adaptation behavior are studied and relevant models are proposed. Those adaptive co-competition behaviors model can be integrated to the multi-agent system of industry cluster to make the industry cluster model more realistic.

Prediction of Sybil attack on WSN using Bayesian network and swarm intelligence

NASA Astrophysics Data System (ADS)

Muraleedharan, Rajani; Ye, Xiang; Osadciw, Lisa Ann

2008-04-01

Security in wireless sensor networks is typically sacrificed or kept minimal due to limited resources such as memory and battery power. Hence, the sensor nodes are prone to Denial-of-service attacks and detecting the threats is crucial in any application. In this paper, the Sybil attack is analyzed and a novel prediction method, combining Bayesian algorithm and Swarm Intelligence (SI) is proposed. Bayesian Networks (BN) is used in representing and reasoning problems, by modeling the elements of uncertainty. The decision from the BN is applied to SI forming an Hybrid Intelligence Scheme (HIS) to re-route the information and disconnecting the malicious nodes in future routes. A performance comparison based on the prediction using HIS vs. Ant System (AS) helps in prioritizing applications where decisions are time-critical.

Evolution of Collective Behaviors for a Real Swarm of Aquatic Surface Robots.

PubMed

Duarte, Miguel; Costa, Vasco; Gomes, Jorge; Rodrigues, Tiago; Silva, Fernando; Oliveira, Sancho Moura; Christensen, Anders Lyhne

2016-01-01

Swarm robotics is a promising approach for the coordination of large numbers of robots. While previous studies have shown that evolutionary robotics techniques can be applied to obtain robust and efficient self-organized behaviors for robot swarms, most studies have been conducted in simulation, and the few that have been conducted on real robots have been confined to laboratory environments. In this paper, we demonstrate for the first time a swarm robotics system with evolved control successfully operating in a real and uncontrolled environment. We evolve neural network-based controllers in simulation for canonical swarm robotics tasks, namely homing, dispersion, clustering, and monitoring. We then assess the performance of the controllers on a real swarm of up to ten aquatic surface robots. Our results show that the evolved controllers transfer successfully to real robots and achieve a performance similar to the performance obtained in simulation. We validate that the evolved controllers display key properties of swarm intelligence-based control, namely scalability, flexibility, and robustness on the real swarm. We conclude with a proof-of-concept experiment in which the swarm performs a complete environmental monitoring task by combining multiple evolved controllers.

Evolution of Collective Behaviors for a Real Swarm of Aquatic Surface Robots

PubMed Central

Duarte, Miguel; Costa, Vasco; Gomes, Jorge; Rodrigues, Tiago; Silva, Fernando; Oliveira, Sancho Moura; Christensen, Anders Lyhne

2016-01-01

Swarm robotics is a promising approach for the coordination of large numbers of robots. While previous studies have shown that evolutionary robotics techniques can be applied to obtain robust and efficient self-organized behaviors for robot swarms, most studies have been conducted in simulation, and the few that have been conducted on real robots have been confined to laboratory environments. In this paper, we demonstrate for the first time a swarm robotics system with evolved control successfully operating in a real and uncontrolled environment. We evolve neural network-based controllers in simulation for canonical swarm robotics tasks, namely homing, dispersion, clustering, and monitoring. We then assess the performance of the controllers on a real swarm of up to ten aquatic surface robots. Our results show that the evolved controllers transfer successfully to real robots and achieve a performance similar to the performance obtained in simulation. We validate that the evolved controllers display key properties of swarm intelligence-based control, namely scalability, flexibility, and robustness on the real swarm. We conclude with a proof-of-concept experiment in which the swarm performs a complete environmental monitoring task by combining multiple evolved controllers. PMID:26999614

A user credit assessment model based on clustering ensemble for broadband network new media service supervision

NASA Astrophysics Data System (ADS)

Liu, Fang; Cao, San-xing; Lu, Rui

2012-04-01

This paper proposes a user credit assessment model based on clustering ensemble aiming to solve the problem that users illegally spread pirated and pornographic media contents within the user self-service oriented broadband network new media platforms. Its idea is to do the new media user credit assessment by establishing indices system based on user credit behaviors, and the illegal users could be found according to the credit assessment results, thus to curb the bad videos and audios transmitted on the network. The user credit assessment model based on clustering ensemble proposed by this paper which integrates the advantages that swarm intelligence clustering is suitable for user credit behavior analysis and K-means clustering could eliminate the scattered users existed in the result of swarm intelligence clustering, thus to realize all the users' credit classification automatically. The model's effective verification experiments are accomplished which are based on standard credit application dataset in UCI machine learning repository, and the statistical results of a comparative experiment with a single model of swarm intelligence clustering indicates this clustering ensemble model has a stronger creditworthiness distinguishing ability, especially in the aspect of predicting to find user clusters with the best credit and worst credit, which will facilitate the operators to take incentive measures or punitive measures accurately. Besides, compared with the experimental results of Logistic regression based model under the same conditions, this clustering ensemble model is robustness and has better prediction accuracy.

Multiple paths to encephalization and technical civilizations.

PubMed

Schwartzman, David; Middendorf, George

2011-12-01

We propose consideration of at least two possible evolutionary paths for the emergence of intelligent life with the potential for technical civilization. The first is the path via encephalization of homeothermic animals; the second is the path to swarm intelligence of so-called superorganisms, in particular the social insects. The path to each appears to be facilitated by environmental change: homeothermic animals by decreased climatic temperature and for swarm intelligence by increased oxygen levels.

Gravity inversion of a fault by Particle swarm optimization (PSO).

PubMed

Toushmalani, Reza

2013-01-01

Particle swarm optimization is a heuristic global optimization method and also an optimization algorithm, which is based on swarm intelligence. It comes from the research on the bird and fish flock movement behavior. In this paper we introduce and use this method in gravity inverse problem. We discuss the solution for the inverse problem of determining the shape of a fault whose gravity anomaly is known. Application of the proposed algorithm to this problem has proven its capability to deal with difficult optimization problems. The technique proved to work efficiently when tested to a number of models.

Synthetic collective intelligence.

PubMed

Solé, Ricard; Amor, Daniel R; Duran-Nebreda, Salva; Conde-Pueyo, Núria; Carbonell-Ballestero, Max; Montañez, Raúl

2016-10-01

Intelligent systems have emerged in our biosphere in different contexts and achieving different levels of complexity. The requirement of communication in a social context has been in all cases a determinant. The human brain, probably co-evolving with language, is an exceedingly successful example. Similarly, social insects complex collective decisions emerge from information exchanges between many agents. The difference is that such processing is obtained out of a limited individual cognitive power. Computational models and embodied versions using non-living systems, particularly involving robot swarms, have been used to explore the potentiality of collective intelligence. Here we suggest a novel approach to the problem grounded in the genetic engineering of unicellular systems, which can be modified in order to interact, store memories or adapt to external stimuli in collective ways. What we label as Synthetic Swarm Intelligence defines a parallel approach to the evolution of computation and swarm intelligence and allows to explore potential embodied scenarios for decision making at the microscale. Here, we consider several relevant examples of collective intelligence and their synthetic organism counterparts. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.

Improved Modeling of Intelligent Tutoring Systems Using Ant Colony Optimization

ERIC Educational Resources Information Center

Rastegarmoghadam, Mahin; Ziarati, Koorush

2017-01-01

Swarm intelligence approaches, such as ant colony optimization (ACO), are used in adaptive e-learning systems and provide an effective method for finding optimal learning paths based on self-organization. The aim of this paper is to develop an improved modeling of adaptive tutoring systems using ACO. In this model, the learning object is…

Multi-modulus algorithm based on global artificial fish swarm intelligent optimization of DNA encoding sequences.

PubMed

Guo, Y C; Wang, H; Wu, H P; Zhang, M Q

2015-12-21

Aimed to address the defects of the large mean square error (MSE), and the slow convergence speed in equalizing the multi-modulus signals of the constant modulus algorithm (CMA), a multi-modulus algorithm (MMA) based on global artificial fish swarm (GAFS) intelligent optimization of DNA encoding sequences (GAFS-DNA-MMA) was proposed. To improve the convergence rate and reduce the MSE, this proposed algorithm adopted an encoding method based on DNA nucleotide chains to provide a possible solution to the problem. Furthermore, the GAFS algorithm, with its fast convergence and global search ability, was used to find the best sequence. The real and imaginary parts of the initial optimal weight vector of MMA were obtained through DNA coding of the best sequence. The simulation results show that the proposed algorithm has a faster convergence speed and smaller MSE in comparison with the CMA, the MMA, and the AFS-DNA-MMA.

A survey on bio inspired meta heuristic based clustering protocols for wireless sensor networks

NASA Astrophysics Data System (ADS)

Datta, A.; Nandakumar, S.

2017-11-01

Recent studies have shown that utilizing a mobile sink to harvest and carry data from a Wireless Sensor Network (WSN) can improve network operational efficiency as well as maintain uniform energy consumption by the sensor nodes in the network. Due to Sink mobility, the path between two sensor nodes continuously changes and this has a profound effect on the operational longevity of the network and a need arises for a protocol which utilizes minimal resources in maintaining routes between the mobile sink and the sensor nodes. Swarm Intelligence based techniques inspired by the foraging behavior of ants, termites and honey bees can be artificially simulated and utilized to solve real wireless network problems. The author presents a brief survey on various bio inspired swarm intelligence based protocols used in routing data in wireless sensor networks while outlining their general principle and operation.

Position-adaptive explosive detection concepts for swarming micro-UAVs

NASA Astrophysics Data System (ADS)

Selmic, Rastko R.; Mitra, Atindra

2008-04-01

We have formulated a series of position-adaptive sensor concepts for explosive detection applications using swarms of micro-UAV's. These concepts are a generalization of position-adaptive radar concepts developed for challenging conditions such as urban environments. For radar applications, this concept is developed with platforms within a UAV swarm that spatially-adapt to signal leakage points on the perimeter of complex clutter environments to collect information on embedded objects-of-interest. The concept is generalized for additional sensors applications by, for example, considering a wooden cart that contains explosives. We can formulate system-of-systems concepts for a swarm of micro-UAV's in an effort to detect whether or not a given cart contains explosives. Under this new concept, some of the members of the UAV swarm can serve as position-adaptive "transmitters" by blowing air over the cart and some of the members of the UAV swarm can serve as position-adaptive "receivers" that are equipped with chem./bio sensors that function as "electronic noses". The final objective can be defined as improving the particle count for the explosives in the air that surrounds a cart via development of intelligent position-adaptive control algorithms in order to improve the detection and false-alarm statistics. We report on recent simulation results with regard to designing optimal sensor placement for explosive or other chemical agent detection. This type of information enables the development of intelligent control algorithms for UAV swarm applications and is intended for the design of future system-of-systems with adaptive intelligence for advanced surveillance of unknown regions. Results are reported as part of a parametric investigation where it is found that the probability of contaminant detection depends on the air flow that carries contaminant particles, geometry of the surrounding space, leakage areas, and other factors. We present a concept of position-adaptive detection (i.e. based on the example in the previous paragraph) consisting of position-adaptive fluid actuators (fans) and position-adaptive sensors. Based on these results, a preliminary analysis of sensor requirements for these fluid actuators and sensors is presented for small-UAVs in a field-enabled explosive detection environment. The computational fluid dynamics (CFD) simulation software Fluent is used to simulate the air flow in the corridor model containing a box with explosive particles. It is found that such flow is turbulent with Reynolds number greater than 106. Simulation methods and results are presented which show particle velocity and concentration distribution throughout the closed box. The results indicate that the CFD-based method can be used for other sensor placement and deployment optimization problems. These techniques and results can be applied towards the development of future system-of-system UAV swarms for defense, homeland defense, and security applications.

A Survey of Formal Methods for Intelligent Swarms

NASA Technical Reports Server (NTRS)

Truszkowski, Walt; Rash, James; Hinchey, Mike; Rouff, Chrustopher A.

2004-01-01

Swarms of intelligent autonomous spacecraft, involving complex behaviors and interactions, are being proposed for future space exploration missions. Such missions provide greater flexibility and offer the possibility of gathering more science data than traditional single spacecraft missions. The emergent properties of swarms make these missions powerful, but simultaneously far more difficult to design, and to assure that the proper behaviors will emerge. These missions are also considerably more complex than previous types of missions, and NASA, like other organizations, has little experience in developing or in verifying and validating these types of missions. A significant challenge when verifying and validating swarms of intelligent interacting agents is how to determine that the possible exponential interactions and emergent behaviors are producing the desired results. Assuring correct behavior and interactions of swarms will be critical to mission success. The Autonomous Nano Technology Swarm (ANTS) mission is an example of one of the swarm types of missions NASA is considering. The ANTS mission will use a swarm of picospacecraft that will fly from Earth orbit to the Asteroid Belt. Using an insect colony analogy, ANTS will be composed of specialized workers for asteroid exploration. Exploration would consist of cataloguing the mass, density, morphology, and chemical composition of the asteroids, including any anomalous concentrations of specific minerals. To perform this task, ANTS would carry miniaturized instruments, such as imagers, spectrometers, and detectors. Since ANTS and other similar missions are going to consist of autonomous spacecraft that may be out of contact with the earth for extended periods of time, and have low bandwidths due to weight constraints, it will be difficult to observe improper behavior and to correct any errors after launch. Providing V&V (verification and validation) for this type of mission is new to NASA, and represents the cutting edge in system correctness, and requires higher levels of assurance than other (traditional) missions that use a single or small number of spacecraft that are deterministic in nature and have near continuous communication access. One of the highest possible levels of assurance comes from the application of formal methods. Formal methods are mathematics-based tools and techniques for specifying and verifying (software and hardware) systems. They are particularly useful for specifying complex parallel systems, such as exemplified by the ANTS mission, where the entire system is difficult for a single person to fully understand, a problem that is multiplied with multiple developers. Once written, a formal specification can be used to prove properties of a system (e.g., the underlying system will go from one state to another or not into a specific state) and check for particular types of errors (e.g., race or livelock conditions). A formal specification can also be used as input to a model checker for further validation. This report gives the results of a survey of formal methods techniques for verification and validation of space missions that use swarm technology. Multiple formal methods were evaluated to determine their effectiveness in modeling and assuring the behavior of swarms of spacecraft using the ANTS mission as an example system. This report is the first result of the project to determine formal approaches that are promising for formally specifying swarm-based systems. From this survey, the most promising approaches were selected and are discussed relative to their possible application to the ANTS mission. Future work will include the application of an integrated approach, based on the selected approaches identified in this report, to the formal specification of the ANTS mission.

Research on UAV Intelligent Obstacle Avoidance Technology During Inspection of Transmission Line

NASA Astrophysics Data System (ADS)

Wei, Chuanhu; Zhang, Fei; Yin, Chaoyuan; Liu, Yue; Liu, Liang; Li, Zongyu; Wang, Wanguo

Autonomous obstacle avoidance of unmanned aerial vehicle (hereinafter referred to as UAV) in electric power line inspection process has important significance for operation safety and economy for UAV intelligent inspection system of transmission line as main content of UAV intelligent inspection system on transmission line. In the paper, principles of UAV inspection obstacle avoidance technology of transmission line are introduced. UAV inspection obstacle avoidance technology based on particle swarm global optimization algorithm is proposed after common obstacle avoidance technologies are studied. Stimulation comparison is implemented with traditional UAV inspection obstacle avoidance technology which adopts artificial potential field method. Results show that UAV inspection strategy of particle swarm optimization algorithm, adopted in the paper, is prominently better than UAV inspection strategy of artificial potential field method in the aspects of obstacle avoidance effect and the ability of returning to preset inspection track after passing through the obstacle. An effective method is provided for UAV inspection obstacle avoidance of transmission line.

Urban Growth Modeling Using Cellular Automata with Multi-Temporal Remote Sensing Images Calibrated by the Artificial Bee Colony Optimization Algorithm.

PubMed

Naghibi, Fereydoun; Delavar, Mahmoud Reza; Pijanowski, Bryan

2016-12-14

Cellular Automata (CA) is one of the most common techniques used to simulate the urbanization process. CA-based urban models use transition rules to deliver spatial patterns of urban growth and urban dynamics over time. Determining the optimum transition rules of the CA is a critical step because of the heterogeneity and nonlinearities existing among urban growth driving forces. Recently, new CA models integrated with optimization methods based on swarm intelligence algorithms were proposed to overcome this drawback. The Artificial Bee Colony (ABC) algorithm is an advanced meta-heuristic swarm intelligence-based algorithm. Here, we propose a novel CA-based urban change model that uses the ABC algorithm to extract optimum transition rules. We applied the proposed ABC-CA model to simulate future urban growth in Urmia (Iran) with multi-temporal Landsat images from 1997, 2006 and 2015. Validation of the simulation results was made through statistical methods such as overall accuracy, the figure of merit and total operating characteristics (TOC). Additionally, we calibrated the CA model by ant colony optimization (ACO) to assess the performance of our proposed model versus similar swarm intelligence algorithm methods. We showed that the overall accuracy and the figure of merit of the ABC-CA model are 90.1% and 51.7%, which are 2.9% and 8.8% higher than those of the ACO-CA model, respectively. Moreover, the allocation disagreement of the simulation results for the ABC-CA model is 9.9%, which is 2.9% less than that of the ACO-CA model. Finally, the ABC-CA model also outperforms the ACO-CA model with fewer quantity and allocation errors and slightly more hits.

Urban Growth Modeling Using Cellular Automata with Multi-Temporal Remote Sensing Images Calibrated by the Artificial Bee Colony Optimization Algorithm

PubMed Central

Naghibi, Fereydoun; Delavar, Mahmoud Reza; Pijanowski, Bryan

2016-01-01

Cellular Automata (CA) is one of the most common techniques used to simulate the urbanization process. CA-based urban models use transition rules to deliver spatial patterns of urban growth and urban dynamics over time. Determining the optimum transition rules of the CA is a critical step because of the heterogeneity and nonlinearities existing among urban growth driving forces. Recently, new CA models integrated with optimization methods based on swarm intelligence algorithms were proposed to overcome this drawback. The Artificial Bee Colony (ABC) algorithm is an advanced meta-heuristic swarm intelligence-based algorithm. Here, we propose a novel CA-based urban change model that uses the ABC algorithm to extract optimum transition rules. We applied the proposed ABC-CA model to simulate future urban growth in Urmia (Iran) with multi-temporal Landsat images from 1997, 2006 and 2015. Validation of the simulation results was made through statistical methods such as overall accuracy, the figure of merit and total operating characteristics (TOC). Additionally, we calibrated the CA model by ant colony optimization (ACO) to assess the performance of our proposed model versus similar swarm intelligence algorithm methods. We showed that the overall accuracy and the figure of merit of the ABC-CA model are 90.1% and 51.7%, which are 2.9% and 8.8% higher than those of the ACO-CA model, respectively. Moreover, the allocation disagreement of the simulation results for the ABC-CA model is 9.9%, which is 2.9% less than that of the ACO-CA model. Finally, the ABC-CA model also outperforms the ACO-CA model with fewer quantity and allocation errors and slightly more hits. PMID:27983633

A comparative analysis of swarm intelligence techniques for feature selection in cancer classification.

PubMed

Gunavathi, Chellamuthu; Premalatha, Kandasamy

2014-01-01

Feature selection in cancer classification is a central area of research in the field of bioinformatics and used to select the informative genes from thousands of genes of the microarray. The genes are ranked based on T-statistics, signal-to-noise ratio (SNR), and F-test values. The swarm intelligence (SI) technique finds the informative genes from the top-m ranked genes. These selected genes are used for classification. In this paper the shuffled frog leaping with Lévy flight (SFLLF) is proposed for feature selection. In SFLLF, the Lévy flight is included to avoid premature convergence of shuffled frog leaping (SFL) algorithm. The SI techniques such as particle swarm optimization (PSO), cuckoo search (CS), SFL, and SFLLF are used for feature selection which identifies informative genes for classification. The k-nearest neighbour (k-NN) technique is used to classify the samples. The proposed work is applied on 10 different benchmark datasets and examined with SI techniques. The experimental results show that the results obtained from k-NN classifier through SFLLF feature selection method outperform PSO, CS, and SFL.

Infrared and visible image fusion using discrete cosine transform and swarm intelligence for surveillance applications

NASA Astrophysics Data System (ADS)

Paramanandham, Nirmala; Rajendiran, Kishore

2018-01-01

A novel image fusion technique is presented for integrating infrared and visible images. Integration of images from the same or various sensing modalities can deliver the required information that cannot be delivered by viewing the sensor outputs individually and consecutively. In this paper, a swarm intelligence based image fusion technique using discrete cosine transform (DCT) domain is proposed for surveillance application which integrates the infrared image with the visible image for generating a single informative fused image. Particle swarm optimization (PSO) is used in the fusion process for obtaining the optimized weighting factor. These optimized weighting factors are used for fusing the DCT coefficients of visible and infrared images. Inverse DCT is applied for obtaining the initial fused image. An enhanced fused image is obtained through adaptive histogram equalization for a better visual understanding and target detection. The proposed framework is evaluated using quantitative metrics such as standard deviation, spatial frequency, entropy and mean gradient. The experimental results demonstrate the outperformance of the proposed algorithm over many other state- of- the- art techniques reported in literature.

A Sustainable City Planning Algorithm Based on TLBO and Local Search

NASA Astrophysics Data System (ADS)

Zhang, Ke; Lin, Li; Huang, Xuanxuan; Liu, Yiming; Zhang, Yonggang

2017-09-01

Nowadays, how to design a city with more sustainable features has become a center problem in the field of social development, meanwhile it has provided a broad stage for the application of artificial intelligence theories and methods. Because the design of sustainable city is essentially a constraint optimization problem, the swarm intelligence algorithm of extensive research has become a natural candidate for solving the problem. TLBO (Teaching-Learning-Based Optimization) algorithm is a new swarm intelligence algorithm. Its inspiration comes from the “teaching” and “learning” behavior of teaching class in the life. The evolution of the population is realized by simulating the “teaching” of the teacher and the student “learning” from each other, with features of less parameters, efficient, simple thinking, easy to achieve and so on. It has been successfully applied to scheduling, planning, configuration and other fields, which achieved a good effect and has been paid more and more attention by artificial intelligence researchers. Based on the classical TLBO algorithm, we propose a TLBO_LS algorithm combined with local search. We design and implement the random generation algorithm and evaluation model of urban planning problem. The experiments on the small and medium-sized random generation problem showed that our proposed algorithm has obvious advantages over DE algorithm and classical TLBO algorithm in terms of convergence speed and solution quality.

Modeling of biological intelligence for SCM system optimization.

PubMed

Chen, Shengyong; Zheng, Yujun; Cattani, Carlo; Wang, Wanliang

2012-01-01

This article summarizes some methods from biological intelligence for modeling and optimization of supply chain management (SCM) systems, including genetic algorithms, evolutionary programming, differential evolution, swarm intelligence, artificial immune, and other biological intelligence related methods. An SCM system is adaptive, dynamic, open self-organizing, which is maintained by flows of information, materials, goods, funds, and energy. Traditional methods for modeling and optimizing complex SCM systems require huge amounts of computing resources, and biological intelligence-based solutions can often provide valuable alternatives for efficiently solving problems. The paper summarizes the recent related methods for the design and optimization of SCM systems, which covers the most widely used genetic algorithms and other evolutionary algorithms.

Modeling of Biological Intelligence for SCM System Optimization

PubMed Central

Chen, Shengyong; Zheng, Yujun; Cattani, Carlo; Wang, Wanliang

2012-01-01

This article summarizes some methods from biological intelligence for modeling and optimization of supply chain management (SCM) systems, including genetic algorithms, evolutionary programming, differential evolution, swarm intelligence, artificial immune, and other biological intelligence related methods. An SCM system is adaptive, dynamic, open self-organizing, which is maintained by flows of information, materials, goods, funds, and energy. Traditional methods for modeling and optimizing complex SCM systems require huge amounts of computing resources, and biological intelligence-based solutions can often provide valuable alternatives for efficiently solving problems. The paper summarizes the recent related methods for the design and optimization of SCM systems, which covers the most widely used genetic algorithms and other evolutionary algorithms. PMID:22162724

Exploring with PAM: Prospecting ANTS Missions for Solar System Surveys

NASA Technical Reports Server (NTRS)

Clark, P. E.; Rilee, M. L.; Curtis, S. A.

2003-01-01

ANTS (Autonomous Nano-Technology Swarm), a large (1000 member) swarm of nano to picoclass (10 to 1 kg) totally autonomous spacecraft, are being developed as a NASA advanced mission concept. ANTS, based on a hierarchical insect social order, use an evolvable, self-similar, hierarchical neural system in which individual spacecraft represent the highest level nodes. ANTS uses swarm intelligence attained through collective, cooperative interactions of the nodes at all levels of the system. At the highest levels this can take the form of cooperative, collective behavior among the individual spacecraft in a very large constellation. The ANTS neural architecture is designed for totally autonomous operation of complex systems including spacecraft constellations. The ANTS (Autonomous Nano Technology Swarm) concept has a number of possible applications. A version of ANTS designed for surveying and determining the resource potential of the asteroid belt, called PAM (Prospecting ANTS Mission), is examined here.

Swarm intelligence in fish? The difficulty in demonstrating distributed and self-organised collective intelligence in (some) animal groups.

PubMed

Ioannou, Christos C

2017-08-01

Larger groups often have a greater ability to solve cognitive tasks compared to smaller ones or lone individuals. This is well established in social insects, navigating flocks of birds, and in groups of prey collectively vigilant for predators. Research in social insects has convincingly shown that improved cognitive performance can arise from self-organised local interactions between individuals that integrates their contributions, often referred to as swarm intelligence. This emergent collective intelligence has gained in popularity and been directly applied to groups of other animals, including fish. Despite being a likely mechanism at least partially explaining group performance in vertebrates, I argue here that other possible explanations are rarely ruled out in empirical studies. Hence, evidence for self-organised collective (or 'swarm') intelligence in fish is not as strong as it would first appear. These other explanations, the 'pool-of-competence' and the greater cognitive ability of individuals when in larger groups, are also reviewed. Also discussed is why improved group performance in general may be less often observed in animals such as shoaling fish compared to social insects. This review intends to highlight the difficulties in exploring collective intelligence in animal groups, ideally leading to further empirical work to illuminate these issues. Copyright © 2016 The Author. Published by Elsevier B.V. All rights reserved.

Design and implementation of intelligent electronic warfare decision making algorithm

NASA Astrophysics Data System (ADS)

Peng, Hsin-Hsien; Chen, Chang-Kuo; Hsueh, Chi-Shun

2017-05-01

Electromagnetic signals and the requirements of timely response have been a rapid growth in modern electronic warfare. Although jammers are limited resources, it is possible to achieve the best electronic warfare efficiency by tactical decisions. This paper proposes the intelligent electronic warfare decision support system. In this work, we develop a novel hybrid algorithm, Digital Pheromone Particle Swarm Optimization, based on Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO) and Shuffled Frog Leaping Algorithm (SFLA). We use PSO to solve the problem and combine the concept of pheromones in ACO to accumulate more useful information in spatial solving process and speed up finding the optimal solution. The proposed algorithm finds the optimal solution in reasonable computation time by using the method of matrix conversion in SFLA. The results indicated that jammer allocation was more effective. The system based on the hybrid algorithm provides electronic warfare commanders with critical information to assist commanders in effectively managing the complex electromagnetic battlefield.

Adaptive power allocation schemes based on IAFS algorithm for OFDM-based cognitive radio systems

NASA Astrophysics Data System (ADS)

Zhang, Shuying; Zhao, Xiaohui; Liang, Cong; Ding, Xu

2017-01-01

In cognitive radio (CR) systems, reasonable power allocation can increase transmission rate of CR users or secondary users (SUs) as much as possible and at the same time insure normal communication among primary users (PUs). This study proposes an optimal power allocation scheme for the OFDM-based CR system with one SU influenced by multiple PU interference constraints. This scheme is based on an improved artificial fish swarm (IAFS) algorithm in combination with the advantage of conventional artificial fish swarm (ASF) algorithm and particle swarm optimisation (PSO) algorithm. In performance comparison of IAFS algorithm with other intelligent algorithms by simulations, the superiority of the IAFS algorithm is illustrated; this superiority results in better performance of our proposed scheme than that of the power allocation algorithms proposed by the previous studies in the same scenario. Furthermore, our proposed scheme can obtain higher transmission data rate under the multiple PU interference constraints and the total power constraint of SU than that of the other mentioned works.

Identifying protein complexes based on brainstorming strategy.

PubMed

Shen, Xianjun; Zhou, Jin; Yi, Li; Hu, Xiaohua; He, Tingting; Yang, Jincai

2016-11-01

Protein complexes comprising of interacting proteins in protein-protein interaction network (PPI network) play a central role in driving biological processes within cells. Recently, more and more swarm intelligence based algorithms to detect protein complexes have been emerging, which have become the research hotspot in proteomics field. In this paper, we propose a novel algorithm for identifying protein complexes based on brainstorming strategy (IPC-BSS), which is integrated into the main idea of swarm intelligence optimization and the improved K-means algorithm. Distance between the nodes in PPI network is defined by combining the network topology and gene ontology (GO) information. Inspired by human brainstorming process, IPC-BSS algorithm firstly selects the clustering center nodes, and then they are separately consolidated with the other nodes with short distance to form initial clusters. Finally, we put forward two ways of updating the initial clusters to search optimal results. Experimental results show that our IPC-BSS algorithm outperforms the other classic algorithms on yeast and human PPI networks, and it obtains many predicted protein complexes with biological significance. Copyright © 2016 Elsevier Inc. All rights reserved.

Swarm Intelligence for Optimizing Hybridized Smoothing Filter in Image Edge Enhancement

NASA Astrophysics Data System (ADS)

Rao, B. Tirumala; Dehuri, S.; Dileep, M.; Vindhya, A.

In this modern era, image transmission and processing plays a major role. It would be impossible to retrieve information from satellite and medical images without the help of image processing techniques. Edge enhancement is an image processing step that enhances the edge contrast of an image or video in an attempt to improve its acutance. Edges are the representations of the discontinuities of image intensity functions. For processing these discontinuities in an image, a good edge enhancement technique is essential. The proposed work uses a new idea for edge enhancement using hybridized smoothening filters and we introduce a promising technique of obtaining best hybrid filter using swarm algorithms (Artificial Bee Colony (ABC), Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO)) to search for an optimal sequence of filters from among a set of rather simple, representative image processing filters. This paper deals with the analysis of the swarm intelligence techniques through the combination of hybrid filters generated by these algorithms for image edge enhancement.

Optimizing bi-objective, multi-echelon supply chain model using particle swarm intelligence algorithm

NASA Astrophysics Data System (ADS)

Sathish Kumar, V. R.; Anbuudayasankar, S. P.; Rameshkumar, K.

2018-02-01

In the current globalized scenario, business organizations are more dependent on cost effective supply chain to enhance profitability and better handle competition. Demand uncertainty is an important factor in success or failure of a supply chain. An efficient supply chain limits the stock held at all echelons to the extent of avoiding a stock-out situation. In this paper, a three echelon supply chain model consisting of supplier, manufacturing plant and market is developed and the same is optimized using particle swarm intelligence algorithm.

Residential Consumer-Centric Demand-Side Management Based on Energy Disaggregation-Piloting Constrained Swarm Intelligence: Towards Edge Computing

PubMed Central

Hu, Yu-Chen

2018-01-01

The emergence of smart Internet of Things (IoT) devices has highly favored the realization of smart homes in a down-stream sector of a smart grid. The underlying objective of Demand Response (DR) schemes is to actively engage customers to modify their energy consumption on domestic appliances in response to pricing signals. Domestic appliance scheduling is widely accepted as an effective mechanism to manage domestic energy consumption intelligently. Besides, to residential customers for DR implementation, maintaining a balance between energy consumption cost and users’ comfort satisfaction is a challenge. Hence, in this paper, a constrained Particle Swarm Optimization (PSO)-based residential consumer-centric load-scheduling method is proposed. The method can be further featured with edge computing. In contrast with cloud computing, edge computing—a method of optimizing cloud computing technologies by driving computing capabilities at the IoT edge of the Internet as one of the emerging trends in engineering technology—addresses bandwidth-intensive contents and latency-sensitive applications required among sensors and central data centers through data analytics at or near the source of data. A non-intrusive load-monitoring technique proposed previously is utilized to automatic determination of physical characteristics of power-intensive home appliances from users’ life patterns. The swarm intelligence, constrained PSO, is used to minimize the energy consumption cost while considering users’ comfort satisfaction for DR implementation. The residential consumer-centric load-scheduling method proposed in this paper is evaluated under real-time pricing with inclining block rates and is demonstrated in a case study. The experimentation reported in this paper shows the proposed residential consumer-centric load-scheduling method can re-shape loads by home appliances in response to DR signals. Moreover, a phenomenal reduction in peak power consumption is achieved by 13.97%. PMID:29702607

Comparison result of inversion of gravity data of a fault by particle swarm optimization and Levenberg-Marquardt methods.

PubMed

Toushmalani, Reza

2013-01-01

The purpose of this study was to compare the performance of two methods for gravity inversion of a fault. First method [Particle swarm optimization (PSO)] is a heuristic global optimization method and also an optimization algorithm, which is based on swarm intelligence. It comes from the research on the bird and fish flock movement behavior. Second method [The Levenberg-Marquardt algorithm (LM)] is an approximation to the Newton method used also for training ANNs. In this paper first we discussed the gravity field of a fault, then describes the algorithms of PSO and LM And presents application of Levenberg-Marquardt algorithm, and a particle swarm algorithm in solving inverse problem of a fault. Most importantly the parameters for the algorithms are given for the individual tests. Inverse solution reveals that fault model parameters are agree quite well with the known results. A more agreement has been found between the predicted model anomaly and the observed gravity anomaly in PSO method rather than LM method.

Firefly algorithm for cardinality constrained mean-variance portfolio optimization problem with entropy diversity constraint.

PubMed

Bacanin, Nebojsa; Tuba, Milan

2014-01-01

Portfolio optimization (selection) problem is an important and hard optimization problem that, with the addition of necessary realistic constraints, becomes computationally intractable. Nature-inspired metaheuristics are appropriate for solving such problems; however, literature review shows that there are very few applications of nature-inspired metaheuristics to portfolio optimization problem. This is especially true for swarm intelligence algorithms which represent the newer branch of nature-inspired algorithms. No application of any swarm intelligence metaheuristics to cardinality constrained mean-variance (CCMV) portfolio problem with entropy constraint was found in the literature. This paper introduces modified firefly algorithm (FA) for the CCMV portfolio model with entropy constraint. Firefly algorithm is one of the latest, very successful swarm intelligence algorithm; however, it exhibits some deficiencies when applied to constrained problems. To overcome lack of exploration power during early iterations, we modified the algorithm and tested it on standard portfolio benchmark data sets used in the literature. Our proposed modified firefly algorithm proved to be better than other state-of-the-art algorithms, while introduction of entropy diversity constraint further improved results.

Firefly Algorithm for Cardinality Constrained Mean-Variance Portfolio Optimization Problem with Entropy Diversity Constraint

PubMed Central

2014-01-01

Portfolio optimization (selection) problem is an important and hard optimization problem that, with the addition of necessary realistic constraints, becomes computationally intractable. Nature-inspired metaheuristics are appropriate for solving such problems; however, literature review shows that there are very few applications of nature-inspired metaheuristics to portfolio optimization problem. This is especially true for swarm intelligence algorithms which represent the newer branch of nature-inspired algorithms. No application of any swarm intelligence metaheuristics to cardinality constrained mean-variance (CCMV) portfolio problem with entropy constraint was found in the literature. This paper introduces modified firefly algorithm (FA) for the CCMV portfolio model with entropy constraint. Firefly algorithm is one of the latest, very successful swarm intelligence algorithm; however, it exhibits some deficiencies when applied to constrained problems. To overcome lack of exploration power during early iterations, we modified the algorithm and tested it on standard portfolio benchmark data sets used in the literature. Our proposed modified firefly algorithm proved to be better than other state-of-the-art algorithms, while introduction of entropy diversity constraint further improved results. PMID:24991645

Conformational sampling enhancement of replica exchange molecular dynamics simulations using swarm particle intelligence

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kamberaj, Hiqmet, E-mail: hkamberaj@ibu.edu.mk

In this paper, we present a new method based on swarm particle social intelligence for use in replica exchange molecular dynamics simulations. In this method, the replicas (representing the different system configurations) are allowed communicating with each other through the individual and social knowledge, in additional to considering them as a collection of real particles interacting through the Newtonian forces. The new method is based on the modification of the equations of motion in such way that the replicas are driven towards the global energy minimum. The method was tested for the Lennard-Jones clusters of N = 4,  5, andmore » 6 atoms. Our results showed that the new method is more efficient than the conventional replica exchange method under the same practical conditions. In particular, the new method performed better on optimizing the distribution of the replicas among the thermostats with time and, in addition, ergodic convergence is observed to be faster. We also introduce a weighted histogram analysis method allowing analyzing the data from simulations by combining data from all of the replicas and rigorously removing the inserted bias.« less

Conformational sampling enhancement of replica exchange molecular dynamics simulations using swarm particle intelligence

NASA Astrophysics Data System (ADS)

Kamberaj, Hiqmet

2015-09-01

In this paper, we present a new method based on swarm particle social intelligence for use in replica exchange molecular dynamics simulations. In this method, the replicas (representing the different system configurations) are allowed communicating with each other through the individual and social knowledge, in additional to considering them as a collection of real particles interacting through the Newtonian forces. The new method is based on the modification of the equations of motion in such way that the replicas are driven towards the global energy minimum. The method was tested for the Lennard-Jones clusters of N = 4, 5, and 6 atoms. Our results showed that the new method is more efficient than the conventional replica exchange method under the same practical conditions. In particular, the new method performed better on optimizing the distribution of the replicas among the thermostats with time and, in addition, ergodic convergence is observed to be faster. We also introduce a weighted histogram analysis method allowing analyzing the data from simulations by combining data from all of the replicas and rigorously removing the inserted bias.

A comparison between metaheuristics as strategies for minimizing cyclic instability in Ambient Intelligence.

PubMed

Romero, Leoncio A; Zamudio, Victor; Baltazar, Rosario; Mezura, Efren; Sotelo, Marco; Callaghan, Vic

2012-01-01

In this paper we present a comparison between six novel approaches to the fundamental problem of cyclic instability in Ambient Intelligence. These approaches are based on different optimization algorithms, Particle Swarm Optimization (PSO), Bee Swarm Optimization (BSO), micro Particle Swarm Optimization (μ-PSO), Artificial Immune System (AIS), Genetic Algorithm (GA) and Mutual Information Maximization for Input Clustering (MIMIC). In order to be able to use these algorithms, we introduced the concept of Average Cumulative Oscillation (ACO), which enabled us to measure the average behavior of the system. This approach has the advantage that it does not need to analyze the topological properties of the system, in particular the loops, which can be computationally expensive. In order to test these algorithms we used the well-known discrete system called the Game of Life for 9, 25, 49 and 289 agents. It was found that PSO and μ-PSO have the best performance in terms of the number of agents locked. These results were confirmed using the Wilcoxon Signed Rank Test. This novel and successful approach is very promising and can be used to remove instabilities in real scenarios with a large number of agents (including nomadic agents) and complex interactions and dependencies among them.

A Comparison between Metaheuristics as Strategies for Minimizing Cyclic Instability in Ambient Intelligence

PubMed Central

Romero, Leoncio A.; Zamudio, Victor; Baltazar, Rosario; Mezura, Efren; Sotelo, Marco; Callaghan, Vic

2012-01-01

In this paper we present a comparison between six novel approaches to the fundamental problem of cyclic instability in Ambient Intelligence. These approaches are based on different optimization algorithms, Particle Swarm Optimization (PSO), Bee Swarm Optimization (BSO), micro Particle Swarm Optimization (μ-PSO), Artificial Immune System (AIS), Genetic Algorithm (GA) and Mutual Information Maximization for Input Clustering (MIMIC). In order to be able to use these algorithms, we introduced the concept of Average Cumulative Oscillation (ACO), which enabled us to measure the average behavior of the system. This approach has the advantage that it does not need to analyze the topological properties of the system, in particular the loops, which can be computationally expensive. In order to test these algorithms we used the well-known discrete system called the Game of Life for 9, 25, 49 and 289 agents. It was found that PSO and μ-PSO have the best performance in terms of the number of agents locked. These results were confirmed using the Wilcoxon Signed Rank Test. This novel and successful approach is very promising and can be used to remove instabilities in real scenarios with a large number of agents (including nomadic agents) and complex interactions and dependencies among them. PMID:23112643

A new inertia weight control strategy for particle swarm optimization

NASA Astrophysics Data System (ADS)

Zhu, Xianming; Wang, Hongbo

2018-04-01

Particle Swarm Optimization is a member of swarm intelligence algorithms, which is inspired by the behavior of bird flocks. The inertia weight, one of the most important parameters of PSO, is crucial for PSO, for it balances the performance of exploration and exploitation of the algorithm. This paper proposes a new inertia weight control strategy and PSO with this new strategy is tested by four benchmark functions. The results shows that the new strategy provides the PSO with better performance.

Swarm robotics and minimalism

NASA Astrophysics Data System (ADS)

Sharkey, Amanda J. C.

2007-09-01

Swarm Robotics (SR) is closely related to Swarm Intelligence, and both were initially inspired by studies of social insects. Their guiding principles are based on their biological inspiration and take the form of an emphasis on decentralized local control and communication. Earlier studies went a step further in emphasizing the use of simple reactive robots that only communicate indirectly through the environment. More recently SR studies have moved beyond these constraints to explore the use of non-reactive robots that communicate directly, and that can learn and represent their environment. There is no clear agreement in the literature about how far such extensions of the original principles could go. Should there be any limitations on the individual abilities of the robots used in SR studies? Should knowledge of the capabilities of social insects lead to constraints on the capabilities of individual robots in SR studies? There is a lack of explicit discussion of such questions, and researchers have adopted a variety of constraints for a variety of reasons. A simple taxonomy of swarm robotics is presented here with the aim of addressing and clarifying these questions. The taxonomy distinguishes subareas of SR based on the emphases and justifications for minimalism and individual simplicity.

A review on economic emission dispatch problems using quantum computational intelligence

NASA Astrophysics Data System (ADS)

Mahdi, Fahad Parvez; Vasant, Pandian; Kallimani, Vish; Abdullah-Al-Wadud, M.

2016-11-01

Economic emission dispatch (EED) problems are one of the most crucial problems in power systems. Growing energy demand, limitation of natural resources and global warming make this topic into the center of discussion and research. This paper reviews the use of Quantum Computational Intelligence (QCI) in solving Economic Emission Dispatch problems. QCI techniques like Quantum Genetic Algorithm (QGA) and Quantum Particle Swarm Optimization (QPSO) algorithm are discussed here. This paper will encourage the researcher to use more QCI based algorithm to get better optimal result for solving EED problems.

A chaos wolf optimization algorithm with self-adaptive variable step-size

NASA Astrophysics Data System (ADS)

Zhu, Yong; Jiang, Wanlu; Kong, Xiangdong; Quan, Lingxiao; Zhang, Yongshun

2017-10-01

To explore the problem of parameter optimization for complex nonlinear function, a chaos wolf optimization algorithm (CWOA) with self-adaptive variable step-size was proposed. The algorithm was based on the swarm intelligence of wolf pack, which fully simulated the predation behavior and prey distribution way of wolves. It possessed three intelligent behaviors such as migration, summons and siege. And the competition rule as "winner-take-all" and the update mechanism as "survival of the fittest" were also the characteristics of the algorithm. Moreover, it combined the strategies of self-adaptive variable step-size search and chaos optimization. The CWOA was utilized in parameter optimization of twelve typical and complex nonlinear functions. And the obtained results were compared with many existing algorithms, including the classical genetic algorithm, the particle swarm optimization algorithm and the leader wolf pack search algorithm. The investigation results indicate that CWOA possess preferable optimization ability. There are advantages in optimization accuracy and convergence rate. Furthermore, it demonstrates high robustness and global searching ability.

Fish swarm intelligent to optimize real time monitoring of chips drying using machine vision

NASA Astrophysics Data System (ADS)

Hendrawan, Y.; Hawa, L. C.; Damayanti, R.

2018-03-01

This study attempted to apply machine vision-based chips drying monitoring system which is able to optimise the drying process of cassava chips. The objective of this study is to propose fish swarm intelligent (FSI) optimization algorithms to find the most significant set of image features suitable for predicting water content of cassava chips during drying process using artificial neural network model (ANN). Feature selection entails choosing the feature subset that maximizes the prediction accuracy of ANN. Multi-Objective Optimization (MOO) was used in this study which consisted of prediction accuracy maximization and feature-subset size minimization. The results showed that the best feature subset i.e. grey mean, L(Lab) Mean, a(Lab) energy, red entropy, hue contrast, and grey homogeneity. The best feature subset has been tested successfully in ANN model to describe the relationship between image features and water content of cassava chips during drying process with R2 of real and predicted data was equal to 0.9.

Implementation and comparative analysis of the optimisations produced by evolutionary algorithms for the parameter extraction of PSP MOSFET model

NASA Astrophysics Data System (ADS)

Hadia, Sarman K.; Thakker, R. A.; Bhatt, Kirit R.

2016-05-01

The study proposes an application of evolutionary algorithms, specifically an artificial bee colony (ABC), variant ABC and particle swarm optimisation (PSO), to extract the parameters of metal oxide semiconductor field effect transistor (MOSFET) model. These algorithms are applied for the MOSFET parameter extraction problem using a Pennsylvania surface potential model. MOSFET parameter extraction procedures involve reducing the error between measured and modelled data. This study shows that ABC algorithm optimises the parameter values based on intelligent activities of honey bee swarms. Some modifications have also been applied to the basic ABC algorithm. Particle swarm optimisation is a population-based stochastic optimisation method that is based on bird flocking activities. The performances of these algorithms are compared with respect to the quality of the solutions. The simulation results of this study show that the PSO algorithm performs better than the variant ABC and basic ABC algorithm for the parameter extraction of the MOSFET model; also the implementation of the ABC algorithm is shown to be simpler than that of the PSO algorithm.

On Two Metaphors for Pedagogy and Creativity in the Digital Era: Liquid and Solid Learning

ERIC Educational Resources Information Center

Das, Simon

2012-01-01

As part of a belief in higher education (HE) aiding "creative capital", McWilliam and Dawson argue for a shift in pedagogic attention towards "Small C" creativity, which emphasises group endeavour over individual. Their radical 'liquid-learning" prescription, based on swarm intelligence, gives rise to the pedagogy of metagroups and modes of…

Application of a swarm-based approach for phase unwrapping

NASA Astrophysics Data System (ADS)

da S. Maciel, Lucas; Albertazzi G., Armando, Jr.

2014-07-01

An algorithm for phase unwrapping based on swarm intelligence is proposed. The novel approach is based on the emergent behavior of swarms. This behavior is the result of the interactions between independent agents following a simple set of rules and is regarded as fast, flexible and robust. The rules here were designed with two purposes. Firstly, the collective behavior must result in a reliable map of the unwrapped phase. The unwrapping reliability was evaluated by each agent during run-time, based on the quality of the neighboring pixels. In addition, the rule set must result in a behavior that focuses on wrapped regions. Stigmergy and communication rules were implemented in order to enable each agent to seek less worked areas of the image. The agents were modeled as Finite-State Machines. Based on the availability of unwrappable pixels, each agent assumed a different state in order to better adapt itself to the surroundings. The implemented rule set was able to fulfill the requirements on reliability and focused unwrapping. The unwrapped phase map was comparable to those from established methods as the agents were able to reliably evaluate each pixel quality. Also, the unwrapping behavior, being observed in real time, was able to focus on workable areas as the agents communicated in order to find less traveled regions. The results were very positive for such a new approach to the phase unwrapping problem. Finally, the authors see great potential for future developments concerning the flexibility, robustness and processing times of the swarm-based algorithm.

Residential Consumer-Centric Demand-Side Management Based on Energy Disaggregation-Piloting Constrained Swarm Intelligence: Towards Edge Computing.

PubMed

Lin, Yu-Hsiu; Hu, Yu-Chen

2018-04-27

The emergence of smart Internet of Things (IoT) devices has highly favored the realization of smart homes in a down-stream sector of a smart grid. The underlying objective of Demand Response (DR) schemes is to actively engage customers to modify their energy consumption on domestic appliances in response to pricing signals. Domestic appliance scheduling is widely accepted as an effective mechanism to manage domestic energy consumption intelligently. Besides, to residential customers for DR implementation, maintaining a balance between energy consumption cost and users’ comfort satisfaction is a challenge. Hence, in this paper, a constrained Particle Swarm Optimization (PSO)-based residential consumer-centric load-scheduling method is proposed. The method can be further featured with edge computing. In contrast with cloud computing, edge computing—a method of optimizing cloud computing technologies by driving computing capabilities at the IoT edge of the Internet as one of the emerging trends in engineering technology—addresses bandwidth-intensive contents and latency-sensitive applications required among sensors and central data centers through data analytics at or near the source of data. A non-intrusive load-monitoring technique proposed previously is utilized to automatic determination of physical characteristics of power-intensive home appliances from users’ life patterns. The swarm intelligence, constrained PSO, is used to minimize the energy consumption cost while considering users’ comfort satisfaction for DR implementation. The residential consumer-centric load-scheduling method proposed in this paper is evaluated under real-time pricing with inclining block rates and is demonstrated in a case study. The experimentation reported in this paper shows the proposed residential consumer-centric load-scheduling method can re-shape loads by home appliances in response to DR signals. Moreover, a phenomenal reduction in peak power consumption is achieved by 13.97%.

Coordination in Distributed Intelligent Systems Applications

DTIC Science & Technology

2009-12-13

working in the area of Distributed Artificial Intelligence (DAI) unanimously endorses the idea that coordination - a fundamental paradigm - represents a...using the distributed artificial intelligence paradigm. Section 4 discusses the healthcare applications. On the other hand, Section 5 describes...coordination mechanisms should be used is in the control of swarms of UA Vs (unmanned aerial vehicles). The UAVs are considered in this case as highly mobile

Honey Bees Inspired Optimization Method: The Bees Algorithm.

PubMed

Yuce, Baris; Packianather, Michael S; Mastrocinque, Ernesto; Pham, Duc Truong; Lambiase, Alfredo

2013-11-06

Optimization algorithms are search methods where the goal is to find an optimal solution to a problem, in order to satisfy one or more objective functions, possibly subject to a set of constraints. Studies of social animals and social insects have resulted in a number of computational models of swarm intelligence. Within these swarms their collective behavior is usually very complex. The collective behavior of a swarm of social organisms emerges from the behaviors of the individuals of that swarm. Researchers have developed computational optimization methods based on biology such as Genetic Algorithms, Particle Swarm Optimization, and Ant Colony. The aim of this paper is to describe an optimization algorithm called the Bees Algorithm, inspired from the natural foraging behavior of honey bees, to find the optimal solution. The algorithm performs both an exploitative neighborhood search combined with random explorative search. In this paper, after an explanation of the natural foraging behavior of honey bees, the basic Bees Algorithm and its improved versions are described and are implemented in order to optimize several benchmark functions, and the results are compared with those obtained with different optimization algorithms. The results show that the Bees Algorithm offering some advantage over other optimization methods according to the nature of the problem.

A Computational Intelligence (CI) Approach to the Precision Mars Lander Problem

NASA Technical Reports Server (NTRS)

Birge, Brian; Walberg, Gerald

2002-01-01

A Mars precision landing requires a landed footprint of no more than 100 meters. Obstacles to reducing the landed footprint include trajectory dispersions due to initial atmospheric entry conditions such as entry angle, parachute deployment height, environment parameters such as wind, atmospheric density, parachute deployment dynamics, unavoidable injection error or propagated error from launch, etc. Computational Intelligence (CI) techniques such as Artificial Neural Nets and Particle Swarm Optimization have been shown to have great success with other control problems. The research period extended previous work on investigating applicability of the computational intelligent approaches. The focus of this investigation was on Particle Swarm Optimization and basic Neural Net architectures. The research investigating these issues was performed for the grant cycle from 5/15/01 to 5/15/02. Matlab 5.1 and 6.0 along with NASA's POST were the primary computational tools.

Entanglement-Gradient Routing for Quantum Networks.

PubMed

Gyongyosi, Laszlo; Imre, Sandor

2017-10-27

We define the entanglement-gradient routing scheme for quantum repeater networks. The routing framework fuses the fundamentals of swarm intelligence and quantum Shannon theory. Swarm intelligence provides nature-inspired solutions for problem solving. Motivated by models of social insect behavior, the routing is performed using parallel threads to determine the shortest path via the entanglement gradient coefficient, which describes the feasibility of the entangled links and paths of the network. The routing metrics are derived from the characteristics of entanglement transmission and relevant measures of entanglement distribution in quantum networks. The method allows a moderate complexity decentralized routing in quantum repeater networks. The results can be applied in experimental quantum networking, future quantum Internet, and long-distance quantum communications.

Particle swarm optimization based space debris surveillance network scheduling

NASA Astrophysics Data System (ADS)

Jiang, Hai; Liu, Jing; Cheng, Hao-Wen; Zhang, Yao

2017-02-01

The increasing number of space debris has created an orbital debris environment that poses increasing impact risks to existing space systems and human space flights. For the safety of in-orbit spacecrafts, we should optimally schedule surveillance tasks for the existing facilities to allocate resources in a manner that most significantly improves the ability to predict and detect events involving affected spacecrafts. This paper analyzes two criteria that mainly affect the performance of a scheduling scheme and introduces an artificial intelligence algorithm into the scheduling of tasks of the space debris surveillance network. A new scheduling algorithm based on the particle swarm optimization algorithm is proposed, which can be implemented in two different ways: individual optimization and joint optimization. Numerical experiments with multiple facilities and objects are conducted based on the proposed algorithm, and simulation results have demonstrated the effectiveness of the proposed algorithm.

Optimization of power utilization in multimobile robot foraging behavior inspired by honeybees system.

PubMed

Ahmad, Faisul Arif; Ramli, Abd Rahman; Samsudin, Khairulmizam; Hashim, Shaiful Jahari

2014-01-01

Deploying large numbers of mobile robots which can interact with each other produces swarm intelligent behavior. However, mobile robots are normally running with finite energy resource, supplied from finite battery. The limitation of energy resource required human intervention for recharging the batteries. The sharing information among the mobile robots would be one of the potentials to overcome the limitation on previously recharging system. A new approach is proposed based on integrated intelligent system inspired by foraging of honeybees applied to multimobile robot scenario. This integrated approach caters for both working and foraging stages for known/unknown power station locations. Swarm mobile robot inspired by honeybee is simulated to explore and identify the power station for battery recharging. The mobile robots will share the location information of the power station with each other. The result showed that mobile robots consume less energy and less time when they are cooperating with each other for foraging process. The optimizing of foraging behavior would result in the mobile robots spending more time to do real work.

Optimization of Power Utilization in Multimobile Robot Foraging Behavior Inspired by Honeybees System

PubMed Central

Ahmad, Faisul Arif; Ramli, Abd Rahman; Samsudin, Khairulmizam; Hashim, Shaiful Jahari

2014-01-01

Deploying large numbers of mobile robots which can interact with each other produces swarm intelligent behavior. However, mobile robots are normally running with finite energy resource, supplied from finite battery. The limitation of energy resource required human intervention for recharging the batteries. The sharing information among the mobile robots would be one of the potentials to overcome the limitation on previously recharging system. A new approach is proposed based on integrated intelligent system inspired by foraging of honeybees applied to multimobile robot scenario. This integrated approach caters for both working and foraging stages for known/unknown power station locations. Swarm mobile robot inspired by honeybee is simulated to explore and identify the power station for battery recharging. The mobile robots will share the location information of the power station with each other. The result showed that mobile robots consume less energy and less time when they are cooperating with each other for foraging process. The optimizing of foraging behavior would result in the mobile robots spending more time to do real work. PMID:24949491

Analyzing Convergence in e-Learning Resource Filtering Based on ACO Techniques: A Case Study with Telecommunication Engineering Students

ERIC Educational Resources Information Center

Munoz-Organero, Mario; Ramirez, Gustavo A.; Merino, Pedro Munoz; Kloos, Carlos Delgado

2010-01-01

The use of swarm intelligence techniques in e-learning scenarios provides a way to combine simple interactions of individual students to solve a more complex problem. After getting some data from the interactions of the first students with a central system, the use of these techniques converges to a solution that the rest of the students can…

Stochastic Set-Based Particle Swarm Optimization Based on Local Exploration for Solving the Carpool Service Problem.

PubMed

Chou, Sheng-Kai; Jiau, Ming-Kai; Huang, Shih-Chia

2016-08-01

The growing ubiquity of vehicles has led to increased concerns about environmental issues. These concerns can be mitigated by implementing an effective carpool service. In an intelligent carpool system, an automated service process assists carpool participants in determining routes and matches. It is a discrete optimization problem that involves a system-wide condition as well as participants' expectations. In this paper, we solve the carpool service problem (CSP) to provide satisfactory ride matches. To this end, we developed a particle swarm carpool algorithm based on stochastic set-based particle swarm optimization (PSO). Our method introduces stochastic coding to augment traditional particles, and uses three terminologies to represent a particle: 1) particle position; 2) particle view; and 3) particle velocity. In this way, the set-based PSO (S-PSO) can be realized by local exploration. In the simulation and experiments, two kind of discrete PSOs-S-PSO and binary PSO (BPSO)-and a genetic algorithm (GA) are compared and examined using tested benchmarks that simulate a real-world metropolis. We observed that the S-PSO outperformed the BPSO and the GA thoroughly. Moreover, our method yielded the best result in a statistical test and successfully obtained numerical results for meeting the optimization objectives of the CSP.

A Methodology For Measuring Resilience in a Satellite-Based Communication Network

DTIC Science & Technology

2014-03-27

solving the Travelling Salesman Problem (TSP) (Solnon p. 1). Based upon swarm intelligence, in a travelling salesman problem ants are sent out from...developed for the Travelling Salesman Problem (TSP) in 1992 (Solnon p. 1), this metaheuristic shows its roots in the original formulations. Given v, the...is lost. To tackle this problem , a common LEO orbit type is examined, the polar orbit. Polar LEO satellites travel from the south pole to the

Swarm intelligence. A whole new way to think about business.

PubMed

Bonabeau, E; Meyer, C

2001-05-01

What do ants and bees have to do with business? A great deal, it turns out. Individually, social insects are only minimally intelligent, and their work together is largely self-organized and unsupervised. Yet collectively they're capable of finding highly efficient solutions to difficult problems and can adapt automatically to changing environments. Over the past 20 years, the authors and other researchers have developed rigorous mathematical models to describe this phenomenon, which has been dubbed "swarm intelligence," and they are now applying them to business. Their research has already helped several companies develop more efficient ways to schedule factory equipment, divide tasks among workers, organize people, and even plot strategy. Emulating the way ants find the shortest path to a new food supply, for example, has led researchers at Hewlett-Packard to develop software programs that can find the most efficient way to route phone traffic over a telecommunications network. South-west Airlines has used a similar model to efficiently route cargo. To allocate labor, honeybees appear to follow one simple but powerful rule--they seem to specialize in a particular activity unless they perceive an important need to perform another function. Using that model, researchers at Northwestern University have devised a system for painting trucks that can automatically adapt to changing conditions. In the future, the authors speculate, a company might structure its entire business using the principles of swarm intelligence. The result, they believe, would be the ultimate self-organizing enterprise--one that could adapt quickly and instinctively to fast-changing markets.

A novel artificial fish swarm algorithm for recalibration of fiber optic gyroscope error parameters.

PubMed

Gao, Yanbin; Guan, Lianwu; Wang, Tingjun; Sun, Yunlong

2015-05-05

The artificial fish swarm algorithm (AFSA) is one of the state-of-the-art swarm intelligent techniques, which is widely utilized for optimization purposes. Fiber optic gyroscope (FOG) error parameters such as scale factors, biases and misalignment errors are relatively unstable, especially with the environmental disturbances and the aging of fiber coils. These uncalibrated error parameters are the main reasons that the precision of FOG-based strapdown inertial navigation system (SINS) degraded. This research is mainly on the application of a novel artificial fish swarm algorithm (NAFSA) on FOG error coefficients recalibration/identification. First, the NAFSA avoided the demerits (e.g., lack of using artificial fishes' pervious experiences, lack of existing balance between exploration and exploitation, and high computational cost) of the standard AFSA during the optimization process. To solve these weak points, functional behaviors and the overall procedures of AFSA have been improved with some parameters eliminated and several supplementary parameters added. Second, a hybrid FOG error coefficients recalibration algorithm has been proposed based on NAFSA and Monte Carlo simulation (MCS) approaches. This combination leads to maximum utilization of the involved approaches for FOG error coefficients recalibration. After that, the NAFSA is verified with simulation and experiments and its priorities are compared with that of the conventional calibration method and optimal AFSA. Results demonstrate high efficiency of the NAFSA on FOG error coefficients recalibration.

Swarmie User Manual: A Rover Used for Multi-agent Swarm Research

NASA Technical Reports Server (NTRS)

Montague, Gilbert

2014-01-01

The ability to create multiple functional yet cost effective robots is crucial for conducting swarming robotics research. The Center Innovation Fund (CIF) swarming robotics project is a collaboration among the KSC Granular Mechanics and Regolith Operations (GMRO) group, the University of New Mexico Biological Computation Lab, and the NASA Ames Intelligent Robotics Group (IRG) that uses rovers, dubbed "Swarmies", as test platforms for genetic search algorithms. This fall, I assisted in the development of the software modules used on the Swarmies and created this guide to provide thorough instructions on how to configure your workspace to operate a Swarmie both in simulation and out in the field.

An efficient swarm intelligence approach to feature selection based on invasive weed optimization: Application to multivariate calibration and classification using spectroscopic data

NASA Astrophysics Data System (ADS)

Sheykhizadeh, Saheleh; Naseri, Abdolhossein

2018-04-01

Variable selection plays a key role in classification and multivariate calibration. Variable selection methods are aimed at choosing a set of variables, from a large pool of available predictors, relevant to the analyte concentrations estimation, or to achieve better classification results. Many variable selection techniques have now been introduced among which, those which are based on the methodologies of swarm intelligence optimization have been more respected during a few last decades since they are mainly inspired by nature. In this work, a simple and new variable selection algorithm is proposed according to the invasive weed optimization (IWO) concept. IWO is considered a bio-inspired metaheuristic mimicking the weeds ecological behavior in colonizing as well as finding an appropriate place for growth and reproduction; it has been shown to be very adaptive and powerful to environmental changes. In this paper, the first application of IWO, as a very simple and powerful method, to variable selection is reported using different experimental datasets including FTIR and NIR data, so as to undertake classification and multivariate calibration tasks. Accordingly, invasive weed optimization - linear discrimination analysis (IWO-LDA) and invasive weed optimization- partial least squares (IWO-PLS) are introduced for multivariate classification and calibration, respectively.

An efficient swarm intelligence approach to feature selection based on invasive weed optimization: Application to multivariate calibration and classification using spectroscopic data.

PubMed

Sheykhizadeh, Saheleh; Naseri, Abdolhossein

2018-04-05

Variable selection plays a key role in classification and multivariate calibration. Variable selection methods are aimed at choosing a set of variables, from a large pool of available predictors, relevant to the analyte concentrations estimation, or to achieve better classification results. Many variable selection techniques have now been introduced among which, those which are based on the methodologies of swarm intelligence optimization have been more respected during a few last decades since they are mainly inspired by nature. In this work, a simple and new variable selection algorithm is proposed according to the invasive weed optimization (IWO) concept. IWO is considered a bio-inspired metaheuristic mimicking the weeds ecological behavior in colonizing as well as finding an appropriate place for growth and reproduction; it has been shown to be very adaptive and powerful to environmental changes. In this paper, the first application of IWO, as a very simple and powerful method, to variable selection is reported using different experimental datasets including FTIR and NIR data, so as to undertake classification and multivariate calibration tasks. Accordingly, invasive weed optimization - linear discrimination analysis (IWO-LDA) and invasive weed optimization- partial least squares (IWO-PLS) are introduced for multivariate classification and calibration, respectively. Copyright © 2018 Elsevier B.V. All rights reserved.

Cuckoo Search Algorithm Based on Repeat-Cycle Asymptotic Self-Learning and Self-Evolving Disturbance for Function Optimization

PubMed Central

Wang, Jie-sheng; Li, Shu-xia; Song, Jiang-di

2015-01-01

In order to improve convergence velocity and optimization accuracy of the cuckoo search (CS) algorithm for solving the function optimization problems, a new improved cuckoo search algorithm based on the repeat-cycle asymptotic self-learning and self-evolving disturbance (RC-SSCS) is proposed. A disturbance operation is added into the algorithm by constructing a disturbance factor to make a more careful and thorough search near the bird's nests location. In order to select a reasonable repeat-cycled disturbance number, a further study on the choice of disturbance times is made. Finally, six typical test functions are adopted to carry out simulation experiments, meanwhile, compare algorithms of this paper with two typical swarm intelligence algorithms particle swarm optimization (PSO) algorithm and artificial bee colony (ABC) algorithm. The results show that the improved cuckoo search algorithm has better convergence velocity and optimization accuracy. PMID:26366164

Swarm Optimization-Based Magnetometer Calibration for Personal Handheld Devices

PubMed Central

Ali, Abdelrahman; Siddharth, Siddharth; Syed, Zainab; El-Sheimy, Naser

2012-01-01

Inertial Navigation Systems (INS) consist of accelerometers, gyroscopes and a processor that generates position and orientation solutions by integrating the specific forces and rotation rates. In addition to the accelerometers and gyroscopes, magnetometers can be used to derive the user heading based on Earth's magnetic field. Unfortunately, the measurements of the magnetic field obtained with low cost sensors are usually corrupted by several errors, including manufacturing defects and external electro-magnetic fields. Consequently, proper calibration of the magnetometer is required to achieve high accuracy heading measurements. In this paper, a Particle Swarm Optimization (PSO)-based calibration algorithm is presented to estimate the values of the bias and scale factor of low cost magnetometers. The main advantage of this technique is the use of the artificial intelligence which does not need any error modeling or awareness of the nonlinearity. Furthermore, the proposed algorithm can help in the development of Pedestrian Navigation Devices (PNDs) when combined with inertial sensors and GPS/Wi-Fi for indoor navigation and Location Based Services (LBS) applications.

Particle swarm optimization-based local entropy weighted histogram equalization for infrared image enhancement

NASA Astrophysics Data System (ADS)

Wan, Minjie; Gu, Guohua; Qian, Weixian; Ren, Kan; Chen, Qian; Maldague, Xavier

2018-06-01

Infrared image enhancement plays a significant role in intelligent urban surveillance systems for smart city applications. Unlike existing methods only exaggerating the global contrast, we propose a particle swam optimization-based local entropy weighted histogram equalization which involves the enhancement of both local details and fore-and background contrast. First of all, a novel local entropy weighted histogram depicting the distribution of detail information is calculated based on a modified hyperbolic tangent function. Then, the histogram is divided into two parts via a threshold maximizing the inter-class variance in order to improve the contrasts of foreground and background, respectively. To avoid over-enhancement and noise amplification, double plateau thresholds of the presented histogram are formulated by means of particle swarm optimization algorithm. Lastly, each sub-image is equalized independently according to the constrained sub-local entropy weighted histogram. Comparative experiments implemented on real infrared images prove that our algorithm outperforms other state-of-the-art methods in terms of both visual and quantized evaluations.

Robot Wars: US Empire and geopolitics in the robotic age

PubMed Central

Shaw, Ian GR

2017-01-01

How will the robot age transform warfare? What geopolitical futures are being imagined by the US military? This article constructs a robotic futurology to examine these crucial questions. Its central concern is how robots – driven by leaps in artificial intelligence and swarming – are rewiring the spaces and logics of US empire, warfare, and geopolitics. The article begins by building a more-than-human geopolitics to de-center the role of humans in conflict and foreground a worldly understanding of robots. The article then analyzes the idea of US empire, before speculating upon how and why robots are materializing new forms of proxy war. A three-part examination of the shifting spaces of US empire then follows: (1) Swarm Wars explores the implications of miniaturized drone swarming; (2) Roboworld investigates how robots are changing US military basing strategy and producing new topological spaces of violence; and (3) The Autogenic Battle-Site reveals how autonomous robots will produce emergent, technologically event-ful sites of security and violence – revolutionizing the battlespace. The conclusion reflects on the rise of a robotic US empire and its consequences for democracy. PMID:29081605

Robot Wars: US Empire and geopolitics in the robotic age.

PubMed

Shaw, Ian Gr

2017-10-01

How will the robot age transform warfare? What geopolitical futures are being imagined by the US military? This article constructs a robotic futurology to examine these crucial questions. Its central concern is how robots - driven by leaps in artificial intelligence and swarming - are rewiring the spaces and logics of US empire, warfare, and geopolitics. The article begins by building a more-than-human geopolitics to de-center the role of humans in conflict and foreground a worldly understanding of robots. The article then analyzes the idea of US empire, before speculating upon how and why robots are materializing new forms of proxy war. A three-part examination of the shifting spaces of US empire then follows: (1) Swarm Wars explores the implications of miniaturized drone swarming; (2) Roboworld investigates how robots are changing US military basing strategy and producing new topological spaces of violence; and (3) The Autogenic Battle-Site reveals how autonomous robots will produce emergent, technologically event-ful sites of security and violence - revolutionizing the battlespace. The conclusion reflects on the rise of a robotic US empire and its consequences for democracy.

A swarm intelligence framework for reconstructing gene networks: searching for biologically plausible architectures.

PubMed

Kentzoglanakis, Kyriakos; Poole, Matthew

2012-01-01

In this paper, we investigate the problem of reverse engineering the topology of gene regulatory networks from temporal gene expression data. We adopt a computational intelligence approach comprising swarm intelligence techniques, namely particle swarm optimization (PSO) and ant colony optimization (ACO). In addition, the recurrent neural network (RNN) formalism is employed for modeling the dynamical behavior of gene regulatory systems. More specifically, ACO is used for searching the discrete space of network architectures and PSO for searching the corresponding continuous space of RNN model parameters. We propose a novel solution construction process in the context of ACO for generating biologically plausible candidate architectures. The objective is to concentrate the search effort into areas of the structure space that contain architectures which are feasible in terms of their topological resemblance to real-world networks. The proposed framework is initially applied to the reconstruction of a small artificial network that has previously been studied in the context of gene network reverse engineering. Subsequently, we consider an artificial data set with added noise for reconstructing a subnetwork of the genetic interaction network of S. cerevisiae (yeast). Finally, the framework is applied to a real-world data set for reverse engineering the SOS response system of the bacterium Escherichia coli. Results demonstrate the relative advantage of utilizing problem-specific knowledge regarding biologically plausible structural properties of gene networks over conducting a problem-agnostic search in the vast space of network architectures.

Artificial intelligence based models for stream-flow forecasting: 2000-2015

NASA Astrophysics Data System (ADS)

Yaseen, Zaher Mundher; El-shafie, Ahmed; Jaafar, Othman; Afan, Haitham Abdulmohsin; Sayl, Khamis Naba

2015-11-01

The use of Artificial Intelligence (AI) has increased since the middle of the 20th century as seen in its application in a wide range of engineering and science problems. The last two decades, for example, has seen a dramatic increase in the development and application of various types of AI approaches for stream-flow forecasting. Generally speaking, AI has exhibited significant progress in forecasting and modeling non-linear hydrological applications and in capturing the noise complexity in the dataset. This paper explores the state-of-the-art application of AI in stream-flow forecasting, focusing on defining the data-driven of AI, the advantages of complementary models, as well as the literature and their possible future application in modeling and forecasting stream-flow. The review also identifies the major challenges and opportunities for prospective research, including, a new scheme for modeling the inflow, a novel method for preprocessing time series frequency based on Fast Orthogonal Search (FOS) techniques, and Swarm Intelligence (SI) as an optimization approach.

Generic, scalable and decentralized fault detection for robot swarms.

PubMed

Tarapore, Danesh; Christensen, Anders Lyhne; Timmis, Jon

2017-01-01

Robot swarms are large-scale multirobot systems with decentralized control which means that each robot acts based only on local perception and on local coordination with neighboring robots. The decentralized approach to control confers number of potential benefits. In particular, inherent scalability and robustness are often highlighted as key distinguishing features of robot swarms compared with systems that rely on traditional approaches to multirobot coordination. It has, however, been shown that swarm robotics systems are not always fault tolerant. To realize the robustness potential of robot swarms, it is thus essential to give systems the capacity to actively detect and accommodate faults. In this paper, we present a generic fault-detection system for robot swarms. We show how robots with limited and imperfect sensing capabilities are able to observe and classify the behavior of one another. In order to achieve this, the underlying classifier is an immune system-inspired algorithm that learns to distinguish between normal behavior and abnormal behavior online. Through a series of experiments, we systematically assess the performance of our approach in a detailed simulation environment. In particular, we analyze our system's capacity to correctly detect robots with faults, false positive rates, performance in a foraging task in which each robot exhibits a composite behavior, and performance under perturbations of the task environment. Results show that our generic fault-detection system is robust, that it is able to detect faults in a timely manner, and that it achieves a low false positive rate. The developed fault-detection system has the potential to enable long-term autonomy for robust multirobot systems, thus increasing the usefulness of robots for a diverse repertoire of upcoming applications in the area of distributed intelligent automation.

Generic, scalable and decentralized fault detection for robot swarms

PubMed Central

Christensen, Anders Lyhne; Timmis, Jon

2017-01-01

Robot swarms are large-scale multirobot systems with decentralized control which means that each robot acts based only on local perception and on local coordination with neighboring robots. The decentralized approach to control confers number of potential benefits. In particular, inherent scalability and robustness are often highlighted as key distinguishing features of robot swarms compared with systems that rely on traditional approaches to multirobot coordination. It has, however, been shown that swarm robotics systems are not always fault tolerant. To realize the robustness potential of robot swarms, it is thus essential to give systems the capacity to actively detect and accommodate faults. In this paper, we present a generic fault-detection system for robot swarms. We show how robots with limited and imperfect sensing capabilities are able to observe and classify the behavior of one another. In order to achieve this, the underlying classifier is an immune system-inspired algorithm that learns to distinguish between normal behavior and abnormal behavior online. Through a series of experiments, we systematically assess the performance of our approach in a detailed simulation environment. In particular, we analyze our system’s capacity to correctly detect robots with faults, false positive rates, performance in a foraging task in which each robot exhibits a composite behavior, and performance under perturbations of the task environment. Results show that our generic fault-detection system is robust, that it is able to detect faults in a timely manner, and that it achieves a low false positive rate. The developed fault-detection system has the potential to enable long-term autonomy for robust multirobot systems, thus increasing the usefulness of robots for a diverse repertoire of upcoming applications in the area of distributed intelligent automation. PMID:28806756

Artificial bee colony in neuro - Symbolic integration

NASA Astrophysics Data System (ADS)

Kasihmuddin, Mohd Shareduwan Mohd; Sathasivam, Saratha; Mansor, Mohd. Asyraf

2017-08-01

Swarm intelligence is a research area that models the population of the swarm based on natural computation. Artificial bee colony (ABC) algorithm is a swarm based metaheuristic algorithm introduced by Karaboga to optimize numerical problem. Pattern-SAT is a pattern reconstruction paradigm that utilized 2SAT logical rule in representing the behavior of the desired pattern. The information of the desired pattern in terms of 2SAT logic is embedded to Hopfield neural network (HNN-P2SAT) and the desired pattern is reconstructed during the retrieval phase. Since the performance of HNN-P2SAT in Pattern-SAT deteriorates when the number of 2SAT clause increased, newly improved ABC is used to reduce the computation burden during the learning phase of HNN-P2SAT (HNN-P2SATABC). The aim of this study is to investigate the performance of Pattern-SAT produced by ABC incorporated with HNN-P2SAT and compare it with conventional standalone HNN. The comparison is examined by using Microsoft Visual Basic C++ 2013 software. The detailed comparison in doing Pattern-SAT is discussed based on global Pattern-SAT, ratio of activated clauses and computation time. The result obtained from computer simulation indicates the beneficial features of HNN-P2SATABC in doing Pattern-SAT. This finding is expected to result in a significant implication on the choice of searching method used to do Pattern-SAT.

Biomolecular self-defense and futility of high-specificity therapeutic targeting.

PubMed

Rosenfeld, Simon

2011-01-01

Robustness has been long recognized to be a distinctive property of living entities. While a reasonably wide consensus has been achieved regarding the conceptual meaning of robustness, the biomolecular mechanisms underlying this systemic property are still open to many unresolved questions. The goal of this paper is to provide an overview of existing approaches to characterization of robustness in mathematically sound terms. The concept of robustness is discussed in various contexts including network vulnerability, nonlinear dynamic stability, and self-organization. The second goal is to discuss the implications of biological robustness for individual-target therapeutics and possible strategies for outsmarting drug resistance arising from it. Special attention is paid to the concept of swarm intelligence, a well studied mechanism of self-organization in natural, societal and artificial systems. It is hypothesized that swarm intelligence is the key to understanding the emergent property of chemoresistance.

Biomolecular Self-Defense and Futility of High-Specificity Therapeutic Targeting

PubMed Central

Rosenfeld, Simon

2011-01-01

Robustness has been long recognized to be a distinctive property of living entities. While a reasonably wide consensus has been achieved regarding the conceptual meaning of robustness, the biomolecular mechanisms underlying this systemic property are still open to many unresolved questions. The goal of this paper is to provide an overview of existing approaches to characterization of robustness in mathematically sound terms. The concept of robustness is discussed in various contexts including network vulnerability, nonlinear dynamic stability, and self-organization. The second goal is to discuss the implications of biological robustness for individual-target therapeutics and possible strategies for outsmarting drug resistance arising from it. Special attention is paid to the concept of swarm intelligence, a well studied mechanism of self-organization in natural, societal and artificial systems. It is hypothesized that swarm intelligence is the key to understanding the emergent property of chemoresistance. PMID:22272063

Improved Bat Algorithm Applied to Multilevel Image Thresholding

PubMed Central

2014-01-01

Multilevel image thresholding is a very important image processing technique that is used as a basis for image segmentation and further higher level processing. However, the required computational time for exhaustive search grows exponentially with the number of desired thresholds. Swarm intelligence metaheuristics are well known as successful and efficient optimization methods for intractable problems. In this paper, we adjusted one of the latest swarm intelligence algorithms, the bat algorithm, for the multilevel image thresholding problem. The results of testing on standard benchmark images show that the bat algorithm is comparable with other state-of-the-art algorithms. We improved standard bat algorithm, where our modifications add some elements from the differential evolution and from the artificial bee colony algorithm. Our new proposed improved bat algorithm proved to be better than five other state-of-the-art algorithms, improving quality of results in all cases and significantly improving convergence speed. PMID:25165733

NASA's Swarm Missions: The Challenge of Building Autonomous Software

NASA Technical Reports Server (NTRS)

Truszkowski, Walt; Hinchey, Mike; Rash, James; Rouff, Christopher

2004-01-01

The days of watching a massive manned cylinder thrust spectacularly off a platform into space might rapidly become ancient history when the National Aeronautics and Space Administration (NASA) introduces its new millenium mission class. Motivated by the need to gather more data than is possible with a single spacecraft, scientists have developed a new class of missions based on the efficiency and cooperative nature of a hive culture. The missions, aptly dubbed nanoswarm will be little more than mechanized colonies cooperating in their exploration of the solar system. Each swarm mission can have hundreds or even thousands of cooperating intelligent spacecraft that work in teams. The spacecraft must operate independently for long periods both in teams and individually, as well as have autonomic properties - self-healing, -configuring, -optimizing, and -protecting- to survive the harsh space environment. One swarm mission under concept development for 2020 to 2030 is the Autonomous Nano Technology Swarm (ANTS), in which a thousand picospacecraft, each weighing less than three pounds, will work cooperatively to explore the asteroid belt. Some spacecraft will form teams to catalog asteroid properties, such as mass, density, morphology, and chemical composition, using their respective miniature scientific instruments. Others will communicate with the data gatherers and send updates to mission elements on Earth. For software and systems development, this is uncharted territory that calls for revolutionary techniques.

Microwave-based medical diagnosis using particle swarm optimization algorithm

NASA Astrophysics Data System (ADS)

Modiri, Arezoo

This dissertation proposes and investigates a novel architecture intended for microwave-based medical diagnosis (MBMD). Furthermore, this investigation proposes novel modifications of particle swarm optimization algorithm for achieving enhanced convergence performance. MBMD has been investigated through a variety of innovative techniques in the literature since the 1990's and has shown significant promise in early detection of some specific health threats. In comparison to the X-ray- and gamma-ray-based diagnostic tools, MBMD does not expose patients to ionizing radiation; and due to the maturity of microwave technology, it lends itself to miniaturization of the supporting systems. This modality has been shown to be effective in detecting breast malignancy, and hence, this study focuses on the same modality. A novel radiator device and detection technique is proposed and investigated in this dissertation. As expected, hardware design and implementation are of paramount importance in such a study, and a good deal of research, analysis, and evaluation has been done in this regard which will be reported in ensuing chapters of this dissertation. It is noteworthy that an important element of any detection system is the algorithm used for extracting signatures. Herein, the strong intrinsic potential of the swarm-intelligence-based algorithms in solving complicated electromagnetic problems is brought to bear. This task is accomplished through addressing both mathematical and electromagnetic problems. These problems are called benchmark problems throughout this dissertation, since they have known answers. After evaluating the performance of the algorithm for the chosen benchmark problems, the algorithm is applied to MBMD tumor detection problem. The chosen benchmark problems have already been tackled by solution techniques other than particle swarm optimization (PSO) algorithm, the results of which can be found in the literature. However, due to the relatively high level of complexity and randomness inherent to the selection of electromagnetic benchmark problems, a trend to resort to oversimplification in order to arrive at reasonable solutions has been taken in literature when utilizing analytical techniques. Here, an attempt has been made to avoid oversimplification when using the proposed swarm-based optimization algorithms.

A shrinking hypersphere PSO for engineering optimisation problems

NASA Astrophysics Data System (ADS)

Yadav, Anupam; Deep, Kusum

2016-03-01

Many real-world and engineering design problems can be formulated as constrained optimisation problems (COPs). Swarm intelligence techniques are a good approach to solve COPs. In this paper an efficient shrinking hypersphere-based particle swarm optimisation (SHPSO) algorithm is proposed for constrained optimisation. The proposed SHPSO is designed in such a way that the movement of the particle is set to move under the influence of shrinking hyperspheres. A parameter-free approach is used to handle the constraints. The performance of the SHPSO is compared against the state-of-the-art algorithms for a set of 24 benchmark problems. An exhaustive comparison of the results is provided statistically as well as graphically. Moreover three engineering design problems namely welded beam design, compressed string design and pressure vessel design problems are solved using SHPSO and the results are compared with the state-of-the-art algorithms.

Cosmological parameter estimation using Particle Swarm Optimization

NASA Astrophysics Data System (ADS)

Prasad, J.; Souradeep, T.

2014-03-01

Constraining parameters of a theoretical model from observational data is an important exercise in cosmology. There are many theoretically motivated models, which demand greater number of cosmological parameters than the standard model of cosmology uses, and make the problem of parameter estimation challenging. It is a common practice to employ Bayesian formalism for parameter estimation for which, in general, likelihood surface is probed. For the standard cosmological model with six parameters, likelihood surface is quite smooth and does not have local maxima, and sampling based methods like Markov Chain Monte Carlo (MCMC) method are quite successful. However, when there are a large number of parameters or the likelihood surface is not smooth, other methods may be more effective. In this paper, we have demonstrated application of another method inspired from artificial intelligence, called Particle Swarm Optimization (PSO) for estimating cosmological parameters from Cosmic Microwave Background (CMB) data taken from the WMAP satellite.

Product demand forecasts using wavelet kernel support vector machine and particle swarm optimization in manufacture system

NASA Astrophysics Data System (ADS)

Wu, Qi

2010-03-01

Demand forecasts play a crucial role in supply chain management. The future demand for a certain product is the basis for the respective replenishment systems. Aiming at demand series with small samples, seasonal character, nonlinearity, randomicity and fuzziness, the existing support vector kernel does not approach the random curve of the sales time series in the space (quadratic continuous integral space). In this paper, we present a hybrid intelligent system combining the wavelet kernel support vector machine and particle swarm optimization for demand forecasting. The results of application in car sale series forecasting show that the forecasting approach based on the hybrid PSOWv-SVM model is effective and feasible, the comparison between the method proposed in this paper and other ones is also given, which proves that this method is, for the discussed example, better than hybrid PSOv-SVM and other traditional methods.

Self-focusing therapeutic gene delivery with intelligent gene vector swarms: intra-swarm signalling through receptor transgene expression in targeted cells.

PubMed

Tolmachov, Oleg E

2015-01-01

Gene delivery in vivo that is tightly focused on the intended target cells is essential to maximize the benefits of gene therapy and to reduce unwanted side-effects. Cell surface markers are immediately available for probing by therapeutic gene vectors and are often used to direct gene transfer with these vectors to specific target cell populations. However, it is not unusual for the choice of available extra-cellular markers to be too scarce to provide a reliable definition of the desired therapeutically relevant set of target cells. Therefore, interrogation of intra-cellular determinants of cell-specificity, such as tissue-specific transcription factors, can be vital in order to provide detailed cell-guiding information to gene vector particles. An important improvement in cell-specific gene delivery can be achieved through auto-buildup in vector homing efficiency using intelligent 'self-focusing' of swarms of vector particles on target cells. Vector self-focusing was previously suggested to rely on the release of diffusible chemo-attractants after a successful target-specific hit by 'scout' vector particles. I hypothesize that intelligent self-focusing behaviour of swarms of cell-targeted therapeutic gene vectors can be accomplished without the employment of difficult-to-use diffusible chemo-attractants, instead relying on the intra-swarm signalling through cells expressing a non-diffusible extra-cellular receptor for the gene vectors. In the proposed model, cell-guiding information is gathered by the 'scout' gene vector particles, which: (1) attach to a variety of cells via a weakly binding (low affinity) receptor; (2) successfully facilitate gene transfer into these cells; (3) query intra-cellular determinants of cell-specificity with their transgene expression control elements and (4) direct the cell-specific biosynthesis of a vector-encoded strongly binding (high affinity) cell-surface receptor. Free members of the vector swarm loaded with therapeutic cargo are then attracted to and internalized into the intended target cells via the expressed cognate strongly binding extra-cellular receptor, causing escalation of gene transfer into these cells and increasing the copy number of the therapeutic gene expression modules. Such self-focusing swarms of gene vectors can be either homogeneous, with 'scout' and 'therapeutic' members of the swarm being structurally identical, or, alternatively, heterogeneous (split), with 'scout' and 'therapeutic' members of the swarm being structurally specialized. It is hoped that the proposed self-focusing cell-targeted gene vector swarms with receptor-mediated intra-swarm signalling could be particularly effective in 'top-up' gene delivery scenarios, achieving high-level and sustained expression of therapeutic transgenes that are prone to shut-down through degradation and silencing. Crucially, in contrast to low-precision 'general location' vector guidance by diffusible chemo-attractants, ear-marking non-diffusible receptors can provide high-accuracy targeting of therapeutic vector particles to the specific cell, which has undergone a 'successful cell-specific hit' by a 'scout' vector particle. Opportunities for cell targeting could be expanded, since in the proposed model of self-focusing it could be possible to probe a broad selection of intra-cellular determinants of cell-specificity and not just to rely exclusively on extra-cellular markers of cell-specificity. By employing such self-focusing gene vectors for the improvement of cell-targeted delivery of therapeutic genes, e.g., in cancer therapy or gene addition therapy of recessive genetic diseases, it could be possible to broaden a leeway for the reduction of the vector load and, consequently, to minimize undesired vector cytotoxicity, immune reactions, and the risk of inadvertent genetic modification of germline cells in genetic treatment in vivo. Copyright © 2014 Elsevier B.V. All rights reserved.

Extreme Learning Machine and Particle Swarm Optimization in optimizing CNC turning operation

NASA Astrophysics Data System (ADS)

Janahiraman, Tiagrajah V.; Ahmad, Nooraziah; Hani Nordin, Farah

2018-04-01

The CNC machine is controlled by manipulating cutting parameters that could directly influence the process performance. Many optimization methods has been applied to obtain the optimal cutting parameters for the desired performance function. Nonetheless, the industry still uses the traditional technique to obtain those values. Lack of knowledge on optimization techniques is the main reason for this issue to be prolonged. Therefore, the simple yet easy to implement, Optimal Cutting Parameters Selection System is introduced to help the manufacturer to easily understand and determine the best optimal parameters for their turning operation. This new system consists of two stages which are modelling and optimization. In modelling of input-output and in-process parameters, the hybrid of Extreme Learning Machine and Particle Swarm Optimization is applied. This modelling technique tend to converge faster than other artificial intelligent technique and give accurate result. For the optimization stage, again the Particle Swarm Optimization is used to get the optimal cutting parameters based on the performance function preferred by the manufacturer. Overall, the system can reduce the gap between academic world and the industry by introducing a simple yet easy to implement optimization technique. This novel optimization technique can give accurate result besides being the fastest technique.

Physics-based approach to chemical source localization using mobile robotic swarms

NASA Astrophysics Data System (ADS)

Zarzhitsky, Dimitri

2008-07-01

Recently, distributed computation has assumed a dominant role in the fields of artificial intelligence and robotics. To improve system performance, engineers are combining multiple cooperating robots into cohesive collectives called swarms. This thesis illustrates the application of basic principles of physicomimetics, or physics-based design, to swarm robotic systems. Such principles include decentralized control, short-range sensing and low power consumption. We show how the application of these principles to robotic swarms results in highly scalable, robust, and adaptive multi-robot systems. The emergence of these valuable properties can be predicted with the help of well-developed theoretical methods. In this research effort, we have designed and constructed a distributed physicomimetics system for locating sources of airborne chemical plumes. This task, called chemical plume tracing (CPT), is receiving a great deal of attention due to persistent homeland security threats. For this thesis, we have created a novel CPT algorithm called fluxotaxis that is based on theoretical principles of fluid dynamics. Analytically, we show that fluxotaxis combines the essence, as well as the strengths, of the two most popular biologically-inspired CPT methods-- chemotaxis and anemotaxis. The chemotaxis strategy consists of navigating in the direction of the chemical density gradient within the plume, while the anemotaxis approach is based on an upwind traversal of the chemical cloud. Rigorous and extensive experimental evaluations have been performed in simulated chemical plume environments. Using a suite of performance metrics that capture the salient aspects of swarm-specific behavior, we have been able to evaluate and compare the three CPT algorithms. We demonstrate the improved performance of our fluxotaxis approach over both chemotaxis and anemotaxis in these realistic simulation environments, which include obstacles. To test our understanding of CPT on actual hardware, we have implemented chemotaxis on three laboratory-scale robots. Chemotaxis requires only chemical sensors; eventually, when small-scale anemometers capable of reliably detecting low air velocities become available, we plan to implement anemotaxis and fluxotaxis on the robots as well. Our chemotaxis robots use the physicomimetics control algorithm to arrange the team of vehicles into a triangular formation, which then traces an ethanol vapor plume to its source emitter. In agreement with our theoretical predictions, the swarm implementation shows a consistent gain in CPT performance as compared to a single-robot solution.

Research and application of an intelligent control system in central air-conditioning based on energy consumption simulation

NASA Astrophysics Data System (ADS)

Cao, Ling; Che, Wenbin

2018-05-01

For the central air-conditioning energy-saving, it is common practice to use a wide range of PTD controllers in engineering to optimize energy savings. However, the shortcomings of the PTD controller have also been magnified on this issue, such as: calculation accuracy is not enough, the calculation time is too long. Particle swarm optimization has the advantage of fast convergence. This paper is based on Particle Swarm Optimization apply in PTD controller tuning parameters in order to achieve the purpose of saving energy while ensuring comfort. The algorithm proposed in this paper can adjust the weight according to the change of population fitness, reduce the weights of particles with lower fitness and enhance the weights of particles with higher fitness in the population, and fully release the population vitality. The method in this paper is validated by the TRNSYS model based on the central air-conditioning system. The experimental results show that the room temperature fluctuation is small, the overshoot is small, the adjustment speed is fast, and the energy-saving fluctuates at 10%.

Computing Nash equilibria through computational intelligence methods

NASA Astrophysics Data System (ADS)

Pavlidis, N. G.; Parsopoulos, K. E.; Vrahatis, M. N.

2005-03-01

Nash equilibrium constitutes a central solution concept in game theory. The task of detecting the Nash equilibria of a finite strategic game remains a challenging problem up-to-date. This paper investigates the effectiveness of three computational intelligence techniques, namely, covariance matrix adaptation evolution strategies, particle swarm optimization, as well as, differential evolution, to compute Nash equilibria of finite strategic games, as global minima of a real-valued, nonnegative function. An issue of particular interest is to detect more than one Nash equilibria of a game. The performance of the considered computational intelligence methods on this problem is investigated using multistart and deflection.

Modeling level change in Lake Urmia using hybrid artificial intelligence approaches

NASA Astrophysics Data System (ADS)

Esbati, M.; Ahmadieh Khanesar, M.; Shahzadi, Ali

2017-06-01

The investigation of water level fluctuations in lakes for protecting them regarding the importance of these water complexes in national and regional scales has found a special place among countries in recent years. The importance of the prediction of water level balance in Lake Urmia is necessary due to several-meter fluctuations in the last decade which help the prevention from possible future losses. For this purpose, in this paper, the performance of adaptive neuro-fuzzy inference system (ANFIS) for predicting the lake water level balance has been studied. In addition, for the training of the adaptive neuro-fuzzy inference system, particle swarm optimization (PSO) and hybrid backpropagation-recursive least square method algorithm have been used. Moreover, a hybrid method based on particle swarm optimization and recursive least square (PSO-RLS) training algorithm for the training of ANFIS structure is introduced. In order to have a more fare comparison, hybrid particle swarm optimization and gradient descent are also applied. The models have been trained, tested, and validated based on lake level data between 1991 and 2014. For performance evaluation, a comparison is made between these methods. Numerical results obtained show that the proposed methods with a reasonable error have a good performance in water level balance prediction. It is also clear that with continuing the current trend, Lake Urmia will experience more drop in the water level balance in the upcoming years.

Performance comparison of genetic algorithms and particle swarm optimization for model integer programming bus timetabling problem

NASA Astrophysics Data System (ADS)

Wihartiko, F. D.; Wijayanti, H.; Virgantari, F.

2018-03-01

Genetic Algorithm (GA) is a common algorithm used to solve optimization problems with artificial intelligence approach. Similarly, the Particle Swarm Optimization (PSO) algorithm. Both algorithms have different advantages and disadvantages when applied to the case of optimization of the Model Integer Programming for Bus Timetabling Problem (MIPBTP), where in the case of MIPBTP will be found the optimal number of trips confronted with various constraints. The comparison results show that the PSO algorithm is superior in terms of complexity, accuracy, iteration and program simplicity in finding the optimal solution.

A Dynamic Recommender System for Improved Web Usage Mining and CRM Using Swarm Intelligence.

PubMed

Alphy, Anna; Prabakaran, S

2015-01-01

In modern days, to enrich e-business, the websites are personalized for each user by understanding their interests and behavior. The main challenges of online usage data are information overload and their dynamic nature. In this paper, to address these issues, a WebBluegillRecom-annealing dynamic recommender system that uses web usage mining techniques in tandem with software agents developed for providing dynamic recommendations to users that can be used for customizing a website is proposed. The proposed WebBluegillRecom-annealing dynamic recommender uses swarm intelligence from the foraging behavior of a bluegill fish. It overcomes the information overload by handling dynamic behaviors of users. Our dynamic recommender system was compared against traditional collaborative filtering systems. The results show that the proposed system has higher precision, coverage, F1 measure, and scalability than the traditional collaborative filtering systems. Moreover, the recommendations given by our system overcome the overspecialization problem by including variety in recommendations.

A Dynamic Recommender System for Improved Web Usage Mining and CRM Using Swarm Intelligence

PubMed Central

Alphy, Anna; Prabakaran, S.

2015-01-01

In modern days, to enrich e-business, the websites are personalized for each user by understanding their interests and behavior. The main challenges of online usage data are information overload and their dynamic nature. In this paper, to address these issues, a WebBluegillRecom-annealing dynamic recommender system that uses web usage mining techniques in tandem with software agents developed for providing dynamic recommendations to users that can be used for customizing a website is proposed. The proposed WebBluegillRecom-annealing dynamic recommender uses swarm intelligence from the foraging behavior of a bluegill fish. It overcomes the information overload by handling dynamic behaviors of users. Our dynamic recommender system was compared against traditional collaborative filtering systems. The results show that the proposed system has higher precision, coverage, F1 measure, and scalability than the traditional collaborative filtering systems. Moreover, the recommendations given by our system overcome the overspecialization problem by including variety in recommendations. PMID:26229978

FRAN and RBF-PSO as two components of a hyper framework to recognize protein folds.

PubMed

Abbasi, Elham; Ghatee, Mehdi; Shiri, M E

2013-09-01

In this paper, an intelligent hyper framework is proposed to recognize protein folds from its amino acid sequence which is a fundamental problem in bioinformatics. This framework includes some statistical and intelligent algorithms for proteins classification. The main components of the proposed framework are the Fuzzy Resource-Allocating Network (FRAN) and the Radial Bases Function based on Particle Swarm Optimization (RBF-PSO). FRAN applies a dynamic method to tune up the RBF network parameters. Due to the patterns complexity captured in protein dataset, FRAN classifies the proteins under fuzzy conditions. Also, RBF-PSO applies PSO to tune up the RBF classifier. Experimental results demonstrate that FRAN improves prediction accuracy up to 51% and achieves acceptable multi-class results for protein fold prediction. Although RBF-PSO provides reasonable results for protein fold recognition up to 48%, it is weaker than FRAN in some cases. However the proposed hyper framework provides an opportunity to use a great range of intelligent methods and can learn from previous experiences. Thus it can avoid the weakness of some intelligent methods in terms of memory, computational time and static structure. Furthermore, the performance of this system can be enhanced throughout the system life-cycle. Copyright © 2013 Elsevier Ltd. All rights reserved.

Using ANTS to explore small body populations in the solar system.

NASA Astrophysics Data System (ADS)

Clark, P. E.; Rilee, M.; Truszkowski, W.; Curtis, S.; Marr, G.; Chapman, C.

2001-11-01

ANTS (Autonomous Nano-Technology Swarm), a NASA advanced mission concept, is a large (100 to 1000 member) swarm of pico-class (1 kg) totally autonomous spacecraft that prospect the asteroid belt. Little data is available for asteroids because the vast majority are too small to be observed except in close proximity. Light curves are available for thousands of asteroids, confirmed trajectories for tens of thousands, detailed shape models for approximately ten. Asteroids originated in the transitional region between the inner (rocky) and outer (solidified gases) solar system. Many have remained largely unmodified since formation, and thus have more primitive composition than planetary surfaces. Determination of the systematic distribution of physical and compositional properties within the asteroid population is crucial in the understanding of solar system formation. The traditional exploration approach of using few, large spacecraft for sequential exploration, could be improved. Our far more cost-effective approach utilizes distributed intelligence in a swarm of tiny highly maneuverable spacecraft, each with specialized instrument capability (e.g., advanced computing, imaging, spectrometry). NASA is at the forefront of Intelligent Software Agents (ISAs) research, performing experiments in space and on the ground to advance deliberative and collaborative autonomous control techniques. The advanced development under consideration here is in the use of ISAs at a strategic level, to explore remote frontiers of the solar system, potentially involving a large class of objects such as asteroids. Supervised clusters of spacecraft operate simultaneously within a broadly defined framework of goals to select targets (> 1000) from among available candidates while developing scenarios for studying targets. Swarm members use solar sails to fly directly to asteroids > 1 kilometer in diameter, and then perform maneuvers appropriate for the instrument carried, ranging from hovering to orbiting. Selected members return with data and are replaced as needed.

Modeling and simulation of dynamic ant colony's labor division for task allocation of UAV swarm

NASA Astrophysics Data System (ADS)

Wu, Husheng; Li, Hao; Xiao, Renbin; Liu, Jie

2018-02-01

The problem of unmanned aerial vehicle (UAV) task allocation not only has the intrinsic attribute of complexity, such as highly nonlinear, dynamic, highly adversarial and multi-modal, but also has a better practicability in various multi-agent systems, which makes it more and more attractive recently. In this paper, based on the classic fixed response threshold model (FRTM), under the idea of "problem centered + evolutionary solution" and by a bottom-up way, the new dynamic environmental stimulus, response threshold and transition probability are designed, and a dynamic ant colony's labor division (DACLD) model is proposed. DACLD allows a swarm of agents with a relatively low-level of intelligence to perform complex tasks, and has the characteristic of distributed framework, multi-tasks with execution order, multi-state, adaptive response threshold and multi-individual response. With the proposed model, numerical simulations are performed to illustrate the effectiveness of the distributed task allocation scheme in two situations of UAV swarm combat (dynamic task allocation with a certain number of enemy targets and task re-allocation due to unexpected threats). Results show that our model can get both the heterogeneous UAVs' real-time positions and states at the same time, and has high degree of self-organization, flexibility and real-time response to dynamic environments.

Material quality assessment of silk nanofibers based on swarm intelligence

NASA Astrophysics Data System (ADS)

Brandoli Machado, Bruno; Nunes Gonçalves, Wesley; Martinez Bruno, Odemir

2013-02-01

In this paper, we propose a novel approach for texture analysis based on artificial crawler model. Our method assumes that each agent can interact with the environment and each other. The evolution process converges to an equilibrium state according to the set of rules. For each textured image, the feature vector is composed by signatures of the live agents curve at each time. Experimental results revealed that combining the minimum and maximum signatures into one increase the classification rate. In addition, we pioneer the use of autonomous agents for characterizing silk fibroin scaffolds. The results strongly suggest that our approach can be successfully employed for texture analysis.

An efficient algorithm for function optimization: modified stem cells algorithm

NASA Astrophysics Data System (ADS)

Taherdangkoo, Mohammad; Paziresh, Mahsa; Yazdi, Mehran; Bagheri, Mohammad Hadi

2013-03-01

In this paper, we propose an optimization algorithm based on the intelligent behavior of stem cell swarms in reproduction and self-organization. Optimization algorithms, such as the Genetic Algorithm (GA), Particle Swarm Optimization (PSO) algorithm, Ant Colony Optimization (ACO) algorithm and Artificial Bee Colony (ABC) algorithm, can give solutions to linear and non-linear problems near to the optimum for many applications; however, in some case, they can suffer from becoming trapped in local optima. The Stem Cells Algorithm (SCA) is an optimization algorithm inspired by the natural behavior of stem cells in evolving themselves into new and improved cells. The SCA avoids the local optima problem successfully. In this paper, we have made small changes in the implementation of this algorithm to obtain improved performance over previous versions. Using a series of benchmark functions, we assess the performance of the proposed algorithm and compare it with that of the other aforementioned optimization algorithms. The obtained results prove the superiority of the Modified Stem Cells Algorithm (MSCA).

Generating a Multiphase Equation of State with Swarm Intelligence

NASA Astrophysics Data System (ADS)

Cox, Geoffrey

2017-06-01

Hydrocode calculations require knowledge of the variation of pressure of a material with density and temperature, which is given by the equation of state. An accurate model needs to account for discontinuities in energy, density and properties of a material across a phase boundary. When generating a multiphase equation of state the modeller attempts to balance the agreement between the available data for compression, expansion and phase boundary location. However, this can prove difficult because minor adjustments in the equation of state for a single phase can have a large impact on the overall phase diagram. Recently, Cox and Christie described a method for combining statistical-mechanics-based condensed matter physics models with a stochastic analysis technique called particle swarm optimisation. The models produced show good agreement with experiment over a wide range of pressure-temperature space. This talk details the general implementation of this technique, shows example results, and describes the types of analysis that can be performed with this method.

A novel global Harmony Search method based on Ant Colony Optimisation algorithm

NASA Astrophysics Data System (ADS)

Fouad, Allouani; Boukhetala, Djamel; Boudjema, Fares; Zenger, Kai; Gao, Xiao-Zhi

2016-03-01

The Global-best Harmony Search (GHS) is a stochastic optimisation algorithm recently developed, which hybridises the Harmony Search (HS) method with the concept of swarm intelligence in the particle swarm optimisation (PSO) to enhance its performance. In this article, a new optimisation algorithm called GHSACO is developed by incorporating the GHS with the Ant Colony Optimisation algorithm (ACO). Our method introduces a novel improvisation process, which is different from that of the GHS in the following aspects. (i) A modified harmony memory (HM) representation and conception. (ii) The use of a global random switching mechanism to monitor the choice between the ACO and GHS. (iii) An additional memory consideration selection rule using the ACO random proportional transition rule with a pheromone trail update mechanism. The proposed GHSACO algorithm has been applied to various benchmark functions and constrained optimisation problems. Simulation results demonstrate that it can find significantly better solutions when compared with the original HS and some of its variants.

A Novel Flexible Inertia Weight Particle Swarm Optimization Algorithm.

PubMed

Amoshahy, Mohammad Javad; Shamsi, Mousa; Sedaaghi, Mohammad Hossein

2016-01-01

Particle swarm optimization (PSO) is an evolutionary computing method based on intelligent collective behavior of some animals. It is easy to implement and there are few parameters to adjust. The performance of PSO algorithm depends greatly on the appropriate parameter selection strategies for fine tuning its parameters. Inertia weight (IW) is one of PSO's parameters used to bring about a balance between the exploration and exploitation characteristics of PSO. This paper proposes a new nonlinear strategy for selecting inertia weight which is named Flexible Exponential Inertia Weight (FEIW) strategy because according to each problem we can construct an increasing or decreasing inertia weight strategy with suitable parameters selection. The efficacy and efficiency of PSO algorithm with FEIW strategy (FEPSO) is validated on a suite of benchmark problems with different dimensions. Also FEIW is compared with best time-varying, adaptive, constant and random inertia weights. Experimental results and statistical analysis prove that FEIW improves the search performance in terms of solution quality as well as convergence rate.

A Novel Flexible Inertia Weight Particle Swarm Optimization Algorithm

PubMed Central

Shamsi, Mousa; Sedaaghi, Mohammad Hossein

2016-01-01

Particle swarm optimization (PSO) is an evolutionary computing method based on intelligent collective behavior of some animals. It is easy to implement and there are few parameters to adjust. The performance of PSO algorithm depends greatly on the appropriate parameter selection strategies for fine tuning its parameters. Inertia weight (IW) is one of PSO’s parameters used to bring about a balance between the exploration and exploitation characteristics of PSO. This paper proposes a new nonlinear strategy for selecting inertia weight which is named Flexible Exponential Inertia Weight (FEIW) strategy because according to each problem we can construct an increasing or decreasing inertia weight strategy with suitable parameters selection. The efficacy and efficiency of PSO algorithm with FEIW strategy (FEPSO) is validated on a suite of benchmark problems with different dimensions. Also FEIW is compared with best time-varying, adaptive, constant and random inertia weights. Experimental results and statistical analysis prove that FEIW improves the search performance in terms of solution quality as well as convergence rate. PMID:27560945

Particle swarm optimization algorithm based low cost magnetometer calibration

NASA Astrophysics Data System (ADS)

Ali, A. S.; Siddharth, S., Syed, Z., El-Sheimy, N.

2011-12-01

Inertial Navigation Systems (INS) consist of accelerometers, gyroscopes and a microprocessor provide inertial digital data from which position and orientation is obtained by integrating the specific forces and rotation rates. In addition to the accelerometers and gyroscopes, magnetometers can be used to derive the absolute user heading based on Earth's magnetic field. Unfortunately, the measurements of the magnetic field obtained with low cost sensors are corrupted by several errors including manufacturing defects and external electro-magnetic fields. Consequently, proper calibration of the magnetometer is required to achieve high accuracy heading measurements. In this paper, a Particle Swarm Optimization (PSO) based calibration algorithm is presented to estimate the values of the bias and scale factor of low cost magnetometer. The main advantage of this technique is the use of the artificial intelligence which does not need any error modeling or awareness of the nonlinearity. The estimated bias and scale factor errors from the proposed algorithm improve the heading accuracy and the results are also statistically significant. Also, it can help in the development of the Pedestrian Navigation Devices (PNDs) when combined with the INS and GPS/Wi-Fi especially in the indoor environments

New numerical methods for open-loop and feedback solutions to dynamic optimization problems

NASA Astrophysics Data System (ADS)

Ghosh, Pradipto

The topic of the first part of this research is trajectory optimization of dynamical systems via computational swarm intelligence. Particle swarm optimization is a nature-inspired heuristic search method that relies on a group of potential solutions to explore the fitness landscape. Conceptually, each particle in the swarm uses its own memory as well as the knowledge accumulated by the entire swarm to iteratively converge on an optimal or near-optimal solution. It is relatively straightforward to implement and unlike gradient-based solvers, does not require an initial guess or continuity in the problem definition. Although particle swarm optimization has been successfully employed in solving static optimization problems, its application in dynamic optimization, as posed in optimal control theory, is still relatively new. In the first half of this thesis particle swarm optimization is used to generate near-optimal solutions to several nontrivial trajectory optimization problems including thrust programming for minimum fuel, multi-burn spacecraft orbit transfer, and computing minimum-time rest-to-rest trajectories for a robotic manipulator. A distinct feature of the particle swarm optimization implementation in this work is the runtime selection of the optimal solution structure. Optimal trajectories are generated by solving instances of constrained nonlinear mixed-integer programming problems with the swarming technique. For each solved optimal programming problem, the particle swarm optimization result is compared with a nearly exact solution found via a direct method using nonlinear programming. Numerical experiments indicate that swarm search can locate solutions to very great accuracy. The second half of this research develops a new extremal-field approach for synthesizing nearly optimal feedback controllers for optimal control and two-player pursuit-evasion games described by general nonlinear differential equations. A notable revelation from this development is that the resulting control law has an algebraic closed-form structure. The proposed method uses an optimal spatial statistical predictor called universal kriging to construct the surrogate model of a feedback controller, which is capable of quickly predicting an optimal control estimate based on current state (and time) information. With universal kriging, an approximation to the optimal feedback map is computed by conceptualizing a set of state-control samples from pre-computed extremals to be a particular realization of a jointly Gaussian spatial process. Feedback policies are computed for a variety of example dynamic optimization problems in order to evaluate the effectiveness of this methodology. This feedback synthesis approach is found to combine good numerical accuracy with low computational overhead, making it a suitable candidate for real-time applications. Particle swarm and universal kriging are combined for a capstone example, a near optimal, near-admissible, full-state feedback control law is computed and tested for the heat-load-limited atmospheric-turn guidance of an aeroassisted transfer vehicle. The performance of this explicit guidance scheme is found to be very promising; initial errors in atmospheric entry due to simulated thruster misfirings are found to be accurately corrected while closely respecting the algebraic state-inequality constraint.

An adaptive neural swarm approach for intrusion defense in ad hoc networks

NASA Astrophysics Data System (ADS)

Cannady, James

2011-06-01

Wireless sensor networks (WSN) and mobile ad hoc networks (MANET) are being increasingly deployed in critical applications due to the flexibility and extensibility of the technology. While these networks possess numerous advantages over traditional wireless systems in dynamic environments they are still vulnerable to many of the same types of host-based and distributed attacks common to those systems. Unfortunately, the limited power and bandwidth available in WSNs and MANETs, combined with the dynamic connectivity that is a defining characteristic of the technology, makes it extremely difficult to utilize traditional intrusion detection techniques. This paper describes an approach to accurately and efficiently detect potentially damaging activity in WSNs and MANETs. It enables the network as a whole to recognize attacks, anomalies, and potential vulnerabilities in a distributive manner that reflects the autonomic processes of biological systems. Each component of the network recognizes activity in its local environment and then contributes to the overall situational awareness of the entire system. The approach utilizes agent-based swarm intelligence to adaptively identify potential data sources on each node and on adjacent nodes throughout the network. The swarm agents then self-organize into modular neural networks that utilize a reinforcement learning algorithm to identify relevant behavior patterns in the data without supervision. Once the modular neural networks have established interconnectivity both locally and with neighboring nodes the analysis of events within the network can be conducted collectively in real-time. The approach has been shown to be extremely effective in identifying distributed network attacks.

Enhanced intelligent water drops algorithm for multi-depot vehicle routing problem

PubMed Central

Akutsah, Francis; Olusanya, Micheal O.; Adewumi, Aderemi O.

2018-01-01

The intelligent water drop algorithm is a swarm-based metaheuristic algorithm, inspired by the characteristics of water drops in the river and the environmental changes resulting from the action of the flowing river. Since its appearance as an alternative stochastic optimization method, the algorithm has found applications in solving a wide range of combinatorial and functional optimization problems. This paper presents an improved intelligent water drop algorithm for solving multi-depot vehicle routing problems. A simulated annealing algorithm was introduced into the proposed algorithm as a local search metaheuristic to prevent the intelligent water drop algorithm from getting trapped into local minima and also improve its solution quality. In addition, some of the potential problematic issues associated with using simulated annealing that include high computational runtime and exponential calculation of the probability of acceptance criteria, are investigated. The exponential calculation of the probability of acceptance criteria for the simulated annealing based techniques is computationally expensive. Therefore, in order to maximize the performance of the intelligent water drop algorithm using simulated annealing, a better way of calculating the probability of acceptance criteria is considered. The performance of the proposed hybrid algorithm is evaluated by using 33 standard test problems, with the results obtained compared with the solutions offered by four well-known techniques from the subject literature. Experimental results and statistical tests show that the new method possesses outstanding performance in terms of solution quality and runtime consumed. In addition, the proposed algorithm is suitable for solving large-scale problems. PMID:29554662

Enhanced intelligent water drops algorithm for multi-depot vehicle routing problem.

PubMed

Ezugwu, Absalom E; Akutsah, Francis; Olusanya, Micheal O; Adewumi, Aderemi O

2018-01-01

The intelligent water drop algorithm is a swarm-based metaheuristic algorithm, inspired by the characteristics of water drops in the river and the environmental changes resulting from the action of the flowing river. Since its appearance as an alternative stochastic optimization method, the algorithm has found applications in solving a wide range of combinatorial and functional optimization problems. This paper presents an improved intelligent water drop algorithm for solving multi-depot vehicle routing problems. A simulated annealing algorithm was introduced into the proposed algorithm as a local search metaheuristic to prevent the intelligent water drop algorithm from getting trapped into local minima and also improve its solution quality. In addition, some of the potential problematic issues associated with using simulated annealing that include high computational runtime and exponential calculation of the probability of acceptance criteria, are investigated. The exponential calculation of the probability of acceptance criteria for the simulated annealing based techniques is computationally expensive. Therefore, in order to maximize the performance of the intelligent water drop algorithm using simulated annealing, a better way of calculating the probability of acceptance criteria is considered. The performance of the proposed hybrid algorithm is evaluated by using 33 standard test problems, with the results obtained compared with the solutions offered by four well-known techniques from the subject literature. Experimental results and statistical tests show that the new method possesses outstanding performance in terms of solution quality and runtime consumed. In addition, the proposed algorithm is suitable for solving large-scale problems.

MaGate Simulator: A Simulation Environment for a Decentralized Grid Scheduler

NASA Astrophysics Data System (ADS)

Huang, Ye; Brocco, Amos; Courant, Michele; Hirsbrunner, Beat; Kuonen, Pierre

This paper presents a simulator for of a decentralized modular grid scheduler named MaGate. MaGate’s design emphasizes scheduler interoperability by providing intelligent scheduling serving the grid community as a whole. Each MaGate scheduler instance is able to deal with dynamic scheduling conditions, with continuously arriving grid jobs. Received jobs are either allocated on local resources, or delegated to other MaGates for remote execution. The proposed MaGate simulator is based on GridSim toolkit and Alea simulator, and abstracts the features and behaviors of complex fundamental grid elements, such as grid jobs, grid resources, and grid users. Simulation of scheduling tasks is supported by a grid network overlay simulator executing distributed ant-based swarm intelligence algorithms to provide services such as group communication and resource discovery. For evaluation, a comparison of behaviors of different collaborative policies among a community of MaGates is provided. Results support the use of the proposed approach as a functional ready grid scheduler simulator.

Joint global optimization of tomographic data based on particle swarm optimization and decision theory

NASA Astrophysics Data System (ADS)

Paasche, H.; Tronicke, J.

2012-04-01

In many near surface geophysical applications multiple tomographic data sets are routinely acquired to explore subsurface structures and parameters. Linking the model generation process of multi-method geophysical data sets can significantly reduce ambiguities in geophysical data analysis and model interpretation. Most geophysical inversion approaches rely on local search optimization methods used to find an optimal model in the vicinity of a user-given starting model. The final solution may critically depend on the initial model. Alternatively, global optimization (GO) methods have been used to invert geophysical data. They explore the solution space in more detail and determine the optimal model independently from the starting model. Additionally, they can be used to find sets of optimal models allowing a further analysis of model parameter uncertainties. Here we employ particle swarm optimization (PSO) to realize the global optimization of tomographic data. PSO is an emergent methods based on swarm intelligence characterized by fast and robust convergence towards optimal solutions. The fundamental principle of PSO is inspired by nature, since the algorithm mimics the behavior of a flock of birds searching food in a search space. In PSO, a number of particles cruise a multi-dimensional solution space striving to find optimal model solutions explaining the acquired data. The particles communicate their positions and success and direct their movement according to the position of the currently most successful particle of the swarm. The success of a particle, i.e. the quality of the currently found model by a particle, must be uniquely quantifiable to identify the swarm leader. When jointly inverting disparate data sets, the optimization solution has to satisfy multiple optimization objectives, at least one for each data set. Unique determination of the most successful particle currently leading the swarm is not possible. Instead, only statements about the Pareto optimality of the found solutions can be made. Identification of the leading particle traditionally requires a costly combination of ranking and niching techniques. In our approach, we use a decision rule under uncertainty to identify the currently leading particle of the swarm. In doing so, we consider the different objectives of our optimization problem as competing agents with partially conflicting interests. Analysis of the maximin fitness function allows for robust and cheap identification of the currently leading particle. The final optimization result comprises a set of possible models spread along the Pareto front. For convex Pareto fronts, solution density is expected to be maximal in the region ideally compromising all objectives, i.e. the region of highest curvature.

Smart materials on the way to theranostic nanorobots: Molecular machines and nanomotors, advanced biosensors, and intelligent vehicles for drug delivery.

PubMed

Sokolov, Ilya L; Cherkasov, Vladimir R; Tregubov, Andrey A; Buiucli, Sveatoslav R; Nikitin, Maxim P

2017-06-01

Theranostics, a fusion of two key parts of modern medicine - diagnostics and therapy of the organism's disorders, promises to bring the efficacy of medical treatment to a fundamentally new level and to become the basis of personalized medicine. Extrapolating today's progress in the field of smart materials to the long-run prospect, we can imagine future intelligent agents capable of performing complex analysis of different physiological factors inside the living organism and implementing a built-in program thereby triggering a series of therapeutic actions. These agents, by analogy with their macroscopic counterparts, can be called nanorobots. It is quite obscure what these devices are going to look like but they will be more or less based on today's achievements in nanobiotechnology. The present Review is an attempt to systematize highly diverse nanomaterials, which may potentially serve as modules for theranostic nanorobotics, e.g., nanomotors, sensing units, and payload carriers. Biocomputing-based sensing, externally actuated or chemically "fueled" autonomous movement, swarm inter-agent communication behavior are just a few inspiring examples that nanobiotechnology can offer today for construction of truly intelligent drug delivery systems. The progress of smart nanomaterials toward fully autonomous drug delivery nanorobots is an exciting prospect for disease treatment. Synergistic combination of the available approaches and their further development may produce intelligent drugs of unmatched functionality. Copyright © 2017 Elsevier B.V. All rights reserved.

A hybrid artificial bee colony algorithm for numerical function optimization

NASA Astrophysics Data System (ADS)

Alqattan, Zakaria N.; Abdullah, Rosni

2015-02-01

Artificial Bee Colony (ABC) algorithm is one of the swarm intelligence algorithms; it has been introduced by Karaboga in 2005. It is a meta-heuristic optimization search algorithm inspired from the intelligent foraging behavior of the honey bees in nature. Its unique search process made it as one of the most competitive algorithm with some other search algorithms in the area of optimization, such as Genetic algorithm (GA) and Particle Swarm Optimization (PSO). However, the ABC performance of the local search process and the bee movement or the solution improvement equation still has some weaknesses. The ABC is good in avoiding trapping at the local optimum but it spends its time searching around unpromising random selected solutions. Inspired by the PSO, we propose a Hybrid Particle-movement ABC algorithm called HPABC, which adapts the particle movement process to improve the exploration of the original ABC algorithm. Numerical benchmark functions were used in order to experimentally test the HPABC algorithm. The results illustrate that the HPABC algorithm can outperform the ABC algorithm in most of the experiments (75% better in accuracy and over 3 times faster).

Swarm intelligence: when uncertainty meets conflict.

PubMed

Conradt, Larissa; List, Christian; Roper, Timothy J

2013-11-01

Good decision making is important for the survival and fitness of stakeholders, but decisions usually involve uncertainty and conflict. We know surprisingly little about profitable decision-making strategies in conflict situations. On the one hand, sharing decisions with others can pool information and decrease uncertainty (swarm intelligence). On the other hand, sharing decisions can hand influence to individuals whose goals conflict. Thus, when should an animal share decisions with others? Using a theoretical model, we show that, contrary to intuition, decision sharing by animals with conflicting goals often increases individual gains as well as decision accuracy. Thus, conflict-far from hampering effective decision making-can improve decision outcomes for all stakeholders, as long as they share large-scale goals. In contrast, decisions shared by animals without conflict were often surprisingly poor. The underlying mechanism is that animals with conflicting goals are less correlated in individual choice errors. These results provide a strong argument in the interest of all stakeholders for not excluding other (e.g., minority) factions from collective decisions. The observed benefits of including diverse factions among the decision makers could also be relevant to human collective decision making.

Performance Review of Harmony Search, Differential Evolution and Particle Swarm Optimization

NASA Astrophysics Data System (ADS)

Mohan Pandey, Hari

2017-08-01

Metaheuristic algorithms are effective in the design of an intelligent system. These algorithms are widely applied to solve complex optimization problems, including image processing, big data analytics, language processing, pattern recognition and others. This paper presents a performance comparison of three meta-heuristic algorithms, namely Harmony Search, Differential Evolution, and Particle Swarm Optimization. These algorithms are originated altogether from different fields of meta-heuristics yet share a common objective. The standard benchmark functions are used for the simulation. Statistical tests are conducted to derive a conclusion on the performance. The key motivation to conduct this research is to categorize the computational capabilities, which might be useful to the researchers.

Particle swarm optimization applied to automatic lens design

NASA Astrophysics Data System (ADS)

Qin, Hua

2011-06-01

This paper describes a novel application of Particle Swarm Optimization (PSO) technique to lens design. A mathematical model is constructed, and merit functions in an optical system are employed as fitness functions, which combined radiuses of curvature, thicknesses among lens surfaces and refractive indices regarding an optical system. By using this function, the aberration correction is carried out. A design example using PSO is given. Results show that PSO as optical design tools is practical and powerful, and this method is no longer dependent on the lens initial structure and can arbitrarily create search ranges of structural parameters of a lens system, which is an important step towards automatic design with artificial intelligence.

A new distributed systems scheduling algorithm: a swarm intelligence approach

NASA Astrophysics Data System (ADS)

Haghi Kashani, Mostafa; Sarvizadeh, Raheleh; Jameii, Mahdi

2011-12-01

The scheduling problem in distributed systems is known as an NP-complete problem, and methods based on heuristic or metaheuristic search have been proposed to obtain optimal and suboptimal solutions. The task scheduling is a key factor for distributed systems to gain better performance. In this paper, an efficient method based on memetic algorithm is developed to solve the problem of distributed systems scheduling. With regard to load balancing efficiently, Artificial Bee Colony (ABC) has been applied as local search in the proposed memetic algorithm. The proposed method has been compared to existing memetic-Based approach in which Learning Automata method has been used as local search. The results demonstrated that the proposed method outperform the above mentioned method in terms of communication cost.

Identification of transformer fault based on dissolved gas analysis using hybrid support vector machine-modified evolutionary particle swarm optimisation

PubMed Central

2018-01-01

Early detection of power transformer fault is important because it can reduce the maintenance cost of the transformer and it can ensure continuous electricity supply in power systems. Dissolved Gas Analysis (DGA) technique is commonly used to identify oil-filled power transformer fault type but utilisation of artificial intelligence method with optimisation methods has shown convincing results. In this work, a hybrid support vector machine (SVM) with modified evolutionary particle swarm optimisation (EPSO) algorithm was proposed to determine the transformer fault type. The superiority of the modified PSO technique with SVM was evaluated by comparing the results with the actual fault diagnosis, unoptimised SVM and previous reported works. Data reduction was also applied using stepwise regression prior to the training process of SVM to reduce the training time. It was found that the proposed hybrid SVM-Modified EPSO (MEPSO)-Time Varying Acceleration Coefficient (TVAC) technique results in the highest correct identification percentage of faults in a power transformer compared to other PSO algorithms. Thus, the proposed technique can be one of the potential solutions to identify the transformer fault type based on DGA data on site. PMID:29370230

Identification of transformer fault based on dissolved gas analysis using hybrid support vector machine-modified evolutionary particle swarm optimisation.

PubMed

Illias, Hazlee Azil; Zhao Liang, Wee

2018-01-01

Early detection of power transformer fault is important because it can reduce the maintenance cost of the transformer and it can ensure continuous electricity supply in power systems. Dissolved Gas Analysis (DGA) technique is commonly used to identify oil-filled power transformer fault type but utilisation of artificial intelligence method with optimisation methods has shown convincing results. In this work, a hybrid support vector machine (SVM) with modified evolutionary particle swarm optimisation (EPSO) algorithm was proposed to determine the transformer fault type. The superiority of the modified PSO technique with SVM was evaluated by comparing the results with the actual fault diagnosis, unoptimised SVM and previous reported works. Data reduction was also applied using stepwise regression prior to the training process of SVM to reduce the training time. It was found that the proposed hybrid SVM-Modified EPSO (MEPSO)-Time Varying Acceleration Coefficient (TVAC) technique results in the highest correct identification percentage of faults in a power transformer compared to other PSO algorithms. Thus, the proposed technique can be one of the potential solutions to identify the transformer fault type based on DGA data on site.

ANTS: A New Concept for Very Remote Exploration with Intelligent Software Agents

NASA Astrophysics Data System (ADS)

Clark, P. E.; Curtis, S.; Rilee, M.; Truszkowski, W.; Iyengar, J.; Crawford, H.

2001-12-01

ANTS (Autonomous Nano-Technology Swarm), a NASA advanced mission concept, is a large (100 to 1000 member) swarm of pico-class (1 kg) totally autonomous spacecraft that prospect the asteroid belt. As the capacity and complexity of hardware and software, and the sophistication of technical and scientific goals have increased, greater cost constraints have led to fewer resources and thus, the need to operate spacecraft with less frequent contact. At present, autonomous operation of spacecraft systems allows great capability of spacecraft to 'safe' themselves when conditions threaten spacecraft safety. To further develop spacecraft capability, NASA is at the forefront of Intelligent Software Agent (ISA) research, performing experiments in space and on the ground to advance deliberative and collaborative autonomous control techniques. Selected missions in current planning stages require small groups of spacecraft to cooperate at a tactical level to select and schedule measurements to be made by appropriate instruments to characterize rapidly unfolding real-time events on a routine basis. The next level of development, which we are considering here, is in the use of ISAs at a strategic level, to explore the final, remote frontiers of the solar system, potentially involving a large class of objects with only infrequent contact possible. Obvious mission candidates are mainbelt asteroids, a population consisting of more than a million small bodies. Although a large fraction of solar system objects are asteroids, little data is available for them because the vast majority of them are too small to be observed except in close proximity. Asteroids originated in the transitional region between the inner (rocky) and outer (solidified gases) solar system, have remained largely unmodified since formation, and thus have a more primitive composition which includes higher abundances of siderophile (metallic iron-associated) elements and volatiles than other planetary surfaces. As a result, there has been interest in asteroids as sources of exploitable resources. Far more reconnaissance is required before such a program is undertaken. A traditional mission approach (to explore larger asteroids sequentially) is not adequate for determining the systematic distribution of exploitable material in the asteroid population. Our approach involves the use of distributed intelligence in a swarm of tiny spacecraft, each with specialized instrument capability (e.g., advanced computing, imaging, spectrometry, etc.) to evaluate the resource potential of the entire population. Supervised clusters of spacecraft will operate simultaneously within a broadly defined framework of goals to select targets (>1000) from among available candidates and to develop scenarios for studying targets simultaneously. Spacecraft use solar sails to fly directly to asteroids 1 kilometer or greater in diameter. Selected swarm members return to Earth with data, replacements join the swarm as needed. We would like to acknowledge our students R. Watson, V. Cox, and F. Olukomo for their support of this work.

Achieving Consistent Near-Optimal Pattern Recognition Accuracy Using Particle Swarm Optimization to Pre-Train Artificial Neural Networks

ERIC Educational Resources Information Center

Nikelshpur, Dmitry O.

2014-01-01

Similar to mammalian brains, Artificial Neural Networks (ANN) are universal approximators, capable of yielding near-optimal solutions to a wide assortment of problems. ANNs are used in many fields including medicine, internet security, engineering, retail, robotics, warfare, intelligence control, and finance. "ANNs have a tendency to get…

Swarm Intelligence: New Techniques for Adaptive Systems to Provide Learning Support

ERIC Educational Resources Information Center

Wong, Lung-Hsiang; Looi, Chee-Kit

2012-01-01

The notion of a system adapting itself to provide support for learning has always been an important issue of research for technology-enabled learning. One approach to provide adaptivity is to use social navigation approaches and techniques which involve analysing data of what was previously selected by a cluster of users or what worked for…

Decision-making in honeybee swarms based on quality and distance information of candidate nest sites.

PubMed

Laomettachit, Teeraphan; Termsaithong, Teerasit; Sae-Tang, Anuwat; Duangphakdee, Orawan

2015-01-07

In the nest-site selection process of honeybee swarms, an individual bee performs a waggle dance to communicate information about direction, quality, and distance of a discovered site to other bees at the swarm. Initially, different groups of bees dance to represent different potential sites, but eventually the swarm usually reaches an agreement for only one site. Here, we model the nest-site selection process in honeybee swarms of Apis mellifera and show how the swarms make adaptive decisions based on a trade-off between the quality and distance to candidate nest sites. We use bifurcation analysis and stochastic simulations to reveal that the swarm's site distance preference is moderate>near>far when the swarms choose between low quality sites. However, the distance preference becomes near>moderate>far when the swarms choose between high quality sites. Our simulations also indicate that swarms with large population size prefer nearer sites and, in addition, are more adaptive at making decisions based on available information compared to swarms with smaller population size. Copyright © 2014 Elsevier Ltd. All rights reserved.

You Can't Get There From Here! Problems and Potential Solutions in Developing New Classes of Complex Systems

NASA Technical Reports Server (NTRS)

Hinchey, Michael G.; Rash, James L.; Truszkowski, Walter F.; Rouff, Christopher A.; Sterritt, Roy

2005-01-01

The explosion of capabilities and new products within the sphere of Information Technology (IT) has fostered widespread, overly optimistic opinions regarding the industry, based on common but unjustified assumptions of quality and correctness of software. These assumptions are encouraged by software producers and vendors, who at this late date have not succeeded in finding a way to overcome the lack of an automated, mathematically sound way to develop correct systems from requirements. NASA faces this dilemma as it envisages advanced mission concepts that involve large swarms of small spacecraft that will engage cooperatively to acheve science goals. Such missions entail levels of complexity that beg for new methods for system development far beyond today's methods, which are inadequate for ensuring correct behavior of large numbers of interacting intelligent mission elements. New system development techniques recently devised through NASA-led research will offer some innovative approaches to achieving correctness in complex system development, including autonomous swarm missions that exhibit emergent behavior, as well as general software products created by the computing industry.

Artificial intelligence and synthetic biology: A tri-temporal contribution.

PubMed

Bianchini, Francesco

2016-10-01

Artificial intelligence can make numerous contributions to synthetic biology. I would like to suggest three that are related to the past, present and future of artificial intelligence. From the past, works in biology and artificial systems by Turing and von Neumann prove highly interesting to explore within the new framework of synthetic biology, especially with regard to the notions of self-modification and self-replication and their links to emergence and the bottom-up approach. The current epistemological inquiry into emergence and research on swarm intelligence, superorganisms and biologically inspired cognitive architecture may lead to new achievements on the possibilities of synthetic biology in explaining cognitive processes. Finally, the present-day discussion on the future of artificial intelligence and the rise of superintelligence may point to some research trends for the future of synthetic biology and help to better define the boundary of notions such as "life", "cognition", "artificial" and "natural", as well as their interconnections in theoretical synthetic biology. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.

The foundations of plant intelligence.

PubMed

Trewavas, Anthony

2017-06-06

Intelligence is defined for wild plants and its role in fitness identified. Intelligent behaviour exhibited by single cells and systems similarity between the interactome and connectome indicates neural systems are not necessary for intelligent capabilities. Plants sense and respond to many environmental signals that are assessed to competitively optimize acquisition of patchily distributed resources. Situations of choice engender motivational states in goal-directed plant behaviour; consequent intelligent decisions enable efficient gain of energy over expenditure. Comparison of swarm intelligence and plant behaviour indicates the origins of plant intelligence lie in complex communication and is exemplified by cambial control of branch function. Error correction in behaviours indicates both awareness and intention as does the ability to count to five. Volatile organic compounds are used as signals in numerous plant interactions. Being complex in composition and often species and individual specific, they may represent the plant language and account for self and alien recognition between individual plants. Game theory has been used to understand competitive and cooperative interactions between plants and microbes. Some unexpected cooperative behaviour between individuals and potential aliens has emerged. Behaviour profiting from experience, another simple definition of intelligence, requires both learning and memory and is indicated in the priming of herbivory, disease and abiotic stresses.

The foundations of plant intelligence

PubMed Central

2017-01-01

Intelligence is defined for wild plants and its role in fitness identified. Intelligent behaviour exhibited by single cells and systems similarity between the interactome and connectome indicates neural systems are not necessary for intelligent capabilities. Plants sense and respond to many environmental signals that are assessed to competitively optimize acquisition of patchily distributed resources. Situations of choice engender motivational states in goal-directed plant behaviour; consequent intelligent decisions enable efficient gain of energy over expenditure. Comparison of swarm intelligence and plant behaviour indicates the origins of plant intelligence lie in complex communication and is exemplified by cambial control of branch function. Error correction in behaviours indicates both awareness and intention as does the ability to count to five. Volatile organic compounds are used as signals in numerous plant interactions. Being complex in composition and often species and individual specific, they may represent the plant language and account for self and alien recognition between individual plants. Game theory has been used to understand competitive and cooperative interactions between plants and microbes. Some unexpected cooperative behaviour between individuals and potential aliens has emerged. Behaviour profiting from experience, another simple definition of intelligence, requires both learning and memory and is indicated in the priming of herbivory, disease and abiotic stresses. PMID:28479977

Application of the artificial bee colony algorithm for solving the set covering problem.

PubMed

Crawford, Broderick; Soto, Ricardo; Cuesta, Rodrigo; Paredes, Fernando

2014-01-01

The set covering problem is a formal model for many practical optimization problems. In the set covering problem the goal is to choose a subset of the columns of minimal cost that covers every row. Here, we present a novel application of the artificial bee colony algorithm to solve the non-unicost set covering problem. The artificial bee colony algorithm is a recent swarm metaheuristic technique based on the intelligent foraging behavior of honey bees. Experimental results show that our artificial bee colony algorithm is competitive in terms of solution quality with other recent metaheuristic approaches for the set covering problem.

Performance comparison of some evolutionary algorithms on job shop scheduling problems

NASA Astrophysics Data System (ADS)

Mishra, S. K.; Rao, C. S. P.

2016-09-01

Job Shop Scheduling as a state space search problem belonging to NP-hard category due to its complexity and combinational explosion of states. Several naturally inspire evolutionary methods have been developed to solve Job Shop Scheduling Problems. In this paper the evolutionary methods namely Particles Swarm Optimization, Artificial Intelligence, Invasive Weed Optimization, Bacterial Foraging Optimization, Music Based Harmony Search Algorithms are applied and find tuned to model and solve Job Shop Scheduling Problems. To compare about 250 Bench Mark instances have been used to evaluate the performance of these algorithms. The capabilities of each these algorithms in solving Job Shop Scheduling Problems are outlined.

Application of the Artificial Bee Colony Algorithm for Solving the Set Covering Problem

PubMed Central

Crawford, Broderick; Soto, Ricardo; Cuesta, Rodrigo; Paredes, Fernando

2014-01-01

The set covering problem is a formal model for many practical optimization problems. In the set covering problem the goal is to choose a subset of the columns of minimal cost that covers every row. Here, we present a novel application of the artificial bee colony algorithm to solve the non-unicost set covering problem. The artificial bee colony algorithm is a recent swarm metaheuristic technique based on the intelligent foraging behavior of honey bees. Experimental results show that our artificial bee colony algorithm is competitive in terms of solution quality with other recent metaheuristic approaches for the set covering problem. PMID:24883356

Aerial robot intelligent control method based on back-stepping

NASA Astrophysics Data System (ADS)

Zhou, Jian; Xue, Qian

2018-05-01

The aerial robot is characterized as strong nonlinearity, high coupling and parameter uncertainty, a self-adaptive back-stepping control method based on neural network is proposed in this paper. The uncertain part of the aerial robot model is compensated online by the neural network of Cerebellum Model Articulation Controller and robust control items are designed to overcome the uncertainty error of the system during online learning. At the same time, particle swarm algorithm is used to optimize and fix parameters so as to improve the dynamic performance, and control law is obtained by the recursion of back-stepping regression. Simulation results show that the designed control law has desired attitude tracking performance and good robustness in case of uncertainties and large errors in the model parameters.

Computational intelligence-based optimization of maximally stable extremal region segmentation for object detection

NASA Astrophysics Data System (ADS)

Davis, Jeremy E.; Bednar, Amy E.; Goodin, Christopher T.; Durst, Phillip J.; Anderson, Derek T.; Bethel, Cindy L.

2017-05-01

Particle swarm optimization (PSO) and genetic algorithms (GAs) are two optimization techniques from the field of computational intelligence (CI) for search problems where a direct solution can not easily be obtained. One such problem is finding an optimal set of parameters for the maximally stable extremal region (MSER) algorithm to detect areas of interest in imagery. Specifically, this paper describes the design of a GA and PSO for optimizing MSER parameters to detect stop signs in imagery produced via simulation for use in an autonomous vehicle navigation system. Several additions to the GA and PSO are required to successfully detect stop signs in simulated images. These additions are a primary focus of this paper and include: the identification of an appropriate fitness function, the creation of a variable mutation operator for the GA, an anytime algorithm modification to allow the GA to compute a solution quickly, the addition of an exponential velocity decay function to the PSO, the addition of an "execution best" omnipresent particle to the PSO, and the addition of an attractive force component to the PSO velocity update equation. Experimentation was performed with the GA using various combinations of selection, crossover, and mutation operators and experimentation was also performed with the PSO using various combinations of neighborhood topologies, swarm sizes, cognitive influence scalars, and social influence scalars. The results of both the GA and PSO optimized parameter sets are presented. This paper details the benefits and drawbacks of each algorithm in terms of detection accuracy, execution speed, and additions required to generate successful problem specific parameter sets.

Using a Combined Platform of Swarm Intelligence Algorithms and GIS to Provide Land Suitability Maps for Locating Cardiac Rehabilitation Defibrillators

PubMed Central

KAFFASH-CHARANDABI, Neda; SADEGHI-NIARAKI, Abolghasem; PARK, Dong-Kyun

2015-01-01

Background: Cardiac arrest is a condition in which the heart is completely stopped and is not pumping any blood. Although most cardiac arrest cases are reported from homes or hospitals, about 20% occur in public areas. Therefore, these areas need to be investigated in terms of cardiac arrest incidence so that places of high incidence can be identified and cardiac rehabilitation defibrillators installed there. Methods: In order to investigate a study area in Petersburg, Pennsylvania State, and to determine appropriate places for installing defibrillators with 5-year period data, swarm intelligence algorithms were used. Moreover, the location of the defibrillators was determined based on the following five evaluation criteria: land use, altitude of the area, economic conditions, distance from hospitals and approximate areas of reported cases of cardiac arrest for public places that were created in geospatial information system (GIS). Results: The A-P HADEL algorithm results were more precise about 27.36%. The validation results indicated a wider coverage of real values and the verification results confirmed the faster and more exact optimization of the cost function in the PSO method. Conclusion: The study findings emphasize the necessity of applying optimal optimization methods along with GIS and precise selection of criteria in the selection of optimal locations for installing medical facilities because the selected algorithm and criteria dramatically affect the final responses. Meanwhile, providing land suitability maps for installing facilities across hot and risky spots has the potential to save many lives. PMID:26587471

Construction of Gene Regulatory Networks Using Recurrent Neural Networks and Swarm Intelligence.

PubMed

Khan, Abhinandan; Mandal, Sudip; Pal, Rajat Kumar; Saha, Goutam

2016-01-01

We have proposed a methodology for the reverse engineering of biologically plausible gene regulatory networks from temporal genetic expression data. We have used established information and the fundamental mathematical theory for this purpose. We have employed the Recurrent Neural Network formalism to extract the underlying dynamics present in the time series expression data accurately. We have introduced a new hybrid swarm intelligence framework for the accurate training of the model parameters. The proposed methodology has been first applied to a small artificial network, and the results obtained suggest that it can produce the best results available in the contemporary literature, to the best of our knowledge. Subsequently, we have implemented our proposed framework on experimental (in vivo) datasets. Finally, we have investigated two medium sized genetic networks (in silico) extracted from GeneNetWeaver, to understand how the proposed algorithm scales up with network size. Additionally, we have implemented our proposed algorithm with half the number of time points. The results indicate that a reduction of 50% in the number of time points does not have an effect on the accuracy of the proposed methodology significantly, with a maximum of just over 15% deterioration in the worst case.

Swarm-based medicine.

PubMed

Putora, Paul Martin; Oldenburg, Jan

2013-09-19

Occasionally, medical decisions have to be taken in the absence of evidence-based guidelines. Other sources can be drawn upon to fill in the gaps, including experience and intuition. Authorities or experts, with their knowledge and experience, may provide further input--known as "eminence-based medicine". Due to the Internet and digital media, interactions among physicians now take place at a higher rate than ever before. With the rising number of interconnected individuals and their communication capabilities, the medical community is obtaining the properties of a swarm. The way individual physicians act depends on other physicians; medical societies act based on their members. Swarm behavior might facilitate the generation and distribution of knowledge as an unconscious process. As such, "swarm-based medicine" may add a further source of information to the classical approaches of evidence- and eminence-based medicine. How to integrate swarm-based medicine into practice is left to the individual physician, but even this decision will be influenced by the swarm.

Distributed pheromone-based swarming control of unmanned air and ground vehicles for RSTA

NASA Astrophysics Data System (ADS)

Sauter, John A.; Mathews, Robert S.; Yinger, Andrew; Robinson, Joshua S.; Moody, John; Riddle, Stephanie

2008-04-01

The use of unmanned vehicles in Reconnaissance, Surveillance, and Target Acquisition (RSTA) applications has received considerable attention recently. Cooperating land and air vehicles can support multiple sensor modalities providing pervasive and ubiquitous broad area sensor coverage. However coordination of multiple air and land vehicles serving different mission objectives in a dynamic and complex environment is a challenging problem. Swarm intelligence algorithms, inspired by the mechanisms used in natural systems to coordinate the activities of many entities provide a promising alternative to traditional command and control approaches. This paper describes recent advances in a fully distributed digital pheromone algorithm that has demonstrated its effectiveness in managing the complexity of swarming unmanned systems. The results of a recent demonstration at NASA's Wallops Island of multiple Aerosonde Unmanned Air Vehicles (UAVs) and Pioneer Unmanned Ground Vehicles (UGVs) cooperating in a coordinated RSTA application are discussed. The vehicles were autonomously controlled by the onboard digital pheromone responding to the needs of the automatic target recognition algorithms. UAVs and UGVs controlled by the same pheromone algorithm self-organized to perform total area surveillance, automatic target detection, sensor cueing, and automatic target recognition with no central processing or control and minimal operator input. Complete autonomy adds several safety and fault tolerance requirements which were integrated into the basic pheromone framework. The adaptive algorithms demonstrated the ability to handle some unplanned hardware failures during the demonstration without any human intervention. The paper describes lessons learned and the next steps for this promising technology.

Object Detection Based on Template Matching through Use of Best-So-Far ABC

PubMed Central

2014-01-01

Best-so-far ABC is a modified version of the artificial bee colony (ABC) algorithm used for optimization tasks. This algorithm is one of the swarm intelligence (SI) algorithms proposed in recent literature, in which the results demonstrated that the best-so-far ABC can produce higher quality solutions with faster convergence than either the ordinary ABC or the current state-of-the-art ABC-based algorithm. In this work, we aim to apply the best-so-far ABC-based approach for object detection based on template matching by using the difference between the RGB level histograms corresponding to the target object and the template object as the objective function. Results confirm that the proposed method was successful in both detecting objects and optimizing the time used to reach the solution. PMID:24812556

A cognitive information processing framework for distributed sensor networks

NASA Astrophysics Data System (ADS)

Wang, Feiyi; Qi, Hairong

2004-09-01

In this paper, we present a cognitive agent framework (CAF) based on swarm intelligence and self-organization principles, and demonstrate it through collaborative processing for target classification in sensor networks. The framework involves integrated designs to provide both cognitive behavior at the organization level to conquer complexity and reactive behavior at the individual agent level to retain simplicity. The design tackles various problems in the current information processing systems, including overly complex systems, maintenance difficulties, increasing vulnerability to attack, lack of capability to tolerate faults, and inability to identify and cope with low-frequency patterns. An important and distinguishing point of the presented work from classical AI research is that the acquired intelligence does not pertain to distinct individuals but to groups. It also deviates from multi-agent systems (MAS) due to sheer quantity of extremely simple agents we are able to accommodate, to the degree that some loss of coordination messages and behavior of faulty/compromised agents will not affect the collective decision made by the group.

Detection and Length Estimation of Linear Scratch on Solid Surfaces Using an Angle Constrained Ant Colony Technique

NASA Astrophysics Data System (ADS)

Pal, Siddharth; Basak, Aniruddha; Das, Swagatam

In many manufacturing areas the detection of surface defects is one of the most important processes in quality control. Currently in order to detect small scratches on solid surfaces most of the industries working on material manufacturing rely on visual inspection primarily. In this article we propose a hybrid computational intelligence technique to automatically detect a linear scratch from a solid surface and estimate its length (in pixel unit) simultaneously. The approach is based on a swarm intelligence algorithm called Ant Colony Optimization (ACO) and image preprocessing with Wiener and Sobel filters as well as the Canny edge detector. The ACO algorithm is mostly used to compensate for the broken parts of the scratch. Our experimental results confirm that the proposed technique can be used for detecting scratches from noisy and degraded images, even when it is very difficult for conventional image processing to distinguish the scratch area from its background.

Recurrent neural network-based modeling of gene regulatory network using elephant swarm water search algorithm.

PubMed

Mandal, Sudip; Saha, Goutam; Pal, Rajat Kumar

2017-08-01

Correct inference of genetic regulations inside a cell from the biological database like time series microarray data is one of the greatest challenges in post genomic era for biologists and researchers. Recurrent Neural Network (RNN) is one of the most popular and simple approach to model the dynamics as well as to infer correct dependencies among genes. Inspired by the behavior of social elephants, we propose a new metaheuristic namely Elephant Swarm Water Search Algorithm (ESWSA) to infer Gene Regulatory Network (GRN). This algorithm is mainly based on the water search strategy of intelligent and social elephants during drought, utilizing the different types of communication techniques. Initially, the algorithm is tested against benchmark small and medium scale artificial genetic networks without and with presence of different noise levels and the efficiency was observed in term of parametric error, minimum fitness value, execution time, accuracy of prediction of true regulation, etc. Next, the proposed algorithm is tested against the real time gene expression data of Escherichia Coli SOS Network and results were also compared with others state of the art optimization methods. The experimental results suggest that ESWSA is very efficient for GRN inference problem and performs better than other methods in many ways.

Dancing with Swarms: Utilizing Swarm Intelligence to Build, Investigate, and Control Complex Systems

NASA Astrophysics Data System (ADS)

Jacob, Christian

We are surrounded by a natural world of massively parallel, decentralized biological "information processing" systems, a world that exhibits fascinating emergent properties in many ways. In fact, our very own bodies are the result of emergent patterns, as the development of any multi-cellular organism is determined by localized interactions among an enormous number of cells, carefully orchestrated by enzymes, signalling proteins and other molecular "agents". What is particularly striking about these highly distributed developmental processes is that a centralized control agency is completely absent. This is also the case for many other biological systems, such as termites which build their nests—without an architect that draws a plan, or brain cells evolving into a complex `mind machine'—without an explicit blueprint of a network layout.

Convergence analysis of particle swarm optimization (PSO) method on the with-in host dengue infection treatment model

NASA Astrophysics Data System (ADS)

Handayani, D.; Nuraini, N.; Tse, O.; Saragih, R.; Naiborhu, J.

2016-04-01

PSO is a computational optimization method motivated by the social behavior of organisms like bird flocking, fish schooling and human social relations. PSO is one of the most important swarm intelligence algorithms. In this study, we analyze the convergence of PSO when it is applied to with-in host dengue infection treatment model simulation in our early research. We used PSO method to construct the initial adjoin equation and to solve a control problem. Its properties of control input on the continuity of objective function and ability of adapting to the dynamic environment made us have to analyze the convergence of PSO. With the convergence analysis of PSO we will have some parameters that ensure the convergence result of numerical simulations on this model using PSO.

Military Application of Apiculture: The (Other) Nature of War

DTIC Science & Technology

2011-03-30

cybernetic organisms, cyborgs , out of bees and other insects. The objective is to control the cyborgs ’ flight and motions by remote control. Used individually...or in swarms, cyborgs could potentially conduct reconnaissance missions, deliver toxins, collect intelligence, track targets, and retrieve samples...develop technology to create cybernetic organisms, cyborgs , out of bees arid other insects. The objective is to control the cyborgs1 flight and

Non-linear pattern formation in bone growth and architecture.

PubMed

Salmon, Phil

2014-01-01

The three-dimensional morphology of bone arises through adaptation to its required engineering performance. Genetically and adaptively bone travels along a complex spatiotemporal trajectory to acquire optimal architecture. On a cellular, micro-anatomical scale, what mechanisms coordinate the activity of osteoblasts and osteoclasts to produce complex and efficient bone architectures? One mechanism is examined here - chaotic non-linear pattern formation (NPF) - which underlies in a unifying way natural structures as disparate as trabecular bone, swarms of birds flying, island formation, fluid turbulence, and others. At the heart of NPF is the fact that simple rules operating between interacting elements, and Turing-like interaction between global and local signals, lead to complex and structured patterns. The study of "group intelligence" exhibited by swarming birds or shoaling fish has led to an embodiment of NPF called "particle swarm optimization" (PSO). This theoretical model could be applicable to the behavior of osteoblasts, osteoclasts, and osteocytes, seeing them operating "socially" in response simultaneously to both global and local signals (endocrine, cytokine, mechanical), resulting in their clustered activity at formation and resorption sites. This represents problem-solving by social intelligence, and could potentially add further realism to in silico computer simulation of bone modeling. What insights has NPF provided to bone biology? One example concerns the genetic disorder juvenile Pagets disease or idiopathic hyperphosphatasia, where the anomalous parallel trabecular architecture characteristic of this pathology is consistent with an NPF paradigm by analogy with known experimental NPF systems. Here, coupling or "feedback" between osteoblasts and osteoclasts is the critical element. This NPF paradigm implies a profound link between bone regulation and its architecture: in bone the architecture is the regulation. The former is the emergent consequence of the latter.

Swarm intelligence application for optimization of CO2 diffusivity in polystyrene-b-polybutadiene-b-polystyrene (SEBS) foaming

NASA Astrophysics Data System (ADS)

Sharudin, Rahida Wati; Ajib, Norshawalina Muhamad; Yusoff, Marina; Ahmad, Mohd Aizad

2017-12-01

Thermoplastic elastomer SEBS foams were prepared by using carbon dioxide (CO2) as a blowing agent and the process is classified as physical foaming method. During the foaming process, the diffusivity of CO2 need to be controlled since it is one of the parameter that will affect the final cellular structure of the foam. Conventionally, the rate of CO2 diffusion was measured experimentally by using a highly sensitive device called magnetic suspension balance (MSB). Besides, this expensive MSB machine is not easily available and measurement of CO2 diffusivity is quite complicated as well as time consuming process. Thus, to overcome these limitations, a computational method was introduced. Particle Swarm Optimization (PSO) is a part of Swarm Intelligence system which acts as a beneficial optimization tool where it can solve most of nonlinear complications. PSO model was developed for predicting the optimum foaming temperature and CO2 diffusion rate in SEBS foam. Results obtained by PSO model are compared with experimental results for CO2 diffusivity at various foaming temperature. It is shown that predicted optimum foaming temperature at 154.6 °C was not represented the best temperature for foaming as the cellular structure of SEBS foamed at corresponding temperature consisted pores with unstable dimension and the structure was not visibly perceived due to foam shrinkage. The predictions were not agreed well with experimental result when single parameter of CO2 diffusivity is considered in PSO model because it is not the only factor that affected the controllability of foam shrinkage. The modification on the PSO model by considering CO2 solubility and rigidity of SEBS as additional parameters needs to be done for obtaining the optimum temperature for SEBS foaming. Hence stable SEBS foam could be prepared.

Integrating Symbolic and Statistical Methods for Testing Intelligent Systems Applications to Machine Learning and Computer Vision

DOE Office of Scientific and Technical Information (OSTI.GOV)

Jha, Sumit Kumar; Pullum, Laura L; Ramanathan, Arvind

Embedded intelligent systems ranging from tiny im- plantable biomedical devices to large swarms of autonomous un- manned aerial systems are becoming pervasive in our daily lives. While we depend on the flawless functioning of such intelligent systems, and often take their behavioral correctness and safety for granted, it is notoriously difficult to generate test cases that expose subtle errors in the implementations of machine learning algorithms. Hence, the validation of intelligent systems is usually achieved by studying their behavior on representative data sets, using methods such as cross-validation and bootstrapping.In this paper, we present a new testing methodology for studyingmore » the correctness of intelligent systems. Our approach uses symbolic decision procedures coupled with statistical hypothesis testing to. We also use our algorithm to analyze the robustness of a human detection algorithm built using the OpenCV open-source computer vision library. We show that the human detection implementation can fail to detect humans in perturbed video frames even when the perturbations are so small that the corresponding frames look identical to the naked eye.« less

Developing Software for NASA Missions in the New Millennia

NASA Technical Reports Server (NTRS)

Truszkowski, Walt; Rash, James; Rouff, Christopher; Hinchey, Mike

2004-01-01

NASA is working on new mission concepts for exploration of the solar system. The concepts for these missions include swarms of hundreds of cooperating intelligent spacecraft which will be able to work in teams and gather more data than current single spacecraft missions. These spacecraft will not only have to operate independently for long periods of time on their own and in teams, but will also need to have autonomic properties of self healing, self configuring, self optimizing and self protecting for them to survive in the harsh space environment. Software for these types of missions has never been developed before and represents some of the challenges of software development in the new millennia. The Autonomous Nano Technology Swarm (ANTS) mission is an example of one of the swarm missions NASA is considering. The ANTS mission will use a swarm of one thousand pico-spacecraft that weigh less than five pounds. Using an insect colony analog, ANTS will explore the asteroid belt and catalog the mass, density, morphology, and chemical composition of the asteroids. Due to the size of the spacecraft, each will only carry a single miniaturized science instrument which will require them to cooperate in searching for asteroids that are of scientific interest. This article also discusses the ANTS mission, the properties the spacecraft will need and how that will effect future software development.

Optimization of brushless direct current motor design using an intelligent technique.

PubMed

Shabanian, Alireza; Tousiwas, Armin Amini Poustchi; Pourmandi, Massoud; Khormali, Aminollah; Ataei, Abdolhay

2015-07-01

This paper presents a method for the optimal design of a slotless permanent magnet brushless DC (BLDC) motor with surface mounted magnets using an improved bee algorithm (IBA). The characteristics of the motor are expressed as functions of motor geometries. The objective function is a combination of losses, volume and cost to be minimized simultaneously. This method is based on the capability of swarm-based algorithms in finding the optimal solution. One sample case is used to illustrate the performance of the design approach and optimization technique. The IBA has a better performance and speed of convergence compared with bee algorithm (BA). Simulation results show that the proposed method has a very high/efficient performance. Copyright © 2015 ISA. Published by Elsevier Ltd. All rights reserved.

Parameter Selection and Performance Comparison of Particle Swarm Optimization in Sensor Networks Localization.

PubMed

Cui, Huanqing; Shu, Minglei; Song, Min; Wang, Yinglong

2017-03-01

Localization is a key technology in wireless sensor networks. Faced with the challenges of the sensors' memory, computational constraints, and limited energy, particle swarm optimization has been widely applied in the localization of wireless sensor networks, demonstrating better performance than other optimization methods. In particle swarm optimization-based localization algorithms, the variants and parameters should be chosen elaborately to achieve the best performance. However, there is a lack of guidance on how to choose these variants and parameters. Further, there is no comprehensive performance comparison among particle swarm optimization algorithms. The main contribution of this paper is three-fold. First, it surveys the popular particle swarm optimization variants and particle swarm optimization-based localization algorithms for wireless sensor networks. Secondly, it presents parameter selection of nine particle swarm optimization variants and six types of swarm topologies by extensive simulations. Thirdly, it comprehensively compares the performance of these algorithms. The results show that the particle swarm optimization with constriction coefficient using ring topology outperforms other variants and swarm topologies, and it performs better than the second-order cone programming algorithm.

Parameter Selection and Performance Comparison of Particle Swarm Optimization in Sensor Networks Localization

PubMed Central

Cui, Huanqing; Shu, Minglei; Song, Min; Wang, Yinglong

2017-01-01

Localization is a key technology in wireless sensor networks. Faced with the challenges of the sensors’ memory, computational constraints, and limited energy, particle swarm optimization has been widely applied in the localization of wireless sensor networks, demonstrating better performance than other optimization methods. In particle swarm optimization-based localization algorithms, the variants and parameters should be chosen elaborately to achieve the best performance. However, there is a lack of guidance on how to choose these variants and parameters. Further, there is no comprehensive performance comparison among particle swarm optimization algorithms. The main contribution of this paper is three-fold. First, it surveys the popular particle swarm optimization variants and particle swarm optimization-based localization algorithms for wireless sensor networks. Secondly, it presents parameter selection of nine particle swarm optimization variants and six types of swarm topologies by extensive simulations. Thirdly, it comprehensively compares the performance of these algorithms. The results show that the particle swarm optimization with constriction coefficient using ring topology outperforms other variants and swarm topologies, and it performs better than the second-order cone programming algorithm. PMID:28257060

On the role of the plasmodial cytoskeleton in facilitating intelligent behavior in slime mold Physarum polycephalum.

PubMed

Mayne, Richard; Adamatzky, Andrew; Jones, Jeff

2015-01-01

The plasmodium of slime mold Physarum polycephalum behaves as an amorphous reaction-diffusion computing substrate and is capable of apparently 'intelligent' behavior. But how does intelligence emerge in an acellular organism? Through a range of laboratory experiments, we visualize the plasmodial cytoskeleton-a ubiquitous cellular protein scaffold whose functions are manifold and essential to life-and discuss its putative role as a network for transducing, transmitting and structuring data streams within the plasmodium. Through a range of computer modeling techniques, we demonstrate how emergent behavior, and hence computational intelligence, may occur in cytoskeletal communications networks. Specifically, we model the topology of both the actin and tubulin cytoskeletal networks and discuss how computation may occur therein. Furthermore, we present bespoke cellular automata and particle swarm models for the computational process within the cytoskeleton and observe the incidence of emergent patterns in both. Our work grants unique insight into the origins of natural intelligence; the results presented here are therefore readily transferable to the fields of natural computation, cell biology and biomedical science. We conclude by discussing how our results may alter our biological, computational and philosophical understanding of intelligence and consciousness.

Cutting Pattern Identification for Coal Mining Shearer through a Swarm Intelligence–Based Variable Translation Wavelet Neural Network

PubMed Central

Xu, Jing; Wang, Zhongbin; Tan, Chao; Liu, Xinhua

2018-01-01

As a sound signal has the advantages of non-contacted measurement, compact structure, and low power consumption, it has resulted in much attention in many fields. In this paper, the sound signal of the coal mining shearer is analyzed to realize the accurate online cutting pattern identification and guarantee the safety quality of the working face. The original acoustic signal is first collected through an industrial microphone and decomposed by adaptive ensemble empirical mode decomposition (EEMD). A 13-dimensional set composed by the normalized energy of each level is extracted as the feature vector in the next step. Then, a swarm intelligence optimization algorithm inspired by bat foraging behavior is applied to determine key parameters of the traditional variable translation wavelet neural network (VTWNN). Moreover, a disturbance coefficient is introduced into the basic bat algorithm (BA) to overcome the disadvantage of easily falling into local extremum and limited exploration ability. The VTWNN optimized by the modified BA (VTWNN-MBA) is used as the cutting pattern recognizer. Finally, a simulation example, with an accuracy of 95.25%, and a series of comparisons are conducted to prove the effectiveness and superiority of the proposed method. PMID:29382120

A New Hybrid BFOA-PSO Optimization Technique for Decoupling and Robust Control of Two-Coupled Distillation Column Process.

PubMed

Abdelkarim, Noha; Mohamed, Amr E; El-Garhy, Ahmed M; Dorrah, Hassen T

2016-01-01

The two-coupled distillation column process is a physically complicated system in many aspects. Specifically, the nested interrelationship between system inputs and outputs constitutes one of the significant challenges in system control design. Mostly, such a process is to be decoupled into several input/output pairings (loops), so that a single controller can be assigned for each loop. In the frame of this research, the Brain Emotional Learning Based Intelligent Controller (BELBIC) forms the control structure for each decoupled loop. The paper's main objective is to develop a parameterization technique for decoupling and control schemes, which ensures robust control behavior. In this regard, the novel optimization technique Bacterial Swarm Optimization (BSO) is utilized for the minimization of summation of the integral time-weighted squared errors (ITSEs) for all control loops. This optimization technique constitutes a hybrid between two techniques, which are the Particle Swarm and Bacterial Foraging algorithms. According to the simulation results, this hybridized technique ensures low mathematical burdens and high decoupling and control accuracy. Moreover, the behavior analysis of the proposed BELBIC shows a remarkable improvement in the time domain behavior and robustness over the conventional PID controller.

A novel swarm intelligence algorithm for finding DNA motifs.

PubMed

Lei, Chengwei; Ruan, Jianhua

2009-01-01

Discovering DNA motifs from co-expressed or co-regulated genes is an important step towards deciphering complex gene regulatory networks and understanding gene functions. Despite significant improvement in the last decade, it still remains one of the most challenging problems in computational molecular biology. In this work, we propose a novel motif finding algorithm that finds consensus patterns using a population-based stochastic optimisation technique called Particle Swarm Optimisation (PSO), which has been shown to be effective in optimising difficult multidimensional problems in continuous domains. We propose to use a word dissimilarity graph to remap the neighborhood structure of the solution space of DNA motifs, and propose a modification of the naive PSO algorithm to accommodate discrete variables. In order to improve efficiency, we also propose several strategies for escaping from local optima and for automatically determining the termination criteria. Experimental results on simulated challenge problems show that our method is both more efficient and more accurate than several existing algorithms. Applications to several sets of real promoter sequences also show that our approach is able to detect known transcription factor binding sites, and outperforms two of the most popular existing algorithms.

Dissolved oxygen content prediction in crab culture using a hybrid intelligent method

PubMed Central

Yu, Huihui; Chen, Yingyi; Hassan, ShahbazGul; Li, Daoliang

2016-01-01

A precise predictive model is needed to obtain a clear understanding of the changing dissolved oxygen content in outdoor crab ponds, to assess how to reduce risk and to optimize water quality management. The uncertainties in the data from multiple sensors are a significant factor when building a dissolved oxygen content prediction model. To increase prediction accuracy, a new hybrid dissolved oxygen content forecasting model based on the radial basis function neural networks (RBFNN) data fusion method and a least squares support vector machine (LSSVM) with an optimal improved particle swarm optimization(IPSO) is developed. In the modelling process, the RBFNN data fusion method is used to improve information accuracy and provide more trustworthy training samples for the IPSO-LSSVM prediction model. The LSSVM is a powerful tool for achieving nonlinear dissolved oxygen content forecasting. In addition, an improved particle swarm optimization algorithm is developed to determine the optimal parameters for the LSSVM with high accuracy and generalizability. In this study, the comparison of the prediction results of different traditional models validates the effectiveness and accuracy of the proposed hybrid RBFNN-IPSO-LSSVM model for dissolved oxygen content prediction in outdoor crab ponds. PMID:27270206

Dissolved oxygen content prediction in crab culture using a hybrid intelligent method.

PubMed

Yu, Huihui; Chen, Yingyi; Hassan, ShahbazGul; Li, Daoliang

2016-06-08

A precise predictive model is needed to obtain a clear understanding of the changing dissolved oxygen content in outdoor crab ponds, to assess how to reduce risk and to optimize water quality management. The uncertainties in the data from multiple sensors are a significant factor when building a dissolved oxygen content prediction model. To increase prediction accuracy, a new hybrid dissolved oxygen content forecasting model based on the radial basis function neural networks (RBFNN) data fusion method and a least squares support vector machine (LSSVM) with an optimal improved particle swarm optimization(IPSO) is developed. In the modelling process, the RBFNN data fusion method is used to improve information accuracy and provide more trustworthy training samples for the IPSO-LSSVM prediction model. The LSSVM is a powerful tool for achieving nonlinear dissolved oxygen content forecasting. In addition, an improved particle swarm optimization algorithm is developed to determine the optimal parameters for the LSSVM with high accuracy and generalizability. In this study, the comparison of the prediction results of different traditional models validates the effectiveness and accuracy of the proposed hybrid RBFNN-IPSO-LSSVM model for dissolved oxygen content prediction in outdoor crab ponds.

Discrete particle swarm optimization for identifying community structures in signed social networks.

PubMed

Cai, Qing; Gong, Maoguo; Shen, Bo; Ma, Lijia; Jiao, Licheng

2014-10-01

Modern science of networks has facilitated us with enormous convenience to the understanding of complex systems. Community structure is believed to be one of the notable features of complex networks representing real complicated systems. Very often, uncovering community structures in networks can be regarded as an optimization problem, thus, many evolutionary algorithms based approaches have been put forward. Particle swarm optimization (PSO) is an artificial intelligent algorithm originated from social behavior such as birds flocking and fish schooling. PSO has been proved to be an effective optimization technique. However, PSO was originally designed for continuous optimization which confounds its applications to discrete contexts. In this paper, a novel discrete PSO algorithm is suggested for identifying community structures in signed networks. In the suggested method, particles' status has been redesigned in discrete form so as to make PSO proper for discrete scenarios, and particles' updating rules have been reformulated by making use of the topology of the signed network. Extensive experiments compared with three state-of-the-art approaches on both synthetic and real-world signed networks demonstrate that the proposed method is effective and promising. Copyright © 2014 Elsevier Ltd. All rights reserved.

Comparative Analysis of Neural Network Training Methods in Real-time Radiotherapy.

PubMed

Nouri, S; Hosseini Pooya, S M; Soltani Nabipour, J

2017-03-01

The motions of body and tumor in some regions such as chest during radiotherapy treatments are one of the major concerns protecting normal tissues against high doses. By using real-time radiotherapy technique, it is possible to increase the accuracy of delivered dose to the tumor region by means of tracing markers on the body of patients. This study evaluates the accuracy of some artificial intelligence methods including neural network and those of combination with genetic algorithm as well as particle swarm optimization (PSO) estimating tumor positions in real-time radiotherapy. One hundred recorded signals of three external markers were used as input data. The signals from 3 markers thorough 10 breathing cycles of a patient treated via a cyber-knife for a lung tumor were used as data input. Then, neural network method and its combination with genetic or PSO algorithms were applied determining the tumor locations using MATLAB© software program. The accuracies were obtained 0.8%, 12% and 14% in neural network, genetic and particle swarm optimization algorithms, respectively. The internal target volume (ITV) should be determined based on the applied neural network algorithm on training steps.

A New Hybrid BFOA-PSO Optimization Technique for Decoupling and Robust Control of Two-Coupled Distillation Column Process

PubMed Central

Mohamed, Amr E.; Dorrah, Hassen T.

2016-01-01

The two-coupled distillation column process is a physically complicated system in many aspects. Specifically, the nested interrelationship between system inputs and outputs constitutes one of the significant challenges in system control design. Mostly, such a process is to be decoupled into several input/output pairings (loops), so that a single controller can be assigned for each loop. In the frame of this research, the Brain Emotional Learning Based Intelligent Controller (BELBIC) forms the control structure for each decoupled loop. The paper's main objective is to develop a parameterization technique for decoupling and control schemes, which ensures robust control behavior. In this regard, the novel optimization technique Bacterial Swarm Optimization (BSO) is utilized for the minimization of summation of the integral time-weighted squared errors (ITSEs) for all control loops. This optimization technique constitutes a hybrid between two techniques, which are the Particle Swarm and Bacterial Foraging algorithms. According to the simulation results, this hybridized technique ensures low mathematical burdens and high decoupling and control accuracy. Moreover, the behavior analysis of the proposed BELBIC shows a remarkable improvement in the time domain behavior and robustness over the conventional PID controller. PMID:27807444

Determination of optimal parameters for dual-layer cathode of polymer electrolyte fuel cell using computational intelligence-aided design.

PubMed

Chen, Yi; Huang, Weina; Peng, Bei

2014-01-01

Because of the demands for sustainable and renewable energy, fuel cells have become increasingly popular, particularly the polymer electrolyte fuel cell (PEFC). Among the various components, the cathode plays a key role in the operation of a PEFC. In this study, a quantitative dual-layer cathode model was proposed for determining the optimal parameters that minimize the over-potential difference η and improve the efficiency using a newly developed bat swarm algorithm with a variable population embedded in the computational intelligence-aided design. The simulation results were in agreement with previously reported results, suggesting that the proposed technique has potential applications for automating and optimizing the design of PEFCs.

Self Organized Sorting in Swarms

NASA Astrophysics Data System (ADS)

Copenhagen, Katherine; Quint, David; Gopinathan, Ajay

2014-03-01

Swarming behavior extends across multiple length scales in biology ranging from bacteria to whales. Natural swarms are affected by erratic, or dissenting behavior by individuals within the swarm who may display different types of behaviors than the rest of the swarm. This research investigates the introduction of heterogenous behavior amongst individuals within a swarm and their impact on swarm formation and robustness. We model swarms with a finite number of agents utilizing a velocity alignment interaction and a Lennard-Jones potential, which provides both cohesive and repulsive interactions between neighboring agents. Depending on the parameters governing the swarming interactions and the level of heterogeneity in behavior introduced, we found a variety of collective behavior including sharp transitions from swarming to non-swarming regimes and self organized sorting of individuals based on their types of behavior. Our research sheds light on the varied responses of swarms to internal dissent and suggests optimal strategies to tolerate errant individuals.

Command at the Edge of Chaos

DTIC Science & Technology

2007-05-10

originated from observations of social insects such as ants, bees and termites . See Fleischer’s “Foundations of Swarm Intelligence.” 7 In a...forms. For an insect colony, it might be an environment that will allow the placement and collection of pheromones ,24 while for organizations involved...22 Clippinger, "Human Nature and Social Networks." 23 Ibid. 24 A pheromone is a biochemical secreted by an animal

Foundations of Swarm Intelligence: From Principles to Practice

DTIC Science & Technology

2003-01-01

through the use of chemical substances known as pheromones which have a scent that decays over time through the process of evaporation [6, p. 26...These pheromones form the basis of what amounts to a clever, and apparently simple, communications and information storage and retrieval system. Since... pheromone strength or intensity decays over time, it also provides a very simple information processing mechanism that can implement forms of positive

Materials Discovery via CALYPSO Methodology

NASA Astrophysics Data System (ADS)

Ma, Yanming

2014-03-01

Materials design has been the subject of topical interests in materials and physical sciences for long. Atomistic structures of materials occupy a central and often critical role, when establishing a correspondence between materials performance and their basic compositions. Theoretical prediction of atomistic structures of materials with the only given information of chemical compositions becomes crucially important, but it is extremely difficult as it basically involves in classifying a huge number of energy minima on the lattice energy surface. To tackle the problems, we have developed an efficient CALYPSO (Crystal structural AnLYsis by Particle Swarm Optimization) approach for structure prediction from scratch based on particle swarm optimization algorithm by taking the advantage of swarm intelligence and the spirit of structures smart learning. The method has been coded into CALYPSO software (http://www.calypso.cn) which is free for academic use. Currently, CALYPSO method is able to predict structures of three-dimensional crystals, isolated clusters or molecules, surface reconstructions, and two-dimensional layers. The applications of CALYPSO into purposed materials design of layered materials, high-pressure superconductors, and superhard materials were successfully made. Our design of superhard materials introduced a useful scheme, where the hardness value has been employed as the fitness function. This strategy might also be applicable into design of materials with other desired functional properties (e.g., thermoelectric figure of merit, topological Z2 number, etc.). For such a structural design, a well-understood structure to property formulation is required, by which functional properties of materials can be easily acquired at given structures. An emergent application is seen on design of photocatalyst materials.

Intelligent system design for bionanorobots in drug delivery.

PubMed

Fletcher, Mark; Biglarbegian, Mohammad; Neethirajan, Suresh

A nanorobot is defined as any smart structure which is capable of actuation, sensing, manipulation, intelligence, and swarm behavior at the nanoscale. In this study, we designed an intelligent system using fuzzy logic for diagnosis and treatment of tumors inside the human body using bionanorobots. We utilize fuzzy logic and a combination of thermal, magnetic, optical, and chemical nanosensors to interpret the uncertainty associated with the sensory information. Two different fuzzy logic structures, for diagnosis (Mamdani structure) and for cure (Takagi-Sugeno structure), were developed to efficiently identify the tumors and treat them through delivery of effective dosages of a drug. Validation of the designed system with simulated conditions proved that the drug delivery of bionanorobots was robust to reasonable noise that may occur in the bionanorobot sensors during navigation, diagnosis, and curing of the cancer cells. Bionanorobots represent a great hope for successful cancer therapy in the near future.

An intelligent service matching method for mechanical equipment condition monitoring using the fibre Bragg grating sensor network

NASA Astrophysics Data System (ADS)

Zhang, Fan; Zhou, Zude; Liu, Quan; Xu, Wenjun

2017-02-01

Due to the advantages of being able to function under harsh environmental conditions and serving as a distributed condition information source in a networked monitoring system, the fibre Bragg grating (FBG) sensor network has attracted considerable attention for equipment online condition monitoring. To provide an overall conditional view of the mechanical equipment operation, a networked service-oriented condition monitoring framework based on FBG sensing is proposed, together with an intelligent matching method for supporting monitoring service management. In the novel framework, three classes of progressive service matching approaches, including service-chain knowledge database service matching, multi-objective constrained service matching and workflow-driven human-interactive service matching, are developed and integrated with an enhanced particle swarm optimisation (PSO) algorithm as well as a workflow-driven mechanism. Moreover, the manufacturing domain ontology, FBG sensor network structure and monitoring object are considered to facilitate the automatic matching of condition monitoring services to overcome the limitations of traditional service processing methods. The experimental results demonstrate that FBG monitoring services can be selected intelligently, and the developed condition monitoring system can be re-built rapidly as new equipment joins the framework. The effectiveness of the service matching method is also verified by implementing a prototype system together with its performance analysis.

Chaotic particle swarm optimization with mutation for classification.

PubMed

Assarzadeh, Zahra; Naghsh-Nilchi, Ahmad Reza

2015-01-01

In this paper, a chaotic particle swarm optimization with mutation-based classifier particle swarm optimization is proposed to classify patterns of different classes in the feature space. The introduced mutation operators and chaotic sequences allows us to overcome the problem of early convergence into a local minima associated with particle swarm optimization algorithms. That is, the mutation operator sharpens the convergence and it tunes the best possible solution. Furthermore, to remove the irrelevant data and reduce the dimensionality of medical datasets, a feature selection approach using binary version of the proposed particle swarm optimization is introduced. In order to demonstrate the effectiveness of our proposed classifier, mutation-based classifier particle swarm optimization, it is checked out with three sets of data classifications namely, Wisconsin diagnostic breast cancer, Wisconsin breast cancer and heart-statlog, with different feature vector dimensions. The proposed algorithm is compared with different classifier algorithms including k-nearest neighbor, as a conventional classifier, particle swarm-classifier, genetic algorithm, and Imperialist competitive algorithm-classifier, as more sophisticated ones. The performance of each classifier was evaluated by calculating the accuracy, sensitivity, specificity and Matthews's correlation coefficient. The experimental results show that the mutation-based classifier particle swarm optimization unequivocally performs better than all the compared algorithms.

An enhancement of binary particle swarm optimization for gene selection in classifying cancer classes

PubMed Central

2013-01-01

Background Gene expression data could likely be a momentous help in the progress of proficient cancer diagnoses and classification platforms. Lately, many researchers analyze gene expression data using diverse computational intelligence methods, for selecting a small subset of informative genes from the data for cancer classification. Many computational methods face difficulties in selecting small subsets due to the small number of samples compared to the huge number of genes (high-dimension), irrelevant genes, and noisy genes. Methods We propose an enhanced binary particle swarm optimization to perform the selection of small subsets of informative genes which is significant for cancer classification. Particle speed, rule, and modified sigmoid function are introduced in this proposed method to increase the probability of the bits in a particle’s position to be zero. The method was empirically applied to a suite of ten well-known benchmark gene expression data sets. Results The performance of the proposed method proved to be superior to other previous related works, including the conventional version of binary particle swarm optimization (BPSO) in terms of classification accuracy and the number of selected genes. The proposed method also requires lower computational time compared to BPSO. PMID:23617960

Trust Management in Swarm-Based Autonomic Computing Systems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Maiden, Wendy M.; Haack, Jereme N.; Fink, Glenn A.

2009-07-07

Reputation-based trust management techniques can address issues such as insider threat as well as quality of service issues that may be malicious in nature. However, trust management techniques must be adapted to the unique needs of the architectures and problem domains to which they are applied. Certain characteristics of swarms such as their lightweight ephemeral nature and indirect communication make this adaptation especially challenging. In this paper we look at the trust issues and opportunities in mobile agent swarm-based autonomic systems and find that by monitoring the trustworthiness of the autonomic managers rather than the swarming sensors, the trust managementmore » problem becomes much more scalable and still serves to protect the swarms. We also analyze the applicability of trust management research as it has been applied to architectures with similar characteristics. Finally, we specify required characteristics for trust management mechanisms to be used to monitor the trustworthiness of the entities in a swarm-based autonomic computing system.« less

The influence of swarm deformation on the velocity behavior of falling swarms of particles

NASA Astrophysics Data System (ADS)

Mitchell, C. A.; Pyrak-Nolte, L. J.; Nitsche, L.

2017-12-01

Cohesive particle swarms have been shown to exhibit enhanced sedimentation in fractures for an optimal range of fracture apertures. Within this range, swarms travel farther and faster than a disperse (particulate) solution. This study aims to uncover the physics underlying the enhanced sedimentation. Swarm behavior at low Reynolds number in a quiescent unbounded fluid and between smooth rigid planar boundaries is investigated numerically using direct-summation, particle-mesh (PM) and particle-particle particle-mesh (P3M) methods - based upon mutually interacting viscous point forces (Stokeslet fields). Wall effects are treated with a least-squares boundary singularity method. Sub-structural effects beyond pseudo-liquid behavior (i.e., particle-scale interactions) are approximated by the P3M method much more efficiently than with direct summation. The model parameters are selected from particle swarm experiments to enable comparison. From the simulations, if the initial swarm geometry at release is unaffected by the fracture aperture, no enhanced transport occurs. The swarm velocity as a function of apertures increases monotonically until it asymptotes to the swarm velocity in an open tank. However, if the fracture aperture affects the initial swarm geometry, the swarm velocity no longer exhibits a monotonic behavior. When swarms are released between two parallel smooth walls with very small apertures, the swarm is forced to reorganize and quickly deform, which results in dramatically reduced swarm velocities. At large apertures, the swarm evolution is similar to that of a swarm in open tank and quickly flattens into a slow speed torus. In the optimal aperture range, the swarm maintains a cohesive unit behaving similarly to a falling sphere. Swarms falling in apertures less than or greater than the optimal aperture range, experience a level of anisotropy that considerably decreases velocities. Unraveling the physics that drives swarm behavior in fractured porous media is important for understanding particle sedimentation and contaminant spreading in the subsurface. Acknowledgment: This material is based upon work supported by the U.S. Department of Energy, Office of Science, Office of Basic Energy Sciences, Geosciences Research Program under Award Number (DE-FG02-09ER16022).

Big Data: A Parallel Particle Swarm Optimization-Back-Propagation Neural Network Algorithm Based on MapReduce.

PubMed

Cao, Jianfang; Cui, Hongyan; Shi, Hao; Jiao, Lijuan

2016-01-01

A back-propagation (BP) neural network can solve complicated random nonlinear mapping problems; therefore, it can be applied to a wide range of problems. However, as the sample size increases, the time required to train BP neural networks becomes lengthy. Moreover, the classification accuracy decreases as well. To improve the classification accuracy and runtime efficiency of the BP neural network algorithm, we proposed a parallel design and realization method for a particle swarm optimization (PSO)-optimized BP neural network based on MapReduce on the Hadoop platform using both the PSO algorithm and a parallel design. The PSO algorithm was used to optimize the BP neural network's initial weights and thresholds and improve the accuracy of the classification algorithm. The MapReduce parallel programming model was utilized to achieve parallel processing of the BP algorithm, thereby solving the problems of hardware and communication overhead when the BP neural network addresses big data. Datasets on 5 different scales were constructed using the scene image library from the SUN Database. The classification accuracy of the parallel PSO-BP neural network algorithm is approximately 92%, and the system efficiency is approximately 0.85, which presents obvious advantages when processing big data. The algorithm proposed in this study demonstrated both higher classification accuracy and improved time efficiency, which represents a significant improvement obtained from applying parallel processing to an intelligent algorithm on big data.

Self-deployable mobile sensor networks for on-demand surveillance

NASA Astrophysics Data System (ADS)

Miao, Lidan; Qi, Hairong; Wang, Feiyi

2005-05-01

This paper studies two interconnected problems in mobile sensor network deployment, the optimal placement of heterogeneous mobile sensor platforms for cost-efficient and reliable coverage purposes, and the self-organizable deployment. We first develop an optimal placement algorithm based on a "mosaicked technology" such that different types of mobile sensors form a mosaicked pattern uniquely determined by the popularity of different types of sensor nodes. The initial state is assumed to be random. In order to converge to the optimal state, we investigate the swarm intelligence (SI)-based sensor movement strategy, through which the randomly deployed sensors can self-organize themselves to reach the optimal placement state. The proposed algorithm is compared with the random movement and the centralized method using performance metrics such as network coverage, convergence time, and energy consumption. Simulation results are presented to demonstrate the effectiveness of the mosaic placement and the SI-based movement.

Particle Swarm Optimization with Double Learning Patterns.

PubMed

Shen, Yuanxia; Wei, Linna; Zeng, Chuanhua; Chen, Jian

2016-01-01

Particle Swarm Optimization (PSO) is an effective tool in solving optimization problems. However, PSO usually suffers from the premature convergence due to the quick losing of the swarm diversity. In this paper, we first analyze the motion behavior of the swarm based on the probability characteristic of learning parameters. Then a PSO with double learning patterns (PSO-DLP) is developed, which employs the master swarm and the slave swarm with different learning patterns to achieve a trade-off between the convergence speed and the swarm diversity. The particles in the master swarm and the slave swarm are encouraged to explore search for keeping the swarm diversity and to learn from the global best particle for refining a promising solution, respectively. When the evolutionary states of two swarms interact, an interaction mechanism is enabled. This mechanism can help the slave swarm in jumping out of the local optima and improve the convergence precision of the master swarm. The proposed PSO-DLP is evaluated on 20 benchmark functions, including rotated multimodal and complex shifted problems. The simulation results and statistical analysis show that PSO-DLP obtains a promising performance and outperforms eight PSO variants.

Decentralized automatic generation control of interconnected power systems incorporating asynchronous tie-lines.

PubMed

Ibraheem; Hasan, Naimul; Hussein, Arkan Ahmed

2014-01-01

This Paper presents the design of decentralized automatic generation controller for an interconnected power system using PID, Genetic Algorithm (GA) and Particle Swarm Optimization (PSO). The designed controllers are tested on identical two-area interconnected power systems consisting of thermal power plants. The area interconnections between two areas are considered as (i) AC tie-line only (ii) Asynchronous tie-line. The dynamic response analysis is carried out for 1% load perturbation. The performance of the intelligent controllers based on GA and PSO has been compared with the conventional PID controller. The investigations of the system dynamic responses reveal that PSO has the better dynamic response result as compared with PID and GA controller for both type of area interconnection.

Firefly algorithm versus genetic algorithm as powerful variable selection tools and their effect on different multivariate calibration models in spectroscopy: A comparative study

NASA Astrophysics Data System (ADS)

Attia, Khalid A. M.; Nassar, Mohammed W. I.; El-Zeiny, Mohamed B.; Serag, Ahmed

2017-01-01

For the first time, a new variable selection method based on swarm intelligence namely firefly algorithm is coupled with three different multivariate calibration models namely, concentration residual augmented classical least squares, artificial neural network and support vector regression in UV spectral data. A comparative study between the firefly algorithm and the well-known genetic algorithm was developed. The discussion revealed the superiority of using this new powerful algorithm over the well-known genetic algorithm. Moreover, different statistical tests were performed and no significant differences were found between all the models regarding their predictabilities. This ensures that simpler and faster models were obtained without any deterioration of the quality of the calibration.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhu, Li; Fuhrer, Tobias; Schaefer, Bastian

Measuring similarities/dissimilarities between atomic structures is important for the exploration of potential energy landscapes. However, the cell vectors together with the coordinates of the atoms, which are generally used to describe periodic systems, are quantities not directly suitable as fingerprints to distinguish structures. Based on a characterization of the local environment of all atoms in a cell, we introduce crystal fingerprints that can be calculated easily and define configurational distances between crystalline structures that satisfy the mathematical properties of a metric. This distance between two configurations is a measure of their similarity/dissimilarity and it allows in particular to distinguish structures.more » The new method can be a useful tool within various energy landscape exploration schemes, such as minima hopping, random search, swarm intelligence algorithms, and high-throughput screenings.« less

Next Generation System and Software Architectures: Challenges from Future NASA Exploration Missions

NASA Technical Reports Server (NTRS)

Sterritt, Roy; Rouff, Christopher A.; Hinchey, Michael G.; Rash, James L.; Truszkowski, Walt

2006-01-01

The four key objective properties of a system that are required of it in order for it to qualify as "autonomic" are now well-accepted-self-configuring, self-healing, self-protecting, and self-optimizing- together with the attribute properties-viz. self-aware, environment-aware, self-monitoring and self- adjusting. This paper describes the need for next generation system software architectures, where components are agents, rather than objects masquerading as agents, and where support is provided for self-* properties (both existing self-chop and emerging self-* properties). These are discussed as exhibited in NASA missions, and in particular with reference to a NASA concept mission, ANTS, which is illustrative of future NASA exploration missions based on the technology of intelligent swarms.

Analysis of swarm behaviors based on an inversion of the fluctuation theorem.

PubMed

Hamann, Heiko; Schmickl, Thomas; Crailsheim, Karl

2014-01-01

A grand challenge in the field of artificial life is to find a general theory of emergent self-organizing systems. In swarm systems most of the observed complexity is based on motion of simple entities. Similarly, statistical mechanics focuses on collective properties induced by the motion of many interacting particles. In this article we apply methods from statistical mechanics to swarm systems. We try to explain the emergent behavior of a simulated swarm by applying methods based on the fluctuation theorem. Empirical results indicate that swarms are able to produce negative entropy within an isolated subsystem due to frozen accidents. Individuals of a swarm are able to locally detect fluctuations of the global entropy measure and store them, if they are negative entropy productions. By accumulating these stored fluctuations over time the swarm as a whole is producing negative entropy and the system ends up in an ordered state. We claim that this indicates the existence of an inverted fluctuation theorem for emergent self-organizing dissipative systems. This approach bears the potential of general applicability.

Unsupervised learning in persistent sensing for target recognition by wireless ad hoc networks of ground-based sensors

NASA Astrophysics Data System (ADS)

Hortos, William S.

2008-04-01

In previous work by the author, effective persistent and pervasive sensing for recognition and tracking of battlefield targets were seen to be achieved, using intelligent algorithms implemented by distributed mobile agents over a composite system of unmanned aerial vehicles (UAVs) for persistence and a wireless network of unattended ground sensors for pervasive coverage of the mission environment. While simulated performance results for the supervised algorithms of the composite system are shown to provide satisfactory target recognition over relatively brief periods of system operation, this performance can degrade by as much as 50% as target dynamics in the environment evolve beyond the period of system operation in which the training data are representative. To overcome this limitation, this paper applies the distributed approach using mobile agents to the network of ground-based wireless sensors alone, without the UAV subsystem, to provide persistent as well as pervasive sensing for target recognition and tracking. The supervised algorithms used in the earlier work are supplanted by unsupervised routines, including competitive-learning neural networks (CLNNs) and new versions of support vector machines (SVMs) for characterization of an unknown target environment. To capture the same physical phenomena from battlefield targets as the composite system, the suite of ground-based sensors can be expanded to include imaging and video capabilities. The spatial density of deployed sensor nodes is increased to allow more precise ground-based location and tracking of detected targets by active nodes. The "swarm" mobile agents enabling WSN intelligence are organized in a three processing stages: detection, recognition and sustained tracking of ground targets. Features formed from the compressed sensor data are down-selected according to an information-theoretic algorithm that reduces redundancy within the feature set, reducing the dimension of samples used in the target recognition and tracking routines. Target tracking is based on simplified versions of Kalman filtration. Accuracy of recognition and tracking of implemented versions of the proposed suite of unsupervised algorithms is somewhat degraded from the ideal. Target recognition and tracking by supervised routines and by unsupervised SVM and CLNN routines in the ground-based WSN is evaluated in simulations using published system values and sensor data from vehicular targets in ground-surveillance scenarios. Results are compared with previously published performance for the system of the ground-based sensor network (GSN) and UAV swarm.

Autonomous and Autonomic Swarms

NASA Technical Reports Server (NTRS)

Hinchey, Michael G.; Rash, James L.; Truszkowski, Walter F.; Rouff, Christopher A.; Sterritt, Roy

2005-01-01

A watershed in systems engineering is represented by the advent of swarm-based systems that accomplish missions through cooperative action by a (large) group of autonomous individuals each having simple capabilities and no global knowledge of the group s objective. Such systems, with individuals capable of surviving in hostile environments, pose unprecedented challenges to system developers. Design and testing and verification at much higher levels will be required, together with the corresponding tools, to bring such systems to fruition. Concepts for possible future NASA space exploration missions include autonomous, autonomic swarms. Engineering swarm-based missions begins with understanding autonomy and autonomicity and how to design, test, and verify systems that have those properties and, simultaneously, the capability to accomplish prescribed mission goals. Formal methods-based technologies, both projected and in development, are described in terms of their potential utility to swarm-based system developers.

On the role of the plasmodial cytoskeleton in facilitating intelligent behavior in slime mold Physarum polycephalum

PubMed Central

Mayne, Richard; Adamatzky, Andrew; Jones, Jeff

2015-01-01

The plasmodium of slime mold Physarum polycephalum behaves as an amorphous reaction-diffusion computing substrate and is capable of apparently ‘intelligent’ behavior. But how does intelligence emerge in an acellular organism? Through a range of laboratory experiments, we visualize the plasmodial cytoskeleton—a ubiquitous cellular protein scaffold whose functions are manifold and essential to life—and discuss its putative role as a network for transducing, transmitting and structuring data streams within the plasmodium. Through a range of computer modeling techniques, we demonstrate how emergent behavior, and hence computational intelligence, may occur in cytoskeletal communications networks. Specifically, we model the topology of both the actin and tubulin cytoskeletal networks and discuss how computation may occur therein. Furthermore, we present bespoke cellular automata and particle swarm models for the computational process within the cytoskeleton and observe the incidence of emergent patterns in both. Our work grants unique insight into the origins of natural intelligence; the results presented here are therefore readily transferable to the fields of natural computation, cell biology and biomedical science. We conclude by discussing how our results may alter our biological, computational and philosophical understanding of intelligence and consciousness. PMID:26478782

Long-term prospects: Mitigation of supernova and gamma-ray burst threat to intelligent beings

NASA Astrophysics Data System (ADS)

Ćirković, Milan M.; Vukotić, Branislav

2016-12-01

We consider global catastrophic risks due to cosmic explosions (supernovae, magnetars and gamma-ray bursts) and possible mitigation strategies by humans and other hypothetical intelligent beings. While by their very nature these events are so huge to daunt conventional thinking on mitigation and response, we wish to argue that advanced technological civilizations would be able to develop efficient responses in the domain of astroengineering within their home planetary systems. In particular, we suggest that construction of shielding swarms of small objects/particles confined by electromagnetic fields could be one way of mitigating the risk of cosmic explosions and corresponding ionizing radiation surges. Such feats of astroengineering could, in principle, be detectable from afar by advanced Dysonian SETI searches.

Determination of Optimal Parameters for Dual-Layer Cathode of Polymer Electrolyte Fuel Cell Using Computational Intelligence-Aided Design

PubMed Central

Chen, Yi; Huang, Weina; Peng, Bei

2014-01-01

Because of the demands for sustainable and renewable energy, fuel cells have become increasingly popular, particularly the polymer electrolyte fuel cell (PEFC). Among the various components, the cathode plays a key role in the operation of a PEFC. In this study, a quantitative dual-layer cathode model was proposed for determining the optimal parameters that minimize the over-potential difference and improve the efficiency using a newly developed bat swarm algorithm with a variable population embedded in the computational intelligence-aided design. The simulation results were in agreement with previously reported results, suggesting that the proposed technique has potential applications for automating and optimizing the design of PEFCs. PMID:25490761

New Dandelion Algorithm Optimizes Extreme Learning Machine for Biomedical Classification Problems

PubMed Central

Li, Xiguang; Zhao, Liang; Gong, Changqing; Liu, Xiaojing

2017-01-01

Inspired by the behavior of dandelion sowing, a new novel swarm intelligence algorithm, namely, dandelion algorithm (DA), is proposed for global optimization of complex functions in this paper. In DA, the dandelion population will be divided into two subpopulations, and different subpopulations will undergo different sowing behaviors. Moreover, another sowing method is designed to jump out of local optimum. In order to demonstrate the validation of DA, we compare the proposed algorithm with other existing algorithms, including bat algorithm, particle swarm optimization, and enhanced fireworks algorithm. Simulations show that the proposed algorithm seems much superior to other algorithms. At the same time, the proposed algorithm can be applied to optimize extreme learning machine (ELM) for biomedical classification problems, and the effect is considerable. At last, we use different fusion methods to form different fusion classifiers, and the fusion classifiers can achieve higher accuracy and better stability to some extent. PMID:29085425

Game theoretic wireless resource allocation for H.264 MGS video transmission over cognitive radio networks

NASA Astrophysics Data System (ADS)

Fragkoulis, Alexandros; Kondi, Lisimachos P.; Parsopoulos, Konstantinos E.

2015-03-01

We propose a method for the fair and efficient allocation of wireless resources over a cognitive radio system network to transmit multiple scalable video streams to multiple users. The method exploits the dynamic architecture of the Scalable Video Coding extension of the H.264 standard, along with the diversity that OFDMA networks provide. We use a game-theoretic Nash Bargaining Solution (NBS) framework to ensure that each user receives the minimum video quality requirements, while maintaining fairness over the cognitive radio system. An optimization problem is formulated, where the objective is the maximization of the Nash product while minimizing the waste of resources. The problem is solved by using a Swarm Intelligence optimizer, namely Particle Swarm Optimization. Due to the high dimensionality of the problem, we also introduce a dimension-reduction technique. Our experimental results demonstrate the fairness imposed by the employed NBS framework.

Global Consensus Theorem and Self-Organized Criticality: Unifying Principles for Understanding Self-Organization, Swarm Intelligence and Mechanisms of Carcinogenesis

PubMed Central

Rosenfeld, Simon

2013-01-01

Complex biological systems manifest a large variety of emergent phenomena among which prominent roles belong to self-organization and swarm intelligence. Generally, each level in a biological hierarchy possesses its own systemic properties and requires its own way of observation, conceptualization, and modeling. In this work, an attempt is made to outline general guiding principles in exploration of a wide range of seemingly dissimilar phenomena observed in large communities of individuals devoid of any personal intelligence and interacting with each other through simple stimulus-response rules. Mathematically, these guiding principles are well captured by the Global Consensus Theorem (GCT) equally applicable to neural networks and to Lotka-Volterra population dynamics. Universality of the mechanistic principles outlined by GCT allows for a unified approach to such diverse systems as biological networks, communities of social insects, robotic communities, microbial communities, communities of somatic cells, social networks and many other systems. Another cluster of universal laws governing the self-organization in large communities of locally interacting individuals is built around the principle of self-organized criticality (SOC). The GCT and SOC, separately or in combination, provide a conceptual basis for understanding the phenomena of self-organization occurring in large communities without involvement of a supervisory authority, without system-wide informational infrastructure, and without mapping of general plan of action onto cognitive/behavioral faculties of its individual members. Cancer onset and proliferation serves as an important example of application of these conceptual approaches. In this paper, the point of view is put forward that apparently irreconcilable contradictions between two opposing theories of carcinogenesis, that is, the Somatic Mutation Theory and the Tissue Organization Field Theory, may be resolved using the systemic approaches provided by GST and SOC. PMID:23471309

Chaotic Particle Swarm Optimization with Mutation for Classification

PubMed Central

Assarzadeh, Zahra; Naghsh-Nilchi, Ahmad Reza

2015-01-01

In this paper, a chaotic particle swarm optimization with mutation-based classifier particle swarm optimization is proposed to classify patterns of different classes in the feature space. The introduced mutation operators and chaotic sequences allows us to overcome the problem of early convergence into a local minima associated with particle swarm optimization algorithms. That is, the mutation operator sharpens the convergence and it tunes the best possible solution. Furthermore, to remove the irrelevant data and reduce the dimensionality of medical datasets, a feature selection approach using binary version of the proposed particle swarm optimization is introduced. In order to demonstrate the effectiveness of our proposed classifier, mutation-based classifier particle swarm optimization, it is checked out with three sets of data classifications namely, Wisconsin diagnostic breast cancer, Wisconsin breast cancer and heart-statlog, with different feature vector dimensions. The proposed algorithm is compared with different classifier algorithms including k-nearest neighbor, as a conventional classifier, particle swarm-classifier, genetic algorithm, and Imperialist competitive algorithm-classifier, as more sophisticated ones. The performance of each classifier was evaluated by calculating the accuracy, sensitivity, specificity and Matthews's correlation coefficient. The experimental results show that the mutation-based classifier particle swarm optimization unequivocally performs better than all the compared algorithms. PMID:25709937

Symbiosis-Based Alternative Learning Multi-Swarm Particle Swarm Optimization.

PubMed

Niu, Ben; Huang, Huali; Tan, Lijing; Duan, Qiqi

2017-01-01

Inspired by the ideas from the mutual cooperation of symbiosis in natural ecosystem, this paper proposes a new variant of PSO, named Symbiosis-based Alternative Learning Multi-swarm Particle Swarm Optimization (SALMPSO). A learning probability to select one exemplar out of the center positions, the local best position, and the historical best position including the experience of internal and external multiple swarms, is used to keep the diversity of the population. Two different levels of social interaction within and between multiple swarms are proposed. In the search process, particles not only exchange social experience with others that are from their own sub-swarms, but also are influenced by the experience of particles from other fellow sub-swarms. According to the different exemplars and learning strategy, this model is instantiated as four variants of SALMPSO and a set of 15 test functions are conducted to compare with some variants of PSO including 10, 30 and 50 dimensions, respectively. Experimental results demonstrate that the alternative learning strategy in each SALMPSO version can exhibit better performance in terms of the convergence speed and optimal values on most multimodal functions in our simulation.

Swarm formation control utilizing elliptical surfaces and limiting functions.

PubMed

Barnes, Laura E; Fields, Mary Anne; Valavanis, Kimon P

2009-12-01

In this paper, we present a strategy for organizing swarms of unmanned vehicles into a formation by utilizing artificial potential fields that were generated from normal and sigmoid functions. These functions construct the surface on which swarm members travel, controlling the overall swarm geometry and the individual member spacing. Nonlinear limiting functions are defined to provide tighter swarm control by modifying and adjusting a set of control variables that force the swarm to behave according to set constraints, formation, and member spacing. The artificial potential functions and limiting functions are combined to control swarm formation, orientation, and swarm movement as a whole. Parameters are chosen based on desired formation and user-defined constraints. This approach is computationally efficient and scales well to different swarm sizes, to heterogeneous systems, and to both centralized and decentralized swarm models. Simulation results are presented for a swarm of 10 and 40 robots that follow circle, ellipse, and wedge formations. Experimental results are included to demonstrate the applicability of the approach on a swarm of four custom-built unmanned ground vehicles (UGVs).

MO-FG-BRA-08: Swarm Intelligence-Based Personalized Respiratory Gating in Lung SAbR

DOE Office of Scientific and Technical Information (OSTI.GOV)

Modiri, A; Sabouri, P; Sawant, A

Purpose: Respiratory gating is widely deployed as a clinical motion-management strategy in lung radiotherapy. In conventional gating, the beam is turned on during a pre-determined phase window; typically, around end-exhalation. In this work, we challenge the notion that end-exhalation is always the optimal gating phase. Specifically, we use a swarm-intelligence-based, inverse planning approach to determine the optimal respiratory phase and MU for each beam with respect to (i) the state of the anatomy at each phase and (ii) the time spent in that state, estimated from long-term monitoring of the patient’s breathing motion. Methods: In a retrospective study of fivemore » lung cancer patients, we compared the dosimetric performance of our proposed personalized gating (PG) with that of conventional end-of-exhale gating (CEG) and a previously-developed, fully 4D-optimized plan (combined with MLC tracking delivery). For each patient, respiratory phase probabilities (indicative of the time duration of the phase) were estimated over 2 minutes from lung tumor motion traces recorded previously using the Synchrony system (Accuray Inc.). Based on this information, inverse planning optimization was performed to calculate the optimal respiratory gating phase and MU for each beam. To ensure practical deliverability, each PG beam was constrained to deliver the assigned MU over a time duration comparable to that of CEG delivery. Results: Maximum OAR sparing for the five patients achieved by the PG and the 4D plans compared to CEG plans was: Esophagus Dmax [PG:57%, 4D:37%], Heart Dmax [PG:71%, 4D:87%], Spinal cord Dmax [PG:18%, 4D:68%] and Lung V13 [PG:16%, 4D:31%]. While patients spent the most time in exhalation, the PG-optimization chose end-exhale only for 28% of beams. Conclusion: Our novel gating strategy achieved significant dosimetric improvements over conventional gating, and approached the upper limit represented by fully 4D optimized planning while being significantly simpler and more clinically translatable. This work was partially supported through research funding from National Institutes of Health (R01CA169102) and Varian Medical Systems, Palo Alto, CA, USA.« less

Do small swarms have an advantage when house hunting? The effect of swarm size on nest-site selection by Apis mellifera.

PubMed

Schaerf, T M; Makinson, J C; Myerscough, M R; Beekman, M

2013-10-06

Reproductive swarms of honeybees are faced with the problem of finding a good site to establish a new colony. We examined the potential effects of swarm size on the quality of nest-site choice through a combination of modelling and field experiments. We used an individual-based model to examine the effects of swarm size on decision accuracy under the assumption that the number of bees actively involved in the decision-making process (scouts) is an increasing function of swarm size. We found that the ability of a swarm to choose the best of two nest sites decreases as swarm size increases when there is some time-lag between discovering the sites, consistent with Janson & Beekman (Janson & Beekman 2007 Proceedings of European Conference on Complex Systems, pp. 204-211.). However, when simulated swarms were faced with a realistic problem of choosing between many nest sites discoverable at all times, larger swarms were more accurate in their decisions than smaller swarms owing to their ability to discover nest sites more rapidly. Our experimental fieldwork showed that large swarms invest a larger number of scouts into the decision-making process than smaller swarms. Preliminary analysis of waggle dances from experimental swarms also suggested that large swarms could indeed discover and advertise nest sites at a faster rate than small swarms.

Do small swarms have an advantage when house hunting? The effect of swarm size on nest-site selection by Apis mellifera

PubMed Central

Schaerf, T. M.; Makinson, J. C.; Myerscough, M. R.; Beekman, M.

2013-01-01

Reproductive swarms of honeybees are faced with the problem of finding a good site to establish a new colony. We examined the potential effects of swarm size on the quality of nest-site choice through a combination of modelling and field experiments. We used an individual-based model to examine the effects of swarm size on decision accuracy under the assumption that the number of bees actively involved in the decision-making process (scouts) is an increasing function of swarm size. We found that the ability of a swarm to choose the best of two nest sites decreases as swarm size increases when there is some time-lag between discovering the sites, consistent with Janson & Beekman (Janson & Beekman 2007 Proceedings of European Conference on Complex Systems, pp. 204–211.). However, when simulated swarms were faced with a realistic problem of choosing between many nest sites discoverable at all times, larger swarms were more accurate in their decisions than smaller swarms owing to their ability to discover nest sites more rapidly. Our experimental fieldwork showed that large swarms invest a larger number of scouts into the decision-making process than smaller swarms. Preliminary analysis of waggle dances from experimental swarms also suggested that large swarms could indeed discover and advertise nest sites at a faster rate than small swarms. PMID:23904590

Particle Swarm Optimization with Double Learning Patterns

PubMed Central

Shen, Yuanxia; Wei, Linna; Zeng, Chuanhua; Chen, Jian

2016-01-01

Particle Swarm Optimization (PSO) is an effective tool in solving optimization problems. However, PSO usually suffers from the premature convergence due to the quick losing of the swarm diversity. In this paper, we first analyze the motion behavior of the swarm based on the probability characteristic of learning parameters. Then a PSO with double learning patterns (PSO-DLP) is developed, which employs the master swarm and the slave swarm with different learning patterns to achieve a trade-off between the convergence speed and the swarm diversity. The particles in the master swarm and the slave swarm are encouraged to explore search for keeping the swarm diversity and to learn from the global best particle for refining a promising solution, respectively. When the evolutionary states of two swarms interact, an interaction mechanism is enabled. This mechanism can help the slave swarm in jumping out of the local optima and improve the convergence precision of the master swarm. The proposed PSO-DLP is evaluated on 20 benchmark functions, including rotated multimodal and complex shifted problems. The simulation results and statistical analysis show that PSO-DLP obtains a promising performance and outperforms eight PSO variants. PMID:26858747

DualTrust: A Trust Management Model for Swarm-Based Autonomic Computing Systems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Maiden, Wendy M.

Trust management techniques must be adapted to the unique needs of the application architectures and problem domains to which they are applied. For autonomic computing systems that utilize mobile agents and ant colony algorithms for their sensor layer, certain characteristics of the mobile agent ant swarm -- their lightweight, ephemeral nature and indirect communication -- make this adaptation especially challenging. This thesis looks at the trust issues and opportunities in swarm-based autonomic computing systems and finds that by monitoring the trustworthiness of the autonomic managers rather than the swarming sensors, the trust management problem becomes much more scalable and stillmore » serves to protect the swarm. After analyzing the applicability of trust management research as it has been applied to architectures with similar characteristics, this thesis specifies the required characteristics for trust management mechanisms used to monitor the trustworthiness of entities in a swarm-based autonomic computing system and describes a trust model that meets these requirements.« less

Social Emotional Optimization Algorithm for Nonlinear Constrained Optimization Problems

NASA Astrophysics Data System (ADS)

Xu, Yuechun; Cui, Zhihua; Zeng, Jianchao

Nonlinear programming problem is one important branch in operational research, and has been successfully applied to various real-life problems. In this paper, a new approach called Social emotional optimization algorithm (SEOA) is used to solve this problem which is a new swarm intelligent technique by simulating the human behavior guided by emotion. Simulation results show that the social emotional optimization algorithm proposed in this paper is effective and efficiency for the nonlinear constrained programming problems.

An Enhanced Artificial Bee Colony Algorithm with Solution Acceptance Rule and Probabilistic Multisearch.

PubMed

Yurtkuran, Alkın; Emel, Erdal

2016-01-01

The artificial bee colony (ABC) algorithm is a popular swarm based technique, which is inspired from the intelligent foraging behavior of honeybee swarms. This paper proposes a new variant of ABC algorithm, namely, enhanced ABC with solution acceptance rule and probabilistic multisearch (ABC-SA) to address global optimization problems. A new solution acceptance rule is proposed where, instead of greedy selection between old solution and new candidate solution, worse candidate solutions have a probability to be accepted. Additionally, the acceptance probability of worse candidates is nonlinearly decreased throughout the search process adaptively. Moreover, in order to improve the performance of the ABC and balance the intensification and diversification, a probabilistic multisearch strategy is presented. Three different search equations with distinctive characters are employed using predetermined search probabilities. By implementing a new solution acceptance rule and a probabilistic multisearch approach, the intensification and diversification performance of the ABC algorithm is improved. The proposed algorithm has been tested on well-known benchmark functions of varying dimensions by comparing against novel ABC variants, as well as several recent state-of-the-art algorithms. Computational results show that the proposed ABC-SA outperforms other ABC variants and is superior to state-of-the-art algorithms proposed in the literature.

Inverse 4D conformal planning for lung SBRT using particle swarm optimization

NASA Astrophysics Data System (ADS)

Modiri, A.; Gu, X.; Hagan, A.; Bland, R.; Iyengar, P.; Timmerman, R.; Sawant, A.

2016-08-01

A critical aspect of highly potent regimens such as lung stereotactic body radiation therapy (SBRT) is to avoid collateral toxicity while achieving planning target volume (PTV) coverage. In this work, we describe four dimensional conformal radiotherapy using a highly parallelizable swarm intelligence-based stochastic optimization technique. Conventional lung CRT-SBRT uses a 4DCT to create an internal target volume and then, using forward-planning, generates a 3D conformal plan. In contrast, we investigate an inverse-planning strategy that uses 4DCT data to create a 4D conformal plan, which is optimized across the three spatial dimensions (3D) as well as time, as represented by the respiratory phase. The key idea is to use respiratory motion as an additional degree of freedom. We iteratively adjust fluence weights for all beam apertures across all respiratory phases considering OAR sparing, PTV coverage and delivery efficiency. To demonstrate proof-of-concept, five non-small-cell lung cancer SBRT patients were retrospectively studied. The 4D optimized plans achieved PTV coverage comparable to the corresponding clinically delivered plans while showing significantly superior OAR sparing ranging from 26% to 83% for D max heart, 10%-41% for D max esophagus, 31%-68% for D max spinal cord and 7%-32% for V 13 lung.

Inverse 4D conformal planning for lung SBRT using particle swarm optimization

PubMed Central

Modiri, A; Gu, X; Hagan, A; Bland, R; Iyengar, P; Timmerman, R; Sawant, A

2016-01-01

A critical aspect of highly potent regimens such as lung stereotactic body radiation therapy (SBRT) is to avoid collateral toxicity while achieving planning target volume (PTV) coverage. In this work, we describe four dimensional conformal radiotherapy (4D CRT) using a highly parallelizable swarm intelligence-based stochastic optimization technique. Conventional lung CRT-SBRT uses a 4DCT to create an internal target volume (ITV) and then, using forward-planning, generates a 3D conformal plan. In contrast, we investigate an inverse-planning strategy that uses 4DCT data to create a 4D conformal plan, which is optimized across the three spatial dimensions (3D) as well as time, as represented by the respiratory phase. The key idea is to use respiratory motion as an additional degree of freedom. We iteratively adjust fluence weights for all beam apertures across all respiratory phases considering OAR sparing, PTV coverage and delivery efficiency. To demonstrate proof-of-concept, five non-small-cell lung cancer SBRT patients were retrospectively studied. The 4D optimized plans achieved PTV coverage comparable to the corresponding clinically delivered plans while showing significantly superior OAR sparing ranging from 26% to 83% for Dmax heart, 10% to 41% for Dmax esophagus, 31% to 68% for Dmax spinal cord and 7% to 32% for V13 lung. PMID:27476472

Virtual spring damper method for nonholonomic robotic swarm self-organization and leader following

NASA Astrophysics Data System (ADS)

Wiech, Jakub; Eremeyev, Victor A.; Giorgio, Ivan

2018-04-01

In this paper, we demonstrate a method for self-organization and leader following of nonholonomic robotic swarm based on spring damper mesh. By self-organization of swarm robots we mean the emergence of order in a swarm as the result of interactions among the single robots. In other words the self-organization of swarm robots mimics some natural behavior of social animals like ants among others. The dynamics of two-wheel robot is derived, and a relation between virtual forces and robot control inputs is defined in order to establish stable swarm formation. Two cases of swarm control are analyzed. In the first case the swarm cohesion is achieved by virtual spring damper mesh connecting nearest neighboring robots without designated leader. In the second case we introduce a swarm leader interacting with nearest and second neighbors allowing the swarm to follow the leader. The paper ends with numeric simulation for performance evaluation of the proposed control method.

From organized internal traffic to collective navigation of bacterial swarms

NASA Astrophysics Data System (ADS)

Ariel, Gil; Shklarsh, Adi; Kalisman, Oren; Ingham, Colin; Ben-Jacob, Eshel

2013-12-01

Bacterial swarming resulting in collective navigation over surfaces provides a valuable example of cooperative colonization of new territories. The social bacterium Paenibacillus vortex exhibits successful and diverse swarming strategies. When grown on hard agar surfaces with peptone, P. vortex develops complex colonies of vortices (rotating bacterial aggregates). In contrast, during growth on Mueller-Hinton broth gelled into a soft agar surface, a new strategy of multi-level organization is revealed: the colonies are organized into a special network of swarms (or ‘snakes’ of a fraction of millimeter in width) with intricate internal traffic. More specifically, cell movement is organized in two or three lanes of bacteria traveling between the back and the front of the swarm. This special form of cellular logistics suggests new methods in which bacteria can share resources and risk while searching for food or migrating into new territories. While the vortices-based organization on hard agar surfaces has been modeled before, here, we introduce a new multi-agent bacterial swarming model devised to capture the swarms-based organization on soft surfaces. We test two putative generic mechanisms that may underlie the observed swarming logistics: (i) chemo-activated taxis in response to chemical cues and (ii) special align-and-push interactions between the bacteria and the boundary of the layer of lubricant collectively generated by the swarming bacteria. Using realistic parameters, the model captures the observed phenomena with semi-quantitative agreement in terms of the velocity as well as the dynamics of the swarm and its envelope. This agreement implies that the bacteria interactions with the swarm boundary play a crucial role in mediating the interplay between the collective movement of the swarm and the internal traffic dynamics.

Reconstruction of F-Region Electric Current Densities from more than 2 Years of Swarm Satellite Magnetic data

NASA Astrophysics Data System (ADS)

Tozzi, R.; Pezzopane, M.; De Michelis, P.; Pignalberi, A.; Siciliano, F.

2016-12-01

The constellation geometry adopted by ESA for Swarm satellites has opened the way to new investigations based on magnetic data. An example is the curl-B technique that allows reconstructing F-region electric current density in terms of its radial, meridional, and zonal components based on data from two satellites of Swarm constellation (Swarm A and B) which fly at different altitudes. Here, we apply this technique to more than 2 years of Swarm magnetic vector data and investigate the average large scale behaviour of F-region current densities as a function of local time, season and different interplanetary conditions (different strength and direction of the three IMF components and/or geomagnetic activity levels).

A new improved artificial bee colony algorithm for ship hull form optimization

NASA Astrophysics Data System (ADS)

Huang, Fuxin; Wang, Lijue; Yang, Chi

2016-04-01

The artificial bee colony (ABC) algorithm is a relatively new swarm intelligence-based optimization algorithm. Its simplicity of implementation, relatively few parameter settings and promising optimization capability make it widely used in different fields. However, it has problems of slow convergence due to its solution search equation. Here, a new solution search equation based on a combination of the elite solution pool and the block perturbation scheme is proposed to improve the performance of the algorithm. In addition, two different solution search equations are used by employed bees and onlooker bees to balance the exploration and exploitation of the algorithm. The developed algorithm is validated by a set of well-known numerical benchmark functions. It is then applied to optimize two ship hull forms with minimum resistance. The tested results show that the proposed new improved ABC algorithm can outperform the ABC algorithm in most of the tested problems.

Bio-Inspired Networking — Self-Organizing Networked Embedded Systems

NASA Astrophysics Data System (ADS)

Dressler, Falko

The turn to nature has brought us many unforeseen great concepts and solutions. This course seems to hold on for many research domains. In this article, we study the applicability of biological mechanisms and techniques in the domain of communications. In particular, we study the behavior and the challenges in networked embedded systems that are meant to self-organize in large groups of nodes. Application examples include wireless sensor networks and sensor/actuator networks. Based on a review of the needs and requirements in such networks, we study selected bio-inspired networking approaches that claim to outperform other methods in specific domains. We study mechanisms in swarm intelligence, the artificial immune system, and approaches based on investigations on the cellular signaling pathways. As a major conclusion, we derive that bio-inspired networking techniques do have advantages compared to engineering methods. Nevertheless, selection and employment must be done carefully to achieve the desired performance gains.

Firefly algorithm versus genetic algorithm as powerful variable selection tools and their effect on different multivariate calibration models in spectroscopy: A comparative study.

PubMed

Attia, Khalid A M; Nassar, Mohammed W I; El-Zeiny, Mohamed B; Serag, Ahmed

2017-01-05

For the first time, a new variable selection method based on swarm intelligence namely firefly algorithm is coupled with three different multivariate calibration models namely, concentration residual augmented classical least squares, artificial neural network and support vector regression in UV spectral data. A comparative study between the firefly algorithm and the well-known genetic algorithm was developed. The discussion revealed the superiority of using this new powerful algorithm over the well-known genetic algorithm. Moreover, different statistical tests were performed and no significant differences were found between all the models regarding their predictabilities. This ensures that simpler and faster models were obtained without any deterioration of the quality of the calibration. Copyright © 2016 Elsevier B.V. All rights reserved.

Design of underwater robot lines based on a hybrid automatic optimization strategy

NASA Astrophysics Data System (ADS)

Lyu, Wenjing; Luo, Weilin

2014-09-01

In this paper, a hybrid automatic optimization strategy is proposed for the design of underwater robot lines. Isight is introduced as an integration platform. The construction of this platform is based on the user programming and several commercial software including UG6.0, GAMBIT2.4.6 and FLUENT12.0. An intelligent parameter optimization method, the particle swarm optimization, is incorporated into the platform. To verify the strategy proposed, a simulation is conducted on the underwater robot model 5470, which originates from the DTRC SUBOFF project. With the automatic optimization platform, the minimal resistance is taken as the optimization goal; the wet surface area as the constraint condition; the length of the fore-body, maximum body radius and after-body's minimum radius as the design variables. With the CFD calculation, the RANS equations and the standard turbulence model are used for direct numerical simulation. By analyses of the simulation results, it is concluded that the platform is of high efficiency and feasibility. Through the platform, a variety of schemes for the design of the lines are generated and the optimal solution is achieved. The combination of the intelligent optimization algorithm and the numerical simulation ensures a global optimal solution and improves the efficiency of the searching solutions.

Bare-Bones Teaching-Learning-Based Optimization

PubMed Central

Zou, Feng; Wang, Lei; Hei, Xinhong; Chen, Debao; Jiang, Qiaoyong; Li, Hongye

2014-01-01

Teaching-learning-based optimization (TLBO) algorithm which simulates the teaching-learning process of the class room is one of the recently proposed swarm intelligent (SI) algorithms. In this paper, a new TLBO variant called bare-bones teaching-learning-based optimization (BBTLBO) is presented to solve the global optimization problems. In this method, each learner of teacher phase employs an interactive learning strategy, which is the hybridization of the learning strategy of teacher phase in the standard TLBO and Gaussian sampling learning based on neighborhood search, and each learner of learner phase employs the learning strategy of learner phase in the standard TLBO or the new neighborhood search strategy. To verify the performance of our approaches, 20 benchmark functions and two real-world problems are utilized. Conducted experiments can been observed that the BBTLBO performs significantly better than, or at least comparable to, TLBO and some existing bare-bones algorithms. The results indicate that the proposed algorithm is competitive to some other optimization algorithms. PMID:25013844

Bare-bones teaching-learning-based optimization.

PubMed

Zou, Feng; Wang, Lei; Hei, Xinhong; Chen, Debao; Jiang, Qiaoyong; Li, Hongye

2014-01-01

Teaching-learning-based optimization (TLBO) algorithm which simulates the teaching-learning process of the class room is one of the recently proposed swarm intelligent (SI) algorithms. In this paper, a new TLBO variant called bare-bones teaching-learning-based optimization (BBTLBO) is presented to solve the global optimization problems. In this method, each learner of teacher phase employs an interactive learning strategy, which is the hybridization of the learning strategy of teacher phase in the standard TLBO and Gaussian sampling learning based on neighborhood search, and each learner of learner phase employs the learning strategy of learner phase in the standard TLBO or the new neighborhood search strategy. To verify the performance of our approaches, 20 benchmark functions and two real-world problems are utilized. Conducted experiments can been observed that the BBTLBO performs significantly better than, or at least comparable to, TLBO and some existing bare-bones algorithms. The results indicate that the proposed algorithm is competitive to some other optimization algorithms.

An improved marriage in honey bees optimization algorithm for single objective unconstrained optimization.

PubMed

Celik, Yuksel; Ulker, Erkan

2013-01-01

Marriage in honey bees optimization (MBO) is a metaheuristic optimization algorithm developed by inspiration of the mating and fertilization process of honey bees and is a kind of swarm intelligence optimizations. In this study we propose improved marriage in honey bees optimization (IMBO) by adding Levy flight algorithm for queen mating flight and neighboring for worker drone improving. The IMBO algorithm's performance and its success are tested on the well-known six unconstrained test functions and compared with other metaheuristic optimization algorithms.

Big Data: A Parallel Particle Swarm Optimization-Back-Propagation Neural Network Algorithm Based on MapReduce

PubMed Central

Cao, Jianfang; Cui, Hongyan; Shi, Hao; Jiao, Lijuan

2016-01-01

A back-propagation (BP) neural network can solve complicated random nonlinear mapping problems; therefore, it can be applied to a wide range of problems. However, as the sample size increases, the time required to train BP neural networks becomes lengthy. Moreover, the classification accuracy decreases as well. To improve the classification accuracy and runtime efficiency of the BP neural network algorithm, we proposed a parallel design and realization method for a particle swarm optimization (PSO)-optimized BP neural network based on MapReduce on the Hadoop platform using both the PSO algorithm and a parallel design. The PSO algorithm was used to optimize the BP neural network’s initial weights and thresholds and improve the accuracy of the classification algorithm. The MapReduce parallel programming model was utilized to achieve parallel processing of the BP algorithm, thereby solving the problems of hardware and communication overhead when the BP neural network addresses big data. Datasets on 5 different scales were constructed using the scene image library from the SUN Database. The classification accuracy of the parallel PSO-BP neural network algorithm is approximately 92%, and the system efficiency is approximately 0.85, which presents obvious advantages when processing big data. The algorithm proposed in this study demonstrated both higher classification accuracy and improved time efficiency, which represents a significant improvement obtained from applying parallel processing to an intelligent algorithm on big data. PMID:27304987

Daily River Flow Forecasting with Hybrid Support Vector Machine – Particle Swarm Optimization

NASA Astrophysics Data System (ADS)

Zaini, N.; Malek, M. A.; Yusoff, M.; Mardi, N. H.; Norhisham, S.

2018-04-01

The application of artificial intelligence techniques for river flow forecasting can further improve the management of water resources and flood prevention. This study concerns the development of support vector machine (SVM) based model and its hybridization with particle swarm optimization (PSO) to forecast short term daily river flow at Upper Bertam Catchment located in Cameron Highland, Malaysia. Ten years duration of historical rainfall, antecedent river flow data and various meteorology parameters data from 2003 to 2012 are used in this study. Four SVM based models are proposed which are SVM1, SVM2, SVM-PSO1 and SVM-PSO2 to forecast 1 to 7 day ahead of river flow. SVM1 and SVM-PSO1 are the models with historical rainfall and antecedent river flow as its input, while SVM2 and SVM-PSO2 are the models with historical rainfall, antecedent river flow data and additional meteorological parameters as input. The performances of the proposed model are measured in term of RMSE and R2 . It is found that, SVM2 outperformed SVM1 and SVM-PSO2 outperformed SVM-PSO1 which meant the additional meteorology parameters used as input to the proposed models significantly affect the model performances. Hybrid models SVM-PSO1 and SVM-PSO2 yield higher performances as compared to SVM1 and SVM2. It is found that hybrid models are more effective in forecasting river flow at 1 to 7 day ahead at the study area.

Log-linear model based behavior selection method for artificial fish swarm algorithm.

PubMed

Huang, Zhehuang; Chen, Yidong

2015-01-01

Artificial fish swarm algorithm (AFSA) is a population based optimization technique inspired by social behavior of fishes. In past several years, AFSA has been successfully applied in many research and application areas. The behavior of fishes has a crucial impact on the performance of AFSA, such as global exploration ability and convergence speed. How to construct and select behaviors of fishes are an important task. To solve these problems, an improved artificial fish swarm algorithm based on log-linear model is proposed and implemented in this paper. There are three main works. Firstly, we proposed a new behavior selection algorithm based on log-linear model which can enhance decision making ability of behavior selection. Secondly, adaptive movement behavior based on adaptive weight is presented, which can dynamically adjust according to the diversity of fishes. Finally, some new behaviors are defined and introduced into artificial fish swarm algorithm at the first time to improve global optimization capability. The experiments on high dimensional function optimization showed that the improved algorithm has more powerful global exploration ability and reasonable convergence speed compared with the standard artificial fish swarm algorithm.

Reverse engineering the human: artificial intelligence and acting theory

NASA Astrophysics Data System (ADS)

Soto-Morettini, Donna

2017-01-01

In two separate papers, Artificial Intelligence (AI)/Robotics researcher Guy Hoffman takes as a starting point that actors have been in the business of reverse engineering human behaviour for centuries. In this paper, I follow the similar trajectories of AI and acting theory (AT), looking at three primary questions, in the hope of framing a response to Hoffman's papers: (1) How are the problems of training a human to simulate a fictional human both similar to and different from training a machine to simulate a human? (2) How are the larger questions of AI design and architecture similar to the larger questions that still remain within the area of AT? (3) Is there anything in the work of AI design that might advance the work of acting theorists and practitioners? The paper explores the use of "swarm intelligence" in recent models of both AT and AI, and considers the issues of embodied cognition, and the kinds of intelligence that enhances or inhibits imaginative immersion for the actor, and concludes with a consideration of the ontological questions raised by the trend towards intersubjective, dynamic systems of generative thought in both AT and AI.

Agent-Based Simulation and Analysis of a Defensive UAV Swarm Against an Enemy UAV Swarm

DTIC Science & Technology

2011-06-01

de Investigacion, Programas y Desarrollo de la Armada Armada de Chile CHILE 10. CAPT Jeffrey Kline, USN(ret.) Naval Postgraduate School Monterey, California 91 ...this de - fensive swarm system, an agent-based simulation model is developed, and appropriate designs of experiments and statistical analyses are... de - velopment and implementation of counter UAV technology from readily-available commercial products. The organization leverages the “largest

A persistent homology approach to collective behavior in insect swarms

NASA Astrophysics Data System (ADS)

Sinhuber, Michael; Ouellette, Nicholas T.

Various animals from birds and fish to insects tend to form aggregates, displaying self-organized collective swarming behavior. Due to their frequent occurrence in nature and their implications for engineered, collective systems, these systems have been investigated and modeled thoroughly for decades. Common approaches range from modeling them with coupled differential equations on the individual level up to continuum approaches. We present an alternative, topology-based approach for describing swarming behavior at the macroscale rather than the microscale. We study laboratory swarms of Chironomus riparius, a flying, non-biting midge. To obtain the time-resolved three-dimensional trajectories of individual insects, we use a multi-camera stereoimaging and particle-tracking setup. To investigate the swarming behavior in a topological sense, we employ a persistent homology approach to identify persisting structures and features in the insect swarm that elude a direct, ensemble-averaging approach. We are able to identify features of sub-clusters in the swarm that show behavior distinct from that of the remaining swarm members. The coexistence of sub-swarms with different features resembles some non-biological systems such as active colloids or even thermodynamic systems.

Investigation of trunk muscle activities during lifting using a multi-objective optimization-based model and intelligent optimization algorithms.

PubMed

Ghiasi, Mohammad Sadegh; Arjmand, Navid; Boroushaki, Mehrdad; Farahmand, Farzam

2016-03-01

A six-degree-of-freedom musculoskeletal model of the lumbar spine was developed to predict the activity of trunk muscles during light, moderate and heavy lifting tasks in standing posture. The model was formulated into a multi-objective optimization problem, minimizing the sum of the cubed muscle stresses and maximizing the spinal stability index. Two intelligent optimization algorithms, i.e., the vector evaluated particle swarm optimization (VEPSO) and nondominated sorting genetic algorithm (NSGA), were employed to solve the optimization problem. The optimal solution for each task was then found in the way that the corresponding in vivo intradiscal pressure could be reproduced. Results indicated that both algorithms predicted co-activity in the antagonistic abdominal muscles, as well as an increase in the stability index when going from the light to the heavy task. For all of the light, moderate and heavy tasks, the muscles' activities predictions of the VEPSO and the NSGA were generally consistent and in the same order of the in vivo electromyography data. The proposed methodology is thought to provide improved estimations for muscle activities by considering the spinal stability and incorporating the in vivo intradiscal pressure data.

Optimization of PID Parameters Utilizing Variable Weight Grey-Taguchi Method and Particle Swarm Optimization

NASA Astrophysics Data System (ADS)

Azmi, Nur Iffah Mohamed; Arifin Mat Piah, Kamal; Yusoff, Wan Azhar Wan; Romlay, Fadhlur Rahman Mohd

2018-03-01

Controller that uses PID parameters requires a good tuning method in order to improve the control system performance. Tuning PID control method is divided into two namely the classical methods and the methods of artificial intelligence. Particle swarm optimization algorithm (PSO) is one of the artificial intelligence methods. Previously, researchers had integrated PSO algorithms in the PID parameter tuning process. This research aims to improve the PSO-PID tuning algorithms by integrating the tuning process with the Variable Weight Grey- Taguchi Design of Experiment (DOE) method. This is done by conducting the DOE on the two PSO optimizing parameters: the particle velocity limit and the weight distribution factor. Computer simulations and physical experiments were conducted by using the proposed PSO- PID with the Variable Weight Grey-Taguchi DOE and the classical Ziegler-Nichols methods. They are implemented on the hydraulic positioning system. Simulation results show that the proposed PSO-PID with the Variable Weight Grey-Taguchi DOE has reduced the rise time by 48.13% and settling time by 48.57% compared to the Ziegler-Nichols method. Furthermore, the physical experiment results also show that the proposed PSO-PID with the Variable Weight Grey-Taguchi DOE tuning method responds better than Ziegler-Nichols tuning. In conclusion, this research has improved the PSO-PID parameter by applying the PSO-PID algorithm together with the Variable Weight Grey-Taguchi DOE method as a tuning method in the hydraulic positioning system.

Design optimization of steel frames using an enhanced firefly algorithm

NASA Astrophysics Data System (ADS)

Carbas, Serdar

2016-12-01

Mathematical modelling of real-world-sized steel frames under the Load and Resistance Factor Design-American Institute of Steel Construction (LRFD-AISC) steel design code provisions, where the steel profiles for the members are selected from a table of steel sections, turns out to be a discrete nonlinear programming problem. Finding the optimum design of such design optimization problems using classical optimization techniques is difficult. Metaheuristic algorithms provide an alternative way of solving such problems. The firefly algorithm (FFA) belongs to the swarm intelligence group of metaheuristics. The standard FFA has the drawback of being caught up in local optima in large-sized steel frame design problems. This study attempts to enhance the performance of the FFA by suggesting two new expressions for the attractiveness and randomness parameters of the algorithm. Two real-world-sized design examples are designed by the enhanced FFA and its performance is compared with standard FFA as well as with particle swarm and cuckoo search algorithms.

A Hybrid Swarm Intelligence Algorithm for Intrusion Detection Using Significant Features.

PubMed

Amudha, P; Karthik, S; Sivakumari, S

2015-01-01

Intrusion detection has become a main part of network security due to the huge number of attacks which affects the computers. This is due to the extensive growth of internet connectivity and accessibility to information systems worldwide. To deal with this problem, in this paper a hybrid algorithm is proposed to integrate Modified Artificial Bee Colony (MABC) with Enhanced Particle Swarm Optimization (EPSO) to predict the intrusion detection problem. The algorithms are combined together to find out better optimization results and the classification accuracies are obtained by 10-fold cross-validation method. The purpose of this paper is to select the most relevant features that can represent the pattern of the network traffic and test its effect on the success of the proposed hybrid classification algorithm. To investigate the performance of the proposed method, intrusion detection KDDCup'99 benchmark dataset from the UCI Machine Learning repository is used. The performance of the proposed method is compared with the other machine learning algorithms and found to be significantly different.

A Hybrid Swarm Intelligence Algorithm for Intrusion Detection Using Significant Features

PubMed Central

Amudha, P.; Karthik, S.; Sivakumari, S.

2015-01-01

Intrusion detection has become a main part of network security due to the huge number of attacks which affects the computers. This is due to the extensive growth of internet connectivity and accessibility to information systems worldwide. To deal with this problem, in this paper a hybrid algorithm is proposed to integrate Modified Artificial Bee Colony (MABC) with Enhanced Particle Swarm Optimization (EPSO) to predict the intrusion detection problem. The algorithms are combined together to find out better optimization results and the classification accuracies are obtained by 10-fold cross-validation method. The purpose of this paper is to select the most relevant features that can represent the pattern of the network traffic and test its effect on the success of the proposed hybrid classification algorithm. To investigate the performance of the proposed method, intrusion detection KDDCup'99 benchmark dataset from the UCI Machine Learning repository is used. The performance of the proposed method is compared with the other machine learning algorithms and found to be significantly different. PMID:26221625

Swarm intelligence for multi-objective optimization of synthesis gas production

NASA Astrophysics Data System (ADS)

Ganesan, T.; Vasant, P.; Elamvazuthi, I.; Ku Shaari, Ku Zilati

2012-11-01

In the chemical industry, the production of methanol, ammonia, hydrogen and higher hydrocarbons require synthesis gas (or syn gas). The main three syn gas production methods are carbon dioxide reforming (CRM), steam reforming (SRM) and partial-oxidation of methane (POM). In this work, multi-objective (MO) optimization of the combined CRM and POM was carried out. The empirical model and the MO problem formulation for this combined process were obtained from previous works. The central objectives considered in this problem are methane conversion, carbon monoxide selectivity and the hydrogen to carbon monoxide ratio. The MO nature of the problem was tackled using the Normal Boundary Intersection (NBI) method. Two techniques (Gravitational Search Algorithm (GSA) and Particle Swarm Optimization (PSO)) were then applied in conjunction with the NBI method. The performance of the two algorithms and the quality of the solutions were gauged by using two performance metrics. Comparative studies and results analysis were then carried out on the optimization results.

A Technical Analysis Information Fusion Approach for Stock Price Analysis and Modeling

NASA Astrophysics Data System (ADS)

Lahmiri, Salim

In this paper, we address the problem of technical analysis information fusion in improving stock market index-level prediction. We present an approach for analyzing stock market price behavior based on different categories of technical analysis metrics and a multiple predictive system. Each category of technical analysis measures is used to characterize stock market price movements. The presented predictive system is based on an ensemble of neural networks (NN) coupled with particle swarm intelligence for parameter optimization where each single neural network is trained with a specific category of technical analysis measures. The experimental evaluation on three international stock market indices and three individual stocks show that the presented ensemble-based technical indicators fusion system significantly improves forecasting accuracy in comparison with single NN. Also, it outperforms the classical neural network trained with index-level lagged values and NN trained with stationary wavelet transform details and approximation coefficients. As a result, technical information fusion in NN ensemble architecture helps improving prediction accuracy.

Performance improvement of optical CDMA networks with stochastic artificial bee colony optimization technique

NASA Astrophysics Data System (ADS)

Panda, Satyasen

2018-05-01

This paper proposes a modified artificial bee colony optimization (ABC) algorithm based on levy flight swarm intelligence referred as artificial bee colony levy flight stochastic walk (ABC-LFSW) optimization for optical code division multiple access (OCDMA) network. The ABC-LFSW algorithm is used to solve asset assignment problem based on signal to noise ratio (SNR) optimization in OCDM networks with quality of service constraints. The proposed optimization using ABC-LFSW algorithm provides methods for minimizing various noises and interferences, regulating the transmitted power and optimizing the network design for improving the power efficiency of the optical code path (OCP) from source node to destination node. In this regard, an optical system model is proposed for improving the network performance with optimized input parameters. The detailed discussion and simulation results based on transmitted power allocation and power efficiency of OCPs are included. The experimental results prove the superiority of the proposed network in terms of power efficiency and spectral efficiency in comparison to networks without any power allocation approach.

Multiscale Model of Swarming Bacteria

NASA Astrophysics Data System (ADS)

Alber, Mark

2011-03-01

Many bacteria can rapidly traverse surfaces from which they are extracting nutrient for growth. They generate flat, spreading colonies, called swarms because they resemble swarms of insects. In the beginning of the talk, swarms of the M. xanthus will be described in detail. Individual M. xanthus cells are elongated; they always move in the direction of their long axis; and they are in constant motion, repeatedly touching each other. As a cell glides, the slime capsule of a cell interacts with the bare agar surface, non-oriented slime which arises from the surface contact with the slime capsule, or oriented slime trails. Remarkably, cells regularly reverse their gliding directions. In this talk a detailed cell- and behavior-based computational model of M. xanthus swarming will be used to demonstrate that reversals of gliding direction and cell bending are essential for swarming and that specific reversal frequencies result in optimal swarming rate of the whole population. This suggests that the circuit regulating reversals evolved to its current sensitivity under selection for growth achieved by swarming.

Survey of Methods and Algorithms of Robot Swarm Aggregation

NASA Astrophysics Data System (ADS)

E Shlyakhov, N.; Vatamaniuk, I. V.; Ronzhin, A. L.

2017-01-01

The paper considers the problem of swarm aggregation of autonomous robots with the use of three methods based on the analogy of the behavior of biological objects. The algorithms substantiating the requirements for hardware realization of sensor, computer and network resources and propulsion devices are presented. Techniques for efficiency estimation of swarm aggregation via space-time characteristics are described. The developed model of the robot swarm reconfiguration into a predetermined three-dimensional shape is presented.

Particle Swarm Optimization

NASA Technical Reports Server (NTRS)

Venter, Gerhard; Sobieszczanski-Sobieski Jaroslaw

2002-01-01

The purpose of this paper is to show how the search algorithm known as particle swarm optimization performs. Here, particle swarm optimization is applied to structural design problems, but the method has a much wider range of possible applications. The paper's new contributions are improvements to the particle swarm optimization algorithm and conclusions and recommendations as to the utility of the algorithm, Results of numerical experiments for both continuous and discrete applications are presented in the paper. The results indicate that the particle swarm optimization algorithm does locate the constrained minimum design in continuous applications with very good precision, albeit at a much higher computational cost than that of a typical gradient based optimizer. However, the true potential of particle swarm optimization is primarily in applications with discrete and/or discontinuous functions and variables. Additionally, particle swarm optimization has the potential of efficient computation with very large numbers of concurrently operating processors.

Hybrid soft computing systems for electromyographic signals analysis: a review.

PubMed

Xie, Hong-Bo; Guo, Tianruo; Bai, Siwei; Dokos, Socrates

2014-02-03

Electromyographic (EMG) is a bio-signal collected on human skeletal muscle. Analysis of EMG signals has been widely used to detect human movement intent, control various human-machine interfaces, diagnose neuromuscular diseases, and model neuromusculoskeletal system. With the advances of artificial intelligence and soft computing, many sophisticated techniques have been proposed for such purpose. Hybrid soft computing system (HSCS), the integration of these different techniques, aims to further improve the effectiveness, efficiency, and accuracy of EMG analysis. This paper reviews and compares key combinations of neural network, support vector machine, fuzzy logic, evolutionary computing, and swarm intelligence for EMG analysis. Our suggestions on the possible future development of HSCS in EMG analysis are also given in terms of basic soft computing techniques, further combination of these techniques, and their other applications in EMG analysis.

Hybrid soft computing systems for electromyographic signals analysis: a review

PubMed Central

2014-01-01

Electromyographic (EMG) is a bio-signal collected on human skeletal muscle. Analysis of EMG signals has been widely used to detect human movement intent, control various human-machine interfaces, diagnose neuromuscular diseases, and model neuromusculoskeletal system. With the advances of artificial intelligence and soft computing, many sophisticated techniques have been proposed for such purpose. Hybrid soft computing system (HSCS), the integration of these different techniques, aims to further improve the effectiveness, efficiency, and accuracy of EMG analysis. This paper reviews and compares key combinations of neural network, support vector machine, fuzzy logic, evolutionary computing, and swarm intelligence for EMG analysis. Our suggestions on the possible future development of HSCS in EMG analysis are also given in terms of basic soft computing techniques, further combination of these techniques, and their other applications in EMG analysis. PMID:24490979

mRMR-ABC: A Hybrid Gene Selection Algorithm for Cancer Classification Using Microarray Gene Expression Profiling

PubMed Central

Alshamlan, Hala; Badr, Ghada; Alohali, Yousef

2015-01-01

An artificial bee colony (ABC) is a relatively recent swarm intelligence optimization approach. In this paper, we propose the first attempt at applying ABC algorithm in analyzing a microarray gene expression profile. In addition, we propose an innovative feature selection algorithm, minimum redundancy maximum relevance (mRMR), and combine it with an ABC algorithm, mRMR-ABC, to select informative genes from microarray profile. The new approach is based on a support vector machine (SVM) algorithm to measure the classification accuracy for selected genes. We evaluate the performance of the proposed mRMR-ABC algorithm by conducting extensive experiments on six binary and multiclass gene expression microarray datasets. Furthermore, we compare our proposed mRMR-ABC algorithm with previously known techniques. We reimplemented two of these techniques for the sake of a fair comparison using the same parameters. These two techniques are mRMR when combined with a genetic algorithm (mRMR-GA) and mRMR when combined with a particle swarm optimization algorithm (mRMR-PSO). The experimental results prove that the proposed mRMR-ABC algorithm achieves accurate classification performance using small number of predictive genes when tested using both datasets and compared to previously suggested methods. This shows that mRMR-ABC is a promising approach for solving gene selection and cancer classification problems. PMID:25961028

mRMR-ABC: A Hybrid Gene Selection Algorithm for Cancer Classification Using Microarray Gene Expression Profiling.

PubMed

Alshamlan, Hala; Badr, Ghada; Alohali, Yousef

2015-01-01

An artificial bee colony (ABC) is a relatively recent swarm intelligence optimization approach. In this paper, we propose the first attempt at applying ABC algorithm in analyzing a microarray gene expression profile. In addition, we propose an innovative feature selection algorithm, minimum redundancy maximum relevance (mRMR), and combine it with an ABC algorithm, mRMR-ABC, to select informative genes from microarray profile. The new approach is based on a support vector machine (SVM) algorithm to measure the classification accuracy for selected genes. We evaluate the performance of the proposed mRMR-ABC algorithm by conducting extensive experiments on six binary and multiclass gene expression microarray datasets. Furthermore, we compare our proposed mRMR-ABC algorithm with previously known techniques. We reimplemented two of these techniques for the sake of a fair comparison using the same parameters. These two techniques are mRMR when combined with a genetic algorithm (mRMR-GA) and mRMR when combined with a particle swarm optimization algorithm (mRMR-PSO). The experimental results prove that the proposed mRMR-ABC algorithm achieves accurate classification performance using small number of predictive genes when tested using both datasets and compared to previously suggested methods. This shows that mRMR-ABC is a promising approach for solving gene selection and cancer classification problems.

Log-Linear Model Based Behavior Selection Method for Artificial Fish Swarm Algorithm

PubMed Central

Huang, Zhehuang; Chen, Yidong

2015-01-01

Artificial fish swarm algorithm (AFSA) is a population based optimization technique inspired by social behavior of fishes. In past several years, AFSA has been successfully applied in many research and application areas. The behavior of fishes has a crucial impact on the performance of AFSA, such as global exploration ability and convergence speed. How to construct and select behaviors of fishes are an important task. To solve these problems, an improved artificial fish swarm algorithm based on log-linear model is proposed and implemented in this paper. There are three main works. Firstly, we proposed a new behavior selection algorithm based on log-linear model which can enhance decision making ability of behavior selection. Secondly, adaptive movement behavior based on adaptive weight is presented, which can dynamically adjust according to the diversity of fishes. Finally, some new behaviors are defined and introduced into artificial fish swarm algorithm at the first time to improve global optimization capability. The experiments on high dimensional function optimization showed that the improved algorithm has more powerful global exploration ability and reasonable convergence speed compared with the standard artificial fish swarm algorithm. PMID:25691895

Emergence of Swarming Behavior: Foraging Agents Evolve Collective Motion Based on Signaling.

PubMed

Witkowski, Olaf; Ikegami, Takashi

2016-01-01

Swarming behavior is common in biology, from cell colonies to insect swarms and bird flocks. However, the conditions leading to the emergence of such behavior are still subject to research. Since Reynolds' boids, many artificial models have reproduced swarming behavior, focusing on details ranging from obstacle avoidance to the introduction of fixed leaders. This paper presents a model of evolved artificial agents, able to develop swarming using only their ability to listen to each other's signals. The model simulates a population of agents looking for a vital resource they cannot directly detect, in a 3D environment. Instead of a centralized algorithm, each agent is controlled by an artificial neural network, whose weights are encoded in a genotype and adapted by an original asynchronous genetic algorithm. The results demonstrate that agents progressively evolve the ability to use the information exchanged between each other via signaling to establish temporary leader-follower relations. These relations allow agents to form swarming patterns, emerging as a transient behavior that improves the agents' ability to forage for the resource. Once they have acquired the ability to swarm, the individuals are able to outperform the non-swarmers at finding the resource. The population hence reaches a neutral evolutionary space which leads to a genetic drift of the genotypes. This reductionist approach to signal-based swarming not only contributes to shed light on the minimal conditions for the evolution of a swarming behavior, but also more generally it exemplifies the effect communication can have on optimal search patterns in collective groups of individuals.

Markerless human motion tracking using hierarchical multi-swarm cooperative particle swarm optimization.

PubMed

Saini, Sanjay; Zakaria, Nordin; Rambli, Dayang Rohaya Awang; Sulaiman, Suziah

2015-01-01

The high-dimensional search space involved in markerless full-body articulated human motion tracking from multiple-views video sequences has led to a number of solutions based on metaheuristics, the most recent form of which is Particle Swarm Optimization (PSO). However, the classical PSO suffers from premature convergence and it is trapped easily into local optima, significantly affecting the tracking accuracy. To overcome these drawbacks, we have developed a method for the problem based on Hierarchical Multi-Swarm Cooperative Particle Swarm Optimization (H-MCPSO). The tracking problem is formulated as a non-linear 34-dimensional function optimization problem where the fitness function quantifies the difference between the observed image and a projection of the model configuration. Both the silhouette and edge likelihoods are used in the fitness function. Experiments using Brown and HumanEva-II dataset demonstrated that H-MCPSO performance is better than two leading alternative approaches-Annealed Particle Filter (APF) and Hierarchical Particle Swarm Optimization (HPSO). Further, the proposed tracking method is capable of automatic initialization and self-recovery from temporary tracking failures. Comprehensive experimental results are presented to support the claims.

Bioinspired principles for large-scale networked sensor systems: an overview.

PubMed

Jacobsen, Rune Hylsberg; Zhang, Qi; Toftegaard, Thomas Skjødeberg

2011-01-01

Biology has often been used as a source of inspiration in computer science and engineering. Bioinspired principles have found their way into network node design and research due to the appealing analogies between biological systems and large networks of small sensors. This paper provides an overview of bioinspired principles and methods such as swarm intelligence, natural time synchronization, artificial immune system and intercellular information exchange applicable for sensor network design. Bioinspired principles and methods are discussed in the context of routing, clustering, time synchronization, optimal node deployment, localization and security and privacy.

An Improved Marriage in Honey Bees Optimization Algorithm for Single Objective Unconstrained Optimization

PubMed Central

Celik, Yuksel; Ulker, Erkan

2013-01-01

Marriage in honey bees optimization (MBO) is a metaheuristic optimization algorithm developed by inspiration of the mating and fertilization process of honey bees and is a kind of swarm intelligence optimizations. In this study we propose improved marriage in honey bees optimization (IMBO) by adding Levy flight algorithm for queen mating flight and neighboring for worker drone improving. The IMBO algorithm's performance and its success are tested on the well-known six unconstrained test functions and compared with other metaheuristic optimization algorithms. PMID:23935416

Applying Biomimetic Algorithms for Extra-Terrestrial Habitat Generation

NASA Technical Reports Server (NTRS)

Birge, Brian

2012-01-01

The objective is to simulate and optimize distributed cooperation among a network of robots tasked with cooperative excavation on an extra-terrestrial surface. Additionally to examine the concept of directed Emergence among a group of limited artificially intelligent agents. Emergence is the concept of achieving complex results from very simple rules or interactions. For example, in a termite mound each individual termite does not carry a blueprint of how to make their home in a global sense, but their interactions based strictly on local desires create a complex superstructure. Leveraging this Emergence concept applied to a simulation of cooperative agents (robots) will allow an examination of the success of non-directed group strategy achieving specific results. Specifically the simulation will be a testbed to evaluate population based robotic exploration and cooperative strategies while leveraging the evolutionary teamwork approach in the face of uncertainty about the environment and partial loss of sensors. Checking against a cost function and 'social' constraints will optimize cooperation when excavating a simulated tunnel. Agents will act locally with non-local results. The rules by which the simulated robots interact will be optimized to the simplest possible for the desired result, leveraging Emergence. Sensor malfunction and line of sight issues will be incorporated into the simulation. This approach falls under Swarm Robotics, a subset of robot control concerned with finding ways to control large groups of robots. Swarm Robotics often contains biologically inspired approaches, research comes from social insect observation but also data from among groups of herding, schooling, and flocking animals. Biomimetic algorithms applied to manned space exploration is the method under consideration for further study.

Simulating Flying Insects Using Dynamics and Data-Driven Noise Modeling to Generate Diverse Collective Behaviors

PubMed Central

Ren, Jiaping; Wang, Xinjie; Manocha, Dinesh

2016-01-01

We present a biologically plausible dynamics model to simulate swarms of flying insects. Our formulation, which is based on biological conclusions and experimental observations, is designed to simulate large insect swarms of varying densities. We use a force-based model that captures different interactions between the insects and the environment and computes collision-free trajectories for each individual insect. Furthermore, we model the noise as a constructive force at the collective level and present a technique to generate noise-induced insect movements in a large swarm that are similar to those observed in real-world trajectories. We use a data-driven formulation that is based on pre-recorded insect trajectories. We also present a novel evaluation metric and a statistical validation approach that takes into account various characteristics of insect motions. In practice, the combination of Curl noise function with our dynamics model is used to generate realistic swarm simulations and emergent behaviors. We highlight its performance for simulating large flying swarms of midges, fruit fly, locusts and moths and demonstrate many collective behaviors, including aggregation, migration, phase transition, and escape responses. PMID:27187068

Multiscale modelling and analysis of collective decision making in swarm robotics.

PubMed

Vigelius, Matthias; Meyer, Bernd; Pascoe, Geoffrey

2014-01-01

We present a unified approach to describing certain types of collective decision making in swarm robotics that bridges from a microscopic individual-based description to aggregate properties. Our approach encompasses robot swarm experiments, microscopic and probabilistic macroscopic-discrete simulations as well as an analytic mathematical model. Following up on previous work, we identify the symmetry parameter, a measure of the progress of the swarm towards a decision, as a fundamental integrated swarm property and formulate its time evolution as a continuous-time Markov process. Contrary to previous work, which justified this approach only empirically and a posteriori, we justify it from first principles and derive hard limits on the parameter regime in which it is applicable.

Enhancing artificial bee colony algorithm with self-adaptive searching strategy and artificial immune network operators for global optimization.

PubMed

Chen, Tinggui; Xiao, Renbin

2014-01-01

Artificial bee colony (ABC) algorithm, inspired by the intelligent foraging behavior of honey bees, was proposed by Karaboga. It has been shown to be superior to some conventional intelligent algorithms such as genetic algorithm (GA), artificial colony optimization (ACO), and particle swarm optimization (PSO). However, the ABC still has some limitations. For example, ABC can easily get trapped in the local optimum when handing in functions that have a narrow curving valley, a high eccentric ellipse, or complex multimodal functions. As a result, we proposed an enhanced ABC algorithm called EABC by introducing self-adaptive searching strategy and artificial immune network operators to improve the exploitation and exploration. The simulation results tested on a suite of unimodal or multimodal benchmark functions illustrate that the EABC algorithm outperforms ACO, PSO, and the basic ABC in most of the experiments.

Enhancing Artificial Bee Colony Algorithm with Self-Adaptive Searching Strategy and Artificial Immune Network Operators for Global Optimization

PubMed Central

Chen, Tinggui; Xiao, Renbin

2014-01-01

Artificial bee colony (ABC) algorithm, inspired by the intelligent foraging behavior of honey bees, was proposed by Karaboga. It has been shown to be superior to some conventional intelligent algorithms such as genetic algorithm (GA), artificial colony optimization (ACO), and particle swarm optimization (PSO). However, the ABC still has some limitations. For example, ABC can easily get trapped in the local optimum when handing in functions that have a narrow curving valley, a high eccentric ellipse, or complex multimodal functions. As a result, we proposed an enhanced ABC algorithm called EABC by introducing self-adaptive searching strategy and artificial immune network operators to improve the exploitation and exploration. The simulation results tested on a suite of unimodal or multimodal benchmark functions illustrate that the EABC algorithm outperforms ACO, PSO, and the basic ABC in most of the experiments. PMID:24772023

Characteristics of Swarm Seismicity in Northern California

NASA Astrophysics Data System (ADS)

Chiorini, S.; Lekic, V.

2017-12-01

Seismic swarms are characterized by an anomalously large number of earthquakes compared to the background rate of seismicity that are tightly clustered in space (typically, one to tens of kilometers) and time (typically, days to weeks). However, why and how swarms occur is poorly understood, partly because of the difficulty of identifying the range of swarm behaviors within large seismic catalogs. Previous studies have found that swarms, compared to other earthquake sequences, appear to be more common in extensional (Vidale & Shearer, 2006) and volcanic settings (Hayashi & Morita, 2003). In addition, swarms more commonly exhibit migration patterns, consistent with either fluid diffusion (Chen & Shearer, 2011; Chen et al., 2012) or aseismic creep (Lohman & McGuire, 2007), and are preferentially found in areas of enhanced heat flow (Enescu, 2009; Zaliapin & Ben Zion, 2016). While the swarm seismicity of Southern California has been studied extensively, that of Northern California has not been systematically documented and characterized. We employed two complementary methods of swarm identification: the approach of Vidale and Shearer (2006; henceforth VS2006) based on a priori threshold distances and timings of quakes, and the spatio-temporal distance metric proposed by Zaliapin et al. (2008; henceforth Z2008) in order to build a complete catalog of swarm seismicity in Northern California spanning 1984-2016 (Waldhauser & Schaff, 2008). Once filtered for aftershocks, the catalog allows us to describe the main features of swarm seismicity in Northern California, including spatial distribution, association or lack thereof with known faults and volcanic systems, and seismically quiescent regions. We then apply a robust technique to characterize the morphology of swarms, leading to subsets of swarms that are oriented either vertically or horizontally in space. When mapped, vertical swarms show a significant association with volcanic regions, and horizontal swarms with tectonic and volcanic settings. Finally, we demonstrate some swarms underlie areas that are typically quiescent, like Redding and the Sutter Buttes. Our catalog presents a more complete snapshot of the diversity of swarm characteristics in Northern California, and motivates further study of their relationship to tectonic and volcanic processes.

Intelligent Condition Diagnosis Method Based on Adaptive Statistic Test Filter and Diagnostic Bayesian Network

PubMed Central

Li, Ke; Zhang, Qiuju; Wang, Kun; Chen, Peng; Wang, Huaqing

2016-01-01

A new fault diagnosis method for rotating machinery based on adaptive statistic test filter (ASTF) and Diagnostic Bayesian Network (DBN) is presented in this paper. ASTF is proposed to obtain weak fault features under background noise, ASTF is based on statistic hypothesis testing in the frequency domain to evaluate similarity between reference signal (noise signal) and original signal, and remove the component of high similarity. The optimal level of significance α is obtained using particle swarm optimization (PSO). To evaluate the performance of the ASTF, evaluation factor Ipq is also defined. In addition, a simulation experiment is designed to verify the effectiveness and robustness of ASTF. A sensitive evaluation method using principal component analysis (PCA) is proposed to evaluate the sensitiveness of symptom parameters (SPs) for condition diagnosis. By this way, the good SPs that have high sensitiveness for condition diagnosis can be selected. A three-layer DBN is developed to identify condition of rotation machinery based on the Bayesian Belief Network (BBN) theory. Condition diagnosis experiment for rolling element bearings demonstrates the effectiveness of the proposed method. PMID:26761006

Intelligent Condition Diagnosis Method Based on Adaptive Statistic Test Filter and Diagnostic Bayesian Network.

PubMed

Li, Ke; Zhang, Qiuju; Wang, Kun; Chen, Peng; Wang, Huaqing

2016-01-08

A new fault diagnosis method for rotating machinery based on adaptive statistic test filter (ASTF) and Diagnostic Bayesian Network (DBN) is presented in this paper. ASTF is proposed to obtain weak fault features under background noise, ASTF is based on statistic hypothesis testing in the frequency domain to evaluate similarity between reference signal (noise signal) and original signal, and remove the component of high similarity. The optimal level of significance α is obtained using particle swarm optimization (PSO). To evaluate the performance of the ASTF, evaluation factor Ipq is also defined. In addition, a simulation experiment is designed to verify the effectiveness and robustness of ASTF. A sensitive evaluation method using principal component analysis (PCA) is proposed to evaluate the sensitiveness of symptom parameters (SPs) for condition diagnosis. By this way, the good SPs that have high sensitiveness for condition diagnosis can be selected. A three-layer DBN is developed to identify condition of rotation machinery based on the Bayesian Belief Network (BBN) theory. Condition diagnosis experiment for rolling element bearings demonstrates the effectiveness of the proposed method.

Scheduling in Sensor Grid Middleware for Telemedicine Using ABC Algorithm

PubMed Central

Vigneswari, T.; Mohamed, M. A. Maluk

2014-01-01

Advances in microelectromechanical systems (MEMS) and nanotechnology have enabled design of low power wireless sensor nodes capable of sensing different vital signs in our body. These nodes can communicate with each other to aggregate data and transmit vital parameters to a base station (BS). The data collected in the base station can be used to monitor health in real time. The patient wearing sensors may be mobile leading to aggregation of data from different BS for processing. Processing real time data is compute-intensive and telemedicine facilities may not have appropriate hardware to process the real time data effectively. To overcome this, sensor grid has been proposed in literature wherein sensor data is integrated to the grid for processing. This work proposes a scheduling algorithm to efficiently process telemedicine data in the grid. The proposed algorithm uses the popular swarm intelligence algorithm for scheduling to overcome the NP complete problem of grid scheduling. Results compared with other heuristic scheduling algorithms show the effectiveness of the proposed algorithm. PMID:25548557

Improved Ant Colony Clustering Algorithm and Its Performance Study

PubMed Central

Gao, Wei

2016-01-01

Clustering analysis is used in many disciplines and applications; it is an important tool that descriptively identifies homogeneous groups of objects based on attribute values. The ant colony clustering algorithm is a swarm-intelligent method used for clustering problems that is inspired by the behavior of ant colonies that cluster their corpses and sort their larvae. A new abstraction ant colony clustering algorithm using a data combination mechanism is proposed to improve the computational efficiency and accuracy of the ant colony clustering algorithm. The abstraction ant colony clustering algorithm is used to cluster benchmark problems, and its performance is compared with the ant colony clustering algorithm and other methods used in existing literature. Based on similar computational difficulties and complexities, the results show that the abstraction ant colony clustering algorithm produces results that are not only more accurate but also more efficiently determined than the ant colony clustering algorithm and the other methods. Thus, the abstraction ant colony clustering algorithm can be used for efficient multivariate data clustering. PMID:26839533

Structure and weights optimisation of a modified Elman network emotion classifier using hybrid computational intelligence algorithms: a comparative study

NASA Astrophysics Data System (ADS)

Sheikhan, Mansour; Abbasnezhad Arabi, Mahdi; Gharavian, Davood

2015-10-01

Artificial neural networks are efficient models in pattern recognition applications, but their performance is dependent on employing suitable structure and connection weights. This study used a hybrid method for obtaining the optimal weight set and architecture of a recurrent neural emotion classifier based on gravitational search algorithm (GSA) and its binary version (BGSA), respectively. By considering the features of speech signal that were related to prosody, voice quality, and spectrum, a rich feature set was constructed. To select more efficient features, a fast feature selection method was employed. The performance of the proposed hybrid GSA-BGSA method was compared with similar hybrid methods based on particle swarm optimisation (PSO) algorithm and its binary version, PSO and discrete firefly algorithm, and hybrid of error back-propagation and genetic algorithm that were used for optimisation. Experimental tests on Berlin emotional database demonstrated the superior performance of the proposed method using a lighter network structure.

Research on particle swarm optimization algorithm based on optimal movement probability

NASA Astrophysics Data System (ADS)

Ma, Jianhong; Zhang, Han; He, Baofeng

2017-01-01

The particle swarm optimization algorithm to improve the control precision, and has great application value training neural network and fuzzy system control fields etc.The traditional particle swarm algorithm is used for the training of feed forward neural networks,the search efficiency is low, and easy to fall into local convergence.An improved particle swarm optimization algorithm is proposed based on error back propagation gradient descent. Particle swarm optimization for Solving Least Squares Problems to meme group, the particles in the fitness ranking, optimization problem of the overall consideration, the error back propagation gradient descent training BP neural network, particle to update the velocity and position according to their individual optimal and global optimization, make the particles more to the social optimal learning and less to its optimal learning, it can avoid the particles fall into local optimum, by using gradient information can accelerate the PSO local search ability, improve the multi beam particle swarm depth zero less trajectory information search efficiency, the realization of improved particle swarm optimization algorithm. Simulation results show that the algorithm in the initial stage of rapid convergence to the global optimal solution can be near to the global optimal solution and keep close to the trend, the algorithm has faster convergence speed and search performance in the same running time, it can improve the convergence speed of the algorithm, especially the later search efficiency.

Cultural-based particle swarm for dynamic optimisation problems

NASA Astrophysics Data System (ADS)

Daneshyari, Moayed; Yen, Gary G.

2012-07-01

Many practical optimisation problems are with the existence of uncertainties, among which a significant number belong to the dynamic optimisation problem (DOP) category in which the fitness function changes through time. In this study, we propose the cultural-based particle swarm optimisation (PSO) to solve DOP problems. A cultural framework is adopted incorporating the required information from the PSO into five sections of the belief space, namely situational, temporal, domain, normative and spatial knowledge. The stored information will be adopted to detect the changes in the environment and assists response to the change through a diversity-based repulsion among particles and migration among swarms in the population space, and also helps in selecting the leading particles in three different levels, personal, swarm and global levels. Comparison of the proposed heuristics over several difficult dynamic benchmark problems demonstrates the better or equal performance with respect to most of other selected state-of-the-art dynamic PSO heuristics.

Observatory data and the Swarm mission

NASA Astrophysics Data System (ADS)

Macmillan, S.; Olsen, N.

2013-11-01

The ESA Swarm mission to identify and measure very accurately the different magnetic signals that arise in the Earth's core, mantle, crust, oceans, ionosphere and magnetosphere, which together form the magnetic field around the Earth, has increased interest in magnetic data collected on the surface of the Earth at observatories. The scientific use of Swarm data and Swarm-derived products is greatly enhanced by combination with observatory data and indices. As part of the Swarm Level-2 data activities plans are in place to distribute such ground-based data along with the Swarm data as auxiliary data products. We describe here the preparation of the data set of ground observatory hourly mean values, including procedures to check and select observatory data spanning the modern magnetic survey satellite era. We discuss other possible combined uses of satellite and observatory data, in particular those that may use higher cadence 1-second and 1-minute data from observatories.

Multiscale Modelling and Analysis of Collective Decision Making in Swarm Robotics

PubMed Central

Vigelius, Matthias; Meyer, Bernd; Pascoe, Geoffrey

2014-01-01

We present a unified approach to describing certain types of collective decision making in swarm robotics that bridges from a microscopic individual-based description to aggregate properties. Our approach encompasses robot swarm experiments, microscopic and probabilistic macroscopic-discrete simulations as well as an analytic mathematical model. Following up on previous work, we identify the symmetry parameter, a measure of the progress of the swarm towards a decision, as a fundamental integrated swarm property and formulate its time evolution as a continuous-time Markov process. Contrary to previous work, which justified this approach only empirically and a posteriori, we justify it from first principles and derive hard limits on the parameter regime in which it is applicable. PMID:25369026

A Markov Chain Approach to Probabilistic Swarm Guidance

NASA Technical Reports Server (NTRS)

Acikmese, Behcet; Bayard, David S.

2012-01-01

This paper introduces a probabilistic guidance approach for the coordination of swarms of autonomous agents. The main idea is to drive the swarm to a prescribed density distribution in a prescribed region of the configuration space. In its simplest form, the probabilistic approach is completely decentralized and does not require communication or collabo- ration between agents. Agents make statistically independent probabilistic decisions based solely on their own state, that ultimately guides the swarm to the desired density distribution in the configuration space. In addition to being completely decentralized, the probabilistic guidance approach has a novel autonomous self-repair property: Once the desired swarm density distribution is attained, the agents automatically repair any damage to the distribution without collaborating and without any knowledge about the damage.

A Winner Determination Algorithm for Combinatorial Auctions Based on Hybrid Artificial Fish Swarm Algorithm

NASA Astrophysics Data System (ADS)

Zheng, Genrang; Lin, ZhengChun

The problem of winner determination in combinatorial auctions is a hotspot electronic business, and a NP hard problem. A Hybrid Artificial Fish Swarm Algorithm(HAFSA), which is combined with First Suite Heuristic Algorithm (FSHA) and Artificial Fish Swarm Algorithm (AFSA), is proposed to solve the problem after probing it base on the theories of AFSA. Experiment results show that the HAFSA is a rapidly and efficient algorithm for The problem of winner determining. Compared with Ant colony Optimization Algorithm, it has a good performance with broad and prosperous application.

A comprehensive overview of the applications of artificial life.

PubMed

Kim, Kyung-Joong; Cho, Sung-Bae

2006-01-01

We review the applications of artificial life (ALife), the creation of synthetic life on computers to study, simulate, and understand living systems. The definition and features of ALife are shown by application studies. ALife application fields treated include robot control, robot manufacturing, practical robots, computer graphics, natural phenomenon modeling, entertainment, games, music, economics, Internet, information processing, industrial design, simulation software, electronics, security, data mining, and telecommunications. In order to show the status of ALife application research, this review primarily features a survey of about 180 ALife application articles rather than a selected representation of a few articles. Evolutionary computation is the most popular method for designing such applications, but recently swarm intelligence, artificial immune network, and agent-based modeling have also produced results. Applications were initially restricted to the robotics and computer graphics, but presently, many different applications in engineering areas are of interest.

Fireworks Algorithm with Enhanced Fireworks Interaction.

PubMed

Zhang, Bei; Zheng, Yu-Jun; Zhang, Min-Xia; Chen, Sheng-Yong

2017-01-01

As a relatively new metaheuristic in swarm intelligence, fireworks algorithm (FWA) has exhibited promising performance on a wide range of optimization problems. This paper aims to improve FWA by enhancing fireworks interaction in three aspects: 1) Developing a new Gaussian mutation operator to make sparks learn from more exemplars; 2) Integrating the regular explosion operator of FWA with the migration operator of biogeography-based optimization (BBO) to increase information sharing; 3) Adopting a new population selection strategy that enables high-quality solutions to have high probabilities of entering the next generation without incurring high computational cost. The combination of the three strategies can significantly enhance fireworks interaction and thus improve solution diversity and suppress premature convergence. Numerical experiments on the CEC 2015 single-objective optimization test problems show the effectiveness of the proposed algorithm. The application to a high-speed train scheduling problem also demonstrates its feasibility in real-world optimization problems.

Intelligent control for PMSM based on online PSO considering parameters change

NASA Astrophysics Data System (ADS)

Song, Zhengqiang; Yang, Huiling

2018-03-01

A novel online particle swarm optimization method is proposed to design speed and current controllers of vector controlled interior permanent magnet synchronous motor drives considering stator resistance variation. In the proposed drive system, the space vector modulation technique is employed to generate the switching signals for a two-level voltage-source inverter. The nonlinearity of the inverter is also taken into account due to the dead-time, threshold and voltage drop of the switching devices in order to simulate the system in the practical condition. Speed and PI current controller gains are optimized with PSO online, and the fitness function is changed according to the system dynamic and steady states. The proposed optimization algorithm is compared with conventional PI control method in the condition of step speed change and stator resistance variation, showing that the proposed online optimization method has better robustness and dynamic characteristics compared with conventional PI controller design.

Particle Swarm Transport across the Fracture-Matrix Interface

NASA Astrophysics Data System (ADS)

Malenda, M. G.; Pyrak-Nolte, L. J.

2016-12-01

A fundamental understanding of particle transport is required for many diverse applications such as effective proppant injection, for deployment of subsurface imaging micro-particles, and for removal of particulate contaminants from subsurface water systems. One method of particulate transport is the use of particle swarms that act as coherent entities. Previous work found that particle swarms travel farther and faster in single fractures than individual particles when compared to dispersions and emulsions. In this study, gravity-driven experiments were performed to characterize swarm transport across the fracture-matrix interface. Synthetic porous media with a horizontal fracture were created from layers of square-packed 3D printed (PMMA) spherical grains (12 mm diameter). The minimum fracture aperture ranged from 0 - 10 mm. Swarms (5 and 25 µL) were composed of 3.2 micron diameter fluorescent polystryene beads (1-2% by mass). Swarms were released into a fractured porous medium that was submerged in water and was illuminated with a green (528 nm) LED array. Descending swarms were imaged with a CCD camera (2 fps). Whether an intact swarm was transported across a fracture depended on the volume of the swarm, the aperture of the fracture, and the alignment of pores on the two fracture walls. Large aperture fractures caused significant deceleration of a swarm because the swarm was free to expand laterally in the fracture. Swarms tended to remain intact when the pores on the two fracture walls were vertically aligned and traveled in the lower porous medium with speeds that were 30%-50% of their original speed in the upper matrix. When the pores on opposing walls were no longer aligned, swarms were observed to bifurcate around the grain into two smaller slower-moving swarms. Understanding the physics of particle swarms in fractured porous media has important implications for enhancing target particulate injection into the subsurface as well as for contaminant particulate transport. Acknowledgment: This material is based upon work supported by the U.S. Department of Energy, Office of Science, Office of Basic Energy Sciences, Geosciences Research Program under Award Number (DE-FG02-09ER16022) and by National Science Foundation REU program under Award Number (PHY-1460899) at Purdue University.

New evidence of mating swarms of the malaria vector, Anopheles arabiensis in Tanzania

PubMed Central

Kaindoa, Emmanuel W.; Ngowo, Halfan S.; Limwagu, Alex; Mkandawile, Gustav; Kihonda, Japhet; Masalu, John Paliga; Bwanary, Hamis; Diabate, Abdoulaye; Okumu, Fredros O.

2017-01-01

Background: Malaria mosquitoes form mating swarms around sunset, often at the same locations for months or years. Unfortunately, studies of Anopheles swarms are rare in East Africa, the last recorded field observations in Tanzania having been in 1983. Methods: Mosquito swarms were surveyed by trained volunteers between August-2016 and June-2017 in Ulanga district, Tanzania. Identified Anopheles swarms were sampled using sweep nets, and collected mosquitoes killed by refrigeration then identified by sex and taxa. Sub-samples were further identified by PCR, and spermatheca of females examined for mating status. Mosquito ages were estimated by observing female ovarian tracheoles and rotation of male genitalia. GPS locations, types of swarm markers, start/end times of swarming, heights above ground, mosquito counts/swarm, and copulation events were recorded. Results: A total of 216 Anopheles swarms were identified, characterized and mapped, from which 7,142 Anopheles gambiae s.l and 13 Anopheles funestus were sampled. The An. gambiae s.l were 99.6% males and 0.4% females, while the An. funestus were all males. Of all An. gambiae s.l analyzed by PCR, 86.7% were An. arabiensis, while 13.3% returned non-amplified DNA. Mean height (±SD) of swarms was 2.74±0.64m, and median duration was 20 (IQR; 15-25) minutes. Confirmed swarm markers included rice fields (25.5%), burned grounds (17.2%), banana trees (13%), brick piles (8.8%), garbage heaps (7.9%) and ant-hills (7.4%). Visual estimates of swarm sizes by the volunteers was strongly correlated to actual sizes by sweep nets (R=0.94; P=<0.001). All females examined were nulliparous and 95.6% [N=6787] of males had rotated genitalia, indicating sexual maturity. Conclusions: This is the first report of Anopheles swarms in Tanzania in more than three decades. The study demonstrates that the swarms can be identified and characterized by trained community-based volunteers, and highlights potential new interventions, for example targeted aerosol spraying of the swarms to improve malaria control. PMID:29184918

Geodynamic Setting of Proterozoic Dyke Swarms of the Leo-Man Craton, West Africa, Based on New U-Pb Dating and Geochemistry

NASA Astrophysics Data System (ADS)

Baratoux, L.; Jessell, M.; Söderlund, U.; Ernst, R. E.; Benoit, M.; Naba, S.; Cournede, C.; Perrouty, S.; Metelka, V.; Yatte, D.; Diallo, D. P.; Ndiaye, P. M.; Dioh, E.; Baratoux, D.

2016-12-01

Over 20 sets of dolerite dykes crosscutting Paleoproterozoic basement in West Africa were distinguished via the interpretation of regional and high-resolution airborne magnetic data available over the West African Craton. Some of the dykes reach over 300 km in length and are considered parts of much larger systems of mafic dyke swarms which form the plumbing system of Large Igneous Provinces (LIPs). Five different dyke swarms in Burkina Faso, Niger, Ghana and Senegal were investigated. In terms of petrography and composition, the mafic dykes correspond to tholeiitic basalts and are typically composed of plagioclase + clinopyroxene ± orthopyroxene ± olivine. They display a doleritic texture of variable grain size. Eleven ID-TIMS U-Pb ages obtained on baddeleyite define five generations of Proterozoic age. The N10 Libiri dyke swarm, found in western Niger, yielded an age of ca. 1790 Ma. The N40 Bassari swarm in Senegal was dated at ca. 1764 Ma, and is potentially linked to the 1790 Ma Libiri swarm, 1400 km away. The 300 by 400 km Korsimoro N100 dyke swarm transects central Burkina Faso and was dated at ca. 1575 Ma. Five ca. 1520 Ma ages were obtained for dykes of the Essakane swarm, three in Burkina Faso, one from Ghana (N130 orientation) and one from Senegal (E-W orientation), and document a large extent (600 km wide and 1500 km long) and short duration of dyke emplacement. The Manso N350 dyke swarm in southern Ghana, which is about 400 km long and about 200 km wide, yields a preliminary age of ca 870 Ma. A mantle plume origin is suggested for these swarms, especially the 1790-1765 Ma Libiri-Bassari swarm and the 1520 Ma Essakane swarms (which have lithosphere-contaminated E-MORB chemistry), whose scale is similar to largest giant radiating swarms (e.g. CAMP and Mackenzie). The 870 Ma Manso swarm has composition closer to OIB, consistent with a plume/hotspot origin. The 1575 Ma Korsimoro swarm has composition between EMORB and NMORB, which suggests a rift setting.

The Dynamics of Interacting Swarms

DTIC Science & Technology

2018-04-04

Unlimited 16 Ira Schwartzt (202) 404-8359 Swarms are self-organized dynamical coupled agents which evolve from simple rules of communication. They are ...when delay is introduced to the communicating agents. One of our major findings is that interacting swarms are far less likely to flock cohesively if...they are coupled with delay. In addition, parameter ranges based on coupling strength, incidence angle of collision, and delay change dramatically

Optimal configuration of power grid sources based on optimal particle swarm algorithm

NASA Astrophysics Data System (ADS)

Wen, Yuanhua

2018-04-01

In order to optimize the distribution problem of power grid sources, an optimized particle swarm optimization algorithm is proposed. First, the concept of multi-objective optimization and the Pareto solution set are enumerated. Then, the performance of the classical genetic algorithm, the classical particle swarm optimization algorithm and the improved particle swarm optimization algorithm are analyzed. The three algorithms are simulated respectively. Compared with the test results of each algorithm, the superiority of the algorithm in convergence and optimization performance is proved, which lays the foundation for subsequent micro-grid power optimization configuration solution.

A Mission Planning Approach for Precision Farming Systems Based on Multi-Objective Optimization.

PubMed

Zhai, Zhaoyu; Martínez Ortega, José-Fernán; Lucas Martínez, Néstor; Rodríguez-Molina, Jesús

2018-06-02

As the demand for food grows continuously, intelligent agriculture has drawn much attention due to its capability of producing great quantities of food efficiently. The main purpose of intelligent agriculture is to plan agricultural missions properly and use limited resources reasonably with minor human intervention. This paper proposes a Precision Farming System (PFS) as a Multi-Agent System (MAS). Components of PFS are treated as agents with different functionalities. These agents could form several coalitions to complete the complex agricultural missions cooperatively. In PFS, mission planning should consider several criteria, like expected benefit, energy consumption or equipment loss. Hence, mission planning could be treated as a Multi-objective Optimization Problem (MOP). In order to solve MOP, an improved algorithm, MP-PSOGA, is proposed, taking advantages of the Genetic Algorithms and Particle Swarm Optimization. A simulation, called precise pesticide spraying mission, is performed to verify the feasibility of the proposed approach. Simulation results illustrate that the proposed approach works properly. This approach enables the PFS to plan missions and allocate scarce resources efficiently. The theoretical analysis and simulation is a good foundation for the future study. Once the proposed approach is applied to a real scenario, it is expected to bring significant economic improvement.

Multiswarm comprehensive learning particle swarm optimization for solving multiobjective optimization problems.

PubMed

Yu, Xiang; Zhang, Xueqing

2017-01-01

Comprehensive learning particle swarm optimization (CLPSO) is a powerful state-of-the-art single-objective metaheuristic. Extending from CLPSO, this paper proposes multiswarm CLPSO (MSCLPSO) for multiobjective optimization. MSCLPSO involves multiple swarms, with each swarm associated with a separate original objective. Each particle's personal best position is determined just according to the corresponding single objective. Elitists are stored externally. MSCLPSO differs from existing multiobjective particle swarm optimizers in three aspects. First, each swarm focuses on optimizing the associated objective using CLPSO, without learning from the elitists or any other swarm. Second, mutation is applied to the elitists and the mutation strategy appropriately exploits the personal best positions and elitists. Third, a modified differential evolution (DE) strategy is applied to some extreme and least crowded elitists. The DE strategy updates an elitist based on the differences of the elitists. The personal best positions carry useful information about the Pareto set, and the mutation and DE strategies help MSCLPSO discover the true Pareto front. Experiments conducted on various benchmark problems demonstrate that MSCLPSO can find nondominated solutions distributed reasonably over the true Pareto front in a single run.

Collective motion of predictive swarms

PubMed Central

Vural, Dervis Can

2017-01-01

Theoretical models of populations and swarms typically start with the assumption that the motion of agents is governed by the local stimuli. However, an intelligent agent, with some understanding of the laws that govern its habitat, can anticipate the future, and make predictions to gather resources more efficiently. Here we study a specific model of this kind, where agents aim to maximize their consumption of a diffusing resource, by attempting to predict the future of a resource field and the actions of other agents. Once the agents make a prediction, they are attracted to move towards regions that have, and will have, denser resources. We find that the further the agents attempt to see into the future, the more their attempts at prediction fail, and the less resources they consume. We also study the case where predictive agents compete against non-predictive agents and find the predictors perform better than the non-predictors only when their relative numbers are very small. We conclude that predictivity pays off either when the predictors do not see too far into the future or the number of predictors is small. PMID:29065136

Collective motion of predictive swarms.

PubMed

Rupprecht, Nathaniel; Vural, Dervis Can

2017-01-01

Theoretical models of populations and swarms typically start with the assumption that the motion of agents is governed by the local stimuli. However, an intelligent agent, with some understanding of the laws that govern its habitat, can anticipate the future, and make predictions to gather resources more efficiently. Here we study a specific model of this kind, where agents aim to maximize their consumption of a diffusing resource, by attempting to predict the future of a resource field and the actions of other agents. Once the agents make a prediction, they are attracted to move towards regions that have, and will have, denser resources. We find that the further the agents attempt to see into the future, the more their attempts at prediction fail, and the less resources they consume. We also study the case where predictive agents compete against non-predictive agents and find the predictors perform better than the non-predictors only when their relative numbers are very small. We conclude that predictivity pays off either when the predictors do not see too far into the future or the number of predictors is small.

Optimizing Blasting’s Air Overpressure Prediction Model using Swarm Intelligence

NASA Astrophysics Data System (ADS)

Nur Asmawisham Alel, Mohd; Ruben Anak Upom, Mark; Asnida Abdullah, Rini; Hazreek Zainal Abidin, Mohd

2018-04-01

Air overpressure (AOp) resulting from blasting can cause damage and nuisance to nearby civilians. Thus, it is important to be able to predict AOp accurately. In this study, 8 different Artificial Neural Network (ANN) were developed for the purpose of prediction of AOp. The ANN models were trained using different variants of Particle Swarm Optimization (PSO) algorithm. AOp predictions were also made using an empirical equation, as suggested by United States Bureau of Mines (USBM), to serve as a benchmark. In order to develop the models, 76 blasting operations in Hulu Langat were investigated. All the ANN models were found to outperform the USBM equation in three performance metrics; root mean square error (RMSE), mean absolute percentage error (MAPE) and coefficient of determination (R2). Using a performance ranking method, MSO-Rand-Mut was determined to be the best prediction model for AOp with a performance metric of RMSE=2.18, MAPE=1.73% and R2=0.97. The result shows that ANN models trained using PSO are capable of predicting AOp with great accuracy.

Swarmic autopoiesis and computational creativity

NASA Astrophysics Data System (ADS)

al-Rifaie, Mohammad Majid; Leymarie, Frédéric Fol; Latham, William; Bishop, Mark

2017-10-01

In this paper two swarm intelligence algorithms are used, the first leading the "attention" of the swarm and the latter responsible for the tracing mechanism. The attention mechanism is coordinated by agents of Stochastic Diffusion Search where they selectively attend to areas of a digital canvas (with line drawings) which contains (sharper) corners. Once the swarm's attention is drawn to the line of interest with a sharp corner, the corresponding line segment is fed into the tracing algorithm, Dispersive Flies Optimisation which "consumes" the input in order to generate a "swarmic sketch" of the input line. The sketching process is the result of the "flies" leaving traces of their movements on the digital canvas which are then revisited repeatedly in an attempt to re-sketch the traces they left. This cyclic process is then introduced in the context of autopoiesis, where the philosophical aspects of the autopoietic artist are discussed. The autopoetic artist is described in two modalities: gluttonous and contented. In the Gluttonous Autopoietic Artist mode, by iteratively focussing on areas-of-rich-complexity, as the decoding process of the input sketch unfolds, it leads to a less complex structure which ultimately results in an empty canvas; therein reifying the artwork's "death". In the Contented Autopoietic Artist mode, by refocussing the autopoietic artist's reflections on "meaning" onto different constitutive elements, and modifying her reconstitution, different behaviours of autopoietic creativity can be induced and therefore, the autopoietic processes become less likely to fade away and more open-ended in their creative endeavour.

Bioinspired Principles for Large-Scale Networked Sensor Systems: An Overview

PubMed Central

Jacobsen, Rune Hylsberg; Zhang, Qi; Toftegaard, Thomas Skjødeberg

2011-01-01

Biology has often been used as a source of inspiration in computer science and engineering. Bioinspired principles have found their way into network node design and research due to the appealing analogies between biological systems and large networks of small sensors. This paper provides an overview of bioinspired principles and methods such as swarm intelligence, natural time synchronization, artificial immune system and intercellular information exchange applicable for sensor network design. Bioinspired principles and methods are discussed in the context of routing, clustering, time synchronization, optimal node deployment, localization and security and privacy. PMID:22163841

Probabilistic Swarm Guidance using Optimal Transport

DTIC Science & Technology

2014-10-10

controlled to collectively exhibit useful emergent behavior [2]–[5]. Similarly, swarms of hundreds to thousands of femtosatellites (100-gram-class...algorithm using inhomo- geneous Markov chains (PSG– IMC ), each agent chooses the tuning parameter (ξjk) based on the Hellinger distance (HD) between the...PGA and PSG– IMC in the next section. B. Simulation Results We now present the setup of this simulation example. The swarm containing m = 5000 agents is

Improved Performance of Loop-Mediated Isothermal Amplification Assays via Swarm Priming.

PubMed

Martineau, Rhett L; Murray, Sarah A; Ci, Shufang; Gao, Weimin; Chao, Shih-Hui; Meldrum, Deirdre R

2017-01-03

This work describes an enhancement to the loop-mediated isothermal amplification (LAMP) reaction which results in improved performance. Enhancement is achieved by adding a new set of primers to conventional LAMP reactions. These primers are termed "swarm primers" based on their relatively high concentration and their ability to create new amplicons despite the theoretical lack of single-stranded annealing sites. The primers target a region upstream of the FIP/BIP primer recognition sequences on opposite strands, substantially overlapping F1/B1 sites. Thus, despite the addition of a new primer set to an already complex assay, no significant increase in assay complexity is incurred. Swarm priming is presented for three DNA templates: Lambda phage, Synechocystis sp. PCC 6803 rbcL gene, and human HFE. The results of adding swarm primers to conventional LAMP reactions include increased amplification speed, increased indicator contrast, and increased reaction products. For at least one template, minor improvements in assay repeatability are also shown. In addition, swarm priming is shown to be effective at increasing the reaction speed for RNA amplification via RT-LAMP. Collectively, these results suggest that the addition of swarm primers will likely benefit most if not all existing LAMP assays based on state-of-the-art, six-primer reactions.

A Modified Distributed Bees Algorithm for Multi-Sensor Task Allocation.

PubMed

Tkach, Itshak; Jevtić, Aleksandar; Nof, Shimon Y; Edan, Yael

2018-03-02

Multi-sensor systems can play an important role in monitoring tasks and detecting targets. However, real-time allocation of heterogeneous sensors to dynamic targets/tasks that are unknown a priori in their locations and priorities is a challenge. This paper presents a Modified Distributed Bees Algorithm (MDBA) that is developed to allocate stationary heterogeneous sensors to upcoming unknown tasks using a decentralized, swarm intelligence approach to minimize the task detection times. Sensors are allocated to tasks based on sensors' performance, tasks' priorities, and the distances of the sensors from the locations where the tasks are being executed. The algorithm was compared to a Distributed Bees Algorithm (DBA), a Bees System, and two common multi-sensor algorithms, market-based and greedy-based algorithms, which were fitted for the specific task. Simulation analyses revealed that MDBA achieved statistically significant improved performance by 7% with respect to DBA as the second-best algorithm, and by 19% with respect to Greedy algorithm, which was the worst, thus indicating its fitness to provide solutions for heterogeneous multi-sensor systems.

A Modified Distributed Bees Algorithm for Multi-Sensor Task Allocation †

PubMed Central

Nof, Shimon Y.; Edan, Yael

2018-01-01

Multi-sensor systems can play an important role in monitoring tasks and detecting targets. However, real-time allocation of heterogeneous sensors to dynamic targets/tasks that are unknown a priori in their locations and priorities is a challenge. This paper presents a Modified Distributed Bees Algorithm (MDBA) that is developed to allocate stationary heterogeneous sensors to upcoming unknown tasks using a decentralized, swarm intelligence approach to minimize the task detection times. Sensors are allocated to tasks based on sensors’ performance, tasks’ priorities, and the distances of the sensors from the locations where the tasks are being executed. The algorithm was compared to a Distributed Bees Algorithm (DBA), a Bees System, and two common multi-sensor algorithms, market-based and greedy-based algorithms, which were fitted for the specific task. Simulation analyses revealed that MDBA achieved statistically significant improved performance by 7% with respect to DBA as the second-best algorithm, and by 19% with respect to Greedy algorithm, which was the worst, thus indicating its fitness to provide solutions for heterogeneous multi-sensor systems. PMID:29498683

Improving maximum power point tracking of partially shaded photovoltaic system by using IPSO-BELBIC

NASA Astrophysics Data System (ADS)

Al-Alim El-Garhy, M. Abd; Mubarak, R. I.; El-Bably, M.

2017-08-01

Solar photovoltaic (PV) arrays in remote applications are often related to the rapid changes in the partial shading pattern. Rapid changes of the partial shading pattern make the tracking of maximum power point (MPP) of the global peak through the local ones too difficult. An essential need to make a fast and efficient algorithm to detect the peaks values which always vary as the sun irradiance changes. This paper presents two algorithms based on the improved particle swarm optimization technique one of them with PID controller (IPSO-PID), and the other one with Brain Emotional Learning Based Intelligent Controller (IPSO-BELBIC). These techniques improve the maximum power point (MPP) tracking capabilities for photovoltaic (PV) system under partial shading circumstances. The main aim of these improved algorithms is to accelerate the velocity of IPSO to reach to (MPP) and increase its efficiency. These algorithms also improve the tracking time under complex irradiance conditions. Based on these conditions, the tracking time of these presented techniques improves to 2 msec, with an efficiency of 100%.

Cooperative Search and Rescue with Artificial Fishes Based on Fish-Swarm Algorithm for Underwater Wireless Sensor Networks

PubMed Central

Zhao, Wei; Tang, Zhenmin; Yang, Yuwang; Wang, Lei; Lan, Shaohua

2014-01-01

This paper presents a searching control approach for cooperating mobile sensor networks. We use a density function to represent the frequency of distress signals issued by victims. The mobile nodes' moving in mission space is similar to the behaviors of fish-swarm in water. So, we take the mobile node as artificial fish node and define its operations by a probabilistic model over a limited range. A fish-swarm based algorithm is designed requiring local information at each fish node and maximizing the joint detection probabilities of distress signals. Optimization of formation is also considered for the searching control approach and is optimized by fish-swarm algorithm. Simulation results include two schemes: preset route and random walks, and it is showed that the control scheme has adaptive and effective properties. PMID:24741341

Cooperative search and rescue with artificial fishes based on fish-swarm algorithm for underwater wireless sensor networks.

PubMed

Zhao, Wei; Tang, Zhenmin; Yang, Yuwang; Wang, Lei; Lan, Shaohua

2014-01-01

This paper presents a searching control approach for cooperating mobile sensor networks. We use a density function to represent the frequency of distress signals issued by victims. The mobile nodes' moving in mission space is similar to the behaviors of fish-swarm in water. So, we take the mobile node as artificial fish node and define its operations by a probabilistic model over a limited range. A fish-swarm based algorithm is designed requiring local information at each fish node and maximizing the joint detection probabilities of distress signals. Optimization of formation is also considered for the searching control approach and is optimized by fish-swarm algorithm. Simulation results include two schemes: preset route and random walks, and it is showed that the control scheme has adaptive and effective properties.

Composite Particle Swarm Optimizer With Historical Memory for Function Optimization.

PubMed

Li, Jie; Zhang, JunQi; Jiang, ChangJun; Zhou, MengChu

2015-10-01

Particle swarm optimization (PSO) algorithm is a population-based stochastic optimization technique. It is characterized by the collaborative search in which each particle is attracted toward the global best position (gbest) in the swarm and its own best position (pbest). However, all of particles' historical promising pbests in PSO are lost except their current pbests. In order to solve this problem, this paper proposes a novel composite PSO algorithm, called historical memory-based PSO (HMPSO), which uses an estimation of distribution algorithm to estimate and preserve the distribution information of particles' historical promising pbests. Each particle has three candidate positions, which are generated from the historical memory, particles' current pbests, and the swarm's gbest. Then the best candidate position is adopted. Experiments on 28 CEC2013 benchmark functions demonstrate the superiority of HMPSO over other algorithms.

An External Archive-Guided Multiobjective Particle Swarm Optimization Algorithm.

PubMed

Zhu, Qingling; Lin, Qiuzhen; Chen, Weineng; Wong, Ka-Chun; Coello Coello, Carlos A; Li, Jianqiang; Chen, Jianyong; Zhang, Jun

2017-09-01

The selection of swarm leaders (i.e., the personal best and global best), is important in the design of a multiobjective particle swarm optimization (MOPSO) algorithm. Such leaders are expected to effectively guide the swarm to approach the true Pareto optimal front. In this paper, we present a novel external archive-guided MOPSO algorithm (AgMOPSO), where the leaders for velocity update are all selected from the external archive. In our algorithm, multiobjective optimization problems (MOPs) are transformed into a set of subproblems using a decomposition approach, and then each particle is assigned accordingly to optimize each subproblem. A novel archive-guided velocity update method is designed to guide the swarm for exploration, and the external archive is also evolved using an immune-based evolutionary strategy. These proposed approaches speed up the convergence of AgMOPSO. The experimental results fully demonstrate the superiority of our proposed AgMOPSO in solving most of the test problems adopted, in terms of two commonly used performance measures. Moreover, the effectiveness of our proposed archive-guided velocity update method and immune-based evolutionary strategy is also experimentally validated on more than 30 test MOPs.

Fluid-faulting interactions: Fracture-mesh and fault-valve behavior in the February 2014 Mammoth Mountain, California, earthquake swarm

USGS Publications Warehouse

Shelly, David R.; Taira, Taka’aki; Prejean, Stephanie; Hill, David P.; Dreger, Douglas S.

2015-01-01

Faulting and fluid transport in the subsurface are highly coupled processes, which may manifest seismically as earthquake swarms. A swarm in February 2014 beneath densely monitored Mammoth Mountain, California, provides an opportunity to witness these interactions in high resolution. Toward this goal, we employ massive waveform-correlation-based event detection and relative relocation, which quadruples the swarm catalog to more than 6000 earthquakes and produces high-precision locations even for very small events. The swarm's main seismic zone forms a distributed fracture mesh, with individual faults activated in short earthquake bursts. The largest event of the sequence, M 3.1, apparently acted as a fault valve and was followed by a distinct wave of earthquakes propagating ~1 km westward from the updip edge of rupture, 1–2 h later. Late in the swarm, multiple small, shallower subsidiary faults activated with pronounced hypocenter migration, suggesting that a broader fluid pressure pulse propagated through the subsurface.

Dynamic Triggering of Seismic Events and Their Relation to Slow Slip in Interior Alaska

NASA Astrophysics Data System (ADS)

Sims, N. E.; Holtkamp, S. G.

2017-12-01

We conduct a search for dynamically triggered events in the Minto Flats Fault Zone (MFFZ), a left-lateral strike-slip zone expressed as multiple, partially overlapping faults, in central Alaska. We focus on the MFFZ because we have observed slow slip processes (earthquake swarms and Very Low Frequency Earthquakes) and interaction between earthquake swarms and larger main-shock (MS) events in this area before. We utilize the Alaska Earthquake Center catalog to identify potential earthquake swarms and dynamically triggered foreshock and mainshock events along the fault zone. We find 30 swarms occurring in the last two decades, five of which we classify as foreshock (FS) swarms due to their close proximity in both time and space to MS events. Many of the earthquake swarms cluster around 15-20 km depth, which is near the seismic-aseismic transition along this fault zone. Additionally, we observe instances of large teleseismic events such as the M8.6 2012 Sumatra earthquake and M7.4 2012 Guatemala earthquake triggering seismic events within the MFFZ, with the Sumatra earthquake triggering a mainshock event that was preceded by an ongoing earthquake swarm and the Guatemala event triggering earthquake swarms that subsequently transition into a larger mainshock event. In both cases an earthquake swarm transitioned into a mainshock-aftershock event and activity continued for several days after the teleseismic waves had passed, lending some evidence to delayed dynamic triggering of seismic events. We hypothesize that large dynamic transient strain associated with the passage of teleseismic surface waves is triggering slow slip processes near the base of the seismogenic zone. These triggered aseismic transient events result in earthquake swarms, which sometimes lead to the nucleation of larger earthquakes. We utilize network matched filtering to build more robust catalogs of swarm earthquake families in this region to search for additional swarm-like or triggered activity in response to teleseismic surface waves, and to test dynamic triggering hypotheses.

Pulmonary Nodule Recognition Based on Multiple Kernel Learning Support Vector Machine-PSO

PubMed Central

Zhu, Zhichuan; Zhao, Qingdong; Liu, Liwei; Zhang, Lijuan

2018-01-01

Pulmonary nodule recognition is the core module of lung CAD. The Support Vector Machine (SVM) algorithm has been widely used in pulmonary nodule recognition, and the algorithm of Multiple Kernel Learning Support Vector Machine (MKL-SVM) has achieved good results therein. Based on grid search, however, the MKL-SVM algorithm needs long optimization time in course of parameter optimization; also its identification accuracy depends on the fineness of grid. In the paper, swarm intelligence is introduced and the Particle Swarm Optimization (PSO) is combined with MKL-SVM algorithm to be MKL-SVM-PSO algorithm so as to realize global optimization of parameters rapidly. In order to obtain the global optimal solution, different inertia weights such as constant inertia weight, linear inertia weight, and nonlinear inertia weight are applied to pulmonary nodules recognition. The experimental results show that the model training time of the proposed MKL-SVM-PSO algorithm is only 1/7 of the training time of the MKL-SVM grid search algorithm, achieving better recognition effect. Moreover, Euclidean norm of normalized error vector is proposed to measure the proximity between the average fitness curve and the optimal fitness curve after convergence. Through statistical analysis of the average of 20 times operation results with different inertial weights, it can be seen that the dynamic inertial weight is superior to the constant inertia weight in the MKL-SVM-PSO algorithm. In the dynamic inertial weight algorithm, the parameter optimization time of nonlinear inertia weight is shorter; the average fitness value after convergence is much closer to the optimal fitness value, which is better than the linear inertial weight. Besides, a better nonlinear inertial weight is verified. PMID:29853983

Pulmonary Nodule Recognition Based on Multiple Kernel Learning Support Vector Machine-PSO.

PubMed

Li, Yang; Zhu, Zhichuan; Hou, Alin; Zhao, Qingdong; Liu, Liwei; Zhang, Lijuan

2018-01-01

Pulmonary nodule recognition is the core module of lung CAD. The Support Vector Machine (SVM) algorithm has been widely used in pulmonary nodule recognition, and the algorithm of Multiple Kernel Learning Support Vector Machine (MKL-SVM) has achieved good results therein. Based on grid search, however, the MKL-SVM algorithm needs long optimization time in course of parameter optimization; also its identification accuracy depends on the fineness of grid. In the paper, swarm intelligence is introduced and the Particle Swarm Optimization (PSO) is combined with MKL-SVM algorithm to be MKL-SVM-PSO algorithm so as to realize global optimization of parameters rapidly. In order to obtain the global optimal solution, different inertia weights such as constant inertia weight, linear inertia weight, and nonlinear inertia weight are applied to pulmonary nodules recognition. The experimental results show that the model training time of the proposed MKL-SVM-PSO algorithm is only 1/7 of the training time of the MKL-SVM grid search algorithm, achieving better recognition effect. Moreover, Euclidean norm of normalized error vector is proposed to measure the proximity between the average fitness curve and the optimal fitness curve after convergence. Through statistical analysis of the average of 20 times operation results with different inertial weights, it can be seen that the dynamic inertial weight is superior to the constant inertia weight in the MKL-SVM-PSO algorithm. In the dynamic inertial weight algorithm, the parameter optimization time of nonlinear inertia weight is shorter; the average fitness value after convergence is much closer to the optimal fitness value, which is better than the linear inertial weight. Besides, a better nonlinear inertial weight is verified.

Adaptive Remote-Sensing Techniques Implementing Swarms of Mobile Agents

DOE Office of Scientific and Technical Information (OSTI.GOV)

Asher, R.B.; Cameron, S.M.; Loubriel, G.M.

1998-11-25

In many situations, stand-off remote-sensing and hazard-interdiction techniques over realistic operational areas are often impractical "and difficult to characterize. An alternative approach is to implement an adap- tively deployable array of sensitive agent-specific devices. Our group has been studying the collective be- havior of an autonomous, multi-agent system applied to chedbio detection and related emerging threat applications, The current physics-based models we are using coordinate a sensor array for mukivanate sig- nal optimization and coverage as re,alized by a swarm of robots or mobile vehicles. These intelligent control systems integrate'glob"ally operating decision-making systems and locally cooperative learning neural net- worksmore » to enhance re+-timp operational responses to dynarnical environments examples of which include obstacle avoidance, res~onding to prevailing wind patterns, and overcoming other natural obscurants or in- terferences. Collectively',tkensor nefirons with simple properties, interacting according to basic community rules, can accomplish complex interconnecting functions such as generalization, error correction, pattern recognition, sensor fusion, and localization. Neural nets provide a greater degree of robusmess and fault tolerance than conventional systems in that minor variations or imperfections do not impair performance. The robotic platforms would be equipped with sensor devices that perform opticaI detection of biologicais in combination with multivariate chemical analysis tools based on genetic and neural network algorithms, laser-diode LIDAR analysis, ultra-wideband short-pulsed transmitting and receiving antennas, thermal im- a:ing sensors, and optical Communication technology providing robust data throughput pathways. Mission scenarios under consideration include ground penetrating radar (GPR) for detection of underground struc- tures, airborne systems, and plume migration and mitigation. We will describe our research in these areas anti give a status report on our progress.« less

EI competencies as a related but different characteristic than intelligence

PubMed Central

Boyatzis, Richard E.; Batista-Foguet, Joan M.; Fernández-i-Marín, Xavier; Truninger, Margarida

2015-01-01

Amid the swarm of debate about emotional intelligence (EI) among academics are claims that cognitive intelligence, or general mental ability (g), is a stronger predictor of life and work outcomes as well as the counter claims that EI is their strongest predictor. Nested within the tempest in a teapot are scientific questions as to what the relationship is between g and EI. Using a behavioral approach to EI, we examined the relationship of a parametric measure of g as the person’s GMAT scores and collected observations from others who live and work with the person as to the frequency of his or her EI behavior, as well as the person’s self-assessment. The results show that EI, as seen by others, is slightly related to g, especially for males with assessment from professional relations. Further, we found that cognitive competencies are more strongly related to GMAT than EI competencies. For observations from personal relationships or self-assessment, there is no relationship between EI and GMAT. Observations from professional relations reveal a positive relationship between cognitive competencies and GMAT and EI and GMAT for males, but a negative relationship between EI and GMAT for females. PMID:25713545

EI competencies as a related but different characteristic than intelligence.

PubMed

Boyatzis, Richard E; Batista-Foguet, Joan M; Fernández-I-Marín, Xavier; Truninger, Margarida

2015-01-01

Amid the swarm of debate about emotional intelligence (EI) among academics are claims that cognitive intelligence, or general mental ability (g), is a stronger predictor of life and work outcomes as well as the counter claims that EI is their strongest predictor. Nested within the tempest in a teapot are scientific questions as to what the relationship is between g and EI. Using a behavioral approach to EI, we examined the relationship of a parametric measure of g as the person's GMAT scores and collected observations from others who live and work with the person as to the frequency of his or her EI behavior, as well as the person's self-assessment. The results show that EI, as seen by others, is slightly related to g, especially for males with assessment from professional relations. Further, we found that cognitive competencies are more strongly related to GMAT than EI competencies. For observations from personal relationships or self-assessment, there is no relationship between EI and GMAT. Observations from professional relations reveal a positive relationship between cognitive competencies and GMAT and EI and GMAT for males, but a negative relationship between EI and GMAT for females.

Collective navigation of cargo-carrying swarms

PubMed Central

Shklarsh, Adi; Finkelshtein, Alin; Ariel, Gil; Kalisman, Oren; Ingham, Colin; Ben-Jacob, Eshel

2012-01-01

Much effort has been devoted to the study of swarming and collective navigation of micro-organisms, insects, fish, birds and other organisms, as well as multi-agent simulations and to the study of real robots. It is well known that insect swarms can carry cargo. The studies here are motivated by a less well-known phenomenon: cargo transport by bacteria swarms. We begin with a concise review of how bacteria swarms carry natural, micrometre-scale objects larger than the bacteria (e.g. fungal spores) as well as man-made beads and capsules (for drug delivery). A comparison of the trajectories of virtual beads in simulations (using different putative coupling between the virtual beads and the bacteria) with the observed trajectories of transported fungal spores implies the existence of adaptable coupling. Motivated by these observations, we devised new, multi-agent-based studies of cargo transport by agent swarms. As a first step, we extended previous modelling of collective navigation of simple bacteria-inspired agents in complex terrain, using three putative models of agent–cargo coupling. We found that cargo-carrying swarms can navigate efficiently in a complex landscape. We further investigated how the stability, elasticity and other features of agent–cargo bonds influence the collective motion and the transport of the cargo, and found sharp phase shifts and dual successful strategies for cargo delivery. Further understanding of such mechanisms may provide valuable clues to understand cargo-transport by smart swarms of other organisms as well as by man-made swarming robots. PMID:24312731

Seismological mechanism analysis of 2015 Luanxian swarm, Hebei province,China

NASA Astrophysics Data System (ADS)

Tan, Yipei; Liao, Xu; Ma, Hongsheng; Zhou, Longquan; Wang, Xingzhou

2017-04-01

The seismological mechanism of an earthquake swarm, a kind of seismic burst activity, means the physical and dynamic process in earthquakes triggering in the swarm. Here we focus on the seismological mechanism of 2015 Luanxian swarm in Hebei province, China. The process of digital seismic waveform data processing is divided into four steps. (1) Choose the three components waveform of earthquakes in the catalog as templates, and detect missing earthquakes by scanning the continues waveforms with matched filter technique. (2) Recalibrate P and S-wave phase arrival time using waveform cross-correlation phase detection technique to eliminate the artificial error in phase picking in the observation report made by Hebei seismic network, and then we obtain a more complete catalog and a more precise seismic phase report. (3) Relocate the earthquakes in the swarm using hypoDD based on phase arrival time we recalibrated, and analyze the characteristics of swarm epicenter migration based on the earthquake relocation result. (4) Detect whether there are repeating earthquakes activity using both waveform cross-correlation standard and whether rupture areas can overlapped. We finally detect 106 missing earthquakes in the swarm, 66 of them have the magnitude greater than ML0.0, include 2 greater than ML1.0. Relocation result shows that the epicenters of earthquakes in the swarm have a strip distribution in NE-SW direction, which indicates the seismogenic structure may be a NE-SW trending fault. The spatial-temporal distribution variation of epicenters in the swarm shows a kind of two stages linear migration characteristics, in which the first stage has appeared with a higher migration velocity as 1.2 km per day, and the velocity of the second step is 0.0024 km per day. According to the three basic models to explain the seismological mechanism of earthquake swarms: cascade model, slow slip model and fluid diffusion model, repeating earthquakes activity is difficult to explain by previous earthquakes stress triggering, however, it can be explained by continuing stress loading at the same asperity from fault slow slip. The phenomena of linear migration is more fitting slow slip model than the migration characteristics of fluid diffusion which satisfied diffusion equation. Comparing the phenomena we observed and the seismological mechanism models, we find that the Luanxian earthquake swarm may be associated with fault slow slip. Fault slow slip may play a role in Luanxian earthquake swarm triggering and sustained activity.

Alarm systems detect volcanic tremor and earthquake swarms during Redoubt eruption, 2009

NASA Astrophysics Data System (ADS)

Thompson, G.; West, M. E.

2009-12-01

We ran two alarm algorithms on real-time data from Redoubt volcano during the 2009 crisis. The first algorithm was designed to detect escalations in continuous seismicity (tremor). This is implemented within an application called IceWeb which computes reduced displacement, and produces plots of reduced displacement and spectrograms linked to the Alaska Volcano Observatory internal webpage every 10 minutes. Reduced displacement is a measure of the amplitude of volcanic tremor, and is computed by applying a geometrical spreading correction to a displacement seismogram. When the reduced displacement at multiple stations exceeds pre-defined thresholds and there has been a factor of 3 increase in reduced displacement over the previous hour, a tremor alarm is declared. The second algorithm was to designed to detect earthquake swarms. The mean and median event rates are computed every 5 minutes based on the last hour of data from a real-time event catalog. By comparing these with thresholds, three swarm alarm conditions can be declared: a new swarm, an escalation in a swarm, and the end of a swarm. The end of swarm alarm is important as it may mark a transition from swarm to continuous tremor. Alarms from both systems were dispatched using a generic alarm management system which implements a call-down list, allowing observatory scientists to be called in sequence until someone acknowledged the alarm via a confirmation web page. The results of this simple approach are encouraging. The tremor alarm algorithm detected 26 of the 27 explosive eruptions that occurred from 23 March - 4 April. The swarm alarm algorithm detected all five of the main volcanic earthquake swarm episodes which occurred during the Redoubt crisis on 26-27 February, 21-23 March, 26 March, 2-4 April and 3-7 May. The end-of-swarm alarms on 23 March and 4 April were particularly helpful as they were caused by transitions from swarm to tremor shortly preceding explosive eruptions; transitions which were detected much earlier by the swarm algorithm than they were by the tremor algorithm.

Modeling the complex shape evolution of sedimenting particle swarms in fractures

NASA Astrophysics Data System (ADS)

Mitchell, C. A.; Nitsche, L.; Pyrak-Nolte, L. J.

2016-12-01

The flow of micro- and nano-particles through subsurface systems can occur in several environments, such as hydraulic fracturing or enhanced oil recovery. Computer simulations were performed to advance our understanding of the complexity of subsurface particle swarm transport in fractures. Previous experiments observed that particle swarms in fractures with uniform apertures exhibit enhanced transport speeds and suppressed bifurcations for an optimal range of apertures. Numerical simulations were performed for low Reynolds number, no interfacial tension and uniform viscosity conditions with particulate swarms represented by point-particles that mutually interact through their (regularized) Stokeslet fields. A P3 M technique accelerates the summations for swarms exceeding 105 particles. Fracture wall effects were incorporated using a least-squares variant of the method of fundamental solutions, with grid mapping of the surface force and source elements within the fast-summation scheme. The numerical study was executed on the basis of dimensionless variables and parameters, in the interest of examining the fundamental behavior and relationships of particle swarms in the presence of uniform apertures. Model parameters were representative of particle swarms experiments to enable direct comparison of the results with the experimental observations. The simulations confirmed that the principal phenomena observed in the experiments can be explained within the realm of Stokes flow. The numerical investigation effectively replicated swarm evolution in a uniform fracture and captured the coalescence, torus and tail formation, and ultimate breakup of the particle swarm as it fell under gravity in a quiescent fluid. The rate of swarm evolution depended on the number of particles in a swarm. When an ideal number of particles was used, swarm transport was characterized by an enhanced velocity regime as observed in the laboratory data. Understanding the physics particle swarms in fractured media will improve the ability to perform controlled micro-particulate transport through rock. Acknowledgment: This material is based upon work supported by the U.S. Department of Energy, Office of Science, Office of Basic Energy Sciences, Geosciences Research Program under Award Number (DE-FG02-09ER16022).

Genetic particle swarm parallel algorithm analysis of optimization arrangement on mistuned blades

NASA Astrophysics Data System (ADS)

Zhao, Tianyu; Yuan, Huiqun; Yang, Wenjun; Sun, Huagang

2017-12-01

This article introduces a method of mistuned parameter identification which consists of static frequency testing of blades, dichotomy and finite element analysis. A lumped parameter model of an engine bladed-disc system is then set up. A bladed arrangement optimization method, namely the genetic particle swarm optimization algorithm, is presented. It consists of a discrete particle swarm optimization and a genetic algorithm. From this, the local and global search ability is introduced. CUDA-based co-evolution particle swarm optimization, using a graphics processing unit, is presented and its performance is analysed. The results show that using optimization results can reduce the amplitude and localization of the forced vibration response of a bladed-disc system, while optimization based on the CUDA framework can improve the computing speed. This method could provide support for engineering applications in terms of effectiveness and efficiency.

Particle Swarm Learning Algorithm Based on Adjustment of Parameter and its Applications Assessment of Agricultural Projects

NASA Astrophysics Data System (ADS)

Yang, Shanlin; Zhu, Weidong; Chen, Li

The particle swarm, which optimizes neural networks, has overcome its disadvantage of slow convergent speed and shortcoming of local optimum. The parameter that the particle swarm optimization relates to is not much. But it has strongly sensitivity to the parameter. In this paper, we applied PSO-BP to evaluate the environmental effect of an agricultural project, and researched application and Particle Swarm learning algorithm based on adjustment of parameter. This paper, we use MATLAB language .The particle number is 5, 30, 50, 90, and the inertia weight is 0.4, 0.6, and 0.8 separately. Calculate 10 times under each same parameter, and analyze the influence under the same parameter. Result is indicated that the number of particles is in 25 ~ 30 and the inertia weight is in 0.6 ~ 0.7, and the result of optimization is satisfied.

Determination of equilibrium electron temperature and times using an electron swarm model with BOLSIG+ calculated collision frequencies and rate coefficients

DOE PAGES

Pusateri, Elise N.; Morris, Heidi E.; Nelson, Eric M.; ...

2015-08-04

Electromagnetic pulse (EMP) events produce low-energy conduction electrons from Compton electron or photoelectron ionizations with air. It is important to understand how conduction electrons interact with air in order to accurately predict EMP evolution and propagation. An electron swarm model can be used to monitor the time evolution of conduction electrons in an environment characterized by electric field and pressure. Here a swarm model is developed that is based on the coupled ordinary differential equations (ODEs) described by Higgins et al. (1973), hereinafter HLO. The ODEs characterize the swarm electric field, electron temperature, electron number density, and drift velocity. Importantmore » swarm parameters, the momentum transfer collision frequency, energy transfer collision frequency, and ionization rate, are calculated and compared to the previously reported fitted functions given in HLO. These swarm parameters are found using BOLSIG+, a two term Boltzmann solver developed by Hagelaar and Pitchford (2005), which utilizes updated cross sections from the LXcat website created by Pancheshnyi et al. (2012). We validate the swarm model by comparing to experimental effective ionization coefficient data in Dutton (1975) and drift velocity data in Ruiz-Vargas et al. (2010). In addition, we report on electron equilibrium temperatures and times for a uniform electric field of 1 StatV/cm for atmospheric heights from 0 to 40 km. We show that the equilibrium temperature and time are sensitive to the modifications in the collision frequencies and ionization rate based on the updated electron interaction cross sections.« less

Transport of Particle Swarms Through Fractures

NASA Astrophysics Data System (ADS)

Boomsma, E.; Pyrak-Nolte, L. J.

2011-12-01

The transport of engineered micro- and nano-scale particles through fractured rock is often assumed to occur as dispersions or emulsions. Another potential transport mechanism is the release of particle swarms from natural or industrial processes where small liquid drops, containing thousands to millions of colloidal-size particles, are released over time from seepage or leaks. Swarms have higher velocities than any individual colloid because the interactions among the particles maintain the cohesiveness of the swarm as it falls under gravity. Thus particle swarms give rise to the possibility that engineered particles may be transported farther and faster in fractures than predicted by traditional dispersion models. In this study, the effect of fractures on colloidal swarm cohesiveness and evolution was studied as a swarm falls under gravity and interacts with fracture walls. Transparent acrylic was used to fabricate synthetic fracture samples with either (1) a uniform aperture or (2) a converging aperture followed by a uniform aperture (funnel-shaped). The samples consisted of two blocks that measured 100 x 100 x 50 mm. The separation between these blocks determined the aperture (0.5 mm to 50 mm). During experiments, a fracture was fully submerged in water and swarms were released into it. The swarms consisted of dilute suspensions of either 25 micron soda-lime glass beads (2% by mass) or 3 micron polystyrene fluorescent beads (1% by mass) with an initial volume of 5μL. The swarms were illuminated with a green (525 nm) LED array and imaged optically with a CCD camera. In the uniform aperture fracture, the speed of the swarm prior to bifurcation increased with aperture up to a maximum at a fracture width of approximately 10 mm. For apertures greater than ~15 mm, the velocity was essentially constant with fracture width (but less than at 10 mm). This peak suggests that two competing mechanisms affect swarm velocity in fractures. The wall provides both drag, which slows the swarm, and a cohesive force that prevents swarm expansion and the corresponding decrease in particle density. For apertures >15mm, though the drag force is small, the loss of swarm cohesion dominates. In small apertures (<5mm), the drag from the wall dominates causing a loss in speed even though there is strong confinement. From a force-based particle interaction approach, the initial simulation did not capture the observed experimental behavior, i.e., the distinct peak in swarm velocities was not observed. For the funnel shaped aperture, the swarm was observed to bifurcate immediately upon reaching the intersection between the converging aperture and the uniform aperture portions of the fracture. Furthermore, converging apertures resulted in the deceleration of a swarm. Thus, the rate of transport of particle swarms is strongly affected by fracture aperture. Acknowledgment: The authors wish to acknowledge support of this work by the Geosciences Research Program, Office of Basic Energy Sciences US Department of Energy (DE-FG02-09ER16022).

A shifted hyperbolic augmented Lagrangian-based artificial fish two-swarm algorithm with guaranteed convergence for constrained global optimization

NASA Astrophysics Data System (ADS)

Rocha, Ana Maria A. C.; Costa, M. Fernanda P.; Fernandes, Edite M. G. P.

2016-12-01

This article presents a shifted hyperbolic penalty function and proposes an augmented Lagrangian-based algorithm for non-convex constrained global optimization problems. Convergence to an ?-global minimizer is proved. At each iteration k, the algorithm requires the ?-global minimization of a bound constrained optimization subproblem, where ?. The subproblems are solved by a stochastic population-based metaheuristic that relies on the artificial fish swarm paradigm and a two-swarm strategy. To enhance the speed of convergence, the algorithm invokes the Nelder-Mead local search with a dynamically defined probability. Numerical experiments with benchmark functions and engineering design problems are presented. The results show that the proposed shifted hyperbolic augmented Lagrangian compares favorably with other deterministic and stochastic penalty-based methods.

Optimization of multi-objective micro-grid based on improved particle swarm optimization algorithm

NASA Astrophysics Data System (ADS)

Zhang, Jian; Gan, Yang

2018-04-01

The paper presents a multi-objective optimal configuration model for independent micro-grid with the aim of economy and environmental protection. The Pareto solution set can be obtained by solving the multi-objective optimization configuration model of micro-grid with the improved particle swarm algorithm. The feasibility of the improved particle swarm optimization algorithm for multi-objective model is verified, which provides an important reference for multi-objective optimization of independent micro-grid.

Method of improving system performance and survivability through changing function

NASA Technical Reports Server (NTRS)

Hinchey, Michael G. (Inventor); Vassev, Emil I. (Inventor)

2012-01-01

A biologically-inspired system and method is provided for self-adapting behavior of swarm-based exploration missions, whereby individual components, for example, spacecraft, in the system can sacrifice themselves for the greater good of the entire system. The swarm-based system can exhibit emergent self-adapting behavior. Each component can be configured to exhibit self-sacrifice behavior based on Autonomic System Specification Language (ASSL).

Electrocardiographic signals and swarm-based support vector machine for hypoglycemia detection.

PubMed

Nuryani, Nuryani; Ling, Steve S H; Nguyen, H T

2012-04-01

Cardiac arrhythmia relating to hypoglycemia is suggested as a cause of death in diabetic patients. This article introduces electrocardiographic (ECG) parameters for artificially induced hypoglycemia detection. In addition, a hybrid technique of swarm-based support vector machine (SVM) is introduced for hypoglycemia detection using the ECG parameters as inputs. In this technique, a particle swarm optimization (PSO) is proposed to optimize the SVM to detect hypoglycemia. In an experiment using medical data of patients with Type 1 diabetes, the introduced ECG parameters show significant contributions to the performance of the hypoglycemia detection and the proposed detection technique performs well in terms of sensitivity and specificity.

Particle Swarms in Fractures: Open Versus Partially Closed Systems

NASA Astrophysics Data System (ADS)

Boomsma, E.; Pyrak-Nolte, L. J.

2014-12-01

In the field, fractures may be isolated or connected to fluid reservoirs anywhere along the perimeter of a fracture. These boundaries affect fluid circulation, flow paths and communication with external reservoirs. The transport of drop like collections of colloidal-sized particles (particle swarms) in open and partially closed systems was studied. A uniform aperture synthetic fracture was constructed using two blocks (100 x 100 x 50 mm) of transparent acrylic placed parallel to each other. The fracture was fully submerged a tank filled with 100cSt silicone oil. Fracture apertures were varied from 5-80 mm. Partially closed systems were created by sealing the sides of the fracture with plastic film. The four boundary conditions study were: (Case 1) open, (Case 2) closed on the sides, (Case 3) closed on the bottom, and (Case 4) closed on both the sides and bottom of the fracture. A 15 μL dilute suspension of soda-lime glass particles in oil (2% by mass) were released into the fracture. Particle swarms were illuminated using a green (525 nm) LED array and imaged with a CCD camera. The presence of the additional boundaries modified the speed of the particle swarms (see figure). In Case 1, enhanced swarm transport was observed for a range of apertures, traveling faster than either very small or very large apertures. In Case 2, swarm velocities were enhanced over a larger range of fracture apertures than in any of the other cases. Case 3 shifted the enhanced transport regime to lower apertures and also reduced swarm speed when compared to Case 2. Finally, Case 4 eliminated the enhanced transport regime entirely. Communication between the fluid in the fracture and an external fluid reservoir resulted in enhanced swarm transport in Cases 1-3. The non-rigid nature of a swarm enables drag from the fracture walls to modify the swarm geometry. The particles composing a swarm reorganize in response to the fracture, elongating the swarm and maintaining its density. Unlike a drop or solid sphere, fracture boundaries do not exclusively decelerate swarm motion but instead produce enhanced swarm transport. Acknowledgments: This material is based upon work supported by the U.S. Department of Energy, Office of Science, Office of Basic Energy Sciences, Geosciences Research Program under Award Number (DE-FG02-09ER16022).

Particle Swarm-Based Translation Control for Immersed Tunnel Element in the Hong Kong-Zhuhai-Macao Bridge Project

NASA Astrophysics Data System (ADS)

Li, Jun-jun; Yang, Xiao-jun; Xiao, Ying-jie; Xu, Bo-wei; Wu, Hua-feng

2018-03-01

Immersed tunnel is an important part of the Hong Kong-Zhuhai-Macao Bridge (HZMB) project. In immersed tunnel floating, translation which includes straight and transverse movements is the main working mode. To decide the magnitude and direction of the towing force for each tug, a particle swarm-based translation control method is presented for non-power immersed tunnel element. A sort of linear weighted logarithmic function is exploited to avoid weak subgoals. In simulation, the particle swarm-based control method is evaluated and compared with traditional empirical method in the case of the HZMB project. Simulation results show that the presented method delivers performance improvement in terms of the enhanced surplus towing force.

LinkMind: link optimization in swarming mobile sensor networks.

PubMed

Ngo, Trung Dung

2011-01-01

A swarming mobile sensor network is comprised of a swarm of wirelessly connected mobile robots equipped with various sensors. Such a network can be applied in an uncertain environment for services such as cooperative navigation and exploration, object identification and information gathering. One of the most advantageous properties of the swarming wireless sensor network is that mobile nodes can work cooperatively to organize an ad-hoc network and optimize the network link capacity to maximize the transmission of gathered data from a source to a target. This paper describes a new method of link optimization of swarming mobile sensor networks. The new method is based on combination of the artificial potential force guaranteeing connectivities of the mobile sensor nodes and the max-flow min-cut theorem of graph theory ensuring optimization of the network link capacity. The developed algorithm is demonstrated and evaluated in simulation.

LinkMind: Link Optimization in Swarming Mobile Sensor Networks

PubMed Central

Ngo, Trung Dung

2011-01-01

A swarming mobile sensor network is comprised of a swarm of wirelessly connected mobile robots equipped with various sensors. Such a network can be applied in an uncertain environment for services such as cooperative navigation and exploration, object identification and information gathering. One of the most advantageous properties of the swarming wireless sensor network is that mobile nodes can work cooperatively to organize an ad-hoc network and optimize the network link capacity to maximize the transmission of gathered data from a source to a target. This paper describes a new method of link optimization of swarming mobile sensor networks. The new method is based on combination of the artificial potential force guaranteeing connectivities of the mobile sensor nodes and the max-flow min-cut theorem of graph theory ensuring optimization of the network link capacity. The developed algorithm is demonstrated and evaluated in simulation. PMID:22164070

SWARMs Ontology: A Common Information Model for the Cooperation of Underwater Robots.

PubMed

Li, Xin; Bilbao, Sonia; Martín-Wanton, Tamara; Bastos, Joaquim; Rodriguez, Jonathan

2017-03-11

In order to facilitate cooperation between underwater robots, it is a must for robots to exchange information with unambiguous meaning. However, heterogeneity, existing in information pertaining to different robots, is a major obstruction. Therefore, this paper presents a networked ontology, named the Smart and Networking Underwater Robots in Cooperation Meshes (SWARMs) ontology, to address information heterogeneity and enable robots to have the same understanding of exchanged information. The SWARMs ontology uses a core ontology to interrelate a set of domain-specific ontologies, including the mission and planning, the robotic vehicle, the communication and networking, and the environment recognition and sensing ontology. In addition, the SWARMs ontology utilizes ontology constructs defined in the PR-OWL ontology to annotate context uncertainty based on the Multi-Entity Bayesian Network (MEBN) theory. Thus, the SWARMs ontology can provide both a formal specification for information that is necessarily exchanged between robots and a command and control entity, and also support for uncertainty reasoning. A scenario on chemical pollution monitoring is described and used to showcase how the SWARMs ontology can be instantiated, be extended, represent context uncertainty, and support uncertainty reasoning.

Particle Swarm Optimization Toolbox

NASA Technical Reports Server (NTRS)

Grant, Michael J.

2010-01-01

The Particle Swarm Optimization Toolbox is a library of evolutionary optimization tools developed in the MATLAB environment. The algorithms contained in the library include a genetic algorithm (GA), a single-objective particle swarm optimizer (SOPSO), and a multi-objective particle swarm optimizer (MOPSO). Development focused on both the SOPSO and MOPSO. A GA was included mainly for comparison purposes, and the particle swarm optimizers appeared to perform better for a wide variety of optimization problems. All algorithms are capable of performing unconstrained and constrained optimization. The particle swarm optimizers are capable of performing single and multi-objective optimization. The SOPSO and MOPSO algorithms are based on swarming theory and bird-flocking patterns to search the trade space for the optimal solution or optimal trade in competing objectives. The MOPSO generates Pareto fronts for objectives that are in competition. A GA, based on Darwin evolutionary theory, is also included in the library. The GA consists of individuals that form a population in the design space. The population mates to form offspring at new locations in the design space. These offspring contain traits from both of the parents. The algorithm is based on this combination of traits from parents to hopefully provide an improved solution than either of the original parents. As the algorithm progresses, individuals that hold these optimal traits will emerge as the optimal solutions. Due to the generic design of all optimization algorithms, each algorithm interfaces with a user-supplied objective function. This function serves as a "black-box" to the optimizers in which the only purpose of this function is to evaluate solutions provided by the optimizers. Hence, the user-supplied function can be numerical simulations, analytical functions, etc., since the specific detail of this function is of no concern to the optimizer. These algorithms were originally developed to support entry trajectory and guidance design for the Mars Science Laboratory mission but may be applied to any optimization problem.

Hysteresis compensation of the Prandtl-Ishlinskii model for piezoelectric actuators using modified particle swarm optimization with chaotic map.

PubMed

Long, Zhili; Wang, Rui; Fang, Jiwen; Dai, Xufei; Li, Zuohua

2017-07-01

Piezoelectric actuators invariably exhibit hysteresis nonlinearities that tend to become significant under the open-loop condition and could cause oscillations and errors in nanometer-positioning tasks. Chaotic map modified particle swarm optimization (MPSO) is proposed and implemented to identify the Prandtl-Ishlinskii model for piezoelectric actuators. Hysteresis compensation is attained through application of an inverse Prandtl-Ishlinskii model, in which the parameters are formulated based on the original model with chaotic map MPSO. To strengthen the diversity and improve the searching ergodicity of the swarm, an initial method of adaptive inertia weight based on a chaotic map is proposed. To compare and prove that the swarm's convergence occurs before stochastic initialization and to attain an optimal particle swarm optimization algorithm, the parameters of a proportional-integral-derivative controller are searched using self-tuning, and the simulated results are used to verify the search effectiveness of chaotic map MPSO. The results show that chaotic map MPSO is superior to its competitors for identifying the Prandtl-Ishlinskii model and that the inverse Prandtl-Ishlinskii model can provide hysteresis compensation under different conditions in a simple and effective manner.

Autonomous Navigation, Dynamic Path and Work Flow Planning in Multi-Agent Robotic Swarms Project

NASA Technical Reports Server (NTRS)

Falker, John; Zeitlin, Nancy; Leucht, Kurt; Stolleis, Karl

2015-01-01

Kennedy Space Center has teamed up with the Biological Computation Lab at the University of New Mexico to create a swarm of small, low-cost, autonomous robots, called Swarmies, to be used as a ground-based research platform for in-situ resource utilization missions. The behavior of the robot swarm mimics the central-place foraging strategy of ants to find and collect resources in an unknown environment and return those resources to a central site.

On edge-aware path-based color spatial sampling for Retinex: from Termite Retinex to Light Energy-driven Termite Retinex

NASA Astrophysics Data System (ADS)

Simone, Gabriele; Cordone, Roberto; Serapioni, Raul Paolo; Lecca, Michela

2017-05-01

Retinex theory estimates the human color sensation at any observed point by correcting its color based on the spatial arrangement of the colors in proximate regions. We revise two recent path-based, edge-aware Retinex implementations: Termite Retinex (TR) and Energy-driven Termite Retinex (ETR). As the original Retinex implementation, TR and ETR scan the neighborhood of any image pixel by paths and rescale their chromatic intensities by intensity levels computed by reworking the colors of the pixels on the paths. Our interest in TR and ETR is due to their unique, content-based scanning scheme, which uses the image edges to define the paths and exploits a swarm intelligence model for guiding the spatial exploration of the image. The exploration scheme of ETR has been showed to be particularly effective: its paths are local minima of an energy functional, designed to favor the sampling of image pixels highly relevant to color sensation. Nevertheless, since its computational complexity makes ETR poorly practicable, here we present a light version of it, named Light Energy-driven TR, and obtained from ETR by implementing a modified, optimized minimization procedure and by exploiting parallel computing.

A novel optimized hybrid fuzzy logic intelligent PID controller for an interconnected multi-area power system with physical constraints and boiler dynamics.

PubMed

Gomaa Haroun, A H; Li, Yin-Ya

2017-11-01

In the fast developing world nowadays, load frequency control (LFC) is considered to be a most significant role for providing the power supply with good quality in the power system. To deliver a reliable power, LFC system requires highly competent and intelligent control technique. Hence, in this article, a novel hybrid fuzzy logic intelligent proportional-integral-derivative (FLiPID) controller has been proposed for LFC of interconnected multi-area power systems. A four-area interconnected thermal power system incorporated with physical constraints and boiler dynamics is considered and the adjustable parameters of the FLiPID controller are optimized using particle swarm optimization (PSO) scheme employing an integral square error (ISE) criterion. The proposed method has been established to enhance the power system performances as well as to reduce the oscillations of uncertainties due to variations in the system parameters and load perturbations. The supremacy of the suggested method is demonstrated by comparing the simulation results with some recently reported heuristic methods such as fuzzy logic proportional-integral (FLPI) and intelligent proportional-integral-derivative (PID) controllers for the same electrical power system. the investigations showed that the FLiPID controller provides a better dynamic performance and outperform compared to the other approaches in terms of the settling time, and minimum undershoots of the frequency as well as tie-line power flow deviations following a perturbation, in addition to perform appropriate settlement of integral absolute error (IAE). Finally, the sensitivity analysis of the plant is inspected by varying the system parameters and operating load conditions from their nominal values. It is observed that the suggested controller based optimization algorithm is robust and perform satisfactorily with the variations in operating load condition, system parameters and load pattern. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

A multipopulation PSO based memetic algorithm for permutation flow shop scheduling.

PubMed

Liu, Ruochen; Ma, Chenlin; Ma, Wenping; Li, Yangyang

2013-01-01

The permutation flow shop scheduling problem (PFSSP) is part of production scheduling, which belongs to the hardest combinatorial optimization problem. In this paper, a multipopulation particle swarm optimization (PSO) based memetic algorithm (MPSOMA) is proposed in this paper. In the proposed algorithm, the whole particle swarm population is divided into three subpopulations in which each particle evolves itself by the standard PSO and then updates each subpopulation by using different local search schemes such as variable neighborhood search (VNS) and individual improvement scheme (IIS). Then, the best particle of each subpopulation is selected to construct a probabilistic model by using estimation of distribution algorithm (EDA) and three particles are sampled from the probabilistic model to update the worst individual in each subpopulation. The best particle in the entire particle swarm is used to update the global optimal solution. The proposed MPSOMA is compared with two recently proposed algorithms, namely, PSO based memetic algorithm (PSOMA) and hybrid particle swarm optimization with estimation of distribution algorithm (PSOEDA), on 29 well-known PFFSPs taken from OR-library, and the experimental results show that it is an effective approach for the PFFSP.

Bio-inspired algorithms applied to molecular docking simulations.

PubMed

Heberlé, G; de Azevedo, W F

2011-01-01

Nature as a source of inspiration has been shown to have a great beneficial impact on the development of new computational methodologies. In this scenario, analyses of the interactions between a protein target and a ligand can be simulated by biologically inspired algorithms (BIAs). These algorithms mimic biological systems to create new paradigms for computation, such as neural networks, evolutionary computing, and swarm intelligence. This review provides a description of the main concepts behind BIAs applied to molecular docking simulations. Special attention is devoted to evolutionary algorithms, guided-directed evolutionary algorithms, and Lamarckian genetic algorithms. Recent applications of these methodologies to protein targets identified in the Mycobacterium tuberculosis genome are described.

Magma intrusion near Volcan Tancitaro: Evidence from seismic analysis

DOE PAGES

Pinzon, Juan I.; Nunez-Cornu, Francisco J.; Rowe, Charlotte Anne

2016-11-17

Between May and June 2006, an earthquake swarm occurred near Volcan Tancítaro in Mexico, which was recorded by a temporary seismic deployment known as the MARS network. We located ~1000 events from this seismic swarm. Previous earthquake swarms in the area were reported in the years 1997, 1999 and 2000. We relocate and analyze the evolution and properties of the 2006 earthquake swarm, employing a waveform cross-correlation-based phase repicking technique. Hypocenters from 911 events were located and divided into eighteen families having a correlation coefficient at or above 0.75. 90% of the earthquakes provide at least sixteen phase picks. Wemore » used the single-event location code Hypo71 and the P-wave velocity model used by the Jalisco Seismic and Accelerometer Network to improve hypocenters based on the correlation-adjusted phase arrival times. We relocated 121 earthquakes, which show clearly two clusters, between 9–10 km and 3–4 km depth respectively. The average location error estimates are <1 km epicentrally, and <2 km in depth, for the largest event in each cluster. Depths of seismicity migrate upward from 16 to 3.5 km and exhibit a NE-SW trend. The swarm first migrated toward Paricutin Volcano but by mid-June began propagating back toward Volcán Tancítaro. In addition to its persistence, noteworthy aspects of this swarm include a quasi-exponential increase in the rate of activity within the first 15 days; a b-value of 1.47; a jug-shaped hypocenter distribution; a shoaling rate of ~5 km/month within the deeper cluster, and a composite focal mechanism solution indicating largely reverse faulting. As a result, these features of the swarm suggest a magmatic source elevating the crustal strain beneath Volcan Tancítaro.« less

Magma intrusion near Volcan Tancitaro: Evidence from seismic analysis

DOE Office of Scientific and Technical Information (OSTI.GOV)

Pinzon, Juan I.; Nunez-Cornu, Francisco J.; Rowe, Charlotte Anne

Between May and June 2006, an earthquake swarm occurred near Volcan Tancítaro in Mexico, which was recorded by a temporary seismic deployment known as the MARS network. We located ~1000 events from this seismic swarm. Previous earthquake swarms in the area were reported in the years 1997, 1999 and 2000. We relocate and analyze the evolution and properties of the 2006 earthquake swarm, employing a waveform cross-correlation-based phase repicking technique. Hypocenters from 911 events were located and divided into eighteen families having a correlation coefficient at or above 0.75. 90% of the earthquakes provide at least sixteen phase picks. Wemore » used the single-event location code Hypo71 and the P-wave velocity model used by the Jalisco Seismic and Accelerometer Network to improve hypocenters based on the correlation-adjusted phase arrival times. We relocated 121 earthquakes, which show clearly two clusters, between 9–10 km and 3–4 km depth respectively. The average location error estimates are <1 km epicentrally, and <2 km in depth, for the largest event in each cluster. Depths of seismicity migrate upward from 16 to 3.5 km and exhibit a NE-SW trend. The swarm first migrated toward Paricutin Volcano but by mid-June began propagating back toward Volcán Tancítaro. In addition to its persistence, noteworthy aspects of this swarm include a quasi-exponential increase in the rate of activity within the first 15 days; a b-value of 1.47; a jug-shaped hypocenter distribution; a shoaling rate of ~5 km/month within the deeper cluster, and a composite focal mechanism solution indicating largely reverse faulting. As a result, these features of the swarm suggest a magmatic source elevating the crustal strain beneath Volcan Tancítaro.« less

Magma intrusion near Volcan Tancítaro: Evidence from seismic analysis

NASA Astrophysics Data System (ADS)

Pinzón, Juan I.; Núñez-Cornú, Francisco J.; Rowe, Charlotte A.

2017-01-01

Between May and June 2006, an earthquake swarm occurred near Volcan Tancítaro in Mexico, which was recorded by a temporary seismic deployment known as the MARS network. We located ∼1000 events from this seismic swarm. Previous earthquake swarms in the area were reported in the years 1997, 1999 and 2000. We relocate and analyze the evolution and properties of the 2006 earthquake swarm, employing a waveform cross-correlation-based phase repicking technique. Hypocenters from 911 events were located and divided into eighteen families having a correlation coefficient at or above 0.75. 90% of the earthquakes provide at least sixteen phase picks. We used the single-event location code Hypo71 and the P-wave velocity model used by the Jalisco Seismic and Accelerometer Network to improve hypocenters based on the correlation-adjusted phase arrival times. We relocated 121 earthquakes, which show clearly two clusters, between 9-10 km and 3-4 km depth respectively. The average location error estimates are <1 km epicentrally, and <2 km in depth, for the largest event in each cluster. Depths of seismicity migrate upward from 16 to 3.5 km and exhibit a NE-SW trend. The swarm first migrated toward Paricutin Volcano but by mid-June began propagating back toward Volcán Tancítaro. In addition to its persistence, noteworthy aspects of this swarm include a quasi-exponential increase in the rate of activity within the first 15 days; a b-value of 1.47; a jug-shaped hypocenter distribution; a shoaling rate of ∼5 km/month within the deeper cluster, and a composite focal mechanism solution indicating largely reverse faulting. These features of the swarm suggest a magmatic source elevating the crustal strain beneath Volcan Tancítaro.

Integrated Swarming Operations for Air Base Defense: Applications in Irregular Warfare

DTIC Science & Technology

2006-06-01

Giordano THIS PAGE INTENTIONALLY LEFT BLANK i REPORT DOCUMENTATION PAGE Form Approved OMB No. 0704-0188 Public...Gray Approved by: John Arquilla Thesis Advisor Frank Giordano Second Reader Gordon McCormick Chairman, Department of Defense...Frank Giordano for all their help in guiding me down the path of swarming, counterinsurgency and applications for air base defense in irregular

Fourier transform and particle swarm optimization based modified LQR algorithm for mitigation of vibrations using magnetorheological dampers

NASA Astrophysics Data System (ADS)

Kumar, Gaurav; Kumar, Ashok

2017-11-01

Structural control has gained significant attention in recent times. The standalone issue of power requirement during an earthquake has already been solved up to a large extent by designing semi-active control systems using conventional linear quadratic control theory, and many other intelligent control algorithms such as fuzzy controllers, artificial neural networks, etc. In conventional linear-quadratic regulator (LQR) theory, it is customary to note that the values of the design parameters are decided at the time of designing the controller and cannot be subsequently altered. During an earthquake event, the response of the structure may increase or decrease, depending the quasi-resonance occurring between the structure and the earthquake. In this case, it is essential to modify the value of the design parameters of the conventional LQR controller to obtain optimum control force to mitigate the vibrations due to the earthquake. A few studies have been done to sort out this issue but in all these studies it was necessary to maintain a database of the earthquake. To solve this problem and to find the optimized design parameters of the LQR controller in real time, a fast Fourier transform and particle swarm optimization based modified linear quadratic regulator method is presented here. This method comprises four different algorithms: particle swarm optimization (PSO), the fast Fourier transform (FFT), clipped control algorithm and the LQR. The FFT helps to obtain the dominant frequency for every time window. PSO finds the optimum gain matrix through the real-time update of the weighting matrix R, thereby, dispensing with the experimentation. The clipped control law is employed to match the magnetorheological (MR) damper force with the desired force given by the controller. The modified Bouc-Wen phenomenological model is taken to recognize the nonlinearities in the MR damper. The assessment of the advised method is done by simulation of a three-story structure having an MR damper at the ground floor level subjected to three different near-fault historical earthquake time histories, and the outcomes are equated with those of simple conventional LQR. The results establish that the advised methodology is more effective than conventional LQR controllers in reducing inter-storey drift, relative displacement, and acceleration response.

Multi Dimensional Honey Bee Foraging Algorithm Based on Optimal Energy Consumption

NASA Astrophysics Data System (ADS)

Saritha, R.; Vinod Chandra, S. S.

2017-10-01

In this paper a new nature inspired algorithm is proposed based on natural foraging behavior of multi-dimensional honey bee colonies. This method handles issues that arise when food is shared from multiple sources by multiple swarms at multiple destinations. The self organizing nature of natural honey bee swarms in multiple colonies is based on the principle of energy consumption. Swarms of multiple colonies select a food source to optimally fulfill the requirements of its colonies. This is based on the energy requirement for transporting food between a source and destination. Minimum use of energy leads to maximizing profit in each colony. The mathematical model proposed here is based on this principle. This has been successfully evaluated by applying it on multi-objective transportation problem for optimizing cost and time. The algorithm optimizes the needs at each destination in linear time.

Intelligent Ensemble Forecasting System of Stock Market Fluctuations Based on Symetric and Asymetric Wavelet Functions

NASA Astrophysics Data System (ADS)

Lahmiri, Salim; Boukadoum, Mounir

2015-08-01

We present a new ensemble system for stock market returns prediction where continuous wavelet transform (CWT) is used to analyze return series and backpropagation neural networks (BPNNs) for processing CWT-based coefficients, determining the optimal ensemble weights, and providing final forecasts. Particle swarm optimization (PSO) is used for finding optimal weights and biases for each BPNN. To capture symmetry/asymmetry in the underlying data, three wavelet functions with different shapes are adopted. The proposed ensemble system was tested on three Asian stock markets: The Hang Seng, KOSPI, and Taiwan stock market data. Three statistical metrics were used to evaluate the forecasting accuracy; including, mean of absolute errors (MAE), root mean of squared errors (RMSE), and mean of absolute deviations (MADs). Experimental results showed that our proposed ensemble system outperformed the individual CWT-ANN models each with different wavelet function. In addition, the proposed ensemble system outperformed the conventional autoregressive moving average process. As a result, the proposed ensemble system is suitable to capture symmetry/asymmetry in financial data fluctuations for better prediction accuracy.

An Improved Hybrid Encoding Cuckoo Search Algorithm for 0-1 Knapsack Problems

PubMed Central

Feng, Yanhong; Jia, Ke; He, Yichao

2014-01-01

Cuckoo search (CS) is a new robust swarm intelligence method that is based on the brood parasitism of some cuckoo species. In this paper, an improved hybrid encoding cuckoo search algorithm (ICS) with greedy strategy is put forward for solving 0-1 knapsack problems. First of all, for solving binary optimization problem with ICS, based on the idea of individual hybrid encoding, the cuckoo search over a continuous space is transformed into the synchronous evolution search over discrete space. Subsequently, the concept of confidence interval (CI) is introduced; hence, the new position updating is designed and genetic mutation with a small probability is introduced. The former enables the population to move towards the global best solution rapidly in every generation, and the latter can effectively prevent the ICS from trapping into the local optimum. Furthermore, the greedy transform method is used to repair the infeasible solution and optimize the feasible solution. Experiments with a large number of KP instances show the effectiveness of the proposed algorithm and its ability to achieve good quality solutions. PMID:24527026

A small, cheap, and portable reconnaissance robot

NASA Astrophysics Data System (ADS)

Kenyon, Samuel H.; Creary, D.; Thi, Dan; Maynard, Jeffrey

2005-05-01

While there is much interest in human-carriable mobile robots for defense/security applications, existing examples are still too large/heavy, and there are not many successful small human-deployable mobile ground robots, especially ones that can survive being thrown/dropped. We have developed a prototype small short-range teleoperated indoor reconnaissance/surveillance robot that is semi-autonomous. It is self-powered, self-propelled, spherical, and meant to be carried and thrown by humans into indoor, yet relatively unstructured, dynamic environments. The robot uses multiple channels for wireless control and feedback, with the potential for inter-robot communication, swarm behavior, or distributed sensor network capabilities. The primary reconnaissance sensor for this prototype is visible-spectrum video. This paper focuses more on the software issues, both the onboard intelligent real time control system and the remote user interface. The communications, sensor fusion, intelligent real time controller, etc. are implemented with onboard microcontrollers. We based the autonomous and teleoperation controls on a simple finite state machine scripting layer. Minimal localization and autonomous routines were designed to best assist the operator, execute whatever mission the robot may have, and promote its own survival. We also discuss the advantages and pitfalls of an inexpensive, rapidly-developed semi-autonomous robotic system, especially one that is spherical, and the importance of human-robot interaction as considered for the human-deployment and remote user interface.

Seismicity-based estimation of the driving fluid pressure in the case of swarm activity in Western Bohemia

NASA Astrophysics Data System (ADS)

Hainzl, S.; Fischer, T.; Dahm, T.

2012-10-01

Two recent major swarms in Western Bohemia occurred in the years 2000 and 2008 within almost the same portion of a fault close to Novy Kostel. Previous analysis of the year 2000 earthquake swarm revealed that fluid intrusion seemed to initiate the activity whereas stress redistribution by the individual swarm earthquakes played a major role in the further swarm evolution. Here we analyse the new swarm, which occurred in the year 2008, with regard to its correlation to the previous swarm as well its spatiotemporal migration patterns. We find that (i) the main part of the year 2008 activity ruptured fault patches adjacent to the main activity of the swarm 2000, but that also (ii) a significant overlap exists where earthquakes occurred in patches in which stress had been already released by precursory events; (iii) the activity shows a clear migration which can be described by a 1-D (in up-dip direction) diffusion process; (iv) the migration pattern can be equally well explained by a hydrofracture growth, which additionally explains the faster migration in up-dip compared to the down-dip direction as well as the maximum up-dip extension of the activity. We use these observations to estimate the underlying fluid pressure change in two different ways: First, we calculate the stress changes induced by precursory events at the location of each swarm earthquake assuming that observed stress deficits had to be compensated by pore pressure increases; and secondly, we estimate the fluid overpressure by fitting a hydrofracture model to the asymmetric seismicity patterns. Both independent methods indicate that the fluid pressure increase was initially up to 30 MPa.

Conditional nonlinear optimal perturbations based on the particle swarm optimization and their applications to the predictability problems

NASA Astrophysics Data System (ADS)

Zheng, Qin; Yang, Zubin; Sha, Jianxin; Yan, Jun

2017-02-01

In predictability problem research, the conditional nonlinear optimal perturbation (CNOP) describes the initial perturbation that satisfies a certain constraint condition and causes the largest prediction error at the prediction time. The CNOP has been successfully applied in estimation of the lower bound of maximum predictable time (LBMPT). Generally, CNOPs are calculated by a gradient descent algorithm based on the adjoint model, which is called ADJ-CNOP. This study, through the two-dimensional Ikeda model, investigates the impacts of the nonlinearity on ADJ-CNOP and the corresponding precision problems when using ADJ-CNOP to estimate the LBMPT. Our conclusions are that (1) when the initial perturbation is large or the prediction time is long, the strong nonlinearity of the dynamical model in the prediction variable will lead to failure of the ADJ-CNOP method, and (2) when the objective function has multiple extreme values, ADJ-CNOP has a large probability of producing local CNOPs, hence making a false estimation of the LBMPT. Furthermore, the particle swarm optimization (PSO) algorithm, one kind of intelligent algorithm, is introduced to solve this problem. The method using PSO to compute CNOP is called PSO-CNOP. The results of numerical experiments show that even with a large initial perturbation and long prediction time, or when the objective function has multiple extreme values, PSO-CNOP can always obtain the global CNOP. Since the PSO algorithm is a heuristic search algorithm based on the population, it can overcome the impact of nonlinearity and the disturbance from multiple extremes of the objective function. In addition, to check the estimation accuracy of the LBMPT presented by PSO-CNOP and ADJ-CNOP, we partition the constraint domain of initial perturbations into sufficiently fine grid meshes and take the LBMPT obtained by the filtering method as a benchmark. The result shows that the estimation presented by PSO-CNOP is closer to the true value than the one by ADJ-CNOP with the forecast time increasing.

Improving high-altitude emp modeling capabilities by using a non-equilibrium electron swarm model to monitor conduction electron evolution

NASA Astrophysics Data System (ADS)

Pusateri, Elise Noel

An Electromagnetic Pulse (EMP) can severely disrupt the use of electronic devices in its path causing a significant amount of infrastructural damage. EMP can also cause breakdown of the surrounding atmosphere during lightning discharges. This makes modeling EMP phenomenon an important research effort in many military and atmospheric physics applications. EMP events include high-energy Compton electrons or photoelectrons that ionize air and produce low energy conduction electrons. A sufficient number of conduction electrons will damp or alter the EMP through conduction current. Therefore, it is important to understand how conduction electrons interact with air in order to accurately predict the EMP evolution and propagation in the air. It is common for EMP simulation codes to use an equilibrium ohmic model for computing the conduction current. Equilibrium ohmic models assume the conduction electrons are always in equilibrium with the local instantaneous electric field, i.e. for a specific EMP electric field, the conduction electrons instantaneously reach steady state without a transient process. An equilibrium model will work well if the electrons have time to reach their equilibrium distribution with respect to the rise time or duration of the EMP. If the time to reach equilibrium is comparable or longer than the rise time or duration of the EMP then the equilibrium model would not accurately predict the conduction current necessary for the EMP simulation. This is because transport coefficients used in the conduction current calculation will be found based on equilibrium reactions rates which may differ significantly from their non-equilibrium values. We see this deficiency in Los Alamos National Laboratory's EMP code, CHAP-LA (Compton High Altitude Pulse-Los Alamos), when modeling certain EMP scenarios at high altitudes, such as upward EMP, where the ionization rate by secondary electrons is over predicted by the equilibrium model, causing the EMP to short abruptly. The objective of the PhD research is to mitigate this effect by integrating a conduction electron model into CHAP-LA which can calculate the conduction current based on a non-equilibrium electron distribution. We propose to use an electron swarm model to monitor the time evolution of conduction electrons in the EMP environment which is characterized by electric field and pressure. Swarm theory uses various collision frequencies and reaction rates to study how the electron distribution and the resultant transport coefficients change with time, ultimately reaching an equilibrium distribution. Validation of the swarm model we develop is a necessary step for completion of the thesis work. After validation, the swarm model is integrated in the air chemistry model CHAP-LA employs for conduction electron simulations. We test high altitude EMP simulations with the swarm model option in the air chemistry model to show improvements in the computational capability of CHAP-LA. A swarm model has been developed that is based on a previous swarm model developed by Higgins, Longmire and O'Dell 1973, hereinafter HLO. The code used for the swarm model calculation solves a system of coupled differential equations for electric field, electron temperature, electron number density, and drift velocity. Important swarm parameters, including the momentum transfer collision frequency, energy transfer collision frequency, and ionization rate, are recalculated and compared to the previously reported empirical results given by HLO. These swarm parameters are found using BOLSIG+, a two term Boltzmann solver developed by Hagelaar and Pitchford 2005. BOLSIG+ utilizes updated electron scattering cross sections that are defined over an expanded energy range found in the atomic and molecular cross section database published by Phelps in the Phelps Database 2014 on the LXcat website created by Pancheshnyi et al. 2012. The swarm model is also updated from the original HLO model by including additional physical parameters such as the O2 electron attachment rate, recombination rate, and mutual neutralization rate. This necessitates tracking the positive and negative ion densities in the swarm model. Adding these parameters, especially electron attachment, is important at lower EMP altitudes where atmospheric density is high. We compare swarm model equilibrium temperatures and times using the HLO and BOLSIG+ coefficients for a uniform electric field of 1 StatV/cm for a range of atmospheric heights. This is done in order to test sensitivity to the swarm parameters used in the swarm model. It is shown that the equilibrium temperature and time are sensitive to the modifications in the collision frequency and ionization rate based on the updated electron interaction cross sections. We validate the swarm model by comparing ionization coefficients and equilibrium drift velocities to experimental results over a wide range of reduced electric field values. The final part of the PhD thesis work includes integrating the swarm model into CHAP-LA. We discuss the physics included in the CHAP-LA EMP model and demonstrate EMP damping behavior caused by the ohmic model at high altitudes. We report on numerical techniques for incorporation of the swarm model into CHAP-LA's Maxwell solver. This includes a discussion of integration techniques for Maxwell's equations in CHAP-LA using the swarm model calculated conduction current. We show improvements on EMP parameter calculations when modeling a high altitude, upward EMP scenario. This provides a novel computational capability that will have an important impact on the atmospheric and EMP research community.

Distributed Pheromone-Based Swarming Control of Unmanned Air and Ground Vehicles for RSTA

DTIC Science & Technology

2008-03-20

Forthcoming in Proceedings of SPIE Defense & Security Conference, March 2008, Orlando, FL Distributed Pheromone -Based Swarming Control of Unmanned...describes recent advances in a fully distributed digital pheromone algorithm that has demonstrated its effectiveness in managing the complexity of...onboard digital pheromone responding to the needs of the automatic target recognition algorithms. UAVs and UGVs controlled by the same pheromone algorithm

How Can Bee Colony Algorithm Serve Medicine?

PubMed Central

Salehahmadi, Zeinab; Manafi, Amir

2014-01-01

Healthcare professionals usually should make complex decisions with far reaching consequences and associated risks in health care fields. As it was demonstrated in other industries, the ability to drill down into pertinent data to explore knowledge behind the data can greatly facilitate superior, informed decisions to ensue the facts. Nature has always inspired researchers to develop models of solving the problems. Bee colony algorithm (BCA), based on the self-organized behavior of social insects is one of the most popular member of the family of population oriented, nature inspired meta-heuristic swarm intelligence method which has been proved its superiority over some other nature inspired algorithms. The objective of this model was to identify valid novel, potentially useful, and understandable correlations and patterns in existing data. This review employs a thematic analysis of online series of academic papers to outline BCA in medical hive, reducing the response and computational time and optimizing the problems. To illustrate the benefits of this model, the cases of disease diagnose system are presented. PMID:25489530

How can bee colony algorithm serve medicine?

PubMed

Salehahmadi, Zeinab; Manafi, Amir

2014-07-01

Healthcare professionals usually should make complex decisions with far reaching consequences and associated risks in health care fields. As it was demonstrated in other industries, the ability to drill down into pertinent data to explore knowledge behind the data can greatly facilitate superior, informed decisions to ensue the facts. Nature has always inspired researchers to develop models of solving the problems. Bee colony algorithm (BCA), based on the self-organized behavior of social insects is one of the most popular member of the family of population oriented, nature inspired meta-heuristic swarm intelligence method which has been proved its superiority over some other nature inspired algorithms. The objective of this model was to identify valid novel, potentially useful, and understandable correlations and patterns in existing data. This review employs a thematic analysis of online series of academic papers to outline BCA in medical hive, reducing the response and computational time and optimizing the problems. To illustrate the benefits of this model, the cases of disease diagnose system are presented.

PSO/ACO algorithm-based risk assessment of human neural tube defects in Heshun County, China.

PubMed

Liao, Yi Lan; Wang, Jin Feng; Wu, Ji Lei; Wang, Jiao Jiao; Zheng, Xiao Ying

2012-10-01

To develop a new technique for assessing the risk of birth defects, which are a major cause of infant mortality and disability in many parts of the world. The region of interest in this study was Heshun County, the county in China with the highest rate of neural tube defects (NTDs). A hybrid particle swarm optimization/ant colony optimization (PSO/ACO) algorithm was used to quantify the probability of NTDs occurring at villages with no births. The hybrid PSO/ACO algorithm is a form of artificial intelligence adapted for hierarchical classification. It is a powerful technique for modeling complex problems involving impacts of causes. The algorithm was easy to apply, with the accuracy of the results being 69.5%±7.02% at the 95% confidence level. The proposed method is simple to apply, has acceptable fault tolerance, and greatly enhances the accuracy of calculations. Copyright © 2012 The Editorial Board of Biomedical and Environmental Sciences. Published by Elsevier B.V. All rights reserved.

Fuzzy bilevel programming with multiple non-cooperative followers: model, algorithm and application

NASA Astrophysics Data System (ADS)

Ke, Hua; Huang, Hu; Ralescu, Dan A.; Wang, Lei

2016-04-01

In centralized decision problems, it is not complicated for decision-makers to make modelling technique selections under uncertainty. When a decentralized decision problem is considered, however, choosing appropriate models is no longer easy due to the difficulty in estimating the other decision-makers' inconclusive decision criteria. These decision criteria may vary with different decision-makers because of their special risk tolerances and management requirements. Considering the general differences among the decision-makers in decentralized systems, we propose a general framework of fuzzy bilevel programming including hybrid models (integrated with different modelling methods in different levels). Specially, we discuss two of these models which may have wide applications in many fields. Furthermore, we apply the proposed two models to formulate a pricing decision problem in a decentralized supply chain with fuzzy coefficients. In order to solve these models, a hybrid intelligent algorithm integrating fuzzy simulation, neural network and particle swarm optimization based on penalty function approach is designed. Some suggestions on the applications of these models are also presented.

Different types of maximum power point tracking techniques for renewable energy systems: A survey

NASA Astrophysics Data System (ADS)

Khan, Mohammad Junaid; Shukla, Praveen; Mustafa, Rashid; Chatterji, S.; Mathew, Lini

2016-03-01

Global demand for electricity is increasing while production of energy from fossil fuels is declining and therefore the obvious choice of the clean energy source that is abundant and could provide security for development future is energy from the sun. In this paper, the characteristic of the supply voltage of the photovoltaic generator is nonlinear and exhibits multiple peaks, including many local peaks and a global peak in non-uniform irradiance. To keep global peak, MPPT is the important component of photovoltaic systems. Although many review articles discussed conventional techniques such as P & O, incremental conductance, the correlation ripple control and very few attempts have been made with intelligent MPPT techniques. This document also discusses different algorithms based on fuzzy logic, Ant Colony Optimization, Genetic Algorithm, artificial neural networks, Particle Swarm Optimization Algorithm Firefly, Extremum seeking control method and hybrid methods applied to the monitoring of maximum value of power at point in systems of photovoltaic under changing conditions of irradiance.

SWARMs Ontology: A Common Information Model for the Cooperation of Underwater Robots

PubMed Central

Li, Xin; Bilbao, Sonia; Martín-Wanton, Tamara; Bastos, Joaquim; Rodriguez, Jonathan

2017-01-01

In order to facilitate cooperation between underwater robots, it is a must for robots to exchange information with unambiguous meaning. However, heterogeneity, existing in information pertaining to different robots, is a major obstruction. Therefore, this paper presents a networked ontology, named the Smart and Networking Underwater Robots in Cooperation Meshes (SWARMs) ontology, to address information heterogeneity and enable robots to have the same understanding of exchanged information. The SWARMs ontology uses a core ontology to interrelate a set of domain-specific ontologies, including the mission and planning, the robotic vehicle, the communication and networking, and the environment recognition and sensing ontology. In addition, the SWARMs ontology utilizes ontology constructs defined in the PR-OWL ontology to annotate context uncertainty based on the Multi-Entity Bayesian Network (MEBN) theory. Thus, the SWARMs ontology can provide both a formal specification for information that is necessarily exchanged between robots and a command and control entity, and also support for uncertainty reasoning. A scenario on chemical pollution monitoring is described and used to showcase how the SWARMs ontology can be instantiated, be extended, represent context uncertainty, and support uncertainty reasoning. PMID:28287468

Resilience and Controllability of Dynamic Collective Behaviors

PubMed Central

Komareji, Mohammad; Bouffanais, Roland

2013-01-01

The network paradigm is used to gain insight into the structural root causes of the resilience of consensus in dynamic collective behaviors, and to analyze the controllability of the swarm dynamics. Here we devise the dynamic signaling network which is the information transfer channel underpinning the swarm dynamics of the directed interagent connectivity based on a topological neighborhood of interactions. The study of the connectedness of the swarm signaling network reveals the profound relationship between group size and number of interacting neighbors, which is found to be in good agreement with field observations on flock of starlings [Ballerini et al. (2008) Proc. Natl. Acad. Sci. USA, 105: 1232]. Using a dynamical model, we generate dynamic collective behaviors enabling us to uncover that the swarm signaling network is a homogeneous clustered small-world network, thus facilitating emergent outcomes if connectedness is maintained. Resilience of the emergent consensus is tested by introducing exogenous environmental noise, which ultimately stresses how deeply intertwined are the swarm dynamics in the physical and network spaces. The availability of the signaling network allows us to analytically establish for the first time the number of driver agents necessary to fully control the swarm dynamics. PMID:24358209

Optimization of shared autonomy vehicle control architectures for swarm operations.

PubMed

Sengstacken, Aaron J; DeLaurentis, Daniel A; Akbarzadeh-T, Mohammad R

2010-08-01

The need for greater capacity in automotive transportation (in the midst of constrained resources) and the convergence of key technologies from multiple domains may eventually produce the emergence of a "swarm" concept of operations. The swarm, which is a collection of vehicles traveling at high speeds and in close proximity, will require technology and management techniques to ensure safe, efficient, and reliable vehicle interactions. We propose a shared autonomy control approach, in which the strengths of both human drivers and machines are employed in concert for this management. Building from a fuzzy logic control implementation, optimal architectures for shared autonomy addressing differing classes of drivers (represented by the driver's response time) are developed through a genetic-algorithm-based search for preferred fuzzy rules. Additionally, a form of "phase transition" from a safe to an unsafe swarm architecture as the amount of sensor capability is varied uncovers key insights on the required technology to enable successful shared autonomy for swarm operations.

A Swarm Optimization Genetic Algorithm Based on Quantum-Behaved Particle Swarm Optimization.

PubMed

Sun, Tao; Xu, Ming-Hai

2017-01-01

Quantum-behaved particle swarm optimization (QPSO) algorithm is a variant of the traditional particle swarm optimization (PSO). The QPSO that was originally developed for continuous search spaces outperforms the traditional PSO in search ability. This paper analyzes the main factors that impact the search ability of QPSO and converts the particle movement formula to the mutation condition by introducing the rejection region, thus proposing a new binary algorithm, named swarm optimization genetic algorithm (SOGA), because it is more like genetic algorithm (GA) than PSO in form. SOGA has crossover and mutation operator as GA but does not need to set the crossover and mutation probability, so it has fewer parameters to control. The proposed algorithm was tested with several nonlinear high-dimension functions in the binary search space, and the results were compared with those from BPSO, BQPSO, and GA. The experimental results show that SOGA is distinctly superior to the other three algorithms in terms of solution accuracy and convergence.

Sambot II: A self-assembly modular swarm robot

NASA Astrophysics Data System (ADS)

Zhang, Yuchao; Wei, Hongxing; Yang, Bo; Jiang, Cancan

2018-04-01

The new generation of self-assembly modular swarm robot Sambot II, based on the original generation of self-assembly modular swarm robot Sambot, adopting laser and camera module for information collecting, is introduced in this manuscript. The visual control algorithm of Sambot II is detailed and feasibility of the algorithm is verified by the laser and camera experiments. At the end of this manuscript, autonomous docking experiments of two Sambot II robots are presented. The results of experiments are showed and analyzed to verify the feasibility of whole scheme of Sambot II.

An initial ULF wave index derived from 2 years of Swarm observations

NASA Astrophysics Data System (ADS)

Papadimitriou, Constantinos; Balasis, Georgios; Daglis, Ioannis A.; Giannakis, Omiros

2018-03-01

The ongoing Swarm satellite mission provides an opportunity for better knowledge of the near-Earth electromagnetic environment. Herein, we use a new methodological approach for the detection and classification of ultra low-frequency (ULF) wave events observed by Swarm based on an existing time-frequency analysis (TFA) tool and utilizing a state-of-the-art high-resolution magnetic field model and Swarm Level 2 products (i.e., field-aligned currents - FACs - and the Ionospheric Bubble Index - IBI). We present maps of the dependence of ULF wave power with magnetic latitude and magnetic local time (MLT) as well as geographic latitude and longitude from the three satellites at their different locations in low-Earth orbit (LEO) for a period spanning 2 years after the constellation's final configuration. We show that the inclusion of the Swarm single-spacecraft FAC product in our analysis eliminates all the wave activity at high altitudes, which is physically unrealistic. Moreover, we derive a Swarm orbit-by-orbit Pc3 wave (20-100 MHz) index for the topside ionosphere and compare its values with the corresponding variations of solar wind variables and geomagnetic activity indices. This is the first attempt, to our knowledge, to derive a ULF wave index from LEO satellite data. The technique can be potentially used to define a new Level 2 product from the mission, the Swarm ULF wave index, which would be suitable for space weather applications.

Competitive Swarm Optimizer Based Gateway Deployment Algorithm in Cyber-Physical Systems.

PubMed

Huang, Shuqiang; Tao, Ming

2017-01-22

Wireless sensor network topology optimization is a highly important issue, and topology control through node selection can improve the efficiency of data forwarding, while saving energy and prolonging lifetime of the network. To address the problem of connecting a wireless sensor network to the Internet in cyber-physical systems, here we propose a geometric gateway deployment based on a competitive swarm optimizer algorithm. The particle swarm optimization (PSO) algorithm has a continuous search feature in the solution space, which makes it suitable for finding the geometric center of gateway deployment; however, its search mechanism is limited to the individual optimum (pbest) and the population optimum (gbest); thus, it easily falls into local optima. In order to improve the particle search mechanism and enhance the search efficiency of the algorithm, we introduce a new competitive swarm optimizer (CSO) algorithm. The CSO search algorithm is based on an inter-particle competition mechanism and can effectively avoid trapping of the population falling into a local optimum. With the improvement of an adaptive opposition-based search and its ability to dynamically parameter adjustments, this algorithm can maintain the diversity of the entire swarm to solve geometric K -center gateway deployment problems. The simulation results show that this CSO algorithm has a good global explorative ability as well as convergence speed and can improve the network quality of service (QoS) level of cyber-physical systems by obtaining a minimum network coverage radius. We also find that the CSO algorithm is more stable, robust and effective in solving the problem of geometric gateway deployment as compared to the PSO or Kmedoids algorithms.

Driving Processes of Earthquake Swarms: Evidence from High Resolution Seismicity

NASA Astrophysics Data System (ADS)

Ellsworth, W. L.; Shelly, D. R.; Hill, D. P.; Hardebeck, J.; Hsieh, P. A.

2017-12-01

Earthquake swarms are transient increases in seismicity deviating from a typical mainshock-aftershock pattern. Swarms are most prevalent in volcanic and hydrothermal areas, yet also occur in other environments, such as extensional fault stepovers. Swarms provide a valuable opportunity to investigate source zone physics, including the causes of their swarm-like behavior. To gain insight into this behavior, we have used waveform-based methods to greatly enhance standard seismic catalogs. Depending on the application, we detect and precisely relocate 2-10x as many events as included in the initial catalog. Recently, we have added characterization of focal mechanisms (applied to a 2014 swarm in Long Valley Caldera, California), addressing a common shortcoming in microseismicity analyses (Shelly et al., JGR, 2016). In analysis of multiple swarms (both within and outside volcanic areas), several features stand out, including: (1) dramatic expansion of the active source region with time, (2) tendency for events to occur on the immediate fringe of prior activity, (3) overall upward migration, and (4) complex faulting structure. Some swarms also show an apparent mismatch between seismicity orientations (as defined by patterns in hypocentral locations) and slip orientations (as inferred from focal mechanisms). These features are largely distinct from those observed in mainshock-aftershock sequences. In combination, these swarm behaviors point to an important role for fluid pressure diffusion. Swarms may in fact be generated by a cascade of fluid pressure diffusion and stress transfer: in cases where faults are critically stressed, an increase in fluid pressure will trigger faulting. Faulting will in turn dramatically increase permeability in the faulted area, allowing rapid equilibration of fluid pressure to the fringe of the rupture zone. This process may perpetuate until fluid pressure perturbations drop and/or stresses become further from failure, such that any perturbation (fluid + stress transfer) is insufficient to generate further faulting. Numerical modeling supports this hypothesis - for example, the main features of the 2014 Long Valley swarm can be reproduced by a relatively simple model incorporating both stress transfer and rupture-aided fluid pressure diffusion (Hsieh et al., AGU FM, 2016).

The Application of Collaborative Business Intelligence Technology in the Hospital SPD Logistics Management Model.

PubMed

Liu, Tongzhu; Shen, Aizong; Hu, Xiaojian; Tong, Guixian; Gu, Wei

2017-06-01

We aimed to apply collaborative business intelligence (BI) system to hospital supply, processing and distribution (SPD) logistics management model. We searched Engineering Village database, China National Knowledge Infrastructure (CNKI) and Google for articles (Published from 2011 to 2016), books, Web pages, etc., to understand SPD and BI related theories and recent research status. For the application of collaborative BI technology in the hospital SPD logistics management model, we realized this by leveraging data mining techniques to discover knowledge from complex data and collaborative techniques to improve the theories of business process. For the application of BI system, we: (i) proposed a layered structure of collaborative BI system for intelligent management in hospital logistics; (ii) built data warehouse for the collaborative BI system; (iii) improved data mining techniques such as supporting vector machines (SVM) and swarm intelligence firefly algorithm to solve key problems in hospital logistics collaborative BI system; (iv) researched the collaborative techniques oriented to data and business process optimization to improve the business processes of hospital logistics management. Proper combination of SPD model and BI system will improve the management of logistics in the hospitals. The successful implementation of the study requires: (i) to innovate and improve the traditional SPD model and make appropriate implement plans and schedules for the application of BI system according to the actual situations of hospitals; (ii) the collaborative participation of internal departments in hospital including the department of information, logistics, nursing, medical and financial; (iii) timely response of external suppliers.

Computational intelligence techniques in bioinformatics.

PubMed

Hassanien, Aboul Ella; Al-Shammari, Eiman Tamah; Ghali, Neveen I

2013-12-01

Computational intelligence (CI) is a well-established paradigm with current systems having many of the characteristics of biological computers and capable of performing a variety of tasks that are difficult to do using conventional techniques. It is a methodology involving adaptive mechanisms and/or an ability to learn that facilitate intelligent behavior in complex and changing environments, such that the system is perceived to possess one or more attributes of reason, such as generalization, discovery, association and abstraction. The objective of this article is to present to the CI and bioinformatics research communities some of the state-of-the-art in CI applications to bioinformatics and motivate research in new trend-setting directions. In this article, we present an overview of the CI techniques in bioinformatics. We will show how CI techniques including neural networks, restricted Boltzmann machine, deep belief network, fuzzy logic, rough sets, evolutionary algorithms (EA), genetic algorithms (GA), swarm intelligence, artificial immune systems and support vector machines, could be successfully employed to tackle various problems such as gene expression clustering and classification, protein sequence classification, gene selection, DNA fragment assembly, multiple sequence alignment, and protein function prediction and its structure. We discuss some representative methods to provide inspiring examples to illustrate how CI can be utilized to address these problems and how bioinformatics data can be characterized by CI. Challenges to be addressed and future directions of research are also presented and an extensive bibliography is included. Copyright © 2013 Elsevier Ltd. All rights reserved.

An ant colony optimization based algorithm for identifying gene regulatory elements.

PubMed

Liu, Wei; Chen, Hanwu; Chen, Ling

2013-08-01

It is one of the most important tasks in bioinformatics to identify the regulatory elements in gene sequences. Most of the existing algorithms for identifying regulatory elements are inclined to converge into a local optimum, and have high time complexity. Ant Colony Optimization (ACO) is a meta-heuristic method based on swarm intelligence and is derived from a model inspired by the collective foraging behavior of real ants. Taking advantage of the ACO in traits such as self-organization and robustness, this paper designs and implements an ACO based algorithm named ACRI (ant-colony-regulatory-identification) for identifying all possible binding sites of transcription factor from the upstream of co-expressed genes. To accelerate the ants' searching process, a strategy of local optimization is presented to adjust the ants' start positions on the searched sequences. By exploiting the powerful optimization ability of ACO, the algorithm ACRI can not only improve precision of the results, but also achieve a very high speed. Experimental results on real world datasets show that ACRI can outperform other traditional algorithms in the respects of speed and quality of solutions. Copyright © 2013 Elsevier Ltd. All rights reserved.

Security Analysis of Image Encryption Based on Gyrator Transform by Searching the Rotation Angle with Improved PSO Algorithm.

PubMed

Sang, Jun; Zhao, Jun; Xiang, Zhili; Cai, Bin; Xiang, Hong

2015-08-05

Gyrator transform has been widely used for image encryption recently. For gyrator transform-based image encryption, the rotation angle used in the gyrator transform is one of the secret keys. In this paper, by analyzing the properties of the gyrator transform, an improved particle swarm optimization (PSO) algorithm was proposed to search the rotation angle in a single gyrator transform. Since the gyrator transform is continuous, it is time-consuming to exhaustedly search the rotation angle, even considering the data precision in a computer. Therefore, a computational intelligence-based search may be an alternative choice. Considering the properties of severe local convergence and obvious global fluctuations of the gyrator transform, an improved PSO algorithm was proposed to be suitable for such situations. The experimental results demonstrated that the proposed improved PSO algorithm can significantly improve the efficiency of searching the rotation angle in a single gyrator transform. Since gyrator transform is the foundation of image encryption in gyrator transform domains, the research on the method of searching the rotation angle in a single gyrator transform is useful for further study on the security of such image encryption algorithms.

A fluid-driven earthquake swarm on the margin of the Yellowstone caldera

USGS Publications Warehouse

Shelly, David R.; Hill, David P.; Massin, Frederick; Farrell, Jamie; Smith, Robert B.; Taira, Taka'aki

2013-01-01

Over the past several decades, the Yellowstone caldera has experienced frequent earthquake swarms and repeated cycles of uplift and subsidence, reflecting dynamic volcanic and tectonic processes. Here, we examine the detailed spatial-temporal evolution of the 2010 Madison Plateau swarm, which occurred near the northwest boundary of the Yellowstone caldera. To fully explore the evolution of the swarm, we integrated procedures for seismic waveform-based earthquake detection with precise double-difference relative relocation. Using cross-correlation of continuous seismic data and waveform templates constructed from cataloged events, we detected and precisely located 8710 earthquakes during the three-week swarm, nearly four times the number of events included in the standard catalog. This high-resolution analysis reveals distinct migration of earthquake activity over the course of the swarm. The swarm initiated abruptly on January 17, 2010 at about 10 km depth and expanded dramatically outward (both shallower and deeper) over time, primarily along a NNW-striking, ~55º ENE-dipping structure. To explain these characteristics, we hypothesize that the swarm was triggered by the rupture of a zone of confined high-pressure aqueous fluids into a pre-existing crustal fault system, prompting release of accumulated stress. The high-pressure fluid injection may have been accommodated by hybrid shear and dilatational failure, as is commonly observed in exhumed hydrothermally affected fault zones. This process has likely occurred repeatedly in Yellowstone as aqueous fluids exsolved from magma migrate into the brittle crust, and it may be a key element in the observed cycles of caldera uplift and subsidence.

Hybrid glowworm swarm optimization for task scheduling in the cloud environment

NASA Astrophysics Data System (ADS)

Zhou, Jing; Dong, Shoubin

2018-06-01

In recent years many heuristic algorithms have been proposed to solve task scheduling problems in the cloud environment owing to their optimization capability. This article proposes a hybrid glowworm swarm optimization (HGSO) based on glowworm swarm optimization (GSO), which uses a technique of evolutionary computation, a strategy of quantum behaviour based on the principle of neighbourhood, offspring production and random walk, to achieve more efficient scheduling with reasonable scheduling costs. The proposed HGSO reduces the redundant computation and the dependence on the initialization of GSO, accelerates the convergence and more easily escapes from local optima. The conducted experiments and statistical analysis showed that in most cases the proposed HGSO algorithm outperformed previous heuristic algorithms to deal with independent tasks.

Identifying Interacting Genetic Variations by Fish-Swarm Logic Regression

PubMed Central

Yang, Aiyuan; Yan, Chunxia; Zhu, Feng; Zhao, Zhongmeng; Cao, Zhi

2013-01-01

Understanding associations between genotypes and complex traits is a fundamental problem in human genetics. A major open problem in mapping phenotypes is that of identifying a set of interacting genetic variants, which might contribute to complex traits. Logic regression (LR) is a powerful multivariant association tool. Several LR-based approaches have been successfully applied to different datasets. However, these approaches are not adequate with regard to accuracy and efficiency. In this paper, we propose a new LR-based approach, called fish-swarm logic regression (FSLR), which improves the logic regression process by incorporating swarm optimization. In our approach, a school of fish agents are conducted in parallel. Each fish agent holds a regression model, while the school searches for better models through various preset behaviors. A swarm algorithm improves the accuracy and the efficiency by speeding up the convergence and preventing it from dropping into local optimums. We apply our approach on a real screening dataset and a series of simulation scenarios. Compared to three existing LR-based approaches, our approach outperforms them by having lower type I and type II error rates, being able to identify more preset causal sites, and performing at faster speeds. PMID:23984382

Support Vector Machine Based on Adaptive Acceleration Particle Swarm Optimization

PubMed Central

Abdulameer, Mohammed Hasan; Othman, Zulaiha Ali

2014-01-01

Existing face recognition methods utilize particle swarm optimizer (PSO) and opposition based particle swarm optimizer (OPSO) to optimize the parameters of SVM. However, the utilization of random values in the velocity calculation decreases the performance of these techniques; that is, during the velocity computation, we normally use random values for the acceleration coefficients and this creates randomness in the solution. To address this problem, an adaptive acceleration particle swarm optimization (AAPSO) technique is proposed. To evaluate our proposed method, we employ both face and iris recognition based on AAPSO with SVM (AAPSO-SVM). In the face and iris recognition systems, performance is evaluated using two human face databases, YALE and CASIA, and the UBiris dataset. In this method, we initially perform feature extraction and then recognition on the extracted features. In the recognition process, the extracted features are used for SVM training and testing. During the training and testing, the SVM parameters are optimized with the AAPSO technique, and in AAPSO, the acceleration coefficients are computed using the particle fitness values. The parameters in SVM, which are optimized by AAPSO, perform efficiently for both face and iris recognition. A comparative analysis between our proposed AAPSO-SVM and the PSO-SVM technique is presented. PMID:24790584

A Multipopulation PSO Based Memetic Algorithm for Permutation Flow Shop Scheduling

PubMed Central

Liu, Ruochen; Ma, Chenlin; Ma, Wenping; Li, Yangyang

2013-01-01

The permutation flow shop scheduling problem (PFSSP) is part of production scheduling, which belongs to the hardest combinatorial optimization problem. In this paper, a multipopulation particle swarm optimization (PSO) based memetic algorithm (MPSOMA) is proposed in this paper. In the proposed algorithm, the whole particle swarm population is divided into three subpopulations in which each particle evolves itself by the standard PSO and then updates each subpopulation by using different local search schemes such as variable neighborhood search (VNS) and individual improvement scheme (IIS). Then, the best particle of each subpopulation is selected to construct a probabilistic model by using estimation of distribution algorithm (EDA) and three particles are sampled from the probabilistic model to update the worst individual in each subpopulation. The best particle in the entire particle swarm is used to update the global optimal solution. The proposed MPSOMA is compared with two recently proposed algorithms, namely, PSO based memetic algorithm (PSOMA) and hybrid particle swarm optimization with estimation of distribution algorithm (PSOEDA), on 29 well-known PFFSPs taken from OR-library, and the experimental results show that it is an effective approach for the PFFSP. PMID:24453841

Non-Linear Pattern Formation in Bone Growth and Architecture

PubMed Central

Salmon, Phil

2014-01-01

The three-dimensional morphology of bone arises through adaptation to its required engineering performance. Genetically and adaptively bone travels along a complex spatiotemporal trajectory to acquire optimal architecture. On a cellular, micro-anatomical scale, what mechanisms coordinate the activity of osteoblasts and osteoclasts to produce complex and efficient bone architectures? One mechanism is examined here – chaotic non-linear pattern formation (NPF) – which underlies in a unifying way natural structures as disparate as trabecular bone, swarms of birds flying, island formation, fluid turbulence, and others. At the heart of NPF is the fact that simple rules operating between interacting elements, and Turing-like interaction between global and local signals, lead to complex and structured patterns. The study of “group intelligence” exhibited by swarming birds or shoaling fish has led to an embodiment of NPF called “particle swarm optimization” (PSO). This theoretical model could be applicable to the behavior of osteoblasts, osteoclasts, and osteocytes, seeing them operating “socially” in response simultaneously to both global and local signals (endocrine, cytokine, mechanical), resulting in their clustered activity at formation and resorption sites. This represents problem-solving by social intelligence, and could potentially add further realism to in silico computer simulation of bone modeling. What insights has NPF provided to bone biology? One example concerns the genetic disorder juvenile Pagets disease or idiopathic hyperphosphatasia, where the anomalous parallel trabecular architecture characteristic of this pathology is consistent with an NPF paradigm by analogy with known experimental NPF systems. Here, coupling or “feedback” between osteoblasts and osteoclasts is the critical element. This NPF paradigm implies a profound link between bone regulation and its architecture: in bone the architecture is the regulation. The former is the emergent consequence of the latter. PMID:25653638

Optimizing of a high-order digital filter using PSO algorithm

NASA Astrophysics Data System (ADS)

Xu, Fuchun

2018-04-01

A self-adaptive high-order digital filter, which offers opportunity to simplify the process of tuning parameters and further improve the noise performance, is presented in this paper. The parameters of traditional digital filter are mainly tuned by complex calculation, whereas this paper presents a 5th order digital filter to obtain outstanding performance and the parameters of the proposed filter are optimized by swarm intelligent algorithm. Simulation results with respect to the proposed 5th order digital filter, SNR>122dB and the noise floor under -170dB are obtained in frequency range of [5-150Hz]. In further simulation, the robustness of the proposed 5th order digital is analyzed.

Precise Orbit Solution for Swarm Using Space-Borne GPS Data and Optimized Pseudo-Stochastic Pulses.

PubMed

Zhang, Bingbing; Wang, Zhengtao; Zhou, Lv; Feng, Jiandi; Qiu, Yaodong; Li, Fupeng

2017-03-20

Swarm is a European Space Agency (ESA) project that was launched on 22 November 2013, which consists of three Swarm satellites. Swarm precise orbits are essential to the success of the above project. This study investigates how well Swarm zero-differenced (ZD) reduced-dynamic orbit solutions can be determined using space-borne GPS data and optimized pseudo-stochastic pulses under high ionospheric activity. We choose Swarm space-borne GPS data from 1-25 October 2014, and Swarm reduced-dynamic orbits are obtained. Orbit quality is assessed by GPS phase observation residuals and compared with Precise Science Orbits (PSOs) released by ESA. Results show that pseudo-stochastic pulses with a time interval of 6 min and a priori standard deviation (STD) of 10 -2 mm/s in radial (R), along-track (T) and cross-track (N) directions are optimized to Swarm ZD reduced-dynamic precise orbit determination (POD). During high ionospheric activity, the mean Root Mean Square (RMS) of Swarm GPS phase residuals is at 9-11 mm, Swarm orbit solutions are also compared with Swarm PSOs released by ESA and the accuracy of Swarm orbits can reach 2-4 cm in R, T and N directions. Independent Satellite Laser Ranging (SLR) validation indicates that Swarm reduced-dynamic orbits have an accuracy of 2-4 cm. Swarm-B orbit quality is better than those of Swarm-A and Swarm-C. The Swarm orbits can be applied to the geomagnetic, geoelectric and gravity field recovery.

Application of particle swarm optimization in path planning of mobile robot

NASA Astrophysics Data System (ADS)

Wang, Yong; Cai, Feng; Wang, Ying

2017-08-01

In order to realize the optimal path planning of mobile robot in unknown environment, a particle swarm optimization algorithm based on path length as fitness function is proposed. The location of the global optimal particle is determined by the minimum fitness value, and the robot moves along the points of the optimal particles to the target position. The process of moving to the target point is done with MATLAB R2014a. Compared with the standard particle swarm optimization algorithm, the simulation results show that this method can effectively avoid all obstacles and get the optimal path.

Monitoring the West Bohemian earthquake swarm in 2008/2009 by a temporary small-aperture seismic array

NASA Astrophysics Data System (ADS)

Hiemer, Stefan; Roessler, Dirk; Scherbaum, Frank

2012-04-01

The most recent intense earthquake swarm in West Bohemia lasted from 6 October 2008 to January 2009. Starting 12 days after the onset, the University of Potsdam monitored the swarm by a temporary small-aperture seismic array at 10 km epicentral distance. The purpose of the installation was a complete monitoring of the swarm including micro-earthquakes ( M L < 0). We identify earthquakes using a conventional short-term average/long-term average trigger combined with sliding-window frequency-wavenumber and polarisation analyses. The resulting earthquake catalogue consists of 14,530 earthquakes between 19 October 2008 and 18 March 2009 with magnitudes in the range of - 1.2 ≤ M L ≤ 2.7. The small-aperture seismic array substantially lowers the detection threshold to about M c = - 0.4, when compared to the regional networks operating in West Bohemia ( M c > 0.0). In the course of this work, the main temporal features (frequency-magnitude distribution, propagation of back azimuth and horizontal slowness, occurrence rate of aftershock sequences and interevent-time distribution) of the recent 2008/2009 earthquake swarm are presented and discussed. Temporal changes of the coefficient of variation (based on interevent times) suggest that the swarm earthquake activity of the 2008/2009 swarm terminates by 12 January 2009. During the main phase in our studied swarm period after 19 October, the b value of the Gutenberg-Richter relation decreases from 1.2 to 0.8. This trend is also reflected in the power-law behavior of the seismic moment release. The corresponding total seismic moment release of 1.02×1017 Nm is equivalent to M L,max = 5.4.

A Parallel Particle Swarm Optimization Algorithm Accelerated by Asynchronous Evaluations

NASA Technical Reports Server (NTRS)

Venter, Gerhard; Sobieszczanski-Sobieski, Jaroslaw

2005-01-01

A parallel Particle Swarm Optimization (PSO) algorithm is presented. Particle swarm optimization is a fairly recent addition to the family of non-gradient based, probabilistic search algorithms that is based on a simplified social model and is closely tied to swarming theory. Although PSO algorithms present several attractive properties to the designer, they are plagued by high computational cost as measured by elapsed time. One approach to reduce the elapsed time is to make use of coarse-grained parallelization to evaluate the design points. Previous parallel PSO algorithms were mostly implemented in a synchronous manner, where all design points within a design iteration are evaluated before the next iteration is started. This approach leads to poor parallel speedup in cases where a heterogeneous parallel environment is used and/or where the analysis time depends on the design point being analyzed. This paper introduces an asynchronous parallel PSO algorithm that greatly improves the parallel e ciency. The asynchronous algorithm is benchmarked on a cluster assembled of Apple Macintosh G5 desktop computers, using the multi-disciplinary optimization of a typical transport aircraft wing as an example.

Color Feature-Based Object Tracking through Particle Swarm Optimization with Improved Inertia Weight

PubMed Central

Guo, Siqiu; Zhang, Tao; Song, Yulong

2018-01-01

This paper presents a particle swarm tracking algorithm with improved inertia weight based on color features. The weighted color histogram is used as the target feature to reduce the contribution of target edge pixels in the target feature, which makes the algorithm insensitive to the target non-rigid deformation, scale variation, and rotation. Meanwhile, the influence of partial obstruction on the description of target features is reduced. The particle swarm optimization algorithm can complete the multi-peak search, which can cope well with the object occlusion tracking problem. This means that the target is located precisely where the similarity function appears multi-peak. When the particle swarm optimization algorithm is applied to the object tracking, the inertia weight adjustment mechanism has some limitations. This paper presents an improved method. The concept of particle maturity is introduced to improve the inertia weight adjustment mechanism, which could adjust the inertia weight in time according to the different states of each particle in each generation. Experimental results show that our algorithm achieves state-of-the-art performance in a wide range of scenarios. PMID:29690610

Color Feature-Based Object Tracking through Particle Swarm Optimization with Improved Inertia Weight.

PubMed

Guo, Siqiu; Zhang, Tao; Song, Yulong; Qian, Feng

2018-04-23

This paper presents a particle swarm tracking algorithm with improved inertia weight based on color features. The weighted color histogram is used as the target feature to reduce the contribution of target edge pixels in the target feature, which makes the algorithm insensitive to the target non-rigid deformation, scale variation, and rotation. Meanwhile, the influence of partial obstruction on the description of target features is reduced. The particle swarm optimization algorithm can complete the multi-peak search, which can cope well with the object occlusion tracking problem. This means that the target is located precisely where the similarity function appears multi-peak. When the particle swarm optimization algorithm is applied to the object tracking, the inertia weight adjustment mechanism has some limitations. This paper presents an improved method. The concept of particle maturity is introduced to improve the inertia weight adjustment mechanism, which could adjust the inertia weight in time according to the different states of each particle in each generation. Experimental results show that our algorithm achieves state-of-the-art performance in a wide range of scenarios.

Competitive Swarm Optimizer Based Gateway Deployment Algorithm in Cyber-Physical Systems

PubMed Central

Huang, Shuqiang; Tao, Ming

2017-01-01

Wireless sensor network topology optimization is a highly important issue, and topology control through node selection can improve the efficiency of data forwarding, while saving energy and prolonging lifetime of the network. To address the problem of connecting a wireless sensor network to the Internet in cyber-physical systems, here we propose a geometric gateway deployment based on a competitive swarm optimizer algorithm. The particle swarm optimization (PSO) algorithm has a continuous search feature in the solution space, which makes it suitable for finding the geometric center of gateway deployment; however, its search mechanism is limited to the individual optimum (pbest) and the population optimum (gbest); thus, it easily falls into local optima. In order to improve the particle search mechanism and enhance the search efficiency of the algorithm, we introduce a new competitive swarm optimizer (CSO) algorithm. The CSO search algorithm is based on an inter-particle competition mechanism and can effectively avoid trapping of the population falling into a local optimum. With the improvement of an adaptive opposition-based search and its ability to dynamically parameter adjustments, this algorithm can maintain the diversity of the entire swarm to solve geometric K-center gateway deployment problems. The simulation results show that this CSO algorithm has a good global explorative ability as well as convergence speed and can improve the network quality of service (QoS) level of cyber-physical systems by obtaining a minimum network coverage radius. We also find that the CSO algorithm is more stable, robust and effective in solving the problem of geometric gateway deployment as compared to the PSO or Kmedoids algorithms. PMID:28117735

Optimization of wireless sensor networks based on chicken swarm optimization algorithm

NASA Astrophysics Data System (ADS)

Wang, Qingxi; Zhu, Lihua

2017-05-01

In order to reduce the energy consumption of wireless sensor network and improve the survival time of network, the clustering routing protocol of wireless sensor networks based on chicken swarm optimization algorithm was proposed. On the basis of LEACH agreement, it was improved and perfected that the points on the cluster and the selection of cluster head using the chicken group optimization algorithm, and update the location of chicken which fall into the local optimum by Levy flight, enhance population diversity, ensure the global search capability of the algorithm. The new protocol avoided the die of partial node of intensive using by making balanced use of the network nodes, improved the survival time of wireless sensor network. The simulation experiments proved that the protocol is better than LEACH protocol on energy consumption, also is better than that of clustering routing protocol based on particle swarm optimization algorithm.

Automatic Clustering Using Multi-objective Particle Swarm and Simulated Annealing

PubMed Central

Abubaker, Ahmad; Baharum, Adam; Alrefaei, Mahmoud

2015-01-01

This paper puts forward a new automatic clustering algorithm based on Multi-Objective Particle Swarm Optimization and Simulated Annealing, “MOPSOSA”. The proposed algorithm is capable of automatic clustering which is appropriate for partitioning datasets to a suitable number of clusters. MOPSOSA combines the features of the multi-objective based particle swarm optimization (PSO) and the Multi-Objective Simulated Annealing (MOSA). Three cluster validity indices were optimized simultaneously to establish the suitable number of clusters and the appropriate clustering for a dataset. The first cluster validity index is centred on Euclidean distance, the second on the point symmetry distance, and the last cluster validity index is based on short distance. A number of algorithms have been compared with the MOPSOSA algorithm in resolving clustering problems by determining the actual number of clusters and optimal clustering. Computational experiments were carried out to study fourteen artificial and five real life datasets. PMID:26132309

Guidance and control of swarms of spacecraft

NASA Astrophysics Data System (ADS)

Morgan, Daniel James

There has been considerable interest in formation flying spacecraft due to their potential to perform certain tasks at a cheaper cost than monolithic spacecraft. Formation flying enables the use of smaller, cheaper spacecraft that distribute the risk of the mission. Recently, the ideas of formation flying have been extended to spacecraft swarms made up of hundreds to thousands of 100-gram-class spacecraft known as femtosatellites. The large number of spacecraft and limited capabilities of each individual spacecraft present a significant challenge in guidance, navigation, and control. This dissertation deals with the guidance and control algorithms required to enable the flight of spacecraft swarms. The algorithms developed in this dissertation are focused on achieving two main goals: swarm keeping and swarm reconfiguration. The objectives of swarm keeping are to maintain bounded relative distances between spacecraft, prevent collisions between spacecraft, and minimize the propellant used by each spacecraft. Swarm reconfiguration requires the transfer of the swarm to a specific shape. Like with swarm keeping, minimizing the propellant used and preventing collisions are the main objectives. Additionally, the algorithms required for swarm keeping and swarm reconfiguration should be decentralized with respect to communication and computation so that they can be implemented on femtosats, which have limited hardware capabilities. The algorithms developed in this dissertation are concerned with swarms located in low Earth orbit. In these orbits, Earth oblateness and atmospheric drag have a significant effect on the relative motion of the swarm. The complicated dynamic environment of low Earth orbits further complicates the swarm-keeping and swarm-reconfiguration problems. To better develop and test these algorithms, a nonlinear, relative dynamic model with J2 and drag perturbations is developed. This model is used throughout this dissertation to validate the algorithms using computer simulations. The swarm-keeping problem can be solved by placing the spacecraft on J2-invariant relative orbits, which prevent collisions and minimize the drift of the swarm over hundreds of orbits using a single burn. These orbits are achieved by energy matching the spacecraft to the reference orbit. Additionally, these conditions can be repeatedly applied to minimize the drift of the swarm when atmospheric drag has a large effect (orbits with an altitude under 500 km). The swarm reconfiguration is achieved using two steps: trajectory optimization and assignment. The trajectory optimization problem can be written as a nonlinear, optimal control problem. This optimal control problem is discretized, decoupled, and convexified so that the individual femtosats can efficiently solve the optimization. Sequential convex programming is used to generate the control sequences and trajectories required to safely and efficiently transfer a spacecraft from one position to another. The sequence of trajectories is shown to converge to a Karush-Kuhn-Tucker point of the nonconvex problem. In the case where many of the spacecraft are interchangeable, a variable-swarm, distributed auction algorithm is used to determine the assignment of spacecraft to target positions. This auction algorithm requires only local communication and all of the bidding parameters are stored locally. The assignment generated using this auction algorithm is shown to be near optimal and to converge in a finite number of bids. Additionally, the bidding process is used to modify the number of targets used in the assignment so that the reconfiguration can be achieved even when there is a disconnected communication network or a significant loss of agents. Once the assignment is achieved, the trajectory optimization can be run using the terminal positions determined by the auction algorithm. To implement these algorithms in real time a model predictive control formulation is used. Model predictive control uses a finite horizon to apply the most up-to-date control sequence while simultaneously calculating a new assignment and trajectory based on updated state information. Using a finite horizon allows collisions to only be considered between spacecraft that are near each other at the current time. This relaxes the all-to-all communication assumption so that only neighboring agents need to communicate. Experimental validation is done using the formation flying testbed. The swarm-reconfiguration algorithms are tested using multiple quadrotors. Experiments have been performed using sequential convex programming for offline trajectory planning, model predictive control and sequential convex programming for real-time trajectory generation, and the variable-swarm, distributed auction algorithm for optimal assignment. These experiments show that the swarm-reconfiguration algorithms can be implemented in real time using actual hardware. In general, this dissertation presents guidance and control algorithms that maintain and reconfigure swarms of spacecraft while maintaining the shape of the swarm, preventing collisions between the spacecraft, and minimizing the amount of propellant used.

Fluid-Faulting Interactions Examined Though Massive Waveform-Based Analyses of Earthquake Swarms in Volcanic and Tectonic Settings: Mammoth Mountain, Long Valley, Lassen, and Fillmore, California Swarms, 2014-2015

NASA Astrophysics Data System (ADS)

Shelly, D. R.; Ellsworth, W. L.; Prejean, S. G.; Hill, D. P.; Hardebeck, J.; Hsieh, P. A.

2015-12-01

Earthquake swarms, sequences of sustained seismicity, convey active subsurface processes that sometimes precede larger tectonic or volcanic episodes. Their extended activity and spatiotemporal migration can often be attributed to fluid pressure transients as migrating crustal fluids (typically water and CO2) interact with subsurface structures. Although the swarms analyzed here are interpreted to be natural in origin, the mechanisms of seismic activation likely mirror those observed for earthquakes induced by industrial fluid injection. Here, we use massive-scale waveform correlation to detect and precisely locate 3-10 times as many earthquakes as included in routine catalogs for recent (2014-2015) swarms beneath Mammoth Mountain, Long Valley Caldera, Lassen Volcanic Center, and Fillmore areas of California, USA. These enhanced catalogs, with location precision as good as a few meters, reveal signatures of fluid-faulting interactions, such as systematic migration, fault-valve behavior, and fracture mesh structures, not resolved in routine catalogs. We extend this analysis to characterize source mechanism similarity even for very small newly detected events using relative P and S polarity estimates. This information complements precise locations to define fault complexities that would otherwise be invisible. In particular, although swarms often consist of groups of highly similar events, some swarms contain a population of outliers with different slip and/or fault orientations. These events highlight the complexity of fluid-faulting interactions. Despite their different settings, the four swarms analyzed here share many similarities, including pronounced hypocenter migration suggestive of a fluid pressure trigger. This includes the July 2015 Fillmore swarm, which, unlike the others, occurred outside of an obvious volcanic zone. Nevertheless, it exhibited systematic westward and downdip migration on a ~1x1.5 km low-angle, NW-dipping reverse fault at midcrustal depth.

An improved design method based on polyphase components for digital FIR filters

NASA Astrophysics Data System (ADS)

Kumar, A.; Kuldeep, B.; Singh, G. K.; Lee, Heung No

2017-11-01

This paper presents an efficient design of digital finite impulse response (FIR) filter, based on polyphase components and swarm optimisation techniques (SOTs). For this purpose, the design problem is formulated as mean square error between the actual response and ideal response in frequency domain using polyphase components of a prototype filter. To achieve more precise frequency response at some specified frequency, fractional derivative constraints (FDCs) have been applied, and optimal FDCs are computed using SOTs such as cuckoo search and modified cuckoo search algorithms. A comparative study of well-proved swarm optimisation, called particle swarm optimisation and artificial bee colony algorithm is made. The excellence of proposed method is evaluated using several important attributes of a filter. Comparative study evidences the excellence of proposed method for effective design of FIR filter.

Adaptive Control Parameters for Dispersal of Multi-Agent Mobile Ad Hoc Network (MANET) Swarms

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kurt Derr; Milos Manic

A mobile ad hoc network is a collection of independent nodes that communicate wirelessly with one another. This paper investigates nodes that are swarm robots with communications and sensing capabilities. Each robot in the swarm may operate in a distributed and decentralized manner to achieve some goal. This paper presents a novel approach to dynamically adapting control parameters to achieve mesh configuration stability. The presented approach to robot interaction is based on spring force laws (attraction and repulsion laws) to create near-optimal mesh like configurations. In prior work, we presented the extended virtual spring mesh (EVSM) algorithm for the dispersionmore » of robot swarms. This paper extends the EVSM framework by providing the first known study on the effects of adaptive versus static control parameters on robot swarm stability. The EVSM algorithm provides the following novelties: 1) improved performance with adaptive control parameters and 2) accelerated convergence with high formation effectiveness. Simulation results show that 120 robots reach convergence using adaptive control parameters more than twice as fast as with static control parameters in a multiple obstacle environment.« less

[Application of an Adaptive Inertia Weight Particle Swarm Algorithm in the Magnetic Resonance Bias Field Correction].

PubMed

Wang, Chang; Qin, Xin; Liu, Yan; Zhang, Wenchao

2016-06-01

An adaptive inertia weight particle swarm algorithm is proposed in this study to solve the local optimal problem with the method of traditional particle swarm optimization in the process of estimating magnetic resonance(MR)image bias field.An indicator measuring the degree of premature convergence was designed for the defect of traditional particle swarm optimization algorithm.The inertia weight was adjusted adaptively based on this indicator to ensure particle swarm to be optimized globally and to avoid it from falling into local optimum.The Legendre polynomial was used to fit bias field,the polynomial parameters were optimized globally,and finally the bias field was estimated and corrected.Compared to those with the improved entropy minimum algorithm,the entropy of corrected image was smaller and the estimated bias field was more accurate in this study.Then the corrected image was segmented and the segmentation accuracy obtained in this research was 10% higher than that with improved entropy minimum algorithm.This algorithm can be applied to the correction of MR image bias field.

Emergent Runaway into an Avoidance Area in a Swarm of Soldier Crabs

PubMed Central

Murakami, Hisashi; Tomaru, Takenori; Nishiyama, Yuta; Moriyama, Toru; Niizato, Takayuki; Gunji, Yukio-Pegio

2014-01-01

Emergent behavior that arises from a mass effect is one of the most striking aspects of collective animal groups. Investigating such behavior would be important in order to understand how individuals interact with their neighbors. Although there are many experiments that have used collective animals to investigate social learning or conflict between individuals and society such as that between a fish and a school, reports on mass effects are rare. In this study, we show that a swarm of soldier crabs could spontaneously enter a water pool, which are usually avoided, by forming densely populated part of a swarm at the edge of the water pool. Moreover, we show that the observed behavior can be explained by the model of collective behavior based on inherent noise that is individuals’ different velocities in a directed group. Our results suggest that inherent noise, which is widely seen in collective animals, can contribute to formation and/or maintenance of a swarm and that the dense swarm can enter the pool by means of enhanced inherent noise. PMID:24839970

Precise Orbit Solution for Swarm Using Space-Borne GPS Data and Optimized Pseudo-Stochastic Pulses

PubMed Central

Zhang, Bingbing; Wang, Zhengtao; Zhou, Lv; Feng, Jiandi; Qiu, Yaodong; Li, Fupeng

2017-01-01

Swarm is a European Space Agency (ESA) project that was launched on 22 November 2013, which consists of three Swarm satellites. Swarm precise orbits are essential to the success of the above project. This study investigates how well Swarm zero-differenced (ZD) reduced-dynamic orbit solutions can be determined using space-borne GPS data and optimized pseudo-stochastic pulses under high ionospheric activity. We choose Swarm space-borne GPS data from 1–25 October 2014, and Swarm reduced-dynamic orbits are obtained. Orbit quality is assessed by GPS phase observation residuals and compared with Precise Science Orbits (PSOs) released by ESA. Results show that pseudo-stochastic pulses with a time interval of 6 min and a priori standard deviation (STD) of 10−2 mm/s in radial (R), along-track (T) and cross-track (N) directions are optimized to Swarm ZD reduced-dynamic precise orbit determination (POD). During high ionospheric activity, the mean Root Mean Square (RMS) of Swarm GPS phase residuals is at 9–11 mm, Swarm orbit solutions are also compared with Swarm PSOs released by ESA and the accuracy of Swarm orbits can reach 2–4 cm in R, T and N directions. Independent Satellite Laser Ranging (SLR) validation indicates that Swarm reduced-dynamic orbits have an accuracy of 2–4 cm. Swarm-B orbit quality is better than those of Swarm-A and Swarm-C. The Swarm orbits can be applied to the geomagnetic, geoelectric and gravity field recovery. PMID:28335538

Improving Vector Evaluated Particle Swarm Optimisation by Incorporating Nondominated Solutions

PubMed Central

Lim, Kian Sheng; Ibrahim, Zuwairie; Buyamin, Salinda; Ahmad, Anita; Naim, Faradila; Ghazali, Kamarul Hawari; Mokhtar, Norrima

2013-01-01

The Vector Evaluated Particle Swarm Optimisation algorithm is widely used to solve multiobjective optimisation problems. This algorithm optimises one objective using a swarm of particles where their movements are guided by the best solution found by another swarm. However, the best solution of a swarm is only updated when a newly generated solution has better fitness than the best solution at the objective function optimised by that swarm, yielding poor solutions for the multiobjective optimisation problems. Thus, an improved Vector Evaluated Particle Swarm Optimisation algorithm is introduced by incorporating the nondominated solutions as the guidance for a swarm rather than using the best solution from another swarm. In this paper, the performance of improved Vector Evaluated Particle Swarm Optimisation algorithm is investigated using performance measures such as the number of nondominated solutions found, the generational distance, the spread, and the hypervolume. The results suggest that the improved Vector Evaluated Particle Swarm Optimisation algorithm has impressive performance compared with the conventional Vector Evaluated Particle Swarm Optimisation algorithm. PMID:23737718

Improving Vector Evaluated Particle Swarm Optimisation by incorporating nondominated solutions.

PubMed

Lim, Kian Sheng; Ibrahim, Zuwairie; Buyamin, Salinda; Ahmad, Anita; Naim, Faradila; Ghazali, Kamarul Hawari; Mokhtar, Norrima

2013-01-01

The Vector Evaluated Particle Swarm Optimisation algorithm is widely used to solve multiobjective optimisation problems. This algorithm optimises one objective using a swarm of particles where their movements are guided by the best solution found by another swarm. However, the best solution of a swarm is only updated when a newly generated solution has better fitness than the best solution at the objective function optimised by that swarm, yielding poor solutions for the multiobjective optimisation problems. Thus, an improved Vector Evaluated Particle Swarm Optimisation algorithm is introduced by incorporating the nondominated solutions as the guidance for a swarm rather than using the best solution from another swarm. In this paper, the performance of improved Vector Evaluated Particle Swarm Optimisation algorithm is investigated using performance measures such as the number of nondominated solutions found, the generational distance, the spread, and the hypervolume. The results suggest that the improved Vector Evaluated Particle Swarm Optimisation algorithm has impressive performance compared with the conventional Vector Evaluated Particle Swarm Optimisation algorithm.

Moving without a purpose: an experimental study of swarm guidance in the Western honey bee, Apis mellifera.

PubMed

Makinson, James C; Beekman, Madeleine

2014-06-01

During reproductive swarming, honey bee scouts perform two very important functions. Firstly, they find new nesting locations and return to the swarm cluster to communicate their discoveries. Secondly, once the swarm is ready to depart, informed scout bees act as guides, leading the swarm to its final destination. We have previously hypothesised that the two processes, selecting a new nest site and swarm guidance, are tightly linked in honey bees. When swarms can be laissez faire about where they nest, reaching directional consensus prior to lift off seems unnecessary. If, in contrast, it is essential that the swarm reaches a precise location, either directional consensus must be near unanimous prior to swarm departure or only a select subgroup of the scouts guide the swarm. Here, we tested experimentally whether directional consensus is necessary for the successful guidance of swarms of the Western honey bee Apis mellifera by forcing swarms into the air prior to the completion of the decision-making process. Our results show that swarms were unable to guide themselves prior to the swarm reaching the pre-flight buzzing phase of the decision-making process, even when directional consensus was high. We therefore suggest that not all scouts involved in the decision-making process attempt to guide the swarm. © 2014. Published by The Company of Biologists Ltd.

Revolutionizing Remote Exploration with ANTS

NASA Astrophysics Data System (ADS)

Clark, P. E.; Rilee, M. L.; Curtis, S.; Truszkowski, W.

2002-05-01

We are developing the Autonomous Nano-Technology Swarm (ANTS) architecture based on an insect colony analogue for the cost-effective, efficient, systematic survey of remote or inaccessible areas with multiple object targets, including planetary surface, marine, airborne, and space environments. The mission context is the exploration in the 2020s of the most compelling remaining targets in the solar system: main belt asteroids. Main belt asteroids harbor important clues to Solar System origins and evolution which are central to NASA's goals in Space Science. Asteroids are smaller than planets, but their number is far greater, and their combined surface area likely dwarfs the Earth's. An asteroid survey will dramatically increase our understanding of the local resources available for the Human Exploration and Development of Space. During the mission composition, shape, gravity, and orbit parameters could be returned to Earth for perhaps several thousand asteroids. A survey of this area will rival the great explorations that encircled this globe, opened up the New World, and laid the groundwork for the progress and challenges of the last centuries. The ANTS architecture for a main belt survey consists of a swarm of as many as a thousand or more highly specialized pico-spacecraft that form teams to survey as many as one hundred asteroids a month. Multi-level autonomy is critical for ANTS and the objective of the proposed study is to work through the implications and constraints this entails. ANTS couples biologically inspired autonomic control for basic functions to higher level artificial intelligence that together enable individual spacecraft to operate as specialized, cooperative, social agents. This revolutionary approach postulates highly advanced, but familiar, components integrated and operated in a way that uniquely transcends any evolutionary extrapolation of existing trends and enables thousand-spacecraft missions.

ANN-PSO Integrated Optimization Methodology for Intelligent Control of MMC Machining

NASA Astrophysics Data System (ADS)

Chandrasekaran, Muthumari; Tamang, Santosh

2017-08-01

Metal Matrix Composites (MMC) show improved properties in comparison with non-reinforced alloys and have found increased application in automotive and aerospace industries. The selection of optimum machining parameters to produce components of desired surface roughness is of great concern considering the quality and economy of manufacturing process. In this study, a surface roughness prediction model for turning Al-SiCp MMC is developed using Artificial Neural Network (ANN). Three turning parameters viz., spindle speed ( N), feed rate ( f) and depth of cut ( d) were considered as input neurons and surface roughness was an output neuron. ANN architecture having 3 -5 -1 is found to be optimum and the model predicts with an average percentage error of 7.72 %. Particle Swarm Optimization (PSO) technique is used for optimizing parameters to minimize machining time. The innovative aspect of this work is the development of an integrated ANN-PSO optimization method for intelligent control of MMC machining process applicable to manufacturing industries. The robustness of the method shows its superiority for obtaining optimum cutting parameters satisfying desired surface roughness. The method has better convergent capability with minimum number of iterations.

Spatial distribution and male mating success of Anopheles gambiae swarms

PubMed Central

2011-01-01

Background Anopheles gambiae mates in flight at particular mating sites over specific landmarks known as swarm markers. The swarms are composed of males; females typically approach a swarm, and leave in copula. This mating aggregation looks like a lek, but appears to lack the component of female choice. To investigate the possible mechanisms promoting the evolution of swarming in this mosquito species, we looked at the variation in mating success between swarms and discussed the factors that structure it in light of the three major lekking models, known as the female preference model, the hotspot model, and the hotshot model. Results We found substantial variation in swarm size and in mating success between swarms. A strong correlation between swarm size and mating success was observed, and consistent with the hotspot model of lek formation, the per capita mating success of individual males did not increase with swarm size. For the spatial distribution of swarms, our results revealed that some display sites were more attractive to both males and females and that females were more attracted to large swarms. While the swarm markers we recognize help us in localizing swarms, they did not account for the variation in swarm size or in the swarm mating success, suggesting that mosquitoes probably are attracted to these markers, but also perceive and respond to other aspects of the swarming site. Conclusions Characterizing the mating system of a species helps understand how this species has evolved and how selective pressures operate on male and female traits. The current study looked at male mating success of An. gambiae and discussed possible factors that account for its variation. We found that swarms of An. gambiae conform to the hotspot model of lek formation. But because swarms may lack the female choice component, we propose that the An. gambiae mating system is a lek-like system that incorporates characteristics pertaining to other mating systems such as scramble mating competition. PMID:21711542

Multi-robot task allocation based on two dimensional artificial fish swarm algorithm

NASA Astrophysics Data System (ADS)

Zheng, Taixiong; Li, Xueqin; Yang, Liangyi

2007-12-01

The problem of task allocation for multiple robots is to allocate more relative-tasks to less relative-robots so as to minimize the processing time of these tasks. In order to get optimal multi-robot task allocation scheme, a twodimensional artificial swarm algorithm based approach is proposed in this paper. In this approach, the normal artificial fish is extended to be two dimension artificial fish. In the two dimension artificial fish, each vector of primary artificial fish is extended to be an m-dimensional vector. Thus, each vector can express a group of tasks. By redefining the distance between artificial fish and the center of artificial fish, the behavior of two dimension fish is designed and the task allocation algorithm based on two dimension artificial swarm algorithm is put forward. At last, the proposed algorithm is applied to the problem of multi-robot task allocation and comparer with GA and SA based algorithm is done. Simulation and compare result shows the proposed algorithm is effective.

Optimal Computing Budget Allocation for Particle Swarm Optimization in Stochastic Optimization.

PubMed

Zhang, Si; Xu, Jie; Lee, Loo Hay; Chew, Ek Peng; Wong, Wai Peng; Chen, Chun-Hung

2017-04-01

Particle Swarm Optimization (PSO) is a popular metaheuristic for deterministic optimization. Originated in the interpretations of the movement of individuals in a bird flock or fish school, PSO introduces the concept of personal best and global best to simulate the pattern of searching for food by flocking and successfully translate the natural phenomena to the optimization of complex functions. Many real-life applications of PSO cope with stochastic problems. To solve a stochastic problem using PSO, a straightforward approach is to equally allocate computational effort among all particles and obtain the same number of samples of fitness values. This is not an efficient use of computational budget and leaves considerable room for improvement. This paper proposes a seamless integration of the concept of optimal computing budget allocation (OCBA) into PSO to improve the computational efficiency of PSO for stochastic optimization problems. We derive an asymptotically optimal allocation rule to intelligently determine the number of samples for all particles such that the PSO algorithm can efficiently select the personal best and global best when there is stochastic estimation noise in fitness values. We also propose an easy-to-implement sequential procedure. Numerical tests show that our new approach can obtain much better results using the same amount of computational effort.

Optimal Computing Budget Allocation for Particle Swarm Optimization in Stochastic Optimization

PubMed Central

Zhang, Si; Xu, Jie; Lee, Loo Hay; Chew, Ek Peng; Chen, Chun-Hung

2017-01-01

Particle Swarm Optimization (PSO) is a popular metaheuristic for deterministic optimization. Originated in the interpretations of the movement of individuals in a bird flock or fish school, PSO introduces the concept of personal best and global best to simulate the pattern of searching for food by flocking and successfully translate the natural phenomena to the optimization of complex functions. Many real-life applications of PSO cope with stochastic problems. To solve a stochastic problem using PSO, a straightforward approach is to equally allocate computational effort among all particles and obtain the same number of samples of fitness values. This is not an efficient use of computational budget and leaves considerable room for improvement. This paper proposes a seamless integration of the concept of optimal computing budget allocation (OCBA) into PSO to improve the computational efficiency of PSO for stochastic optimization problems. We derive an asymptotically optimal allocation rule to intelligently determine the number of samples for all particles such that the PSO algorithm can efficiently select the personal best and global best when there is stochastic estimation noise in fitness values. We also propose an easy-to-implement sequential procedure. Numerical tests show that our new approach can obtain much better results using the same amount of computational effort. PMID:29170617

Designing an Engaged Swarm: Toward a "Techne" for Multi-Class, Interdisciplinary Collaborations with Nonprofit Partners

ERIC Educational Resources Information Center

McCarthy, Seán

2016-01-01

This essay proposes a model of university-community partnership called "an engaged swarm" that mobilizes networks of students from across classes and disciplines to work with off-campus partners such as nonprofits. Based on theories that translate the distributed, adaptive, and flexible activity of actors in biological systems to…

P-adic valued models of swarm behaviour

NASA Astrophysics Data System (ADS)

Schumann, Andrew

2017-07-01

The swarm behaviour can be fully determined by attractants (food pieces) which change the directions of swarm propagation. If we assume that at each time step the swarm can find out not more than p - 1 attractants, then the swarm behaviour can be coded by p-adic integers. The main task of any swarm is to logistically optimize the road system connecting the reachable attractants. In the meanwhile, the transporting network of the swarm has loops (circles) and permanently changes, e.g. the swarm occupies some attractants and leaves the others. However, this complex dynamics can be effectively coded by p-adic integers. This allows us to represent the swarm behaviour as a calculation on p-adic valued strings.

Swarm- Validation of Star Tracker and Accelerometer Data

NASA Astrophysics Data System (ADS)

Schack, Peter; Schlicht, Anja; Pail, Roland; Gruber, Thomas

2016-08-01

The ESA Swarm mission is designed to advance studies in the field of magnetosphere, thermosphere and gravity field. To be fortunate on this task precise knowledge of the orientation of the Swarm satellites is required together with knowledge about external forces acting on the satellites. The key sensors providing this information are the star trackers and the accelerometers. Based on star tracker studies conducted by the Denmark Technical University (DTU), we found interesting patterns in the interboresight angles on all three satellites, which are partly induced by temperature alterations. Additionally, structures of horizontal stripes seem to be caused by the unique distribution of observed stars on the charge-coupled device of the star trackers. Our accelerometer analyses focus on spikes and pulses in the observations. Those short term events on Swarm might originate from electrical processes introduced by sunlight illuminating the nadir foil. Comparisons to GOCE and GRACE are included.

Application of Particle Swarm Optimization Algorithm in the Heating System Planning Problem

PubMed Central

Ma, Rong-Jiang; Yu, Nan-Yang; Hu, Jun-Yi

2013-01-01

Based on the life cycle cost (LCC) approach, this paper presents an integral mathematical model and particle swarm optimization (PSO) algorithm for the heating system planning (HSP) problem. The proposed mathematical model minimizes the cost of heating system as the objective for a given life cycle time. For the particularity of HSP problem, the general particle swarm optimization algorithm was improved. An actual case study was calculated to check its feasibility in practical use. The results show that the improved particle swarm optimization (IPSO) algorithm can more preferably solve the HSP problem than PSO algorithm. Moreover, the results also present the potential to provide useful information when making decisions in the practical planning process. Therefore, it is believed that if this approach is applied correctly and in combination with other elements, it can become a powerful and effective optimization tool for HSP problem. PMID:23935429

DualTrust: A Distributed Trust Model for Swarm-Based Autonomic Computing Systems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Maiden, Wendy M.; Dionysiou, Ioanna; Frincke, Deborah A.

2011-02-01

For autonomic computing systems that utilize mobile agents and ant colony algorithms for their sensor layer, trust management is important for the acceptance of the mobile agent sensors and to protect the system from malicious behavior by insiders and entities that have penetrated network defenses. This paper examines the trust relationships, evidence, and decisions in a representative system and finds that by monitoring the trustworthiness of the autonomic managers rather than the swarming sensors, the trust management problem becomes much more scalable and still serves to protect the swarm. We then propose the DualTrust conceptual trust model. By addressing themore » autonomic manager’s bi-directional primary relationships in the ACS architecture, DualTrust is able to monitor the trustworthiness of the autonomic managers, protect the sensor swarm in a scalable manner, and provide global trust awareness for the orchestrating autonomic manager.« less

Swarms, swarming and entanglements of fungal hyphae and of plant roots

PubMed Central

Barlow, Peter W.; Fisahn, Joachim

2013-01-01

There has been recent interest in the possibility that plant roots can show oriented collective motion, or swarming behavior. We examine the evidence supportive of root swarming and we also present new observations on this topic. Seven criteria are proposed for the definition of a swarm, whose application can help identify putative swarming behavior in plants. Examples where these criteria are fulfilled, at many levels of organization, are presented in relation to plant roots and root systems, as well as to the root-like mycelial cords (rhizomorphs) of fungi. The ideas of both an “active” swarming, directed by a signal which imposes a common vector on swarm element aggregation, and a “passive” swarming, where aggregation results from external constraint, are introduced. Active swarming is a pattern of cooperative behavior peculiar to the sporophyte generation of vascular plants and is the antithesis of the competitive behavior shown by the gametophyte generation of such plants, where passive swarming may be found. Fungal mycelial cords could serve as a model example of swarming in a multi-cellular, non-animal system. PMID:24255743

The Application of Collaborative Business Intelligence Technology in the Hospital SPD Logistics Management Model

PubMed Central

LIU, Tongzhu; SHEN, Aizong; HU, Xiaojian; TONG, Guixian; GU, Wei

2017-01-01

Background: We aimed to apply collaborative business intelligence (BI) system to hospital supply, processing and distribution (SPD) logistics management model. Methods: We searched Engineering Village database, China National Knowledge Infrastructure (CNKI) and Google for articles (Published from 2011 to 2016), books, Web pages, etc., to understand SPD and BI related theories and recent research status. For the application of collaborative BI technology in the hospital SPD logistics management model, we realized this by leveraging data mining techniques to discover knowledge from complex data and collaborative techniques to improve the theories of business process. Results: For the application of BI system, we: (i) proposed a layered structure of collaborative BI system for intelligent management in hospital logistics; (ii) built data warehouse for the collaborative BI system; (iii) improved data mining techniques such as supporting vector machines (SVM) and swarm intelligence firefly algorithm to solve key problems in hospital logistics collaborative BI system; (iv) researched the collaborative techniques oriented to data and business process optimization to improve the business processes of hospital logistics management. Conclusion: Proper combination of SPD model and BI system will improve the management of logistics in the hospitals. The successful implementation of the study requires: (i) to innovate and improve the traditional SPD model and make appropriate implement plans and schedules for the application of BI system according to the actual situations of hospitals; (ii) the collaborative participation of internal departments in hospital including the department of information, logistics, nursing, medical and financial; (iii) timely response of external suppliers. PMID:28828316

MRI segmentation using dialectical optimization.

PubMed

dos Santos, Wellington P; de Assis, Francisco M; de Souza, Ricardo E

2009-01-01

Biology, Psychology and Social Sciences are intrinsically connected to the very roots of the development of algorithms and methods in Computational Intelligence, as it is easily seen in approaches like genetic algorithms, evolutionary programming and particle swarm optimization. In this work we propose a new optimization method based on dialectics using fuzzy membership functions to model the influence of interactions between integrating poles in the status of each pole. Poles are the basic units composing dialectical systems. In order to validate our proposal we designed a segmentation method based on the optimization of k-means using dialectics for the segmentation of MR images. As a case study we used 181 MR synthetic multispectral images composed by proton density, T(1)- and T(2)-weighted synthetic brain images of 181 slices with 1 mm, resolution of 1 mm(3), for a normal brain and a noiseless MR tomographic system without field inhomogeneities, amounting a total of 543 images, generated by the simulator BrainWeb [2]. Our principal target here is comparing our proposal to k-means, fuzzy c-means, and Kohonen's self-organized maps, concerning the quantization error, we proved that our method can improved results obtained using k-means.

Multi-Sensor Information Fusion for Optimizing Electric Bicycle Routes Using a Swarm Intelligence Algorithm

PubMed Central

Villarubia, Gabriel; De Paz, Juan F.; Bajo, Javier

2017-01-01

The use of electric bikes (e-bikes) has grown in popularity, especially in large cities where overcrowding and traffic congestion are common. This paper proposes an intelligent engine management system for e-bikes which uses the information collected from sensors to optimize battery energy and time. The intelligent engine management system consists of a built-in network of sensors in the e-bike, which is used for multi-sensor data fusion; the collected data is analysed and fused and on the basis of this information the system can provide the user with optimal and personalized assistance. The user is given recommendations related to battery consumption, sensors, and other parameters associated with the route travelled, such as duration, speed, or variation in altitude. To provide a user with these recommendations, artificial neural networks are used to estimate speed and consumption for each of the segments of a route. These estimates are incorporated into evolutionary algorithms in order to make the optimizations. A comparative analysis of the results obtained has been conducted for when routes were travelled with and without the optimization system. From the experiments, it is evident that the use of an engine management system results in significant energy and time savings. Moreover, user satisfaction increases as the level of assistance adapts to user behavior and the characteristics of the route. PMID:29088087

Multi-Sensor Information Fusion for Optimizing Electric Bicycle Routes Using a Swarm Intelligence Algorithm.

PubMed

De La Iglesia, Daniel H; Villarrubia, Gabriel; De Paz, Juan F; Bajo, Javier

2017-10-31

The use of electric bikes (e-bikes) has grown in popularity, especially in large cities where overcrowding and traffic congestion are common. This paper proposes an intelligent engine management system for e-bikes which uses the information collected from sensors to optimize battery energy and time. The intelligent engine management system consists of a built-in network of sensors in the e-bike, which is used for multi-sensor data fusion; the collected data is analysed and fused and on the basis of this information the system can provide the user with optimal and personalized assistance. The user is given recommendations related to battery consumption, sensors, and other parameters associated with the route travelled, such as duration, speed, or variation in altitude. To provide a user with these recommendations, artificial neural networks are used to estimate speed and consumption for each of the segments of a route. These estimates are incorporated into evolutionary algorithms in order to make the optimizations. A comparative analysis of the results obtained has been conducted for when routes were travelled with and without the optimization system. From the experiments, it is evident that the use of an engine management system results in significant energy and time savings. Moreover, user satisfaction increases as the level of assistance adapts to user behavior and the characteristics of the route.

Geochemistry of a Triassic dyke swarm in the North Patagonian Massif, Argentina. Implications for a postorogenic event of the Permian Gondwanide orogeny

NASA Astrophysics Data System (ADS)

González, Santiago N.; Greco, Gerson A.; González, Pablo D.; Sato, Ana M.; Llambías, Eduardo J.; Varela, Ricardo

2016-10-01

Permo-Triassic magmatism is widespread in the eastern North Patagonian Massif and has been related to the Gondwanide orogeny. Although a magmatic arc setting is widely accepted for the Permian plutonic rocks, the origin and geotectonic setting for the Triassic plutonic and volcanic rocks are still unknown. A NW-SE Triassic dyke swarm composed of andesites and latites with minor rhyolites was previously described in the Sierra Grande - Rincon de Paileman area. The dyke swarm was associated with extensional tectonics which was linked to a postorogenic process. In this paper we present new geochemical data of the rocks that form the swarm. Trachyandesites and rhyolites were separated based on their geochemical characteristics. Both groups may be considered originated from different sources. On the other hand, the content of incompatible elements (LILE and HFSE) indicates a strong relation between the swarm and an active continental margin. The samples also show a transitional signature between continental-arc and postcollisional or anorogenic settings. The new geochemical data on the dyke swarm support the idea of a magmatism that was linked to a postorogenic extensional tectonic regime related to a continental magmatic arc. Such an extension started in the Paleopacific margin of Pangea during the Anisian and might indicate the beginning of the Pangea break-up.

Swarms: Optimum aggregations of spacecraft

NASA Technical Reports Server (NTRS)

Mayer, H. L.

1980-01-01

Swarms are aggregations of spacecraft or elements of a space system which are cooperative in function, but physically isolated or only loosely connected. For some missions the swarm configuration may be optimum compared to a group of completely independent spacecraft or a complex rigidly integrated spacecraft or space platform. General features of swarms are induced by considering an ensemble of 26 swarms, examples ranging from Earth centered swarms for commercial application to swarms for exploring minor planets. A concept for a low altitude swarm as a substitute for a space platform is proposed and a preliminary design studied. The salient design feature is the web of tethers holding the 30 km swarm in a rigid two dimensional array in the orbital plane. A mathematical discussion and tutorial in tether technology and in some aspects of the distribution of services (mass, energy, and information to swarm elements) are included.

Earthquake statistics, spatiotemporal distribution of foci and source mechanisms - a key to understanding of the West Bohemia/Vogtland earthquake swarms

NASA Astrophysics Data System (ADS)

Horálek, Josef; Čermáková, Hana; Fischer, Tomáš

2016-04-01

Earthquake swarms are sequences of numerous events closely clustered in space and time and do not have a single dominant mainshock. A few of the largest events in a swarm reach similar magnitudes and usually occur throughout the course of the earthquake sequence. These attributes differentiate earthquake swarms from ordinary mainshock-aftershock sequences. Earthquake swarms occur worldwide, in diverse geological units. The swarms typically accompany volcanic activity at margins of the tectonic plate but also occur in intracontinental areas where strain from tectonic-plate movement is small. The origin of earthquake swarms is still unclear. The swarms typically occur at the plate margins but also in intracontinental areas. West Bohemia-Vogtland represents one of the most active intraplate earthquake-swarm areas in Europe. It is characterised by a frequent reoccurrence of ML < 4.0 swarms and by high activity of crustal fluids. West Bohemia-Vogtland is one of the most active intraplate earthquake-swarm areas in Europe which also exhibits high activity of crustal fluids. The Nový Kostel focal zone (NK) dominates the recent seismicity, there were swarms in 1997, 2000, 2008 and 20011, and a striking non-swarm activity (mainshock-aftershock sequences) up to magnitude ML= 4.5 in May to August 2014. The swarms and the 2014 mainshock-aftershock sequences are located close to each other at depths between 6 and 13 km. The frequency-magnitude distributions of all the swarms show bimodal-like character: the most events obey the b-value = 1.0 distribution, but a group of the largest events depart significantly from it. All the ML > 2.8 swarm events are located in a few dense clusters which implies step by step rupturing of one or a few asperities during the individual swarms. The source mechanism patters (moment-tensor description, MT) of the individual swarms indicate several families of the mechanisms, which fit well geometry of respective fault segments. MTs of the most events signify pure shears except for the 1997-swarm events the MTs of which indicates a combine sources including both shear and tensile components. The origin of earthquake swarms is still unclear. Nevertheless, we infer that the individual earthquake swarms in West Bohemia-Vogtland are mixture of the mainshock-aftershock sequences which correspond to step by step rupturing of one or a few asperities. The swarms occur on short fault segments with heterogeneous stress and strength, which may be affected by pressurized crustal fluids reducing normal component of the tectonic stress and lower friction. This way critically loaded faults are brought to failure and the swarm activity is driven by the differential local stress.

Hybrid artificial intelligence approach based on neural fuzzy inference model and metaheuristic optimization for flood susceptibilitgy modeling in a high-frequency tropical cyclone area using GIS

NASA Astrophysics Data System (ADS)

Tien Bui, Dieu; Pradhan, Biswajeet; Nampak, Haleh; Bui, Quang-Thanh; Tran, Quynh-An; Nguyen, Quoc-Phi

2016-09-01

This paper proposes a new artificial intelligence approach based on neural fuzzy inference system and metaheuristic optimization for flood susceptibility modeling, namely MONF. In the new approach, the neural fuzzy inference system was used to create an initial flood susceptibility model and then the model was optimized using two metaheuristic algorithms, Evolutionary Genetic and Particle Swarm Optimization. A high-frequency tropical cyclone area of the Tuong Duong district in Central Vietnam was used as a case study. First, a GIS database for the study area was constructed. The database that includes 76 historical flood inundated areas and ten flood influencing factors was used to develop and validate the proposed model. Root Mean Square Error (RMSE), Mean Absolute Error (MAE), Receiver Operating Characteristic (ROC) curve, and area under the ROC curve (AUC) were used to assess the model performance and its prediction capability. Experimental results showed that the proposed model has high performance on both the training (RMSE = 0.306, MAE = 0.094, AUC = 0.962) and validation dataset (RMSE = 0.362, MAE = 0.130, AUC = 0.911). The usability of the proposed model was evaluated by comparing with those obtained from state-of-the art benchmark soft computing techniques such as J48 Decision Tree, Random Forest, Multi-layer Perceptron Neural Network, Support Vector Machine, and Adaptive Neuro Fuzzy Inference System. The results show that the proposed MONF model outperforms the above benchmark models; we conclude that the MONF model is a new alternative tool that should be used in flood susceptibility mapping. The result in this study is useful for planners and decision makers for sustainable management of flood-prone areas.

Investigating Ground Swarm Robotics Using Agent Based Simulation

DTIC Science & Technology

2006-12-01

Incorporation of virtual pheromones as a shared memory map is modeled as an additional capability that is found to enhance the robustness and reliability of the...virtual pheromones as a shared memory map is modeled as an additional capability that is found to enhance the robustness and reliability of the swarm... PHEROMONES .......................................... 42 1. Repel Friends under Inorganic SA.................................................. 45 2. Max

A Communications Modeling System for Swarm-Based Sensors

DTIC Science & Technology

2003-09-01

6-10 6.6. Digital and Swarm System Performance Measures . . . . . . . . . . 6-21 7.1. Simulation computing hardware...detection and monitoring, and advances in computational capabilities have provided for embedded data analysis and the generation of information from raw... computing and manufacturing technology have made such systems possible. In order to harness this potential for Air Force applica- tions, a method of

Fuzzy distributed cooperative tracking for a swarm of unmanned aerial vehicles with heterogeneous goals

NASA Astrophysics Data System (ADS)

Kladis, Georgios P.; Menon, Prathyush P.; Edwards, Christopher

2016-12-01

This article proposes a systematic analysis for a tracking problem which ensures cooperation amongst a swarm of unmanned aerial vehicles (UAVs), modelled as nonlinear systems with linear and angular velocity constraints, in order to achieve different goals. A distributed Takagi-Sugeno (TS) framework design is adopted for the representation of the nonlinear model of the dynamics of the UAVs. The distributed control law which is introduced is composed of both node and network level information. Firstly, feedback gains are synthesised using a parallel distributed compensation (PDC) control law structure, for a collection of isolated UAVs; ignoring communications among the swarm. Then secondly, based on an alternation-like procedure, the resulting feedback gains are used to determine Lyapunov matrices which are utilised at network level to incorporate into the control law, the relative differences in the states of the vehicles, and to induce cooperative behaviour. Eventually stability is guaranteed for the entire swarm. The control synthesis is performed using tools from linear control theory: in particular the design criteria are posed as linear matrix inequalities (LMIs). An example based on a UAV tracking scenario is included to outline the efficacy of the approach.

Individual Pause-and-Go Motion Is Instrumental to the Formation and Maintenance of Swarms of Marching Locust Nymphs

PubMed Central

Ariel, Gil; Ophir, Yotam; Levi, Sagi; Ben-Jacob, Eshel; Ayali, Amir

2014-01-01

The principal interactions leading to the emergence of order in swarms of marching locust nymphs was studied both experimentally, using small groups of marching locusts in the lab, and using computer simulations. We utilized a custom tracking algorithm to reveal fundamental animal-animal interactions leading to collective motion. Uncovering this behavior introduced a new agent-based modeling approach in which pause-and-go motion is pivotal. The behavioral and modeling findings are largely based on motion-related visual sensory inputs obtained by the individual locust. Results suggest a generic principle, in which intermittent animal motion can be considered as a sequence of individual decisions as animals repeatedly reassess their situation and decide whether or not to swarm. This interpretation implies, among other things, some generic characteristics regarding the build-up and emergence of collective order in swarms: in particular, that order and disorder are generic meta-stable states of the system, suggesting that the emergence of order is kinetic and does not necessarily require external environmental changes. This work calls for further experimental as well as theoretical investigation of the neural mechanisms underlying locust coordinative behavior. PMID:24988464

The infrared spectral transmittance of Aspergillus niger spore aggregated particle swarm

NASA Astrophysics Data System (ADS)

Zhao, Xinying; Hu, Yihua; Gu, Youlin; Li, Le

2015-10-01

Microorganism aggregated particle swarm, which is quite an important composition of complex media environment, can be developed as a new kind of infrared functional materials. Current researches mainly focus on the optical properties of single microorganism particle. As for the swarm, especially the microorganism aggregated particle swarm, a more accurate simulation model should be proposed to calculate its extinction effect. At the same time, certain parameters deserve to be discussed, which helps to better develop the microorganism aggregated particle swarm as a new kind of infrared functional materials. In this paper, take Aspergillus Niger spore as an example. On the one hand, a new calculation model is established. Firstly, the cluster-cluster aggregation (CCA) model is used to simulate the structure of Aspergillus Niger spore aggregated particle. Secondly, the single scattering extinction parameters for Aspergillus Niger spore aggregated particle are calculated by using the discrete dipole approximation (DDA) method. Thirdly, the transmittance of Aspergillus Niger spore aggregated particle swarm is simulated by using Monte Carlo method. On the other hand, based on the model proposed above, what influences can wavelength causes has been studied, including the spectral distribution of scattering intensity of Aspergillus Niger spore aggregated particle and the infrared spectral transmittance of the aggregated particle swarm within the range of 8-14μm incident infrared wavelengths. Numerical results indicate that the scattering intensity of Aspergillus Niger spore aggregated particle reduces with the increase of incident wavelengths at each scattering angle. Scattering energy mainly concentrates on the scattering angle between 0-40°, forward scattering has an obvious effect. In addition, the infrared transmittance of Aspergillus Niger spore aggregated particle swarm goes up with the increase of incident wavelengths. However, some turning points of the trend are associated with the absorption capacity of the swarm. When parameters of the swarm are set as follows: each Aspergillus Niger spore aggregated particle contains 40 original particles, the radius of original particle is 1.5μm, the density of aggregated particles is around 200/cm3, the measurement area is 4 meters thick, under conditions mentioned above, the infrared transmittance can be less than 10% between the incident wavelengths of 9.5-13μm. In the end, all the results provide the basis for better developing the microorganism aggregated particle swarm as a new kind of infrared functional materials and precisely choosing the effective defiladed infrared band.

Initiation of Swarming Motility by Proteus mirabilis Occurs in Response to Specific Cues Present in Urine and Requires Excess l-Glutamine

PubMed Central

Armbruster, Chelsie E.; Hodges, Steven A.

2013-01-01

Proteus mirabilis, a leading cause of catheter-associated urinary tract infection (CaUTI), differentiates into swarm cells that migrate across catheter surfaces and medium solidified with 1.5% agar. While many genes and nutrient requirements involved in the swarming process have been identified, few studies have addressed the signals that promote initiation of swarming following initial contact with a surface. In this study, we show that P. mirabilis CaUTI isolates initiate swarming in response to specific nutrients and environmental cues. Thirty-three compounds, including amino acids, polyamines, fatty acids, and tricarboxylic acid (TCA) cycle intermediates, were tested for the ability to promote swarming when added to normally nonpermissive media. l-Arginine, l-glutamine, dl-histidine, malate, and dl-ornithine promoted swarming on several types of media without enhancing swimming motility or growth rate. Testing of isogenic mutants revealed that swarming in response to the cues required putrescine biosynthesis and pathways involved in amino acid metabolism. Furthermore, excess glutamine was found to be a strict requirement for swarming on normal swarm agar in addition to being a swarming cue under normally nonpermissive conditions. We thus conclude that initiation of swarming occurs in response to specific cues and that manipulating concentrations of key nutrient cues can signal whether or not a particular environment is permissive for swarming. PMID:23316040

Biogeography-based particle swarm optimization with fuzzy elitism and its applications to constrained engineering problems

NASA Astrophysics Data System (ADS)

Guo, Weian; Li, Wuzhao; Zhang, Qun; Wang, Lei; Wu, Qidi; Ren, Hongliang

2014-11-01

In evolutionary algorithms, elites are crucial to maintain good features in solutions. However, too many elites can make the evolutionary process stagnate and cannot enhance the performance. This article employs particle swarm optimization (PSO) and biogeography-based optimization (BBO) to propose a hybrid algorithm termed biogeography-based particle swarm optimization (BPSO) which could make a large number of elites effective in searching optima. In this algorithm, the whole population is split into several subgroups; BBO is employed to search within each subgroup and PSO for the global search. Since not all the population is used in PSO, this structure overcomes the premature convergence in the original PSO. Time complexity analysis shows that the novel algorithm does not increase the time consumption. Fourteen numerical benchmarks and four engineering problems with constraints are used to test the BPSO. To better deal with constraints, a fuzzy strategy for the number of elites is investigated. The simulation results validate the feasibility and effectiveness of the proposed algorithm.

A swarm-trained k-nearest prototypes adaptive classifier with automatic feature selection for interval data.

PubMed

Silva Filho, Telmo M; Souza, Renata M C R; Prudêncio, Ricardo B C

2016-08-01

Some complex data types are capable of modeling data variability and imprecision. These data types are studied in the symbolic data analysis field. One such data type is interval data, which represents ranges of values and is more versatile than classic point data for many domains. This paper proposes a new prototype-based classifier for interval data, trained by a swarm optimization method. Our work has two main contributions: a swarm method which is capable of performing both automatic selection of features and pruning of unused prototypes and a generalized weighted squared Euclidean distance for interval data. By discarding unnecessary features and prototypes, the proposed algorithm deals with typical limitations of prototype-based methods, such as the problem of prototype initialization. The proposed distance is useful for learning classes in interval datasets with different shapes, sizes and structures. When compared to other prototype-based methods, the proposed method achieves lower error rates in both synthetic and real interval datasets. Copyright © 2016 Elsevier Ltd. All rights reserved.

An immune-inspired swarm aggregation algorithm for self-healing swarm robotic systems.

PubMed

Timmis, J; Ismail, A R; Bjerknes, J D; Winfield, A F T

2016-08-01

Swarm robotics is concerned with the decentralised coordination of multiple robots having only limited communication and interaction abilities. Although fault tolerance and robustness to individual robot failures have often been used to justify the use of swarm robotic systems, recent studies have shown that swarm robotic systems are susceptible to certain types of failure. In this paper we propose an approach to self-healing swarm robotic systems and take inspiration from the process of granuloma formation, a process of containment and repair found in the immune system. We use a case study of a swarm performing team work where previous works have demonstrated that partially failed robots have the most detrimental effect on overall swarm behaviour. We have developed an immune inspired approach that permits the recovery from certain failure modes during operation of the swarm, overcoming issues that effect swarm behaviour associated with partially failed robots. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.

Thermal and athermal three-dimensional swarms of self-propelled particles

NASA Astrophysics Data System (ADS)

Nguyen, Nguyen H. P.; Jankowski, Eric; Glotzer, Sharon C.

2012-07-01

Swarms of self-propelled particles exhibit complex behavior that can arise from simple models, with large changes in swarm behavior resulting from small changes in model parameters. We investigate the steady-state swarms formed by self-propelled Morse particles in three dimensions using molecular dynamics simulations optimized for graphics processing units. We find a variety of swarms of different overall shape assemble spontaneously and that for certain Morse potential parameters at most two competing structures are observed. We report a rich “phase diagram” of athermal swarm structures observed across a broad range of interaction parameters. Unlike the structures formed in equilibrium self-assembly, we find that the probability of forming a self-propelled swarm can be biased by the choice of initial conditions. We investigate how thermal noise influences swarm formation and demonstrate ways it can be exploited to reconfigure one swarm into another. Our findings validate and extend previous observations of self-propelled Morse swarms and highlight open questions for predictive theories of nonequilibrium self-assembly.

Prediction of pKa Values for Neutral and Basic Drugs based on Hybrid Artificial Intelligence Methods.

PubMed

Li, Mengshan; Zhang, Huaijing; Chen, Bingsheng; Wu, Yan; Guan, Lixin

2018-03-05

The pKa value of drugs is an important parameter in drug design and pharmacology. In this paper, an improved particle swarm optimization (PSO) algorithm was proposed based on the population entropy diversity. In the improved algorithm, when the population entropy was higher than the set maximum threshold, the convergence strategy was adopted; when the population entropy was lower than the set minimum threshold the divergence strategy was adopted; when the population entropy was between the maximum and minimum threshold, the self-adaptive adjustment strategy was maintained. The improved PSO algorithm was applied in the training of radial basis function artificial neural network (RBF ANN) model and the selection of molecular descriptors. A quantitative structure-activity relationship model based on RBF ANN trained by the improved PSO algorithm was proposed to predict the pKa values of 74 kinds of neutral and basic drugs and then validated by another database containing 20 molecules. The validation results showed that the model had a good prediction performance. The absolute average relative error, root mean square error, and squared correlation coefficient were 0.3105, 0.0411, and 0.9685, respectively. The model can be used as a reference for exploring other quantitative structure-activity relationships.

Stable and accurate methods for identification of water bodies from Landsat series imagery using meta-heuristic algorithms

NASA Astrophysics Data System (ADS)

Gamshadzaei, Mohammad Hossein; Rahimzadegan, Majid

2017-10-01

Identification of water extents in Landsat images is challenging due to surfaces with similar reflectance to water extents. The objective of this study is to provide stable and accurate methods for identifying water extents in Landsat images based on meta-heuristic algorithms. Then, seven Landsat images were selected from various environmental regions in Iran. Training of the algorithms was performed using 40 water pixels and 40 nonwater pixels in operational land imager images of Chitgar Lake (one of the study regions). Moreover, high-resolution images from Google Earth were digitized to evaluate the results. Two approaches were considered: index-based and artificial intelligence (AI) algorithms. In the first approach, nine common water spectral indices were investigated. AI algorithms were utilized to acquire coefficients of optimal band combinations to extract water extents. Among the AI algorithms, the artificial neural network algorithm and also the ant colony optimization, genetic algorithm, and particle swarm optimization (PSO) meta-heuristic algorithms were implemented. Index-based methods represented different performances in various regions. Among AI methods, PSO had the best performance with average overall accuracy and kappa coefficient of 93% and 98%, respectively. The results indicated the applicability of acquired band combinations to extract accurately and stably water extents in Landsat imagery.

A Multiuser Detector Based on Artificial Bee Colony Algorithm for DS-UWB Systems

PubMed Central

Liu, Xiaohui

2013-01-01

Artificial Bee Colony (ABC) algorithm is an optimization algorithm based on the intelligent behavior of honey bee swarm. The ABC algorithm was developed to solve optimizing numerical problems and revealed premising results in processing time and solution quality. In ABC, a colony of artificial bees search for rich artificial food sources; the optimizing numerical problems are converted to the problem of finding the best parameter which minimizes an objective function. Then, the artificial bees randomly discover a population of initial solutions and then iteratively improve them by employing the behavior: moving towards better solutions by means of a neighbor search mechanism while abandoning poor solutions. In this paper, an efficient multiuser detector based on a suboptimal code mapping multiuser detector and artificial bee colony algorithm (SCM-ABC-MUD) is proposed and implemented in direct-sequence ultra-wideband (DS-UWB) systems under the additive white Gaussian noise (AWGN) channel. The simulation results demonstrate that the BER and the near-far effect resistance performances of this proposed algorithm are quite close to those of the optimum multiuser detector (OMD) while its computational complexity is much lower than that of OMD. Furthermore, the BER performance of SCM-ABC-MUD is not sensitive to the number of active users and can obtain a large system capacity. PMID:23983638

Seismological aspects of the 1989-1990 eruptions at redoubt volcano, Alaska: the SSAM perspective

USGS Publications Warehouse

Stephens, C.D.; Chouet, B.A.; Page, R.A.; Lahr, J.C.; Power, J.A.

1994-01-01

SSAM is a simple and inexpensive tool for continuous monitoring of average seismic amplitudes within selected frequency bands in near real-time on a PC-based data acquisition system. During the 1989-1990 eruption sequence at Redoubt Volcano, the potential of SSAM to aid in rapid identification of precursory Long-Period (LP) event swarms was realized, and since this time SSAM has been incorporated in routine monitoring efforts of the Alaska Volcano Observatory. In particular, an eruption that occurred on April 6 was successfully forecast primarily on the basis of recognizing the precursory LP activity on SSAM. Of twenty-two significant eruptions that occurred between December 14 and April 21, eleven had precursory swarms longer than one hour in duration that could be detected on SSAM. For individual swarms, the patterns of relative spectral amplitudes are distinct at each station and remain largely stationary through time, thus indicating that one source may have been preferentially and repeatedly activated throughout the swarm. Typically, a single spectral band dominates the signal at each seismic station: for the vigorous one-day swarm that preceded the first eruption on December 14, signals were sharply peaked in the 1.9-2.7 Hz band at the closest station, located 4 km from the vent, but were dominated by 1.3-1.9 Hz energy at three more distant stations located 7.5-22 km from the vent. The tendency for the signals from different swarms recorded at the same station to be peaked in the same frequency band suggests that all of the sources are characterized by a predominant length scale. Signals from the precursory LP swarms became weaker as the eruption sequence progressed, and swarms that occurred in March and April could only be detected at seismographs on the volcanic edifice. Onset times of precursory LP swarms prior to eruptions ranged from a few hours to about one week, but after the initial vent-clearing phase that ended December 19 these intervals tended to become progressively shorter for successive swarms. These trends in the relative onset times and intensities of successive precursory LP swarms are consistent with an overall depressurization of the magmatic system through time. In general, each of the swarms had an emergent onset, but the intensities did not always increase steadily until the eruptions. Instead, as the time of an eruption approached the intensity usually increased more rapidly before peaking and then declining prior to the eruption; for three of the swarms, two distinct peaks in intensity were apparent. The time intervals between final peaks in swarm intensity and ensuing eruptions ranged from about 2 hours to almost 2 days, but the peaks always occurred closer to the eruptions than to the swarm onsets. Both the onset of LP swarm activity and a decline in intensity prior to an eruption may represent critical points in the process of pressurization that drives the flow of fluids and gas in a sealed magmatic system. A notable exception to this pattern is the eruption of March 9 which lacked a detectable precursory LP swarm, but was followed by an unusually long period of strong LP seismicity that may have been stimulated by a depressurization of the magmatic system resulting from dome failure. On both December 14 and January 2, the spectra of early syn-eruptive signals have peaked signatures much like those of the spectra of precursory LP activity from shortly before the eruptions; these similarities may indicate that the source of precursory seismicity continued to be active during at least the early part of each eruption. In syn-eruptive signals from March and April recorded at stations on the volcanic edifice, the dominant spectral energy progressively shifts with time during the eruption to lower frequencies; at least part of the energy in these signals may have been generated by the debris flows associated with dome failures. ?? 1994.

Seismogenic structures activated during the pre-eruptive and intrusive swarms of Piton de la Fournaise volcano (La Réunion island) between 2008 and 2011

NASA Astrophysics Data System (ADS)

Battaglia, J.; Brenguier, F.

2011-12-01

Piton de la Fournaise is a frequently active basaltic volcano with more than 30 fissure eruptions since 1998. These eruptions are always preceded by pre-eruptive swarms of volcano-tectonic earthquakes which accompany dike propagation. Occasionally, intrusion swarms occur without leading to any eruption. From October 2008 to May 2011, as part of the research project Undervolc, a temporary network of 15 broadband stations has been installed on the volcano to complement the local monitoring network. We examined in detail the 6 intrusive and 5 pre-eruptive swarms which occurred during the temporary experiment. All the crises lasted for a few hours and only included shallow events clustered below the summit craters, around and above sea level, showing no signs of deeper magma transfers. These characteristics are common to most swarms observed at Piton de la Fournaise arising questions about the origin of the seismicity which seems to be poorly linked with dike propagation. With the aim to identify the main seismogenic structures active during the swarms, we applied precise earthquake detection and classification techniques based on waveform cross-correlation. For each swarm, the onsets of all transients, including small amplitude ones, have been precisely detected at a single station by scanning the continuous data with reference waveforms. The classification of the detected transients indicates the presence of several families of similar earthquakes. The two main families (F01 and F02) include several hundred events. They are systematically activated at the beginning of each pre-eruptive swarm but are inactive during the intrusive ones. They group more than 50 percent of the detected events for the corresponding crises. The other clusters are mostly associated with single swarms. To determine the spatial characteristics of the structures corresponding to the main families, we applied precise relocation techniques. Based on the one-station classification, the events have first been picked at all available stations by cross-correlating waveforms with those of master events whose arrival times have been manually determined. All events have been located using a 3D velocity model to determine accurate hypocentral azimuths and take-off angles. Precise relative locations have been computed for each multiplet using cross-correlation delays calculated for all available stations between all pairs of events. The results indicate the presence at sea level of a major structure grouping families F01 and F02 and describing an East-West elongated pattern with sub-vertical extension. Small scale earthquake migrations, mostly horizontal, occur during the pre-eruptive swarms along that structure. The smaller multiplets define vertically elongated patterns extending around and above the main F01-F02 multiplet. Our results show that different processes are involved in pre-eruptive and intrusive crises and that a structure located around 2.5 km below the summit controls the occurrence of recent eruptions of Piton de la Fournaise volcano.

Applying a multiobjective metaheuristic inspired by honey bees to phylogenetic inference.

PubMed

Santander-Jiménez, Sergio; Vega-Rodríguez, Miguel A

2013-10-01

The development of increasingly popular multiobjective metaheuristics has allowed bioinformaticians to deal with optimization problems in computational biology where multiple objective functions must be taken into account. One of the most relevant research topics that can benefit from these techniques is phylogenetic inference. Throughout the years, different researchers have proposed their own view about the reconstruction of ancestral evolutionary relationships among species. As a result, biologists often report different phylogenetic trees from a same dataset when considering distinct optimality principles. In this work, we detail a multiobjective swarm intelligence approach based on the novel Artificial Bee Colony algorithm for inferring phylogenies. The aim of this paper is to propose a complementary view of phylogenetics according to the maximum parsimony and maximum likelihood criteria, in order to generate a set of phylogenetic trees that represent a compromise between these principles. Experimental results on a variety of nucleotide data sets and statistical studies highlight the relevance of the proposal with regard to other multiobjective algorithms and state-of-the-art biological methods. Copyright © 2013 Elsevier Ireland Ltd. All rights reserved.

Bee Swarm Optimization for Medical Web Information Foraging.

PubMed

Drias, Yassine; Kechid, Samir; Pasi, Gabriella

2016-02-01

The present work is related to Web intelligence and more precisely to medical information foraging. We present here a novel approach based on agents technology for information foraging. An architecture is proposed, in which we distinguish two important phases. The first one is a learning process for localizing the most relevant pages that might interest the user. This is performed on a fixed instance of the Web. The second takes into account the openness and the dynamicity of the Web. It consists on an incremental learning starting from the result of the first phase and reshaping the outcomes taking into account the changes that undergoes the Web. The whole system offers a tool to help the user undertaking information foraging. We implemented the system using a group of cooperative reactive agents and more precisely a colony of artificial bees. In order to validate our proposal, experiments were conducted on MedlinePlus, a benchmark dedicated for research in the domain of Health. The results are promising either for those related to Web regularities and for the response time, which is very short and hence complies the real time constraint.

A controllable sensor management algorithm capable of learning

NASA Astrophysics Data System (ADS)

Osadciw, Lisa A.; Veeramacheneni, Kalyan K.

2005-03-01

Sensor management technology progress is challenged by the geographic space it spans, the heterogeneity of the sensors, and the real-time timeframes within which plans controlling the assets are executed. This paper presents a new sensor management paradigm and demonstrates its application in a sensor management algorithm designed for a biometric access control system. This approach consists of an artificial intelligence (AI) algorithm focused on uncertainty measures, which makes the high level decisions to reduce uncertainties and interfaces with the user, integrated cohesively with a bottom up evolutionary algorithm, which optimizes the sensor network"s operation as determined by the AI algorithm. The sensor management algorithm presented is composed of a Bayesian network, the AI algorithm component, and a swarm optimization algorithm, the evolutionary algorithm. Thus, the algorithm can change its own performance goals in real-time and will modify its own decisions based on observed measures within the sensor network. The definition of the measures as well as the Bayesian network determine the robustness of the algorithm and its utility in reacting dynamically to changes in the global system.

Improved artificial bee colony algorithm for wavefront sensor-less system in free space optical communication

NASA Astrophysics Data System (ADS)

Niu, Chaojun; Han, Xiang'e.

2015-10-01

Adaptive optics (AO) technology is an effective way to alleviate the effect of turbulence on free space optical communication (FSO). A new adaptive compensation method can be used without a wave-front sensor. Artificial bee colony algorithm (ABC) is a population-based heuristic evolutionary algorithm inspired by the intelligent foraging behaviour of the honeybee swarm with the advantage of simple, good convergence rate, robust and less parameter setting. In this paper, we simulate the application of the improved ABC to correct the distorted wavefront and proved its effectiveness. Then we simulate the application of ABC algorithm, differential evolution (DE) algorithm and stochastic parallel gradient descent (SPGD) algorithm to the FSO system and analyze the wavefront correction capabilities by comparison of the coupling efficiency, the error rate and the intensity fluctuation in different turbulence before and after the correction. The results show that the ABC algorithm has much faster correction speed than DE algorithm and better correct ability for strong turbulence than SPGD algorithm. Intensity fluctuation can be effectively reduced in strong turbulence, but not so effective in week turbulence.

Collection, quality control and delivery of ground-based magnetic data during ESA's Swarm mission

NASA Astrophysics Data System (ADS)

Macmillan, Susan; Humphries, Thomas; Flower, Simon; Swan, Anthony

2016-04-01

Ground-based magnetic data are used in a variety of ways when analysing satellite data. Selecting satellite data often involves the use of magnetic disturbance indices derived from ground-based stations and inverting satellite magnetic data for models of fields from various sources often requires ground-based data. Ground-based data can also be valuable independent data for validation purposes. We summarise data collection and quality control procedures in place at the British Geological Survey for global ground-based observatory and repeat station data. Whilst ongoing participation in the ICSU World Data System and INTERMAGNET facilitates this work, additional procedures have been specially developed for the Swarm mission. We describe these in detail.

Obtaining Approximate Values of Exterior Orientation Elements of Multi-Intersection Images Using Particle Swarm Optimization

NASA Astrophysics Data System (ADS)

Li, X.; Li, S. W.

2012-07-01

In this paper, an efficient global optimization algorithm in the field of artificial intelligence, named Particle Swarm Optimization (PSO), is introduced into close range photogrammetric data processing. PSO can be applied to obtain the approximate values of exterior orientation elements under the condition that multi-intersection photography and a small portable plane control frame are used. PSO, put forward by an American social psychologist J. Kennedy and an electrical engineer R.C. Eberhart, is a stochastic global optimization method based on swarm intelligence, which was inspired by social behavior of bird flocking or fish schooling. The strategy of obtaining the approximate values of exterior orientation elements using PSO is as follows: in terms of image coordinate observed values and space coordinates of few control points, the equations of calculating the image coordinate residual errors can be given. The sum of absolute value of each image coordinate is minimized to be the objective function. The difference between image coordinate observed value and the image coordinate computed through collinear condition equation is defined as the image coordinate residual error. Firstly a gross area of exterior orientation elements is given, and then the adjustment of other parameters is made to get the particles fly in the gross area. After iterative computation for certain times, the satisfied approximate values of exterior orientation elements are obtained. By doing so, the procedures like positioning and measuring space control points in close range photogrammetry can be avoided. Obviously, this method can improve the surveying efficiency greatly and at the same time can decrease the surveying cost. And during such a process, only one small portable control frame with a couple of control points is employed, and there are no strict requirements for the space distribution of control points. In order to verify the effectiveness of this algorithm, two experiments are carried out. In the first experiment, images of a standard grid board are taken according to multi-intersection photography using digital camera. Three points or six points which are located on the left-down corner of the standard grid are regarded as control points respectively, and the exterior orientation elements of each image are computed through PSO, and compared with these elements computed through bundle adjustment. In the second experiment, the exterior orientation elements obtained from the first experiment are used as approximate values in bundle adjustment and then the space coordinates of other grid points on the board can be computed. The coordinate difference of grid points between these computed space coordinates and their known coordinates can be used to compute the accuracy. The point accuracy computed in above experiments are ±0.76mm and ±0.43mm respectively. The above experiments prove the effectiveness of PSO used in close range photogrammetry to compute approximate values of exterior orientation elements, and the algorithm can meet the requirement of higher accuracy. In short, PSO can get better results in a faster, cheaper way compared with other surveying methods in close range photogrammetry.

Self-organized sorting limits behavioral variability in swarms

PubMed Central

Copenhagen, Katherine; Quint, David A.; Gopinathan, Ajay

2016-01-01

Swarming is a phenomenon where collective motion arises from simple local interactions between typically identical individuals. Here, we investigate the effects of variability in behavior among the agents in finite swarms with both alignment and cohesive interactions. We show that swarming is abolished above a critical fraction of non-aligners who do not participate in alignment. In certain regimes, however, swarms above the critical threshold can dynamically reorganize and sort out excess non-aligners to maintain the average fraction close to the critical value. This persists even in swarms with a distribution of alignment interactions, suggesting a simple, robust and efficient mechanism that allows heterogeneously mixed populations to naturally regulate their composition and remain in a collective swarming state or even differentiate among behavioral phenotypes. We show that, for evolving swarms, this self-organized sorting behavior can couple to the evolutionary dynamics leading to new evolutionarily stable equilibrium populations set by the physical swarm parameters. PMID:27550316

Elastic and inelastic collisions of swarms

NASA Astrophysics Data System (ADS)

Armbruster, Dieter; Martin, Stephan; Thatcher, Andrea

2017-04-01

Scattering interactions of swarms in potentials that are generated by an attraction-repulsion model are studied. In free space, swarms in this model form a well-defined steady state describing the translation of a stable formation of the particles whose shape depends on the interaction potential. Thus, the collision between a swarm and a boundary or between two swarms can be treated as (quasi)-particle scattering. Such scattering experiments result in internal excitations of the swarm or in bound states, respectively. In addition, varying a parameter linked to the relative importance of damping and potential forces drives transitions between elastic and inelastic scattering of the particles. By tracking the swarm's center of mass, a refraction rule is derived via simulations relating the incoming and outgoing directions of a swarm hitting the wall. Iterating the map derived from the refraction law allows us to predict and understand the dynamics and bifurcations of swarms in square boxes and in channels.

Self-organized sorting limits behavioral variability in swarms

NASA Astrophysics Data System (ADS)

Copenhagen, Katherine; Quint, David A.; Gopinathan, Ajay

2016-08-01

Swarming is a phenomenon where collective motion arises from simple local interactions between typically identical individuals. Here, we investigate the effects of variability in behavior among the agents in finite swarms with both alignment and cohesive interactions. We show that swarming is abolished above a critical fraction of non-aligners who do not participate in alignment. In certain regimes, however, swarms above the critical threshold can dynamically reorganize and sort out excess non-aligners to maintain the average fraction close to the critical value. This persists even in swarms with a distribution of alignment interactions, suggesting a simple, robust and efficient mechanism that allows heterogeneously mixed populations to naturally regulate their composition and remain in a collective swarming state or even differentiate among behavioral phenotypes. We show that, for evolving swarms, this self-organized sorting behavior can couple to the evolutionary dynamics leading to new evolutionarily stable equilibrium populations set by the physical swarm parameters.

Detection of earthquake swarms at subduction zones globally: Insights into tectonic controls on swarm activity

NASA Astrophysics Data System (ADS)

Nishikawa, T.; Ide, S.

2017-07-01

Earthquake swarms are characterized by an increase in seismicity rate that lacks a distinguished main shock and does not obey Omori's law. At subduction zones, they are thought to be related to slow-slip events (SSEs) on the plate interface. Earthquake swarms in subduction zones can therefore be used as potential indicators of slow-slip events. However, the global distribution of earthquake swarms at subduction zones remains unclear. Here we present a method for detecting such earthquake sequences using the space-time epidemic-type aftershock-sequence model. We applied this method to seismicity (M ≥ 4.5) recorded in the Advanced National Seismic System catalog at subduction zones during the period of 1995-2009. We detected 453 swarms, which is about 6.7 times the number observed in a previous catalog. Foreshocks of some large earthquakes are also detected as earthquake swarms. In some subduction zones, such as at Ibaraki-Oki, Japan, swarm-like foreshocks and ordinary swarms repeatedly occur at the same location. Given that both foreshocks and swarms are related to SSEs on the plate interface, these regions may have experienced recurring SSEs. We then compare the swarm activity and tectonic properties of subduction zones, finding that swarm activity is positively correlated with curvature of the incoming plate before subduction. This result implies that swarm activity is controlled either by hydration of the incoming plate or by heterogeneity on the plate interface due to fracturing related to slab bending.

Particle Swarm Optimization Based Feature Enhancement and Feature Selection for Improved Emotion Recognition in Speech and Glottal Signals

PubMed Central

Muthusamy, Hariharan; Polat, Kemal; Yaacob, Sazali

2015-01-01

In the recent years, many research works have been published using speech related features for speech emotion recognition, however, recent studies show that there is a strong correlation between emotional states and glottal features. In this work, Mel-frequency cepstralcoefficients (MFCCs), linear predictive cepstral coefficients (LPCCs), perceptual linear predictive (PLP) features, gammatone filter outputs, timbral texture features, stationary wavelet transform based timbral texture features and relative wavelet packet energy and entropy features were extracted from the emotional speech (ES) signals and its glottal waveforms(GW). Particle swarm optimization based clustering (PSOC) and wrapper based particle swarm optimization (WPSO) were proposed to enhance the discerning ability of the features and to select the discriminating features respectively. Three different emotional speech databases were utilized to gauge the proposed method. Extreme learning machine (ELM) was employed to classify the different types of emotions. Different experiments were conducted and the results show that the proposed method significantly improves the speech emotion recognition performance compared to previous works published in the literature. PMID:25799141

Stormwater runoff in watersheds: a system for prediciting impacts of development and climate change

Treesearch

Ann Blair; Denise Sanger; Susan Lovelace

2016-01-01

The Stormwater Runoff Modeling System (SWARM) enhances understanding of impacts of land-use and climate change on stormwater runoff in watersheds. We developed this singleevent system based on US Department of Agriculture, Natural Resources Conservation Service curve number and unit hydrograph methods. We tested SWARM using US Geological Survey discharge and rain data...

Adaptive infinite impulse response system identification using modified-interior search algorithm with Lèvy flight.

PubMed

Kumar, Manjeet; Rawat, Tarun Kumar; Aggarwal, Apoorva

2017-03-01

In this paper, a new meta-heuristic optimization technique, called interior search algorithm (ISA) with Lèvy flight is proposed and applied to determine the optimal parameters of an unknown infinite impulse response (IIR) system for the system identification problem. ISA is based on aesthetics, which is commonly used in interior design and decoration processes. In ISA, composition phase and mirror phase are applied for addressing the nonlinear and multimodal system identification problems. System identification using modified-ISA (M-ISA) based method involves faster convergence, single parameter tuning and does not require derivative information because it uses a stochastic random search using the concepts of Lèvy flight. A proper tuning of control parameter has been performed in order to achieve a balance between intensification and diversification phases. In order to evaluate the performance of the proposed method, mean square error (MSE), computation time and percentage improvement are considered as the performance measure. To validate the performance of M-ISA based method, simulations has been carried out for three benchmarked IIR systems using same order and reduced order system. Genetic algorithm (GA), particle swarm optimization (PSO), cat swarm optimization (CSO), cuckoo search algorithm (CSA), differential evolution using wavelet mutation (DEWM), firefly algorithm (FFA), craziness based particle swarm optimization (CRPSO), harmony search (HS) algorithm, opposition based harmony search (OHS) algorithm, hybrid particle swarm optimization-gravitational search algorithm (HPSO-GSA) and ISA are also used to model the same examples and simulation results are compared. Obtained results confirm the efficiency of the proposed method. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

Intelligent self-organization methods for wireless ad hoc sensor networks based on limited resources

NASA Astrophysics Data System (ADS)

Hortos, William S.

2006-05-01

A wireless ad hoc sensor network (WSN) is a configuration for area surveillance that affords rapid, flexible deployment in arbitrary threat environments. There is no infrastructure support and sensor nodes communicate with each other only when they are in transmission range. To a greater degree than the terminals found in mobile ad hoc networks (MANETs) for communications, sensor nodes are resource-constrained, with limited computational processing, bandwidth, memory, and power, and are typically unattended once in operation. Consequently, the level of information exchange among nodes, to support any complex adaptive algorithms to establish network connectivity and optimize throughput, not only deplete those limited resources and creates high overhead in narrowband communications, but also increase network vulnerability to eavesdropping by malicious nodes. Cooperation among nodes, critical to the mission of sensor networks, can thus be disrupted by the inappropriate choice of the method for self-organization. Recent published contributions to the self-configuration of ad hoc sensor networks, e.g., self-organizing mapping and swarm intelligence techniques, have been based on the adaptive control of the cross-layer interactions found in MANET protocols to achieve one or more performance objectives: connectivity, intrusion resistance, power control, throughput, and delay. However, few studies have examined the performance of these algorithms when implemented with the limited resources of WSNs. In this paper, self-organization algorithms for the initiation, operation and maintenance of a network topology from a collection of wireless sensor nodes are proposed that improve the performance metrics significant to WSNs. The intelligent algorithm approach emphasizes low computational complexity, energy efficiency and robust adaptation to change, allowing distributed implementation with the actual limited resources of the cooperative nodes of the network. Extensions of the algorithms from flat topologies to two-tier hierarchies of sensor nodes are presented. Results from a few simulations of the proposed algorithms are compared to the published results of other approaches to sensor network self-organization in common scenarios. The estimated network lifetime and extent under static resource allocations are computed.

An Earthquake Swarm Search Implemented at Major Convergent Margins to Test for Associated Aseismic Slip

NASA Astrophysics Data System (ADS)

Holtkamp, S. G.; Pritchard, M. E.; Lohman, R. B.; Brudzinski, M. R.

2009-12-01

Recent geodetic analysis indicates earthquake swarms may be associated with slow slip such that earthquakes may only represent a fraction of the moment release. To investigate this potential relationship, we have developed a manual search approach to identify earthquake swarms from a seismicity catalog. Our technique is designed to be insensitive to spatial and temporal scales and the total number of events, as seismicity rates vary in different fault zones. Our first application of this technique on globally recorded earthquakes in South America detects 35 possible swarms of varying spatial scale, with 18 in the megathrust region and 8 along the volcanic arc. Three swarms in the vicinity of the arc appear to be triggered by the Mw=8.5 2001 Peru earthquake, and are examined for possible triggering mechanisms. Coulomb stress modeling suggests that static stress changes due to the earthquake are insufficient to trigger activity, so a dynamic or secondary triggering mechanism is more likely. Volcanic swarms are often associated with ground deformation, either associated with fluid movement (e.g. dike intrusion or chamber inflation or deflation) or fault movement, although these processes are sometimes difficult to differentiate. The only swarm along the arc with sufficient geodetic data that we can process and model is near Ticsani Volcano in Peru. In this case, a swarm of events southeast of the volcano precedes a more typical earthquake sequence beneath the volcano, and evidence for deformation is found in the location of the swarm, but there is no evidence for aseismic slip. Rather, we favor a model where the swarm is associated with deflation of a magma body to the southeast that triggered the earthquake sequence by promoting movement on a fault beneath Ticsani. Since swarms on the subduction interface may indicate aseismic moment release, with a direct impact on hazard, we examine potential relations between swarms and megathrust ruptures. We find evidence that some earthquake swarms show strong interaction with megathrust events where swarms precede the mainshock, swarms show stress interaction with the events, swarms mark the limits of rupture propagation, and swarms occur in areas of long standing seismic gaps. The latter two features also reflect several cases where swarms occur at the subduction of aseismic ridges and trench parallel gravity highs, features often related to megathrust segmentation. Considering that aseismic ridges likely represent material heterogeneity and earthquake swarms typically have low stress drops, we propose that swarms primarily occur in transitional areas of weak coupling that inhibit megathrust seismogenesis and facilitate earthquake swarms. Only 1 swarm in the megathrust area has sufficient geodetic data to investigate slip models, offshore Copiapo, Chile, and while the preferred model suggests aseismic slip, difficulty in modeling an offshore event with onshore data indicates a model without aseismic slip cannot be ruled out. To further examine whether the relationship between swarms and megathrust segmentation is locally derived or more pervasive, we will present results from applying our technique to other major subduction zones.

Improved Quantum Artificial Fish Algorithm Application to Distributed Network Considering Distributed Generation.

PubMed

Du, Tingsong; Hu, Yang; Ke, Xianting

2015-01-01

An improved quantum artificial fish swarm algorithm (IQAFSA) for solving distributed network programming considering distributed generation is proposed in this work. The IQAFSA based on quantum computing which has exponential acceleration for heuristic algorithm uses quantum bits to code artificial fish and quantum revolving gate, preying behavior, and following behavior and variation of quantum artificial fish to update the artificial fish for searching for optimal value. Then, we apply the proposed new algorithm, the quantum artificial fish swarm algorithm (QAFSA), the basic artificial fish swarm algorithm (BAFSA), and the global edition artificial fish swarm algorithm (GAFSA) to the simulation experiments for some typical test functions, respectively. The simulation results demonstrate that the proposed algorithm can escape from the local extremum effectively and has higher convergence speed and better accuracy. Finally, applying IQAFSA to distributed network problems and the simulation results for 33-bus radial distribution network system show that IQAFSA can get the minimum power loss after comparing with BAFSA, GAFSA, and QAFSA.

Geomagnetic Jerks in the Swarm Era

NASA Astrophysics Data System (ADS)

Brown, William; Beggan, Ciaran; Macmillan, Susan

2016-08-01

The timely provision of geomagnetic observations as part of the European Space Agency (ESA) Swarm mission means up-to-date analysis and modelling of the Earth's magnetic field can be conducted rapidly in a manner not possible before. Observations from each of the three Swarm constellation satellites are available within 4 days and a database of close-to-definitive ground observatory measurements is updated every 3 months. This makes it possible to study very recent variations of the core magnetic field. Here we investigate rapid, unpredictable internal field variations known as geomagnetic jerks. Given that jerks represent (currently) unpredictable changes in the core field and have been identified to have happened in 2014 since Swarm was launched, we ask what impact this might have on the future accuracy of the International Geomagnetic Reference Field (IGRF). We assess the performance of each of the IGRF-12 secular variation model candidates in light of recent jerks, given that four of the nine candidates are novel physics-based predictive models.

Swarm motility inhibitory and antioxidant activities of pomegranate peel processed under three drying conditions.

PubMed

John, K M Maria; Bhagwat, Arvind A; Luthria, Devanand L

2017-11-15

During processing of ready-to-eat fresh fruits, large amounts of peel and seeds are discarded as waste. Pomegranate (Punicagranatum) peels contain high amounts of bioactive compounds which inhibit migration of Salmonella on wet surfaces. The metabolic distribution of bioactives in pomegranate peel, inner membrane, and edible aril portion was investigated under three different drying conditions along with the anti-swarming activity against Citrobacter rodentium. Based on the multivariate analysis, 29 metabolites discriminated the pomegranate peel, inner membrane, and edible aril portion, as well as the three different drying methods. Punicalagins (∼38.6-50.3mg/g) were detected in higher quantities in all fractions as compared to ellagic acid (∼0.1-3.2mg/g) and punicalins (∼0-2.4mg/g). The bioactivity (antioxidant, anti-swarming) and phenolics content was significantly higher in peels than the edible aril portion. Natural anti-swarming agents from food waste may have promising potential for controlling food borne pathogens. Published by Elsevier Ltd.

Improved Quantum Artificial Fish Algorithm Application to Distributed Network Considering Distributed Generation

PubMed Central

Hu, Yang; Ke, Xianting

2015-01-01

An improved quantum artificial fish swarm algorithm (IQAFSA) for solving distributed network programming considering distributed generation is proposed in this work. The IQAFSA based on quantum computing which has exponential acceleration for heuristic algorithm uses quantum bits to code artificial fish and quantum revolving gate, preying behavior, and following behavior and variation of quantum artificial fish to update the artificial fish for searching for optimal value. Then, we apply the proposed new algorithm, the quantum artificial fish swarm algorithm (QAFSA), the basic artificial fish swarm algorithm (BAFSA), and the global edition artificial fish swarm algorithm (GAFSA) to the simulation experiments for some typical test functions, respectively. The simulation results demonstrate that the proposed algorithm can escape from the local extremum effectively and has higher convergence speed and better accuracy. Finally, applying IQAFSA to distributed network problems and the simulation results for 33-bus radial distribution network system show that IQAFSA can get the minimum power loss after comparing with BAFSA, GAFSA, and QAFSA. PMID:26447713

Operation management of daily economic dispatch using novel hybrid particle swarm optimization and gravitational search algorithm with hybrid mutation strategy

NASA Astrophysics Data System (ADS)

Wang, Yan; Huang, Song; Ji, Zhicheng

2017-07-01

This paper presents a hybrid particle swarm optimization and gravitational search algorithm based on hybrid mutation strategy (HGSAPSO-M) to optimize economic dispatch (ED) including distributed generations (DGs) considering market-based energy pricing. A daily ED model was formulated and a hybrid mutation strategy was adopted in HGSAPSO-M. The hybrid mutation strategy includes two mutation operators, chaotic mutation, Gaussian mutation. The proposed algorithm was tested on IEEE-33 bus and results show that the approach is effective for this problem.

A Novel Particle Swarm Optimization Approach for Grid Job Scheduling

NASA Astrophysics Data System (ADS)

Izakian, Hesam; Tork Ladani, Behrouz; Zamanifar, Kamran; Abraham, Ajith

This paper represents a Particle Swarm Optimization (PSO) algorithm, for grid job scheduling. PSO is a population-based search algorithm based on the simulation of the social behavior of bird flocking and fish schooling. Particles fly in problem search space to find optimal or near-optimal solutions. In this paper we used a PSO approach for grid job scheduling. The scheduler aims at minimizing makespan and flowtime simultaneously. Experimental studies show that the proposed novel approach is more efficient than the PSO approach reported in the literature.

Making the Grid "Smart" Through "Smart" Microgrids: Real-Time Power Management of Microgrids with Multiple Distributed Generation Sources Using Intelligent Control

DOE Office of Scientific and Technical Information (OSTI.GOV)

Nehrir, M. Hashem

In this Project we collaborated with two DOE National Laboratories, Pacific Northwest National Lab (PNNL) and Lawrence Berkeley National Lab (LBL). Dr. Hammerstrom of PNNL initially supported our project and was on the graduate committee of one of the Ph.D. students (graduated in 2014) who was supported by this project. He is also a committee member of a current graduate student of the PI who was supported by this project in the last two years (August 2014-July 2016). The graduate student is now supported be the Electrical and Computer Engineering (ECE) Department at Montana State University (MSU). Dr. Chris Marneymore » of LBL provided actual load data, and the software WEBOPT developed at LBL for microgrid (MG) design for our project. NEC-Labs America, a private industry, also supported our project, providing expert support and modest financial support. We also used the software “HOMER,” originally developed at the National Renewable Energy Laboratory (NREL) and the most recent version made available to us by HOMER Energy, Inc., for MG (hybrid energy system) unit sizing. We compared the findings from WebOpt and HOMER and designed appropriately sized hybrid systems for our case studies. The objective of the project was to investigate real-time power management strategies for MGs using intelligent control, considering maximum feasible energy sustainability, reliability and efficiency while, minimizing cost and undesired environmental impact (emissions). Through analytic and simulation studies, we evaluated the suitability of several heuristic and artificial-intelligence (AI)-based optimization techniques that had potential for real-time MG power management, including genetic algorithms (GA), ant colony optimization (ACO), particle swarm optimization (PSO), and multi-agent systems (MAS), which is based on the negotiation of smart software-based agents. We found that PSO and MAS, in particular, distributed MAS, were more efficient and better suited for our work. We investigated the following: • Intelligent load control - demand response (DR) - for frequency stabilization in islanded MGs (partially supported by PNNL). • The impact of high penetration of solar photovoltaic (PV)-generated power at the distribution level (partially supported by PNNL). • The application of AI approaches to renewable (wind, PV) power forecasting (proposed by the reviewers of our proposal). • Application of AI approaches and DR for real-time MG power management (partially supported by NEC Labs-America) • Application of DR in dealing with the variability of wind power • Real-time MG power management using DR and storage (partially supported by NEC Labs-America) • Application of DR in enhancing the performance of load-frequency controller • MAS-based whole-sale and retail power market design for smart grid A« less

Laboratory and Modeling Studies of Insect Swarms

DTIC Science & Technology

2016-03-10

and measuring the response. These novel methods allowed us for the first time to characterize precisely properties of the swarm at the group level... Time series for a randomly chosen pair as well as its continuous wavelet transform (CWT; bottom panel). Nearly all of the power in the signal for... based time -frequency analysis to identify such transient interactions, as long as they modified the frequency structure of the insect flight

A parallel competitive Particle Swarm Optimization for non-linear first arrival traveltime tomography and uncertainty quantification

NASA Astrophysics Data System (ADS)

Luu, Keurfon; Noble, Mark; Gesret, Alexandrine; Belayouni, Nidhal; Roux, Pierre-François

2018-04-01

Seismic traveltime tomography is an optimization problem that requires large computational efforts. Therefore, linearized techniques are commonly used for their low computational cost. These local optimization methods are likely to get trapped in a local minimum as they critically depend on the initial model. On the other hand, global optimization methods based on MCMC are insensitive to the initial model but turn out to be computationally expensive. Particle Swarm Optimization (PSO) is a rather new global optimization approach with few tuning parameters that has shown excellent convergence rates and is straightforwardly parallelizable, allowing a good distribution of the workload. However, while it can traverse several local minima of the evaluated misfit function, classical implementation of PSO can get trapped in local minima at later iterations as particles inertia dim. We propose a Competitive PSO (CPSO) to help particles to escape from local minima with a simple implementation that improves swarm's diversity. The model space can be sampled by running the optimizer multiple times and by keeping all the models explored by the swarms in the different runs. A traveltime tomography algorithm based on CPSO is successfully applied on a real 3D data set in the context of induced seismicity.

Velocity correlations in laboratory insect swarms

NASA Astrophysics Data System (ADS)

Ni, R.; Ouellette, N. T.

2015-12-01

In contrast to animal groups such as bird flocks or migratory herds that display net, directed motion, insect swarms do not possess global order. Without such order, it is difficult to define and characterize the transition to collective behavior in swarms; nevertheless, visual observation of swarms strongly suggests that swarming insects do behave collectively. It has recently been suggested that correlation rather than order is the hallmark of emergent collective behavior. Here, we report measurements of spatial velocity correlation functions in laboratory mating swarms of the non-biting midge Chironomus riparius. Although we find some correlation at short distances, our swarms are in general only weakly correlated, in contrast to what has been observed in field studies. Our results hint at the potentially important role of environmental conditions on collective behavior, and suggest that general indicators of the collective nature of swarming are still needed.

The upper surface of an Escherichia coli swarm is stationary.

PubMed

Zhang, Rongjing; Turner, Linda; Berg, Howard C

2010-01-05

When grown in a rich medium on agar, many bacteria elongate, produce more flagella, and swim in a thin film of fluid over the agar surface in swirling packs. Cells that spread in this way are said to swarm. The agar is a solid gel, with pores smaller than the bacteria, so the swarm/agar interface is fixed. Here we show, in experiments with Escherichia coli, that the swarm/air interface also is fixed. We deposited MgO smoke particles on the top surface of an E. coli swarm near its advancing edge, where cells move in a single layer, and then followed the motion of the particles by dark-field microscopy and the motion of the underlying cells by phase-contrast microscopy. Remarkably, the smoke particles remained fixed (diffusing only a few micrometers) while the swarming cells streamed past underneath. The diffusion coefficients of the smoke particles were smaller over the virgin agar ahead of the swarm than over the swarm itself. Changes between these two modes of behavior were evident within 10-20 microm of the swarm edge, indicating an increase in depth of the fluid in advance of the swarm. The only plausible way that the swarm/air interface can be fixed is that it is covered by a surfactant monolayer pinned at its edges. When a swarm is exposed to air, such a monolayer can markedly reduce water loss. When cells invade tissue, the ability to move rapidly between closely opposed fixed surfaces is a useful trait.

Swarm robotics and complex behaviour of continuum material

NASA Astrophysics Data System (ADS)

dell'Erba, Ramiro

2018-05-01

In swarm robotics, just as for an animal swarm in nature, one of the aims is to reach and maintain a desired configuration. One of the possibilities for the team, to reach this aim, is to see what its neighbours are doing. This approach generates a rules system governing the movement of the single robot just by reference to neighbour's motion. The same approach is used in position-based dynamics to simulate behaviour of complex continuum materials under deformation. Therefore, in some previous works, we have considered a two-dimensional lattice of particles and calculated its time evolution by using a rules system derived from our experience in swarm robotics. The new position of a particle, like the element of a swarm, is determined by the spatial position of the other particles. No dynamic is considered, but it can be thought as being hidden in the behaviour rules. This method has given good results in some simple situations reproducing the behaviour of deformable bodies under imposed strain. In this paper we try to stress our model to highlight its limits and how they can be improved. Some other, more complex, examples are computed and discussed. Shear test, different lattices, different fracture mechanisms and ASTM shape sample behaviour have been investigated by the software tool we have developed.

Bifurcating Particle Swarms in Smooth-Walled Fractures

NASA Astrophysics Data System (ADS)

Pyrak-Nolte, L. J.; Sun, H.

2010-12-01

Particle swarms can occur naturally or from industrial processes where small liquid drops containing thousands to millions of micron-size to colloidal-size particles are released over time from seepage or leaks into fractured rock. The behavior of these particle swarms as they fall under gravity are affected by particle interactions as well as interactions with the walls of the fractures. In this paper, we present experimental results on the effect of fractures on the cohesiveness of the swarm and the formation of bifurcation structures as they fall under gravity and interact with the fracture walls. A transparent cubic sample (100 mm x 100 mm x 100 mm) containing a synthetic fracture with uniform aperture distributions was optically imaged to quantify the effect of confinement within fractures on particle swarm formation, swarm velocity, and swarm geometry. A fracture with a uniform aperture distribution was fabricated from two polished rectangular prisms of acrylic. A series of experiments were performed to determine how swarm movement and geometry are affected as the walls of the fracture are brought closer together from 50 mm to 1 mm. During the experiments, the fracture was fully saturated with water. We created the swarms using two different particle sizes in dilute suspension (~ 1.0% by mass). The particles were 3 micron diameter fluorescent polymer beads and 25 micron diameter soda-lime glass beads. Experiments were performed using swarms that ranged in size from 5 µl to 60 µl. The swarm behavior was imaged using an optical fluorescent imaging system composed of a CCD camera illuminated by a 100 mW diode-pumped doubled YAG laser. As a swarm falls in an open-tank of water, it forms a torroidal shape that is stable as long as no ambient or background currents exist in the water tank. When a swarm is released into a fracture with an aperture less than 5 mm, the swarm forms the torroidal shape but it is distorted because of the presence of the walls. The portions of the torroid closest to the fracture wall experiences more drag that causes the swarm to bifurcate. In fractures with 2.5 mm apertures, swarms were observed to bifurcate 7-10 times over a distance of 70 mm. The length of the branches in the tree-like structures decreased as the swarm progressed through multiple bifurcations. The bifurcation length is related to the distance swarms can travel along fractures. Acknowledgment: The authors wish to acknowledge support of this work by the Geosciences Research Program, Office of Basic Energy Sciences US Department of Energy (DE-FG02-09ER16022).

Foraging swarms as Nash equilibria of dynamic games.

PubMed

Özgüler, Arif Bülent; Yildiz, Aykut

2014-06-01

The question of whether foraging swarms can form as a result of a noncooperative game played by individuals is shown here to have an affirmative answer. A dynamic game played by N agents in 1-D motion is introduced and models, for instance, a foraging ant colony. Each agent controls its velocity to minimize its total work done in a finite time interval. The game is shown to have a unique Nash equilibrium under two different foraging location specifications, and both equilibria display many features of a foraging swarm behavior observed in biological swarms. Explicit expressions are derived for pairwise distances between individuals of the swarm, swarm size, and swarm center location during foraging.

On the Optimization of Aerospace Plane Ascent Trajectory

NASA Astrophysics Data System (ADS)

Al-Garni, Ahmed; Kassem, Ayman Hamdy

A hybrid heuristic optimization technique based on genetic algorithms and particle swarm optimization has been developed and tested for trajectory optimization problems with multi-constraints and a multi-objective cost function. The technique is used to calculate control settings for two types for ascending trajectories (constant dynamic pressure and minimum-fuel-minimum-heat) for a two-dimensional model of an aerospace plane. A thorough statistical analysis is done on the hybrid technique to make comparisons with both basic genetic algorithms and particle swarm optimization techniques with respect to convergence and execution time. Genetic algorithm optimization showed better execution time performance while particle swarm optimization showed better convergence performance. The hybrid optimization technique, benefiting from both techniques, showed superior robust performance compromising convergence trends and execution time.

Particle Swarm Social Adaptive Model for Multi-Agent Based Insurgency Warfare Simulation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Cui, Xiaohui; Potok, Thomas E

2009-12-01

To better understand insurgent activities and asymmetric warfare, a social adaptive model for modeling multiple insurgent groups attacking multiple military and civilian targets is proposed and investigated. This report presents a pilot study using the particle swarm modeling, a widely used non-linear optimal tool to model the emergence of insurgency campaign. The objective of this research is to apply the particle swarm metaphor as a model of insurgent social adaptation for the dynamically changing environment and to provide insight and understanding of insurgency warfare. Our results show that unified leadership, strategic planning, and effective communication between insurgent groups are notmore » the necessary requirements for insurgents to efficiently attain their objective.« less

Short-term cascaded hydroelectric system scheduling based on chaotic particle swarm optimization using improved logistic map

NASA Astrophysics Data System (ADS)

He, Yaoyao; Yang, Shanlin; Xu, Qifa

2013-07-01

In order to solve the model of short-term cascaded hydroelectric system scheduling, a novel chaotic particle swarm optimization (CPSO) algorithm using improved logistic map is introduced, which uses the water discharge as the decision variables combined with the death penalty function. According to the principle of maximum power generation, the proposed approach makes use of the ergodicity, symmetry and stochastic property of improved logistic chaotic map for enhancing the performance of particle swarm optimization (PSO) algorithm. The new hybrid method has been examined and tested on two test functions and a practical cascaded hydroelectric system. The experimental results show that the effectiveness and robustness of the proposed CPSO algorithm in comparison with other traditional algorithms.

Null steering of adaptive beamforming using linear constraint minimum variance assisted by particle swarm optimization, dynamic mutated artificial immune system, and gravitational search algorithm.

PubMed

Darzi, Soodabeh; Kiong, Tiong Sieh; Islam, Mohammad Tariqul; Ismail, Mahamod; Kibria, Salehin; Salem, Balasem

2014-01-01

Linear constraint minimum variance (LCMV) is one of the adaptive beamforming techniques that is commonly applied to cancel interfering signals and steer or produce a strong beam to the desired signal through its computed weight vectors. However, weights computed by LCMV usually are not able to form the radiation beam towards the target user precisely and not good enough to reduce the interference by placing null at the interference sources. It is difficult to improve and optimize the LCMV beamforming technique through conventional empirical approach. To provide a solution to this problem, artificial intelligence (AI) technique is explored in order to enhance the LCMV beamforming ability. In this paper, particle swarm optimization (PSO), dynamic mutated artificial immune system (DM-AIS), and gravitational search algorithm (GSA) are incorporated into the existing LCMV technique in order to improve the weights of LCMV. The simulation result demonstrates that received signal to interference and noise ratio (SINR) of target user can be significantly improved by the integration of PSO, DM-AIS, and GSA in LCMV through the suppression of interference in undesired direction. Furthermore, the proposed GSA can be applied as a more effective technique in LCMV beamforming optimization as compared to the PSO technique. The algorithms were implemented using Matlab program.

Null Steering of Adaptive Beamforming Using Linear Constraint Minimum Variance Assisted by Particle Swarm Optimization, Dynamic Mutated Artificial Immune System, and Gravitational Search Algorithm

PubMed Central

Sieh Kiong, Tiong; Tariqul Islam, Mohammad; Ismail, Mahamod; Salem, Balasem

2014-01-01

Linear constraint minimum variance (LCMV) is one of the adaptive beamforming techniques that is commonly applied to cancel interfering signals and steer or produce a strong beam to the desired signal through its computed weight vectors. However, weights computed by LCMV usually are not able to form the radiation beam towards the target user precisely and not good enough to reduce the interference by placing null at the interference sources. It is difficult to improve and optimize the LCMV beamforming technique through conventional empirical approach. To provide a solution to this problem, artificial intelligence (AI) technique is explored in order to enhance the LCMV beamforming ability. In this paper, particle swarm optimization (PSO), dynamic mutated artificial immune system (DM-AIS), and gravitational search algorithm (GSA) are incorporated into the existing LCMV technique in order to improve the weights of LCMV. The simulation result demonstrates that received signal to interference and noise ratio (SINR) of target user can be significantly improved by the integration of PSO, DM-AIS, and GSA in LCMV through the suppression of interference in undesired direction. Furthermore, the proposed GSA can be applied as a more effective technique in LCMV beamforming optimization as compared to the PSO technique. The algorithms were implemented using Matlab program. PMID:25147859

A Modular Simulation Framework for Assessing Swarm Search Models

DTIC Science & Technology

2014-09-01

SUBTITLE A MODULAR SIMULATION FRAMEWORK FOR ASSESSING SWARM SEARCH MODELS 5. FUNDING NUMBERS 6. AUTHOR(S) Blake M. Wanier 7. PERFORMING ORGANIZATION...Numerical studies demonstrate the ability to leverage the developed simulation and analysis framework to investigate three canonical swarm search models ...as benchmarks for future exploration of more sophisticated swarm search scenarios. 14. SUBJECT TERMS Swarm Search, Search Theory, Modeling Framework

Artificial Intelligence Based Optimization for the Se(IV) Removal from Aqueous Solution by Reduced Graphene Oxide-Supported Nanoscale Zero-Valent Iron Composites

PubMed Central

Cao, Rensheng; Ruan, Wenqian; Wu, Xianliang; Wei, Xionghui

2018-01-01

Highly promising artificial intelligence tools, including neural network (ANN), genetic algorithm (GA) and particle swarm optimization (PSO), were applied in the present study to develop an approach for the evaluation of Se(IV) removal from aqueous solutions by reduced graphene oxide-supported nanoscale zero-valent iron (nZVI/rGO) composites. Both GA and PSO were used to optimize the parameters of ANN. The effect of operational parameters (i.e., initial pH, temperature, contact time and initial Se(IV) concentration) on the removal efficiency was examined using response surface methodology (RSM), which was also utilized to obtain a dataset for the ANN training. The ANN-GA model results (with a prediction error of 2.88%) showed a better agreement with the experimental data than the ANN-PSO model results (with a prediction error of 4.63%) and the RSM model results (with a prediction error of 5.56%), thus the ANN-GA model was an ideal choice for modeling and optimizing the Se(IV) removal by the nZVI/rGO composites due to its low prediction error. The analysis of the experimental data illustrates that the removal process of Se(IV) obeyed the Langmuir isotherm and the pseudo-second-order kinetic model. Furthermore, the Se 3d and 3p peaks found in XPS spectra for the nZVI/rGO composites after removing treatment illustrates that the removal of Se(IV) was mainly through the adsorption and reduction mechanisms. PMID:29543753

Artificial Intelligence Based Optimization for the Se(IV) Removal from Aqueous Solution by Reduced Graphene Oxide-Supported Nanoscale Zero-Valent Iron Composites.

PubMed

Cao, Rensheng; Fan, Mingyi; Hu, Jiwei; Ruan, Wenqian; Wu, Xianliang; Wei, Xionghui

2018-03-15

Highly promising artificial intelligence tools, including neural network (ANN), genetic algorithm (GA) and particle swarm optimization (PSO), were applied in the present study to develop an approach for the evaluation of Se(IV) removal from aqueous solutions by reduced graphene oxide-supported nanoscale zero-valent iron (nZVI/rGO) composites. Both GA and PSO were used to optimize the parameters of ANN. The effect of operational parameters (i.e., initial pH, temperature, contact time and initial Se(IV) concentration) on the removal efficiency was examined using response surface methodology (RSM), which was also utilized to obtain a dataset for the ANN training. The ANN-GA model results (with a prediction error of 2.88%) showed a better agreement with the experimental data than the ANN-PSO model results (with a prediction error of 4.63%) and the RSM model results (with a prediction error of 5.56%), thus the ANN-GA model was an ideal choice for modeling and optimizing the Se(IV) removal by the nZVI/rGO composites due to its low prediction error. The analysis of the experimental data illustrates that the removal process of Se(IV) obeyed the Langmuir isotherm and the pseudo-second-order kinetic model. Furthermore, the Se 3d and 3p peaks found in XPS spectra for the nZVI/rGO composites after removing treatment illustrates that the removal of Se(IV) was mainly through the adsorption and reduction mechanisms.

Evolution of Swarming Behavior Is Shaped by How Predators Attack.

PubMed

Olson, Randal S; Knoester, David B; Adami, Christoph

2016-01-01

Animal grouping behaviors have been widely studied due to their implications for understanding social intelligence, collective cognition, and potential applications in engineering, artificial intelligence, and robotics. An important biological aspect of these studies is discerning which selection pressures favor the evolution of grouping behavior. In the past decade, researchers have begun using evolutionary computation to study the evolutionary effects of these selection pressures in predator-prey models. The selfish herd hypothesis states that concentrated groups arise because prey selfishly attempt to place their conspecifics between themselves and the predator, thus causing an endless cycle of movement toward the center of the group. Using an evolutionary model of a predator-prey system, we show that how predators attack is critical to the evolution of the selfish herd. Following this discovery, we show that density-dependent predation provides an abstraction of Hamilton's original formulation of domains of danger. Finally, we verify that density-dependent predation provides a sufficient selective advantage for prey to evolve the selfish herd in response to predation by coevolving predators. Thus, our work corroborates Hamilton's selfish herd hypothesis in a digital evolutionary model, refines the assumptions of the selfish herd hypothesis, and generalizes the domain of danger concept to density-dependent predation.

A review on experimental design for pollutants removal in water treatment with the aid of artificial intelligence.

PubMed

Fan, Mingyi; Hu, Jiwei; Cao, Rensheng; Ruan, Wenqian; Wei, Xionghui

2018-06-01

Water pollution occurs mainly due to inorganic and organic pollutants, such as nutrients, heavy metals and persistent organic pollutants. For the modeling and optimization of pollutants removal, artificial intelligence (AI) has been used as a major tool in the experimental design that can generate the optimal operational variables, since AI has recently gained a tremendous advance. The present review describes the fundamentals, advantages and limitations of AI tools. Artificial neural networks (ANNs) are the AI tools frequently adopted to predict the pollutants removal processes because of their capabilities of self-learning and self-adapting, while genetic algorithm (GA) and particle swarm optimization (PSO) are also useful AI methodologies in efficient search for the global optima. This article summarizes the modeling and optimization of pollutants removal processes in water treatment by using multilayer perception, fuzzy neural, radial basis function and self-organizing map networks. Furthermore, the results conclude that the hybrid models of ANNs with GA and PSO can be successfully applied in water treatment with satisfactory accuracies. Finally, the limitations of current AI tools and their new developments are also highlighted for prospective applications in the environmental protection. Copyright © 2018 Elsevier Ltd. All rights reserved.

Cat swarm optimization based evolutionary framework for multi document summarization

NASA Astrophysics Data System (ADS)

Rautray, Rasmita; Balabantaray, Rakesh Chandra

2017-07-01

Today, World Wide Web has brought us enormous quantity of on-line information. As a result, extracting relevant information from massive data has become a challenging issue. In recent past text summarization is recognized as one of the solution to extract useful information from vast amount documents. Based on number of documents considered for summarization, it is categorized as single document or multi document summarization. Rather than single document, multi document summarization is more challenging for the researchers to find accurate summary from multiple documents. Hence in this study, a novel Cat Swarm Optimization (CSO) based multi document summarizer is proposed to address the problem of multi document summarization. The proposed CSO based model is also compared with two other nature inspired based summarizer such as Harmony Search (HS) based summarizer and Particle Swarm Optimization (PSO) based summarizer. With respect to the benchmark Document Understanding Conference (DUC) datasets, the performance of all algorithms are compared in terms of different evaluation metrics such as ROUGE score, F score, sensitivity, positive predicate value, summary accuracy, inter sentence similarity and readability metric to validate non-redundancy, cohesiveness and readability of the summary respectively. The experimental analysis clearly reveals that the proposed approach outperforms the other summarizers included in the study.

Glacier quakes mimicking volcanic earthquakes: The challenge of monitoring ice-clad volcanoes and some solutions

NASA Astrophysics Data System (ADS)

Allstadt, K.; Carmichael, J. D.; Malone, S. D.; Bodin, P.; Vidale, J. E.; Moran, S. C.

2012-12-01

Swarms of repeating earthquakes at volcanoes are often a sign of volcanic unrest. However, glaciers also can generate repeating seismic signals, so detecting unrest at glacier-covered volcanoes can be a challenge. We have found that multi-day swarms of shallow, low-frequency, repeating earthquakes occur regularly at Mount Rainier, a heavily glaciated stratovolcano in Washington, but that most swarms had escaped recognition until recently. Typically such earthquakes were too small to be routinely detected by the seismic network and were often buried in the noise on visual records, making the few swarms that had been detected seem more unusual and significant at the time they were identified. Our comprehensive search for repeating earthquakes through the past 10 years of continuous seismic data uncovered more than 30 distinct swarms of low-frequency earthquakes at Rainier, each consisting of hundreds to thousands of events. We found that these swarms locate high on the glacier-covered edifice, occur almost exclusively between late fall and early spring, and that their onset coincides with heavy snowfalls. We interpret the correlation with snowfall to indicate a seismically observable glacial response to snow loading. Efforts are underway to confirm this by monitoring glacier motion before and after a major snowfall event using ground based radar interferometry. Clearly, if the earthquakes in these swarms reflect a glacial source, then they are not directly related to volcanic activity. However, from an operational perspective they make volcano monitoring difficult because they closely resemble earthquakes that often precede and accompany volcanic eruptions. Because we now have a better sense of the background level of such swarms and know that their occurrence is seasonal and correlated with snowfall, it will now be easier to recognize if future swarms at Rainier are unusual and possibly related to volcanic activity. To methodically monitor for such unusual activity, we are implementing an automatic detection algorithm to continuously search for repeating earthquakes at Mount Rainier, an algorithm that we eventually intend to apply to other Cascade volcanoes. We propose that a comprehensive routine that characterizes background levels of repeating earthquakes and the degree of correlation with weather and seasonal forcing, combined with real-time monitoring for repeating earthquakes, will provide a means to more rapidly discriminate between glacier seismicity and seismicity related to volcanic activity on monitored glacier-clad volcanoes.

Effects of physical factors on the swarming motility of text itPseudomonas aeruginosa

NASA Astrophysics Data System (ADS)

Si, Tieyan; Ma, Zidong; Tang, Wai Shing; Yang, Alexander; Tang, Jay

Many species of bacteria can spread over a semi-solid surface via a particular form of collective motion known as surface swarming. Using Pseudomonas aeruginosa as a model organism, we investigate physical factors that either facilitate or restrict the swarming motility. The semi-solid surface is typically formed by 0.5-1% agar containing essential nutrients for the bacterial growth and proliferation. Most bacterial species, including P. aeruginosa, synthesize bio-surfactants to aid in swarming. We found addition of exogenous surfactants such as triton into the agar matrix enhances the swarming. In contrast, increasing agar percentage, infusing osmolites, and adding viscous agents all decrease swarming. We propose that the swarming speed is restricted by the rate of water supply from within the agar gel and by the line tension at the swarm front involving three materials in contact: the air, the bacteria propelled liquid film, and the agar substrate.

DNA-assisted swarm control in a biomolecular motor system.

PubMed

Keya, Jakia Jannat; Suzuki, Ryuhei; Kabir, Arif Md Rashedul; Inoue, Daisuke; Asanuma, Hiroyuki; Sada, Kazuki; Hess, Henry; Kuzuya, Akinori; Kakugo, Akira

2018-01-31

In nature, swarming behavior has evolved repeatedly among motile organisms because it confers a variety of beneficial emergent properties. These include improved information gathering, protection from predators, and resource utilization. Some organisms, e.g., locusts, switch between solitary and swarm behavior in response to external stimuli. Aspects of swarming behavior have been demonstrated for motile supramolecular systems composed of biomolecular motors and cytoskeletal filaments, where cross-linkers induce large scale organization. The capabilities of such supramolecular systems may be further extended if the swarming behavior can be programmed and controlled. Here, we demonstrate that the swarming of DNA-functionalized microtubules (MTs) propelled by surface-adhered kinesin motors can be programmed and reversibly regulated by DNA signals. Emergent swarm behavior, such as translational and circular motion, can be selected by tuning the MT stiffness. Photoresponsive DNA containing azobenzene groups enables switching between solitary and swarm behavior in response to stimulation with visible or ultraviolet light.

Earthquake statistics, spatiotemporal distribution of foci and source mechanisms as a key to understanding of causes leading to the West Bohemia/Vogtland earthquake swarms

NASA Astrophysics Data System (ADS)

Horalek, Josef; Jakoubkova, Hana

2017-04-01

The origin of earthquake swarms is still unclear. The swarms typically occur at the plate margins but also in intracontinental areas. West Bohemia-Vogtland represents one of the most active intraplate earthquake-swarm areas in Europe. It is characterised by a frequent reoccurrence of ML < 4.0 swarms and by high activity of crustal fluids. The Nový Kostel focal zone (NK) dominates the recent seismicity of the whole region. There were swarms in 1997, 2000, 2008 and 20011 followed by reactivation in 2013 which forming a focal belt of about 15 x 6 km, focal depths vary from 6 to 15 km. An exceptional non-swarm activity (mainshock-aftershock sequences) up to magnitudes ML = 4.5, stroke the region in May to August 2014, the events were also located in the NK swarm-focal belt. We analysed geometry of the NK focal zone applying the double-difference method to seismicity in the period 1997 - 2014. The swarms are located close to each other at depths between 6 and 13 km, the 2014 maishock-aftershock sequences among them. The 2000 and 2008 swarms were located on the same portion of the NK fault, similarly the swarms of 1997, 2011 and 2013 also occurred on the same fault segment. Other fault segment hosted three mainshock-aftershock sequences of 2014. The individual swarms differ considerably in their evolution, mainly in the rate of the seismic-moment release and foci migration. The frequency-magnitude distributions of all the swarms show bimodal-like character: the most events obey the b-value = 1.0 distribution, however, a group of the largest events ( ML > 2.8) depart significantly from it. Furthermore, we disclose that all the ML > 2.8 swarm events, which occurred in the given time span, are located in a few dense clusters. It implies that the most of seismic energy in the individual swarms has been released in step by step rupturing of one or a few asperities. The source mechanisms have been retrieved in the full moment-tensor description (MT). The mechanism patters of the individual swarms indicate their complexity. All the swarms exhibit both oblique-normal and oblique-thrust faulting but the former prevails. We found a several families of mechanisms, which fit well geometry of respective fault segments being determined by means of the double-difference location. MTs of the most analysed events signify pure shears except for events the second phase of the 1997 swarm the MTs of which indicate significant amount of non-DC components. The existing results do not allow us to explain properly an origin of earthquake swarms. Nevertheless, we infer that the individual earthquake swarms in West Bohemia-Vogtland are mixture of the mainshock-aftershock sequences which correspond to step by step rupturing of one or a few asperities. The swarms occur on short fault segments with heterogeneous stress and strength, which may be affected by crustal fluids. Pressurized fluids may reduce normal component of the tectonic stress and lower friction. Thus, critically loaded and favourably oriented faults are brought to failure and the swarm activity is driven by the differential local stress.

Drone swarm with free-space optical communication to detect and make deep decisions about physical problems for area surveillance

NASA Astrophysics Data System (ADS)

Mazher, Wamidh Jalil; Ibrahim, Hadeel T.; Ucan, Osman N.; Bayat, Oguz

2018-03-01

This paper aims to design a drone swarm network by employing free-space optical (FSO) communication for detecting and deep decision making of topological problems (e.g., oil pipeline leak), where deep decision making requires the highest image resolution. Drones have been widely used for monitoring and detecting problems in industrial applications during which the drone sends images from the on-air camera video stream using radio frequency (RF) signals. To obtain higher-resolution images, higher bandwidth (BW) is required. The current study proposed the use of the FSO communication system to facilitate higher BW for higher image resolution. Moreover, the number of drones required to survey a large physical area exceeded the capabilities of RF technologies. Our configuration of the drones is V-shaped swarm with one leading drone called mother drone (DM). The optical decode-and-forward (DF) technique is used to send the optical payloads of all drones in V-shaped swarm to the single ground station through DM. Furthermore, it is found that the transmitted optical power (Pt) is required for each drone based on the threshold outage probability of FSO link failure among the onboard optical-DF drones. The bit error rate of optical payload is calculated based on optical-DF onboard processing. Finally, the number of drones required for different image resolutions based on the size of the considered topological area is optimized.

PSO-tuned PID controller for coupled tank system via priority-based fitness scheme

NASA Astrophysics Data System (ADS)

Jaafar, Hazriq Izzuan; Hussien, Sharifah Yuslinda Syed; Selamat, Nur Asmiza; Abidin, Amar Faiz Zainal; Aras, Mohd Shahrieel Mohd; Nasir, Mohamad Na'im Mohd; Bohari, Zul Hasrizal

2015-05-01

The industrial applications of Coupled Tank System (CTS) are widely used especially in chemical process industries. The overall process is require liquids to be pumped, stored in the tank and pumped again to another tank. Nevertheless, the level of liquid in tank need to be controlled and flow between two tanks must be regulated. This paper presents development of an optimal PID controller for controlling the desired liquid level of the CTS. Two method of Particle Swarm Optimization (PSO) algorithm will be tested in optimizing the PID controller parameters. These two methods of PSO are standard Particle Swarm Optimization (PSO) and Priority-based Fitness Scheme in Particle Swarm Optimization (PFPSO). Simulation is conducted within Matlab environment to verify the performance of the system in terms of settling time (Ts), steady state error (SSE) and overshoot (OS). It has been demonstrated that implementation of PSO via Priority-based Fitness Scheme (PFPSO) for this system is potential technique to control the desired liquid level and improve the system performances compared with standard PSO.

Artificial Bee Colony Optimization of Capping Potentials for Hybrid Quantum Mechanical/Molecular Mechanical Calculations.

PubMed

Schiffmann, Christoph; Sebastiani, Daniel

2011-05-10

We present an algorithmic extension of a numerical optimization scheme for analytic capping potentials for use in mixed quantum-classical (quantum mechanical/molecular mechanical, QM/MM) ab initio calculations. Our goal is to minimize bond-cleavage-induced perturbations in the electronic structure, measured by means of a suitable penalty functional. The optimization algorithm-a variant of the artificial bee colony (ABC) algorithm, which relies on swarm intelligence-couples deterministic (downhill gradient) and stochastic elements to avoid local minimum trapping. The ABC algorithm outperforms the conventional downhill gradient approach, if the penalty hypersurface exhibits wiggles that prevent a straight minimization pathway. We characterize the optimized capping potentials by computing NMR chemical shifts. This approach will increase the accuracy of QM/MM calculations of complex biomolecules.

Bringing a Time-Depth Perspective to Collective Animal Behaviour.

PubMed

Biro, Dora; Sasaki, Takao; Portugal, Steven J

2016-07-01

The field of collective animal behaviour examines how relatively simple, local interactions between individuals in groups combine to produce global-level outcomes. Existing mathematical models and empirical work have identified candidate mechanisms for numerous collective phenomena but have typically focused on one-off or short-term performance. We argue that feedback between collective performance and learning - giving the former the capacity to become an adaptive, and potentially cumulative, process - is a currently poorly explored but crucial mechanism in understanding collective systems. We synthesise material ranging from swarm intelligence in social insects through collective movements in vertebrates to collective decision making in animal and human groups, to propose avenues for future research to identify the potential for changes in these systems to accumulate over time. Copyright © 2016 Elsevier Ltd. All rights reserved.

Absolute Geomagnetic Paleointensity as Recorded by Mafic Dykes of the ~1.98 Ga Bundelkhand Swarm and ~0.75 Ga Malani Igneous Suite from Northern India

NASA Astrophysics Data System (ADS)

Piispa, E. J.; Smirnov, A. V.; Pandit, M. K.

2012-12-01

Determining the long-term behavior and configuration of the Precambrian geomagnetic field is crucial for understanding the origin and nature of Earth's early geodynamo. However, our knowledge about strength and morphology of the Precambrian geomagnetic field is extremely limited due to paucity of reliable data on the ancient field strength (paleointensity). Information correlating the strength and characteristics of Earth's ancient geomagnetic field can be gained by measuring the paleodirectional and paleointensity properties of Precambrian rocks. We investigated two Proterozoic mafic dyke swarms from the Indian subcontinent: the extensive NW-SE trending 1979±8 Ma (U-Pb) dyke swarm in the Bundelkhand craton and the N-S trending Malani mafic dyke swarm, the latter representing the third and final phase of magmatism in the Malani Igneous Suite. Malani rhyolites have been precisely dated at 771±2 to 751±3 Ma (U - Pb zircon ages). The Malani mafic dykes have been correlated with the ~750 Ma dolerite dykes of Seychelles based on geological and geochemical criteria. The mafic dykes of both studied swarms are vertical to sub-vertical and show little or no evidence of alteration. Detailed paleomagnetic studies, using both thermal and alternating field demagnetization, revealed the presence of stable dual-polarity magnetic component for both dyke swarms. The primary nature of the magnetization is supported by positive baked contact tests. Typically, the characteristic magnetization is single component with narrow unblocking temperature spectra between ~500°C and 550-570°C, with remanence carried by small PSD magnetite or low-Ti titanomagnetite. Absolute paleointensities of these dyke swarms were obtained by two different heating based methods: multiple specimen domain-state corrected (MSP-DSC) and Thellier double heating method with alternating infield-zerofield (IZ) and zerofield-infield (ZI) steps. The multiple sample protocol incorporated checks for alteration, additivity and reciprocity during heating. The magnetic stability of samples was checked using thermomagnetic curves and by monitoring the magnetic susceptibility changes through the paleointensity experiments. Magnetization measurements before and after low temperature demagnetization (LTD) in liquid nitrogen allowed comparison of the effectiveness of the LTD treatment with other experimental domain state corrections. We will discuss implications of our results for the Precambrian geomagnetic field evolution.

Mid-Frequency Reverberation Measurements with Full Companion Environmental Support

DTIC Science & Technology

2014-12-30

acoustic modeling is based on measured stratification and observed wave amplitudes on the New Jersey shelf during the SWARM experiment.3 Ray tracing is...wave model then gives quantitative results for the clutter. 2. Swarm NLIW model and ray tracing Nonlinear internal waves are very common on the...receiver in order to give quantitative clutter to reverberation. To picture the mechanism, a set of rays was launched from a source at range zero and

Genetic Particle Swarm Optimization-Based Feature Selection for Very-High-Resolution Remotely Sensed Imagery Object Change Detection.

PubMed

Chen, Qiang; Chen, Yunhao; Jiang, Weiguo

2016-07-30

In the field of multiple features Object-Based Change Detection (OBCD) for very-high-resolution remotely sensed images, image objects have abundant features and feature selection affects the precision and efficiency of OBCD. Through object-based image analysis, this paper proposes a Genetic Particle Swarm Optimization (GPSO)-based feature selection algorithm to solve the optimization problem of feature selection in multiple features OBCD. We select the Ratio of Mean to Variance (RMV) as the fitness function of GPSO, and apply the proposed algorithm to the object-based hybrid multivariate alternative detection model. Two experiment cases on Worldview-2/3 images confirm that GPSO can significantly improve the speed of convergence, and effectively avoid the problem of premature convergence, relative to other feature selection algorithms. According to the accuracy evaluation of OBCD, GPSO is superior at overall accuracy (84.17% and 83.59%) and Kappa coefficient (0.6771 and 0.6314) than other algorithms. Moreover, the sensitivity analysis results show that the proposed algorithm is not easily influenced by the initial parameters, but the number of features to be selected and the size of the particle swarm would affect the algorithm. The comparison experiment results reveal that RMV is more suitable than other functions as the fitness function of GPSO-based feature selection algorithm.

Mechanism of the 1996-97 non-eruptive volcano-tectonic earthquake swarm at Iliamna Volcano, Alaska

USGS Publications Warehouse

Roman, D.C.; Power, J.A.

2011-01-01

A significant number of volcano-tectonic(VT) earthquake swarms, some of which are accompanied by ground deformation and/or volcanic gas emissions, do not culminate in an eruption.These swarms are often thought to represent stalled intrusions of magma into the mid- or shallow-level crust.Real-time assessment of the likelihood that a VTswarm will culminate in an eruption is one of the key challenges of volcano monitoring, and retrospective analysis of non-eruptive swarms provides an important framework for future assessments. Here we explore models for a non-eruptive VT earthquake swarm located beneath Iliamna Volcano, Alaska, in May 1996-June 1997 through calculation and inversion of fault-plane solutions for swarm and background periods, and through Coulomb stress modeling of faulting types and hypocenter locations observed during the swarm. Through a comparison of models of deep and shallow intrusions to swarm observations,we aim to test the hypothesis that the 1996-97 swarm represented a shallow intrusion, or "failed" eruption.Observations of the 1996-97 swarm are found to be consistent with several scenarios including both shallow and deep intrusion, most likely involving a relatively small volume of intruded magma and/or a low degree of magma pressurization corresponding to a relatively low likelihood of eruption. ?? 2011 Springer-Verlag.

Dome growth behavior at Soufriere Hills Volcano, Montserrat, revealed by relocation of volcanic event swarms, 1995-1996

USGS Publications Warehouse

Rowe, C.A.; Thurber, C.H.; White, R.A.

2004-01-01

We have relocated a subset of events from the digital waveform catalogue of ???17,000 volcanic microearthquakes recorded between July 1995 and February 1996 at Soufriere Hills Volcano (SHV), Montserrat, using a cross-correlation-based phase repicking technique with a joint location method. Hypocenters were estimated for 3914 earthquakes having five or more corrected P-wave picks. The seismic source region collapsed to a volume of ???1 km3 from an initial ???100 km3. Relocated events represent 36 swarms, each containing nearly identical waveforms, having source dimensions of 10 to 100 m in diameter and spatial separations on the order of 500 m or less. Each swarm occurred over a span of several hours to a few days.Triggered data appear to miss between 65% and 98% of the events that occur within these swarms, based on review of helicorder records. Visual estimates of summit dome growth show a rough correspondence between episodes of intense swarming and increases in extruded magma, although dome observations are too sparse to make a direct comparison for this time period. The limited depth range over which dome-growth-related events occur is consistent with a dynamic model of cyclic plug extrusion behavior in the shallow conduit, governed by magma supply rate, overpressure buildup and physical properties of the magma and conduit geometry. Seismic sources may occur in locally overpressured regions that result from microlite formation in a zone of rapid decompression; we propose that this zone exists in the vicinity of a detachment plane associated with the cyclic plug extrusion. ?? 2004 Elsevier B.V. All rights reserved.

Operating Small Sat Swarms as a Single Entity: Introducing SODA

NASA Technical Reports Server (NTRS)

Conn, Tracie; Dono Perez, Andres

2017-01-01

Swarm concepts are a growing topic of interest in the small satellite community. Compared to a small satellite constellation, a swarm has the distinction of being multiple spacecraft in close proximity, in approximately the same orbit. Furthermore, we envision swarms to have capabilities for cross-link communication and station-keeping. Of particular interest is a means to maintain operator-specified geometry, alignment, and/or separation.From NASA's decadal survey, it is clear that simultaneous measurements from a 3D volume of space are desired for a variety of Earth scientific studies. As this mission concept is ultimately extended to deep space, some degree of local control for the swarm to self-correct its configuration is required. We claim that the practicality of ground commanding each individual satellite in the swarm is simply not a feasible concept of operations. In other words, the current state-of-practice does not scale to very large swarms (e.g. 100 spacecraft or more) without becoming cost prohibitive. To contain the operations costs and complexity, a new approach is required: the swarm must be operated as a unit, responding to high-level specifications for relative position and velocity.The Mission Design Division at NASA Ames Research Center is looking to the near future for opportunities to develop satellite swarm technology. As part of this effort, we are developing SODA (Swarm Orbital Dynamics Advisor), a tool that provides the orbital maneuvers required to achieve a desired type of relative swarm motion. The purpose of SODA is two-fold. First, it encompasses the algorithms and orbital dynamics model to enable the desired relative motion of the swarm satellites. The process starts with the user specifying the properties of a swarm configuration. This could be as simple as varying in-track spacing of the swarm in one orbit, or as complex as maintaining a specified 3D geometrical orientation. We presume that science objectives will drive this choice. Given these inputs, the tool provides the most efficient maneuver(s) to achieve the objective.Second, SODA provides a variety of visualization tools. We acknowledge that the relationship between a desired relative motion amongst the swarm, and the corresponding orbital parameters for each individual satellite may not be immediately apparent for ground controllers and mission planners. The purpose of SODA's visualization tools is to illustrate this concept clearly with a variety of graphics and animations. After computing the optimal orbital maneuvers to modify the swarm, these results are simulated to demonstrate successful swarm control.Our emphasis in this paper is on the importance of relating the desired motion of the swarm satellites relative to one another with the required orbital element changes. One cannot joystick a drifting swarm satellite back into position; the underlying orbital mechanics dictate the most efficient recovery maneuvers. To illustrate this point, results from several case study simulations are presented. We conclude with our forward work for ongoing SODA development and potential science applications.

Temporal variation characteristics of shear-wave splitting for the Rushan earthquake swarm of Shandong Province

NASA Astrophysics Data System (ADS)

Miao, Qingjie; Liu, Xiqiang

2017-03-01

The seismicity in Rushan region of Shandong Province is characterized by small swarms after the ML3.8 Rushan earthquake on October 1, 2013, and this situation continues up to now. Four earthquakes with ML4.7, ML4.5, ML4.1 and ML5.0 occurred from January of 2014 to May of 2015 cause great social effects. Based on the seismic records from the Rushan station, this paper calculated the shear-wave splitting parameters of 224 small earthquakes of Rushan earthquake swarm. The result shows that the polarization direction of the fast shear-wave is consistent with the principal compressive stress direction of the Shandong peninsula; on the other hand, the time delay has obvious change before and after the four earthquakes, that is, it raised about one month and declined about twelve days before earthquake. All the characteristics can be taken as the precursor indicator for earthquake prediction based on stress.

Solving the Container Stowage Problem (CSP) using Particle Swarm Optimization (PSO)

NASA Astrophysics Data System (ADS)

Matsaini; Santosa, Budi

2018-04-01

Container Stowage Problem (CSP) is a problem of containers arrangement into ships by considering rules such as: total weight, weight of one stack, destination, equilibrium, and placement of containers on vessel. Container stowage problem is combinatorial problem and hard to solve with enumeration technique. It is an NP-Hard Problem. Therefore, to find a solution, metaheuristics is preferred. The objective of solving the problem is to minimize the amount of shifting such that the unloading time is minimized. Particle Swarm Optimization (PSO) is proposed to solve the problem. The implementation of PSO is combined with some steps which are stack position change rules, stack changes based on destination, and stack changes based on the weight type of the stacks (light, medium, and heavy). The proposed method was applied on five different cases. The results were compared to Bee Swarm Optimization (BSO) and heuristics method. PSO provided mean of 0.87% gap and time gap of 60 second. While BSO provided mean of 2,98% gap and 459,6 second to the heuristcs.

Multimode resource-constrained multiple project scheduling problem under fuzzy random environment and its application to a large scale hydropower construction project.

PubMed

Xu, Jiuping; Feng, Cuiying

2014-01-01

This paper presents an extension of the multimode resource-constrained project scheduling problem for a large scale construction project where multiple parallel projects and a fuzzy random environment are considered. By taking into account the most typical goals in project management, a cost/weighted makespan/quality trade-off optimization model is constructed. To deal with the uncertainties, a hybrid crisp approach is used to transform the fuzzy random parameters into fuzzy variables that are subsequently defuzzified using an expected value operator with an optimistic-pessimistic index. Then a combinatorial-priority-based hybrid particle swarm optimization algorithm is developed to solve the proposed model, where the combinatorial particle swarm optimization and priority-based particle swarm optimization are designed to assign modes to activities and to schedule activities, respectively. Finally, the results and analysis of a practical example at a large scale hydropower construction project are presented to demonstrate the practicality and efficiency of the proposed model and optimization method.

Multimode Resource-Constrained Multiple Project Scheduling Problem under Fuzzy Random Environment and Its Application to a Large Scale Hydropower Construction Project

PubMed Central

Xu, Jiuping

2014-01-01

This paper presents an extension of the multimode resource-constrained project scheduling problem for a large scale construction project where multiple parallel projects and a fuzzy random environment are considered. By taking into account the most typical goals in project management, a cost/weighted makespan/quality trade-off optimization model is constructed. To deal with the uncertainties, a hybrid crisp approach is used to transform the fuzzy random parameters into fuzzy variables that are subsequently defuzzified using an expected value operator with an optimistic-pessimistic index. Then a combinatorial-priority-based hybrid particle swarm optimization algorithm is developed to solve the proposed model, where the combinatorial particle swarm optimization and priority-based particle swarm optimization are designed to assign modes to activities and to schedule activities, respectively. Finally, the results and analysis of a practical example at a large scale hydropower construction project are presented to demonstrate the practicality and efficiency of the proposed model and optimization method. PMID:24550708

Phenology of Honey Bee Swarm Departure in New Jersey, United States.

PubMed

Gilley, D C; Courtright, T J; Thom, C

2018-03-31

Departure of swarms from honey bee (Apis mellifera Linnaeus (Hymenoptera: Apidae)) nests is an important reproductive event for wild honey bee colonies and economically costly in managed bee colonies. The seasonal timing of swarm departure varies regionally and annually, creating challenges for honey bee management and emphasizing the potential for swarming behavior to be affected by plant-pollinator phenological mismatch. In this study, we first document variability in the timing of swarm departure across the large and heterogeneous geographical area of New Jersey over 4 years using 689 swarm-cluster observations. Second, hypothesizing that honey bee colonies adaptively tune the timing of swarm departure to match floral food-resource availability, we predicted that growing degree-days could be used to account for regional and annual variability. To test this idea, we used local weather records to determine the growing degree-day on which each swarm cluster was observed and tested for differences among climate regions and years. The state-wide mean swarm cluster date was May 15 (± 0.6 d), with moderate but significant differences among the state's five climate regions and between years. Use of degree-day information suggests that local heat accumulation can account for some climate-region differences in swarm-departure timing. Annual variation existed on a scale of only several days and was not accounted for by growing degree-days, suggesting little adaptive tuning of swarm-departure timing with respect to local heat accumulation.

Transport of Particle Swarms Through Variable Aperture Fractures

NASA Astrophysics Data System (ADS)

Boomsma, E.; Pyrak-Nolte, L. J.

2012-12-01

Particle transport through fractured rock is a key concern with the increased use of micro- and nano-size particles in consumer products as well as from other activities in the sub- and near surface (e.g. mining, industrial waste, hydraulic fracturing, etc.). While particle transport is often studied as the transport of emulsions or dispersions, particles may also enter the subsurface from leaks or seepage that lead to particle swarms. Swarms are drop-like collections of millions of colloidal-sized particles that exhibit a number of unique characteristics when compared to dispersions and emulsions. Any contaminant or engineered particle that forms a swarm can be transported farther, faster, and more cohesively in fractures than would be expected from a traditional dispersion model. In this study, the effects of several variable aperture fractures on colloidal swarm cohesiveness and evolution were studied as a swarm fell under gravity and interacted with the fracture walls. Transparent acrylic was used to fabricate synthetic fracture samples with (1) a uniform aperture, (2) a converging region followed by a uniform region (funnel shaped), (3) a uniform region followed by a diverging region (inverted funnel), and (4) a cast of a an induced fracture from a carbonate rock. All of the samples consisted of two blocks that measured 100 x 100 x 50 mm. The minimum separation between these blocks determined the nominal aperture (0.5 mm to 20 mm). During experiments a fracture was fully submerged in water and swarms were released into it. The swarms consisted of a dilute suspension of 3 micron polystyrene fluorescent beads (1% by mass) with an initial volume of 5μL. The swarms were illuminated with a green (525 nm) LED array and imaged optically with a CCD camera. The variation in fracture aperture controlled swarm behavior. Diverging apertures caused a sudden loss of confinement that resulted in a rapid change in the swarm's shape as well as a sharp increase in its velocity. Converging apertures caused swarms to decelerate rapidly and become trapped in the transition point between the converging and parallel regions for apertures less than 2.5 mm. In uniform aperture fractures, an optimal aperture range (5 mm to 15 mm) exists where swarm velocity was higher and the swarm maintained cohesion over a longer distance. For apertures below this range the swarms were strongly slowed due to drag from the wall, while for larger apertures the swarm velocity approached an asymptote due to the loss of the walls influence. The transport of particle swarms in fractures is strongly controlled by aperture distribution. While drag from the fracture does slow swarms, especially at small apertures, much of the interesting behavior (shape changes in diverging fracture, optimal aperture in parallel fracture) is best explained by fracture induced preferential confinement that controls the evolution of the swarm. When this confinement is suddenly changed, the swarm responds quickly and dramatically to its new environment. This has important implications for the understanding of contaminant dispersal in subsurface fracture networks because the type of aperture variation can exert a strong influence on particle swarm transport. Acknowledgment: The authors wish to acknowledge support of this work by the Geosciences Research Program, Office of Basic Energy Sciences US Department of Energy (DE-FG02-09ER16022).

Stability of Nonlinear Swarms on Flat and Curved Surfaces

DTIC Science & Technology

numerical experiments have shown that the system either converges to a rotating circular limit cycle with a fixed center of mass, or the agents clump ...Swarming is a near-universal phenomenon in nature. Many mathematical models of swarms exist , both to model natural processes and to control robotic...agents. We study a swarm of agents with spring-like at-traction and nonlinear self-propulsion. Swarms of this type have been studied numerically, but

3D modelling of the Tejeda Caldera cone-sheet swarm, Gran Canaria, Canary Islands, Spain

NASA Astrophysics Data System (ADS)

Samrock, Lisa K.; Jensen, Max J.; Burchardt, Steffi; Troll, Valentin R.; Mattsson, Tobias; Geiger, Harri

2015-04-01

Cone-sheet swarms provide vital information on the interior of volcanic systems and their plumbing systems (e.g. Burchardt et al. 2013). This information is important for the interpretation of processes and dynamics of modern and ancient volcanic systems, and is therefore vital for assessing volcanic hazards and to reduce risks to modern society. To more realistically model cone-sheet emplacement an approximation of their 3D shape needs to be known. Most cone-sheet swarms are not sufficiently exposed laterally and/or vertically, however, which makes it difficult to determine the geometry of a cone-sheet swarm at depth, especially since different shapes (e.g. convex, straight or concave continuations) would produce a similar trace at the surface (cf. Burchardt et al. 2011, and references therein). The Miocene Tejeda Caldera on Gran Canaria, Canary Islands, Spain, hosts a cone-sheet swarm that was emplaced into volcaniclastic caldera infill at about 12.3-7.3 Ma (Schirnick et al. 1999). The dyke swarm displays over 1000 m of vertical exposure and more than 15 km of horizontal exposure, making it a superb locality to study the evolution of cone-sheet swarms in detail and to determine its actual geometry in 3D space. We have used structural data of Schirnick (1996) to model the geometry of the Tejeda cone-sheet in 3D, using the software Move® by Midland Valley Ltd. Based on previous 2D projections, Schirnick et al. (1999) suggested that the cone-sheet swarm is formed by a stack of parallel intrusive sheets which have a truncated dome geometry and form a concentric structure around a central axis, assuming straight sheet-intrusions. Our 3D model gives insight into the symmetries of the sheets and the overall geometry of the cone-sheet swarm below the surface. This visualization now allows to grasp the complexity of the Tejeda cone-sheet swarm at depth, particularly in relation to different possible cone-sheet geometries suggested in the literature (cf. Burchardt et al. 2011, and references therein), and we discuss the implications of this architecture for the feeding system of the Tejeda volcano and the associated temporal variations of cone-sheet emplacement. References: Burchardt, S., Tanner, D.C., Troll, V.R., Krumbholz, M., Gustafsson, L.E. (2011) Three-dimensional geometry of concentric intrusive sheet swarms in the Geitafell and the Dyrfjöll volcanoes, eastern Iceland. Geochemistry, Geophysics, Geosystems 12(7): Q0AB09. Burchardt, S., Troll, V.R., Mathieu, L., Emeleus, H.C., Donaldson, C.H. (2013) Ardnamruchan 3D cone-sheet architecture explained by a single elongate magma chamber. Scientific Reports 3:2891. Schirnick, C. (1996) Formation of an intracaldera cone sheet dike swarm (Tejeda Caldera, Gran Canaria) (Dissertation). Christian-Albrechts-Universität, Kiel, Germany. Schirnick, C., van den Bogaard, P., Schmincke, H.-U. (1999) Cone-sheet formation and intrusive growth of an oceanic island - The Miocene Tejeda complex on Gran Canaria (Canary Islands). Geology, 27: 207-210.

Inhibition of Pseudomonas aeruginosa biofilm formation by 2,2'-bipyridyl, lipoic, kojic and picolinic acids.

PubMed

Çevik, Kübra; Ulusoy, Seyhan

2015-08-01

The inhibitory effects of iron chelators, and FeCl3 chelation on biofilm formation and swarming motility were investigated against an opportunistic human pathogen Pseudomonas aeruginosa. The inhibitory activity of 2,2'-bipyridyl, lipoic acid, kojic acid and picolinic acid on biofilm formation of P. aeruginosa strain PAO1 and three clinical isolates (P. aeruginosa PAK01, P. aeruginosa PAK02 and P. aeruginosa PAK03) were investigated, based on crystal violet assay, and swarming motility test. The kojic, lipoic and picolinic acid inhibited biofilm formation by 5-33% in all tested P. aeruginosa isolates. When chelated iron was added, biofilm inhibition rates were determined to be 39-57%. Among the tested chelators against P. aeruginosa, lipoic acid (84%) and kojic acid (68%) presented the highest inhibition of swarming motility. This is the first study to report the inhibitory effect of lipoic acid on biofilm formation and swarming motility of P. aeruginosa. It is considered that lipoic and picolinic acids can serve as alternatives for the treatment of the P. aeruginosa infections by inhibiting biofilm formation.

Incremental social learning in particle swarms.

PubMed

de Oca, Marco A Montes; Stutzle, Thomas; Van den Enden, Ken; Dorigo, Marco

2011-04-01

Incremental social learning (ISL) was proposed as a way to improve the scalability of systems composed of multiple learning agents. In this paper, we show that ISL can be very useful to improve the performance of population-based optimization algorithms. Our study focuses on two particle swarm optimization (PSO) algorithms: a) the incremental particle swarm optimizer (IPSO), which is a PSO algorithm with a growing population size in which the initial position of new particles is biased toward the best-so-far solution, and b) the incremental particle swarm optimizer with local search (IPSOLS), in which solutions are further improved through a local search procedure. We first derive analytically the probability density function induced by the proposed initialization rule applied to new particles. Then, we compare the performance of IPSO and IPSOLS on a set of benchmark functions with that of other PSO algorithms (with and without local search) and a random restart local search algorithm. Finally, we measure the benefits of using incremental social learning on PSO algorithms by running IPSO and IPSOLS on problems with different fitness distance correlations.

Nonlinear Rayleigh wave inversion based on the shuffled frog-leaping algorithm

NASA Astrophysics Data System (ADS)

Sun, Cheng-Yu; Wang, Yan-Yan; Wu, Dun-Shi; Qin, Xiao-Jun

2017-12-01

At present, near-surface shear wave velocities are mainly calculated through Rayleigh wave dispersion-curve inversions in engineering surface investigations, but the required calculations pose a highly nonlinear global optimization problem. In order to alleviate the risk of falling into a local optimal solution, this paper introduces a new global optimization method, the shuffle frog-leaping algorithm (SFLA), into the Rayleigh wave dispersion-curve inversion process. SFLA is a swarm-intelligence-based algorithm that simulates a group of frogs searching for food. It uses a few parameters, achieves rapid convergence, and is capability of effective global searching. In order to test the reliability and calculation performance of SFLA, noise-free and noisy synthetic datasets were inverted. We conducted a comparative analysis with other established algorithms using the noise-free dataset, and then tested the ability of SFLA to cope with data noise. Finally, we inverted a real-world example to examine the applicability of SFLA. Results from both synthetic and field data demonstrated the effectiveness of SFLA in the interpretation of Rayleigh wave dispersion curves. We found that SFLA is superior to the established methods in terms of both reliability and computational efficiency, so it offers great potential to improve our ability to solve geophysical inversion problems.