Particle Swarm Optimization

Science.gov (United States)

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.

An Orthogonal Multi-Swarm Cooperative PSO Algorithm with a Particle Trajectory Knowledge Base

Directory of Open Access Journals (Sweden)

Jun Yang

2017-01-01

Full Text Available A novel orthogonal multi-swarm cooperative particle swarm optimization (PSO algorithm with a particle trajectory knowledge base is presented in this paper. Different from the traditional PSO algorithms and other variants of PSO, the proposed orthogonal multi-swarm cooperative PSO algorithm not only introduces an orthogonal initialization mechanism and a particle trajectory knowledge base for multi-dimensional optimization problems, but also conceives a new adaptive cooperation mechanism to accomplish the information interaction among swarms and particles. Experiments are conducted on a set of benchmark functions, and the results show its better performance compared with traditional PSO algorithm in aspects of convergence, computational efficiency and avoiding premature convergence.

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

Science.gov (United States)

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.

Cat Swarm Optimization Based Functional Link Artificial Neural Network Filter for Gaussian Noise Removal from Computed Tomography Images

Directory of Open Access Journals (Sweden)

M. Kumar

2016-01-01

Full Text Available Gaussian noise is one of the dominant noises, which degrades the quality of acquired Computed Tomography (CT image data. It creates difficulties in pathological identification or diagnosis of any disease. Gaussian noise elimination is desirable to improve the clarity of a CT image for clinical, diagnostic, and postprocessing applications. This paper proposes an evolutionary nonlinear adaptive filter approach, using Cat Swarm Functional Link Artificial Neural Network (CS-FLANN to remove the unwanted noise. The structure of the proposed filter is based on the Functional Link Artificial Neural Network (FLANN and the Cat Swarm Optimization (CSO is utilized for the selection of optimum weight of the neural network filter. The applied filter has been compared with the existing linear filters, like the mean filter and the adaptive Wiener filter. The performance indices, such as peak signal to noise ratio (PSNR, have been computed for the quantitative analysis of the proposed filter. The experimental evaluation established the superiority of the proposed filtering technique over existing methods.

Gold rush - A swarm dynamics in games

Science.gov (United States)

Zelinka, Ivan; Bukacek, Michal

2017-07-01

This paper is focused on swarm intelligence techniques and its practical use in computer games. The aim is to show how a swarm dynamics can be generated by multiplayer game, then recorded, analyzed and eventually controlled. In this paper we also discuss possibility to use swarm intelligence instead of game players. Based on our previous experiments two games, using swarm algorithms are mentioned briefly here. The first one is strategy game StarCraft: Brood War, and TicTacToe in which SOMA algorithm has also take a role of player against human player. Open research reported here has shown potential benefit of swarm computation in the field of strategy games and players strategy based on swarm behavior record and analysis. We propose new game called Gold Rush as an experimental environment for human or artificial swarm behavior and consequent analysis.

A Distributed Framework for Supporting 3D Swarming Applications

OpenAIRE

Pour Sadrollah, Ghazaleh; Barca, Jan Carlo; Khan, Asad; Eliasson, Jens; Senthooran, Ilankaikone

2014-01-01

Abstract—In-flight wireless sensor networks (WSN) are ofincreased interest owing to efficiency gains in weight and operationallifetime of IP-enabled computers. High impact 3Dswarming applications for such systems include autonomousmapping, surveying, servicing, environmental monitoring anddisaster site management. For distributed robotic applications,such as quad copter swarms, it is critical that the robots are ableto localise themselves autonomously with respect to other robotsand to share ...

Autonomic computing enabled cooperative networked design

CERN Document Server

Wodczak, Michal

2014-01-01

This book introduces the concept of autonomic computing driven cooperative networked system design from an architectural perspective. As such it leverages and capitalises on the relevant advancements in both the realms of autonomic computing and networking by welding them closely together. In particular, a multi-faceted Autonomic Cooperative System Architectural Model is defined which incorporates the notion of Autonomic Cooperative Behaviour being orchestrated by the Autonomic Cooperative Networking Protocol of a cross-layer nature. The overall proposed solution not only advocates for the inc

Swarm autonomic agents with self-destruct capability

Science.gov (United States)

Hinchey, Michael G. (Inventor); Sterritt, Roy (Inventor)

2011-01-01

Systems, methods and apparatus are provided through which in some embodiments an autonomic entity manages a system by generating one or more stay alive signals based on the functioning status and operating state of the system. In some embodiments, an evolvable synthetic neural system is operably coupled to one or more evolvable synthetic neural systems in a hierarchy. The evolvable neural interface receives and generates heartbeat monitor signals and pulse monitor signals that are used to generate a stay alive signal that is used to manage the operations of the synthetic neural system. In another embodiment an asynchronous Alice signal (Autonomic license) requiring valid credentials of an anonymous autonomous agent is initiated. An unsatisfactory Alice exchange may lead to self-destruction of the anonymous autonomous agent for self-protection.

Sambot II: A self-assembly modular swarm robot

Science.gov (United States)

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.

QoE Guarantee Scheme Based on Cooperative Cognitive Cloud and Opportunistic Weight Particle Swarm

Directory of Open Access Journals (Sweden)

Weihang Shi

2015-01-01

Full Text Available It is well known that the Internet application of cloud services may be affected by the inefficiency of cloud computing and inaccurate evaluation of quality of experience (QoE seriously. In our paper, based on construction algorithms of cooperative cognitive cloud platform and optimization algorithm of opportunities weight particle swarm clustering, the QoE guarantee mechanism was proposed. The mechanism, through the sending users of requests and the cognitive neighbor users’ cooperation, combined the cooperation of subcloud platforms and constructed the optimal cloud platform with the different service. At the same time, the particle swarm optimization algorithm could be enhanced dynamically according to all kinds of opportunity request weight, which could optimize the cooperative cognitive cloud platform. Finally, the QoE guarantee scheme was proposed with the opportunity weight particle swarm optimization algorithm and collaborative cognitive cloud platform. The experimental results show that the proposed mechanism compared is superior to the QoE guarantee scheme based on cooperative cloud and QoE guarantee scheme based on particle swarm optimization, compared with optimization fitness and high cloud computing service execution efficiency and high throughput performance advantages.

Support Vector Machine Based on Adaptive Acceleration Particle Swarm Optimization

Science.gov (United States)

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

Support Vector Machine Based on Adaptive Acceleration Particle Swarm Optimization

Directory of Open Access Journals (Sweden)

Mohammed Hasan Abdulameer

2014-01-01

Full Text Available 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.

The Swarm Computing Approach to Business Intelligence

Directory of Open Access Journals (Sweden)

Schumann Andrew

2015-07-01

Full Text Available We have proposed to use some features of swarm behaviours in modelling business processes. Due to these features we deal with a propagation of business processes in all accessible directions. This propagation is involved into our formalization instead of communicating sequential processes. As a result, we have constructed a business process diagram language based on the swarm behavior and an extension of that language in the form of reflexive management language.

Adaptive Remote-Sensing Techniques Implementing Swarms of Mobile Agents

Energy Technology Data Exchange (ETDEWEB)

Cameron, S.M.; Loubriel, G.M.; Rbinett, R.D. III; Stantz, K.M.; Trahan, M.W.; Wagner, J.S.

1999-04-01

This paper focuses on our recent work at Sandia National Laboratories toward engineering a physics-based swarm of mobile vehicles for distributed sensing applications. Our goal is to coordinate a sensor array that optimizes sensor coverage and multivariate signal analysis by implementing artificial intelligence and evolutionary computational techniques. These intelligent control systems integrate both globally operating decision-making systems and locally cooperative information-sharing modes using genetically-trained neural networks. Once trained, neural networks have the ability to enhance real-time operational responses to dynamical environments, such as obstacle avoidance, responding to prevailing wind patterns, and overcoming other natural obscurants or interferences (jammers). The swarm realizes a collective set of sensor neurons with simple properties incorporating interactions based on basic community rules (potential fields) and complex interconnecting functions based on various neural network architectures, Therefore, the swarm is capable of redundant heterogeneous measurements which furnishes an additional degree of robustness and fault tolerance not afforded by conventional systems, while accomplishing such cognitive tasks as generalization, error correction, pattern recognition, and sensor fission. The robotic platforms could be equipped with specialized sensor devices including transmit/receive dipole antennas, chemical or biological sniffers in combination with recognition analysis tools, communication modulators, and laser diodes. Our group has been studying the collective behavior of an autonomous, multi-agent system applied to emerging threat applications. To accomplish such tasks, research in the fields of robotics, sensor technology, and swarms are being conducted within an integrated program. Mission scenarios under consideration include ground penetrating impulse radar (GPR) for detection of under-ground structures, airborne systems, and plume

Celestial Navigation Fix Based on Particle Swarm Optimization

Directory of Open Access Journals (Sweden)

Tsou Ming-Cheng

2015-09-01

Full Text Available A technique for solving celestial fix problems is proposed in this study. This method is based on Particle Swarm Optimization from the field of swarm intelligence, utilizing its superior optimization and searching abilities to obtain the most probable astronomical vessel position. In addition to being applicable to two-body fix, multi-body fix, and high-altitude observation problems, it is also less reliant on the initial dead reckoning position. Moreover, by introducing spatial data processing and display functions in a Geographical Information System, calculation results and chart work used in Circle of Position graphical positioning can both be integrated. As a result, in addition to avoiding tedious and complicated computational and graphical procedures, this work has more flexibility and is more robust when compared to other analytical approaches.

A Survey of Formal Methods for Intelligent Swarms

Science.gov (United States)

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

Formations of Robotic Swarm: An Artificial Force Based Approach

Directory of Open Access Journals (Sweden)

Samitha W. Ekanayake

2009-03-01

Full Text Available Cooperative control of multiple mobile robots is an attractive and challenging problem which has drawn considerable attention in the recent past. This paper introduces a scalable decentralized control algorithm to navigate a group of mobile robots (swarm into a predefined shape in 2D space. The proposed architecture uses artificial forces to control mobile agents into the shape and spread them inside the shape while avoiding inter-member collisions. The theoretical analysis of the swarm behavior describes the motion of the complete swarm and individual members in relevant situations. We use computer simulated case studies to verify the theoretical assertions and to demonstrate the robustness of the swarm under external disturbances such as death of agents, change of shape etc. Also the performance of the proposed distributed swarm control architecture was investigated in the presence of realistic implementation issues such as localization errors, communication range limitations, boundedness of forces etc.

Formations of Robotic Swarm: An Artificial Force Based Approach

Directory of Open Access Journals (Sweden)

Samitha W. Ekanayake

2010-09-01

Full Text Available Cooperative control of multiple mobile robots is an attractive and challenging problem which has drawn considerable attention in the recent past. This paper introduces a scalable decentralized control algorithm to navigate a group of mobile robots (swarm into a predefined shape in 2D space. The proposed architecture uses artificial forces to control mobile agents into the shape and spread them inside the shape while avoiding inter-member collisions. The theoretical analysis of the swarm behavior describes the motion of the complete swarm and individual members in relevant situations. We use computer simulated case studies to verify the theoretical assertions and to demonstrate the robustness of the swarm under external disturbances such as death of agents, change of shape etc. Also the performance of the proposed distributed swarm control architecture was investigated in the presence of realistic implementation issues such as localization errors, communication range limitations, boundedness of forces etc.

Formations of Robotic Swarm: An Artificial Force Based Approach

Directory of Open Access Journals (Sweden)

Samitha W. Ekanayake

2009-03-01

Full Text Available Cooperative control of multiple mobile robots is an attractive and challenging problem which has drawn considerable attention in the recent past. This paper introduces a scalable decentralized control algorithm to navigate a group of mobile robots (swarm into a predefined shape in 2D space. The proposed architecture uses artificial forces to control mobile agents into the shape and spread them inside the shape while avoiding inter- member collisions. The theoretical analysis of the swarm behavior describes the motion of the complete swarm and individual members in relevant situations. We use computer simulated case studies to verify the theoretical assertions and to demonstrate the robustness of the swarm under external disturbances such as death of agents, change of shape etc. Also the performance of the proposed distributed swarm control architecture was investigated in the presence of realistic implementation issues such as localization errors, communication range limitations, boundedness of forces etc.

Formations of Robotic Swarm: An Artificial Force Based Approach

Directory of Open Access Journals (Sweden)

Samitha W. Ekanayake

2010-09-01

Full Text Available Cooperative control of multiple mobile robots is an attractive and challenging problem which has drawn considerable attention in the recent past. This paper introduces a scalable decentralized control algorithm to navigate a group of mobile robots (swarm into a predefined shape in 2D space. The proposed architecture uses artificial forces to control mobile agents into the shape and spread them inside the shape while avoiding inter- member collisions. The theoretical analysis of the swarm behavior describes the motion of the complete swarm and individual members in relevant situations. We use computer simulated case studies to verify the theoretical assertions and to demonstrate the robustness of the swarm under external disturbances such as death of agents, change of shape etc. Also the performance of the proposed distributed swarm control architecture was investigated in the presence of realistic implementation issues such as localization errors, communication range limitations, boundedness of forces etc.

Exploitation of Self Organization in UAV Swarms for Optimization in Combat Environments

National Research Council Canada - National Science Library

Nowak, Dustin J

2008-01-01

...) swarms using autonomous self-organized cooperative control. This development required the design of a new abstract UAV swarm control model which flows from an abstract Markov structure, a Partially Observable Markov Decision Process...

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

Science.gov (United States)

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

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

Science.gov (United States)

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

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

Directory of Open Access Journals (Sweden)

Yu-Hsiu Lin

2018-04-01

Full Text Available 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

A Parallel Particle Swarm Optimizer

National Research Council Canada - National Science Library

Schutte, J. F; Fregly, B .J; Haftka, R. T; George, A. D

2003-01-01

.... Motivated by a computationally demanding biomechanical system identification problem, we introduce a parallel implementation of a stochastic population based global optimizer, the Particle Swarm...

Large and Dense Swarms: Simulation of a Shortest Path Alarm Propagation

Directory of Open Access Journals (Sweden)

Claudia Snels

2015-07-01

Full Text Available This paper deals with the transmission of alarm messages in large and dense underwater swarms of Autonomous Underwater Vehicles (AUVs and describes the verification process of the derived algorithm results by means of two simulation tools realized by the authors. A collision-free communication protocol has been developed, tailored to a case where a single AUV needs to send a message to a specific subset of swarm members regarding a perceived danger. The protocol includes a handshaking procedure that creates a silence region before the transmission of the message obtained through specific acoustic tones out of the normal transmission frequencies or through optical signals. This region will include all members of the swarm involved in the alarm message and their neighbours, preventing collisions between them. The AUV sending messages to a target area computes a delay function on appropriate arcs and runs a Dijkstra-like algorithm obtaining a multicast tree. After an explanation of the whole building of this collision-free multicast tree, a simulation has been carried out assuming different scenarios relevant to swarm density, signal power of the modem and the geometrical configuration of the nodes.

A Parameter Estimation Method for Nonlinear Systems Based on Improved Boundary Chicken Swarm Optimization

Directory of Open Access Journals (Sweden)

Shaolong Chen

2016-01-01

Full Text Available Parameter estimation is an important problem in nonlinear system modeling and control. Through constructing an appropriate fitness function, parameter estimation of system could be converted to a multidimensional parameter optimization problem. As a novel swarm intelligence algorithm, chicken swarm optimization (CSO has attracted much attention owing to its good global convergence and robustness. In this paper, a method based on improved boundary chicken swarm optimization (IBCSO is proposed for parameter estimation of nonlinear systems, demonstrated and tested by Lorenz system and a coupling motor system. Furthermore, we have analyzed the influence of time series on the estimation accuracy. Computer simulation results show it is feasible and with desirable performance for parameter estimation of nonlinear systems.

A Secure, Scalable and Elastic Autonomic Computing Systems Paradigm: Supporting Dynamic Adaptation of Self-* Services from an Autonomic Cloud

Directory of Open Access Journals (Sweden)

Abdul Jaleel

2018-05-01

Full Text Available Autonomic computing embeds self-management features in software systems using external feedback control loops, i.e., autonomic managers. In existing models of autonomic computing, adaptive behaviors are defined at the design time, autonomic managers are statically configured, and the running system has a fixed set of self-* capabilities. An autonomic computing design should accommodate autonomic capability growth by allowing the dynamic configuration of self-* services, but this causes security and integrity issues. A secure, scalable and elastic autonomic computing system (SSE-ACS paradigm is proposed to address the runtime inclusion of autonomic managers, ensuring secure communication between autonomic managers and managed resources. Applying the SSE-ACS concept, a layered approach for the dynamic adaptation of self-* services is presented with an online ‘Autonomic_Cloud’ working as the middleware between Autonomic Managers (offering the self-* services and Autonomic Computing System (requiring the self-* services. A stock trading and forecasting system is used for simulation purposes. The security impact of the SSE-ACS paradigm is verified by testing possible attack cases over the autonomic computing system with single and multiple autonomic managers running on the same and different machines. The common vulnerability scoring system (CVSS metric shows a decrease in the vulnerability severity score from high (8.8 for existing ACS to low (3.9 for SSE-ACS. Autonomic managers are introduced into the system at runtime from the Autonomic_Cloud to test the scalability and elasticity. With elastic AMs, the system optimizes the Central Processing Unit (CPU share resulting in an improved execution time for business logic. For computing systems requiring the continuous support of self-management services, the proposed system achieves a significant improvement in security, scalability, elasticity, autonomic efficiency, and issue resolving time

Real/binary co-operative and co-evolving swarms based multivariable PID controller design of ball mill pulverizing system

International Nuclear Information System (INIS)

Menhas, Muhammad Ilyas; Fei Minrui; Wang Ling; Qian Lin

2012-01-01

Highlights: ► We extend the concept of co-operation and co-evolution in some PSO variants. ► We use developed co-operative PSOs in multivariable PID controller design/tuning. ► We find that co-operative PSOs converge faster and give high quality solutions. ► Dividing the search space among swarms improves search efficiency. ► The proposed methods allow the practitioner for heterogeneous problem formulation. - Abstract: In this paper, multivariable PID controller design based on cooperative and coevolving multiple swarms is demonstrated. A simplified multi-variable MIMO process model of a ball mill pulverizing system with steady state decoupler is considered. In order to formulate computational models of cooperative and coevolving multiple swarms three different algorithms like real coded PSO, discrete binary PSO (DBPSO) and probability based discrete binary PSO (PBPSO) are employed. Simulations are carried out on three composite functions simultaneously considering multiple objectives. The cooperative and coevolving multiple swarms based results are compared with the results obtained through single swarm based methods like real coded particle swarm optimization (PSO), discrete binary PSO (DBPSO), and probability based discrete binary PSO (PBPSO) algorithms. The cooperative and coevolving swarms based techniques outperform the real coded PSO, PBPSO, and the standard discrete binary PSO (DBPSO) algorithm in escaping from local optima. Furthermore, statistical analysis of the simulation results is performed to calculate the comparative reliability of various techniques. All of the techniques employed are suitable for controller tuning, however, the multiple cooperative and coevolving swarms based results are considerably better in terms of mean fitness, variance of fitness, and success rate in finding a feasible solution in comparison to those obtained using single swarm based methods.

Simulation Study of Swarm Intelligence Based on Life Evolution Behavior

Directory of Open Access Journals (Sweden)

Yanmin Liu

2015-01-01

Full Text Available Swarm intelligence (SI is a new evolutionary computation technology, and its performance efficacy is usually affected by each individual behavior in the swarm. According to the genetic and sociological theory, the life evolution behavior process is influenced by the external and internal factors, so the mechanisms of external and internal environment change must be analyzed and explored. Therefore, in this paper, we used the thought of the famous American genetic biologist Morgan, “life = DNA + environment + interaction of environment + gene,” to propose the mutation and crossover operation of DNA fragments by the environmental change to improve the performance efficiency of intelligence algorithms. Additionally, PSO is a random swarm intelligence algorithm with the genetic and sociological property, so we embed the improved mutation and crossover operation to particle swarm optimization (PSO and designed DNA-PSO algorithm to optimize single and multiobjective optimization problems. Simulation experiments in single and multiobjective optimization problems show that the proposed strategies can effectively improve the performance of swarm intelligence.

Particle swarm optimization based fuzzy logic controller for autonomous green power energy system with hydrogen storage

International Nuclear Information System (INIS)

Safari, S.; Ardehali, M.M.; Sirizi, M.J.

2013-01-01

Highlights: ► Optimized fuzzy logic controller for a hybrid green power system is developed. ► PSO algorithm is used to optimize membership functions of controller. ► Optimized fuzzy logic controller results in lower O and M costs and LPSP. ► Optimization results in less variation of battery state of charge. - Abstract: The objective of this study is to develop an optimized fuzzy logic controller (FLC) for operating an autonomous hybrid green power system (HGPS) based on the particle swarm optimization (PSO) algorithm. An electrolyzer produces hydrogen from surplus energy generated by the wind turbine and photovoltaic array of HGPS for later use by a fuel cell. The PSO algorithm is used to optimize membership functions of the FLC. The FLC inputs are (a) net power flow and (b) batteries state of charge (SOC) and FLC output determines the time for hydrogen production or consumption. Actual data for weekly residential load, wind speed, ambient temperature, and solar irradiation are used for performance simulation and analysis of the HGPS examined. The weekly operation and maintenance (O and M) costs and the loss of power supply probability (LPSP) are considered in the optimization procedure. It is determined that FLC optimization results in (a) reduced fluctuations in batteries SOC which translates into longer life for batteries and the average SOC is increased by 6.18% and (b) less working hours for fuel cell, when the load is met by wind and PV. It is found that the optimized FLC results in lower O and M costs and LPSP by 57% and 33%, respectively, as compared to its un-optimized counterpart. In addition, a reduction of 18% in investment cost is achievable by optimal sizing and reducing the capacity of HGPS equipment.

Computing architecture for autonomous microgrids

Science.gov (United States)

Goldsmith, Steven Y.

2015-09-29

A computing architecture that facilitates autonomously controlling operations of a microgrid is described herein. A microgrid network includes numerous computing devices that execute intelligent agents, each of which is assigned to a particular entity (load, source, storage device, or switch) in the microgrid. The intelligent agents can execute in accordance with predefined protocols to collectively perform computations that facilitate uninterrupted control of the .

Simulation Study of Swarm Intelligence Based on Life Evolution Behavior

OpenAIRE

Yanmin Liu; Ying Bi; Changling Sui; Yuanfeng Luo; Zhuanzhou Zhang; Rui Liu

2015-01-01

Swarm intelligence (SI) is a new evolutionary computation technology, and its performance efficacy is usually affected by each individual behavior in the swarm. According to the genetic and sociological theory, the life evolution behavior process is influenced by the external and internal factors, so the mechanisms of external and internal environment change must be analyzed and explored. Therefore, in this paper, we used the thought of the famous American genetic biologist Morgan, “life = DN...

A particle-based simplified swarm optimization algorithm for reliability redundancy allocation problems

International Nuclear Information System (INIS)

Huang, Chia-Ling

2015-01-01

This paper proposes a new swarm intelligence method known as the Particle-based Simplified Swarm Optimization (PSSO) algorithm while undertaking a modification of the Updating Mechanism (UM), called N-UM and R-UM, and simultaneously applying an Orthogonal Array Test (OA) to solve reliability–redundancy allocation problems (RRAPs) successfully. One difficulty of RRAP is the need to maximize system reliability in cases where the number of redundant components and the reliability of corresponding components in each subsystem are simultaneously decided with nonlinear constraints. In this paper, four RRAP benchmarks are used to display the applicability of the proposed PSSO that advances the strengths of both PSO and SSO to enable optimizing the RRAP that belongs to mixed-integer nonlinear programming. When the computational results are compared with those of previously developed algorithms in existing literature, the findings indicate that the proposed PSSO is highly competitive and performs well. - Highlights: • This paper proposes a particle-based simplified swarm optimization algorithm (PSSO) to optimize RRAP. • Furthermore, the UM and an OA are adapted to advance in optimizing RRAP. • Four systems are introduced and the results demonstrate the PSSO performs particularly well

Swarm formation control utilizing elliptical surfaces and limiting functions.

Science.gov (United States)

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).

Autonomous Agents on Expedition: Humans and Progenitor Ants and Planetary Exploration

Science.gov (United States)

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

2002-01-01

The Autonomous Nano-Technology Swarm (ANTS) is an advanced mission architecture based on a social insect analog of many specialized spacecraft working together to achieve mission goals. The principal mission concept driving the ANTS architecture is a Main Belt Asteroid Survey in the 2020s that will involve a thousand or more nano-technology enabled, artificially intelligent, autonomous pico-spacecraft (architecture. High level, mission-oriented behaviors are to be managed by a control / communications layer of the swarm, whereas common low level functions required of all spacecraft, e.g. attitude control and guidance and navigation, are handled autonomically on each spacecraft. At the higher levels of mission planning and social interaction deliberative techniques are to be used. For the asteroid survey, ANTS acts as a large community of cooperative agents while for precursor missions there arises the intriguing possibility of Progenitor ANTS and humans acting together as agents. For optimal efficiency and responsiveness for individual spacecraft at the lowest levels of control we have been studying control methods based on nonlinear dynamical systems. We describe the critically important autonomous control architecture of the ANTS mission concept and a sequence of partial implementations that feature increasingly autonomous behaviors. The scientific and engineering roles that these Progenitor ANTS could play in human missions or remote missions with near real time human interactions, particularly to the Moon and Mars, will be discussed.

Binary particle swarm optimization for frequency band selection in motor imagery based brain-computer interfaces.

Science.gov (United States)

Wei, Qingguo; Wei, Zhonghai

2015-01-01

A brain-computer interface (BCI) enables people suffering from affective neurological diseases to communicate with the external world. Common spatial pattern (CSP) is an effective algorithm for feature extraction in motor imagery based BCI systems. However, many studies have proved that the performance of CSP depends heavily on the frequency band of EEG signals used for the construction of covariance matrices. The use of different frequency bands to extract signal features may lead to different classification performances, which are determined by the discriminative and complementary information they contain. In this study, the broad frequency band (8-30 Hz) is divided into 10 sub-bands of band width 4 Hz and overlapping 2 Hz. Binary particle swarm optimization (BPSO) is used to find the best sub-band set to improve the performance of CSP and subsequent classification. Experimental results demonstrate that the proposed method achieved an average improvement of 6.91% in cross-validation accuracy when compared to broad band CSP.

The Optimal Wavelengths for Light Absorption Spectroscopy Measurements Based on Genetic Algorithm-Particle Swarm Optimization

Science.gov (United States)

Tang, Ge; Wei, Biao; Wu, Decao; Feng, Peng; Liu, Juan; Tang, Yuan; Xiong, Shuangfei; Zhang, Zheng

2018-03-01

To select the optimal wavelengths in the light extinction spectroscopy measurement, genetic algorithm-particle swarm optimization (GAPSO) based on genetic algorithm (GA) and particle swarm optimization (PSO) is adopted. The change of the optimal wavelength positions in different feature size parameters and distribution parameters is evaluated. Moreover, the Monte Carlo method based on random probability is used to identify the number of optimal wavelengths, and good inversion effects of the particle size distribution are obtained. The method proved to have the advantage of resisting noise. In order to verify the feasibility of the algorithm, spectra with bands ranging from 200 to 1000 nm are computed. Based on this, the measured data of standard particles are used to verify the algorithm.

Autonomic Closure for Turbulent Flows Using Approximate Bayesian Computation

Science.gov (United States)

Doronina, Olga; Christopher, Jason; Hamlington, Peter; Dahm, Werner

2017-11-01

Autonomic closure is a new technique for achieving fully adaptive and physically accurate closure of coarse-grained turbulent flow governing equations, such as those solved in large eddy simulations (LES). Although autonomic closure has been shown in recent a priori tests to more accurately represent unclosed terms than do dynamic versions of traditional LES models, the computational cost of the approach makes it challenging to implement for simulations of practical turbulent flows at realistically high Reynolds numbers. The optimization step used in the approach introduces large matrices that must be inverted and is highly memory intensive. In order to reduce memory requirements, here we propose to use approximate Bayesian computation (ABC) in place of the optimization step, thereby yielding a computationally-efficient implementation of autonomic closure that trades memory-intensive for processor-intensive computations. The latter challenge can be overcome as co-processors such as general purpose graphical processing units become increasingly available on current generation petascale and exascale supercomputers. In this work, we outline the formulation of ABC-enabled autonomic closure and present initial results demonstrating the accuracy and computational cost of the approach.

Flocking algorithm for autonomous flying robots.

Science.gov (United States)

Virágh, Csaba; Vásárhelyi, Gábor; Tarcai, Norbert; Szörényi, Tamás; Somorjai, Gergő; Nepusz, Tamás; Vicsek, Tamás

2014-06-01

Animal swarms displaying a variety of typical flocking patterns would not exist without the underlying safe, optimal and stable dynamics of the individuals. The emergence of these universal patterns can be efficiently reconstructed with agent-based models. If we want to reproduce these patterns with artificial systems, such as autonomous aerial robots, agent-based models can also be used in their control algorithms. However, finding the proper algorithms and thus understanding the essential characteristics of the emergent collective behaviour requires thorough and realistic modeling of the robot and also the environment. In this paper, we first present an abstract mathematical model of an autonomous flying robot. The model takes into account several realistic features, such as time delay and locality of communication, inaccuracy of the on-board sensors and inertial effects. We present two decentralized control algorithms. One is based on a simple self-propelled flocking model of animal collective motion, the other is a collective target tracking algorithm. Both algorithms contain a viscous friction-like term, which aligns the velocities of neighbouring agents parallel to each other. We show that this term can be essential for reducing the inherent instabilities of such a noisy and delayed realistic system. We discuss simulation results on the stability of the control algorithms, and perform real experiments to show the applicability of the algorithms on a group of autonomous quadcopters. In our case, bio-inspiration works in two ways. On the one hand, the whole idea of trying to build and control a swarm of robots comes from the observation that birds tend to flock to optimize their behaviour as a group. On the other hand, by using a realistic simulation framework and studying the group behaviour of autonomous robots we can learn about the major factors influencing the flight of bird flocks.

Swarm Intelligence systems

International Nuclear Information System (INIS)

Beni, G.

1994-01-01

We review the characteristics of Swarm Intelligence and discuss systems exhibiting it. The recently developed mathematical description of Swarm behavior is also reviewed and discussed. The self-organization of Swarms is described as the reconfiguring asynchronously and conservatively of a distribution. Swarm reconfigurations are based on producing distributions that are solutions to systems of linear equations. Conservation and asynchronicity are related, respectively, to the global and local nature of the Swarm problem. The conditions for the convergence of the Swarm algorithm are presented. The important point is that, under very general conditions, the Swarm reconfigures in a time which is independent of the size of the Swarm. This fact implies that a centralized controller can never reconfigure as fast as a Swarm provided the size of the Swarm is large enough. This result is related to the unpredictability of the Swarm, a basic property of Swarm Intelligence. Finally, the conditions under which Swarm algorithms become of practical importance are discussed and examples given. (author)

Computer vision for an autonomous mobile robot

CSIR Research Space (South Africa)

Withey, Daniel J

2015-10-01

Full Text Available Computer vision systems are essential for practical, autonomous, mobile robots – machines that employ artificial intelligence and control their own motion within an environment. As with biological systems, computer vision systems include the vision...

A Security Monitoring Method Based on Autonomic Computing for the Cloud Platform

Directory of Open Access Journals (Sweden)

Jingjie Zhang

2018-01-01

Full Text Available With the continuous development of cloud computing, cloud security has become one of the most important issues in cloud computing. For example, data stored in the cloud platform may be attacked, and its security is difficult to be guaranteed. Therefore, we must attach weight to the issue of how to protect the data stored in the cloud. To protect data, data monitoring is a necessary process. Based on autonomic computing, we develop a cloud data monitoring system on the cloud platform, monitoring whether the data is abnormal in the cycle and analyzing the security of the data according to the monitored results. In this paper, the feasibility of the scheme can be verified through simulation. The results show that the proposed method can adapt to the dynamic change of cloud platform load, and it can also accurately evaluate the degree of abnormal data. Meanwhile, by adjusting monitoring frequency automatically, it improves the accuracy and timeliness of monitoring. Furthermore, it can reduce the monitoring cost of the system in normal operation process.

Cooperative Control for Multiple Autonomous Vehicles Using Descriptor Functions

Directory of Open Access Journals (Sweden)

Marta Niccolini

2014-01-01

Full Text Available The paper presents a novel methodology for the control management of a swarm of autonomous vehicles. The vehicles, or agents, may have different skills, and be employed for different missions. The methodology is based on the definition of descriptor functions that model the capabilities of the single agent and each task or mission. The swarm motion is controlled by minimizing a suitable norm of the error between agents’ descriptor functions and other descriptor functions which models the entire mission. The validity of the proposed technique is tested via numerical simulation, using different task assignment scenarios.

Synthesis of a Controller for Swarming Robots Performing Underwater Mine Countermeasures

National Research Council Canada - National Science Library

Tan, Yong

2004-01-01

This Trident Scholar project involved the synthesis of a swarm controller that is suitable for controlling movements of a group of autonomous robots performing underwater mine countermeasures (UMCM...

Multi-UAVs Formation Autonomous Control Method Based on RQPSO-FSM-DMPC

Directory of Open Access Journals (Sweden)

Shao-lei Zhou

2016-01-01

Full Text Available For various threats in the enemy defense area, in order to achieve covert penetration and implement effective combat against enemy, the unmanned aerial vehicles formation needs to be reconfigured in the process of penetration; the mutual collision avoidance problems and communication constraint problems among the formation also need to be considered. By establishing the virtual-leader formation model, this paper puts forward distributed model predictive control and finite state machine formation manager. Combined with distributed cooperative strategy establishing the formation reconfiguration cost function, this paper proposes that adopting the revised quantum-behaved particle swarm algorithm solves the cost function, and it is compared with the result which is solved by particle swarm algorithm. Simulation result shows that this algorithm can control multiple UAVs formation autonomous reconfiguration effectively and achieve covert penetration safely.

A design approach for small vision-based autonomous vehicles

Science.gov (United States)

Edwards, Barrett B.; Fife, Wade S.; Archibald, James K.; Lee, Dah-Jye; Wilde, Doran K.

2006-10-01

This paper describes the design of a small autonomous vehicle based on the Helios computing platform, a custom FPGA-based board capable of supporting on-board vision. Target applications for the Helios computing platform are those that require lightweight equipment and low power consumption. To demonstrate the capabilities of FPGAs in real-time control of autonomous vehicles, a 16 inch long R/C monster truck was outfitted with a Helios board. The platform provided by such a small vehicle is ideal for testing and development. The proof of concept application for this autonomous vehicle was a timed race through an environment with obstacles. Given the size restrictions of the vehicle and its operating environment, the only feasible on-board sensor is a small CMOS camera. The single video feed is therefore the only source of information from the surrounding environment. The image is then segmented and processed by custom logic in the FPGA that also controls direction and speed of the vehicle based on visual input.

Hybrid chaotic ant swarm optimization

International Nuclear Information System (INIS)

Li Yuying; Wen Qiaoyan; Li Lixiang; Peng Haipeng

2009-01-01

Chaotic ant swarm optimization (CASO) is a powerful chaos search algorithm that is used to find the global optimum solution in search space. However, the CASO algorithm has some disadvantages, such as lower solution precision and longer computational time, when solving complex optimization problems. To resolve these problems, an improved CASO, called hybrid chaotic swarm optimization (HCASO), is proposed in this paper. The new algorithm introduces preselection operator and discrete recombination operator into the CASO; meanwhile it replaces the best position found by own and its neighbors' ants with the best position found by preselection operator and discrete recombination operator in evolution equation. Through testing five benchmark functions with large dimensionality, the experimental results show the new method enhances the solution accuracy and stability greatly, as well as reduces the computational time and computer memory significantly when compared to the CASO. In addition, we observe the results can become better with swarm size increasing from the sensitivity study to swarm size. And we gain some relations between problem dimensions and swam size according to scalability study.

Cultural-based particle swarm for dynamic optimisation problems

Science.gov (United States)

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.

From random process to chaotic behavior in swarms of UAVs

OpenAIRE

Rosalie , Martin; Danoy , Grégoire; Chaumette , Serge; Bouvry , Pascal

2016-01-01

International audience; Unmanned Aerial Vehicles (UAVs) applications have seen an important increase in the last decade for both military and civilian applications ranging from fire and high seas rescue to military surveillance and target detection. While this technology is now mature for a single UAV, new methods are needed to operate UAVs in swarms, also referred to as fleets. This work focuses on the mobility management of one single autonomous swarm of UAVs which mission is to cover a giv...

A Robotic Swarm for Spill Finding and Perimeter Formation

National Research Council Canada - National Science Library

Bruemmer, David J; Dudenhoeffer, Donald D; McKay, Mark D; Anderson, Matthew O

2002-01-01

... intelligence as seen in a colony of ants or swarm of bees. A suite of C2 tools, AgentTools, has been developed to enable an operator to inject high-level domain knowledge and guidance into the behavior of the otherwise autonomous robots...

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

Science.gov (United States)

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

Directory of Open Access Journals (Sweden)

Huanqing Cui

2017-03-01

Full Text Available 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.

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

Science.gov (United States)

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.

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

Science.gov (United States)

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

Using Simulated Partial Dynamic Run-Time Reconfiguration to Share Embedded FPGA Compute and Power Resources across a Swarm of Unpiloted Airborne Vehicles

Directory of Open Access Journals (Sweden)

Kearney David

2007-01-01

Full Text Available We show how the limited electrical power and FPGA compute resources available in a swarm of small UAVs can be shared by moving FPGA tasks from one UAV to another. A software and hardware infrastructure that supports the mobility of embedded FPGA applications on a single FPGA chip and across a group of networked FPGA chips is an integral part of the work described here. It is shown how to allocate a single FPGA's resources at run time and to share a single device through the use of application checkpointing, a memory controller, and an on-chip run-time reconfigurable network. A prototype distributed operating system is described for managing mobile applications across the swarm based on the contents of a fuzzy rule base. It can move applications between UAVs in order to equalize power use or to enable the continuous replenishment of fully fueled planes into the swarm.

A Novel Path Planning for Robots Based on Rapidly-Exploring Random Tree and Particle Swarm Optimizer Algorithm

Directory of Open Access Journals (Sweden)

Zhou Feng

2013-09-01

Full Text Available A based on Rapidly-exploring Random Tree(RRT and Particle Swarm Optimizer (PSO for path planning of the robot is proposed.First the grid method is built to describe the working space of the mobile robot,then the Rapidly-exploring Random Tree algorithm is used to obtain the global navigation path,and the Particle Swarm Optimizer algorithm is adopted to get the better path.Computer experiment results demonstrate that this novel algorithm can plan an optimal path rapidly in a cluttered environment.The successful obstacle avoidance is achieved,and the model is robust and performs reliably.

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

Science.gov (United States)

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.

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

Science.gov (United States)

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

Energy-Aware Multipath Routing Scheme Based on Particle Swarm Optimization in Mobile Ad Hoc Networks.

Science.gov (United States)

Robinson, Y Harold; Rajaram, M

2015-01-01

Mobile ad hoc network (MANET) is a collection of autonomous mobile nodes forming an ad hoc network without fixed infrastructure. Dynamic topology property of MANET may degrade the performance of the network. However, multipath selection is a great challenging task to improve the network lifetime. We proposed an energy-aware multipath routing scheme based on particle swarm optimization (EMPSO) that uses continuous time recurrent neural network (CTRNN) to solve optimization problems. CTRNN finds the optimal loop-free paths to solve link disjoint paths in a MANET. The CTRNN is used as an optimum path selection technique that produces a set of optimal paths between source and destination. In CTRNN, particle swarm optimization (PSO) method is primly used for training the RNN. The proposed scheme uses the reliability measures such as transmission cost, energy factor, and the optimal traffic ratio between source and destination to increase routing performance. In this scheme, optimal loop-free paths can be found using PSO to seek better link quality nodes in route discovery phase. PSO optimizes a problem by iteratively trying to get a better solution with regard to a measure of quality. The proposed scheme discovers multiple loop-free paths by using PSO technique.

Autonomous Navigation for Autonomous Underwater Vehicles Based on Information Filters and Active Sensing

Directory of Open Access Journals (Sweden)

Tianhong Yan

2011-11-01

Full Text Available This paper addresses an autonomous navigation method for the autonomous underwater vehicle (AUV C-Ranger applying information-filter-based simultaneous localization and mapping (SLAM, and its sea trial experiments in Tuandao Bay (Shangdong Province, P.R. China. Weak links in the information matrix in an extended information filter (EIF can be pruned to achieve an efficient approach-sparse EIF algorithm (SEIF-SLAM. All the basic update formulae can be implemented in constant time irrespective of the size of the map; hence the computational complexity is significantly reduced. The mechanical scanning imaging sonar is chosen as the active sensing device for the underwater vehicle, and a compensation method based on feedback of the AUV pose is presented to overcome distortion of the acoustic images due to the vehicle motion. In order to verify the feasibility of the navigation methods proposed for the C-Ranger, a sea trial was conducted in Tuandao Bay. Experimental results and analysis show that the proposed navigation approach based on SEIF-SLAM improves the accuracy of the navigation compared with conventional method; moreover the algorithm has a low computational cost when compared with EKF-SLAM.

Autonomous navigation for autonomous underwater vehicles based on information filters and active sensing.

Science.gov (United States)

He, Bo; Zhang, Hongjin; Li, Chao; Zhang, Shujing; Liang, Yan; Yan, Tianhong

2011-01-01

This paper addresses an autonomous navigation method for the autonomous underwater vehicle (AUV) C-Ranger applying information-filter-based simultaneous localization and mapping (SLAM), and its sea trial experiments in Tuandao Bay (Shangdong Province, P.R. China). Weak links in the information matrix in an extended information filter (EIF) can be pruned to achieve an efficient approach-sparse EIF algorithm (SEIF-SLAM). All the basic update formulae can be implemented in constant time irrespective of the size of the map; hence the computational complexity is significantly reduced. The mechanical scanning imaging sonar is chosen as the active sensing device for the underwater vehicle, and a compensation method based on feedback of the AUV pose is presented to overcome distortion of the acoustic images due to the vehicle motion. In order to verify the feasibility of the navigation methods proposed for the C-Ranger, a sea trial was conducted in Tuandao Bay. Experimental results and analysis show that the proposed navigation approach based on SEIF-SLAM improves the accuracy of the navigation compared with conventional method; moreover the algorithm has a low computational cost when compared with EKF-SLAM.

A swarm of autonomous miniature underwater robot drifters for exploring submesoscale ocean dynamics.

Science.gov (United States)

Jaffe, Jules S; Franks, Peter J S; Roberts, Paul L D; Mirza, Diba; Schurgers, Curt; Kastner, Ryan; Boch, Adrien

2017-01-24

Measuring the ever-changing 3-dimensional (3D) motions of the ocean requires simultaneous sampling at multiple locations. In particular, sampling the complex, nonlinear dynamics associated with submesoscales (swarm of 16 independent vehicles whose 3D trajectories are measured near-continuously, underwater. As the vehicles drift with the ambient flow or execute preprogrammed vertical behaviours, the simultaneous measurements at multiple, known locations resolve the details of the flow within the swarm. We describe the design, construction, control and underwater navigation of the M-AUE. A field programme in the coastal ocean using a swarm of these robots programmed with a depth-holding behaviour provides a unique test of a physical-biological interaction leading to plankton patch formation in internal waves. The performance of the M-AUE vehicles illustrates their novel capability for measuring submesoscale dynamics.

Autonomic computing meets SCADA security

OpenAIRE

Nazir, S; Patel, S; Patel, D

2017-01-01

© 2017 IEEE. National assets such as transportation networks, large manufacturing, business and health facilities, power generation, and distribution networks are critical infrastructures. The cyber threats to these infrastructures have increasingly become more sophisticated, extensive and numerous. Cyber security conventional measures have proved useful in the past but increasing sophistication of attacks dictates the need for newer measures. The autonomic computing paradigm mimics the auton...

Time Optimal Reachability Analysis Using Swarm Verification

DEFF Research Database (Denmark)

Zhang, Zhengkui; Nielsen, Brian; Larsen, Kim Guldstrand

2016-01-01

Time optimal reachability analysis employs model-checking to compute goal states that can be reached from an initial state with a minimal accumulated time duration. The model-checker may produce a corresponding diagnostic trace which can be interpreted as a feasible schedule for many scheduling...... and planning problems, response time optimization etc. We propose swarm verification to accelerate time optimal reachability using the real-time model-checker Uppaal. In swarm verification, a large number of model checker instances execute in parallel on a computer cluster using different, typically randomized...... search strategies. We develop four swarm algorithms and evaluate them with four models in terms scalability, and time- and memory consumption. Three of these cooperate by exchanging costs of intermediate solutions to prune the search using a branch-and-bound approach. Our results show that swarm...

AN OFFSET FOR AFSOF: COMBINING ADDITIVE MANUFACTURING AND AUTONOMOUS SYSTEMS WITH SWARM EMPLOYMENT

Science.gov (United States)

2016-10-01

to service members by removing them from the hostile environment. Swarm technologies and employment use a larger number of simple, relatively low...A swarm consists of disparate elements that coordinate and adapt their movements in order to give rise to an emergent , coherent whole.”7...goal in a dynamically changing environment. This is a very active area of research and exemplified by the robot soccer league, a competition where

Adaptively detecting changes in Autonomic Grid Computing

KAUST Repository

Zhang, Xiangliang; Germain, Cé cile; Sebag, Michè le

2010-01-01

Detecting the changes is the common issue in many application fields due to the non-stationary distribution of the applicative data, e.g., sensor network signals, web logs and gridrunning logs. Toward Autonomic Grid Computing, adaptively detecting

Attacks and Intrusion Detection in Cloud Computing Using Neural Networks and Particle Swarm Optimization Algorithms

Directory of Open Access Journals (Sweden)

Ahmad Shokuh Saljoughi

2018-01-01

Full Text Available Today, cloud computing has become popular among users in organizations and companies. Security and efficiency are the two major issues facing cloud service providers and their customers. Since cloud computing is a virtual pool of resources provided in an open environment (Internet, cloud-based services entail security risks. Detection of intrusions and attacks through unauthorized users is one of the biggest challenges for both cloud service providers and cloud users. In the present study, artificial intelligence techniques, e.g. MLP Neural Network sand particle swarm optimization algorithm, were used to detect intrusion and attacks. The methods were tested for NSL-KDD, KDD-CUP datasets. The results showed improved accuracy in detecting attacks and intrusions by unauthorized users.

Particle swarm optimization for automatic creation of complex graphic characters

International Nuclear Information System (INIS)

Fister, Iztok; Perc, Matjaž; Ljubič, Karin; Kamal, Salahuddin M.; Iglesias, Andres; Fister, Iztok

2015-01-01

Nature-inspired algorithms are a very promising tool for solving the hardest problems in computer sciences and mathematics. These algorithms are typically inspired by the fascinating behavior at display in biological systems, such as bee swarms or fish schools. So far, these algorithms have been applied in many practical applications. In this paper, we present a simple particle swarm optimization, which allows automatic creation of complex two-dimensional graphic characters. The method involves constructing the base characters, optimizing the modifications of the base characters with the particle swarm optimization algorithm, and finally generating the graphic characters from the solution. We demonstrate the effectiveness of our approach with the creation of simple snowman, but we also outline in detail how more complex characters can be created

Swarm-Aurora: A web-based tool for quickly identifying multi-instrument auroral events

Science.gov (United States)

Chaddock, D.; Donovan, E.; Spanswick, E.; Knudsen, D. J.; Frey, H. U.; Kauristie, K.; Partamies, N.; Jackel, B. J.; Gillies, M.; Holmdahl Olsen, P. E.

2016-12-01

In recent years there has been a dramatic increase in ground-based auroral imaging systems. These include the continent-wide THEMIS-ASI network, and imagers operated by other programs including GO-Canada, MIRACLE, AGO, OMTI, and more. In the near future, a new Canadian program called TREx will see the deployment of new narrow-band ASIs that will provide multi-wavelength imaging across Western Canada. At the same time, there is an unprecedented fleet of international spacecraft probing geospace at low and high altitudes. We are now in the position to simultaneously observe the magnetospheric drivers of aurora, observe in situ the waves, currents, and particles associated with MI coupling, and the conjugate aurora. Whereas a decade ago, a single magnetic conjunction between one ASI and a low altitude satellite was a relatively rare event, we now have a plethora of triple conjunctions between imagers, low-altitude spacecraft, and near-equatorial magnetospheric probes. But with these riches comes a new level of complexity. It is often difficult to identify the many useful conjunctions for a specific line of inquiry from the multitude of conjunctions where the geospace conditions are often not relevant and/or the imaging is compromised by clouds, moon, or other factors. Swarm-Aurora was designed to facilitate and drive the use of Swarm in situ measurements in auroral science. The project seeks to build a bridge between the Swarm science community, Swarm data, and the complimentary auroral data and community. Swarm-Aurora (http://swarm-aurora.phys.ucalgary.ca) incorporates a web-based tool which provides access to quick-look summary data for a large array of instruments, with Swarm in situ and ground-based ASI data as the primary focus. This web interface allows researchers to quickly and efficiently browse Swarm and ASI data to identify auroral events of interest to them. This allows researchers to be able to easily and quickly identify Swarm overflights of ASIs that

Vision-based autonomous grasping of unknown piled objects

International Nuclear Information System (INIS)

Johnson, R.K.

1994-01-01

Computer vision techniques have been used to develop a vision-based grasping capability for autonomously picking and placing unknown piled objects. This work is currently being applied to the problem of hazardous waste sorting in support of the Department of Energy's Mixed Waste Operations Program

Swarm Robotics with Circular Formation Motion Including Obstacles Avoidance

Directory of Open Access Journals (Sweden)

Nabil M. Hewahi

2017-07-01

Full Text Available The robots science has been developed over the past few years, where robots have become used to accomplish difficult, repetitive or accurate tasks, which are very hard for humans to carry out. In this paper, we propose an algorithm to control the motion of a swarm of robots and make them able to avoid obstacles. The proposed solution is based on forming the robots in circular fashion. A group set of robots consists of multiple groups of robots, each group of robots consists of robots forming a circular shape and each group set is a circular form of robots. The proposed algorithm is concerned with first locating the randomly generated robots in groups and secondly with the swarm robot motion and finally with the swarm obstacle avoidance and swarm reorganization after crossing the obstacle. The proposed algorithm has been simulated with five different obstacles with various numbers of randomly generated robots. The results show that the swarm in the circular form can deal with the obstacles very effectively by passing the obstacles smoothly. The proposed algorithm has been compared with flocking algorithm and it is shown that the circular formation algorithm does not need extensive computation after obstacle avoidance whereas the flocking algorithm needs extensive computation. In addition, the circular formation algorithm maintains every robot in its group after avoiding the obstacles whereas with flocking algorithm does not.

A distance weighted-based approach for self-organized aggregation in robot swarms

KAUST Repository

Khaldi, Belkacem

2017-12-14

In this paper, a Distance-Weighted K Nearest Neighboring (DW-KNN) topology is proposed to study self-organized aggregation as an emergent swarming behavior within robot swarms. A virtual physics approach is applied among the proposed neighborhood topology to keep the robots together. A distance-weighted function based on a Smoothed Particle Hydrodynamic (SPH) interpolation approach is used as a key factor to identify the K-Nearest neighbors taken into account when aggregating the robots. The intra virtual physical connectivity among these neighbors is achieved using a virtual viscoelastic-based proximity model. With the ARGoS based-simulator, we model and evaluate the proposed approach showing various self-organized aggregations performed by a swarm of N foot-bot robots.

Interacting Brownian Swarms: Some Analytical Results

Directory of Open Access Journals (Sweden)

Guillaume Sartoretti

2016-01-01

Full Text Available We consider the dynamics of swarms of scalar Brownian agents subject to local imitation mechanisms implemented using mutual rank-based interactions. For appropriate values of the underlying control parameters, the swarm propagates tightly and the distances separating successive agents are iid exponential random variables. Implicitly, the implementation of rank-based mutual interactions, requires that agents have infinite interaction ranges. Using the probabilistic size of the swarm’s support, we analytically estimate the critical interaction range below that flocked swarms cannot survive. In the second part of the paper, we consider the interactions between two flocked swarms of Brownian agents with finite interaction ranges. Both swarms travel with different barycentric velocities, and agents from both swarms indifferently interact with each other. For appropriate initial configurations, both swarms eventually collide (i.e., all agents interact. Depending on the values of the control parameters, one of the following patterns emerges after collision: (i Both swarms remain essentially flocked, or (ii the swarms become ultimately quasi-free and recover their nominal barycentric speeds. We derive a set of analytical flocking conditions based on the generalized rank-based Brownian motion. An extensive set of numerical simulations corroborates our analytical findings.

The Dynamics of Interacting Swarms

Science.gov (United States)

2018-04-04

have been used as a means of realistically modeling swarming behaviors [26, 38, 44]. Systematic numerical studies of discrete flocking based on...The model for the swarm we use is based on the the employed in [9], which describe a mathe - matically swarm model using the Morse potential. Recently

Swarm intelligence-based approach for optimal design of CMOS differential amplifier and comparator circuit using a hybrid salp swarm algorithm

Science.gov (United States)

Asaithambi, Sasikumar; Rajappa, Muthaiah

2018-05-01

In this paper, an automatic design method based on a swarm intelligence approach for CMOS analog integrated circuit (IC) design is presented. The hybrid meta-heuristics optimization technique, namely, the salp swarm algorithm (SSA), is applied to the optimal sizing of a CMOS differential amplifier and the comparator circuit. SSA is a nature-inspired optimization algorithm which mimics the navigating and hunting behavior of salp. The hybrid SSA is applied to optimize the circuit design parameters and to minimize the MOS transistor sizes. The proposed swarm intelligence approach was successfully implemented for an automatic design and optimization of CMOS analog ICs using Generic Process Design Kit (GPDK) 180 nm technology. The circuit design parameters and design specifications are validated through a simulation program for integrated circuit emphasis simulator. To investigate the efficiency of the proposed approach, comparisons have been carried out with other simulation-based circuit design methods. The performances of hybrid SSA based CMOS analog IC designs are better than the previously reported studies.

Hybrid glowworm swarm optimization for task scheduling in the cloud environment

Science.gov (United States)

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.

Swarm-based adaptation: wayfinding support for lifelong learners

NARCIS (Netherlands)

Tattersall, Colin; Van den Berg, Bert; Van Es, René; Janssen, José; Manderveld, Jocelyn; Koper, Rob

2004-01-01

Please refer to the orinigal publication in: Tattersall, C. Van den Berg, B., Van Es, R., Janssen, J., Manderveld, J., Koper, R. (2004). Swarm-based adaptation: wayfinding support for lifelong learners. In P. de Bra & W. Nejdl, Adaptive Hypermedia and Adaptive Web-Based Systems (LNCS3137), (pp.

Research on Multiple Particle Swarm Algorithm Based on Analysis of Scientific Materials

Directory of Open Access Journals (Sweden)

Zhao Hongwei

2017-01-01

Full Text Available This paper proposed an improved particle swarm optimization algorithm based on analysis of scientific materials. The core thesis of MPSO (Multiple Particle Swarm Algorithm is to improve the single population PSO to interactive multi-swarms, which is used to settle the problem of being trapped into local minima during later iterations because it is lack of diversity. The simulation results show that the convergence rate is fast and the search performance is good, and it has achieved very good results.

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

Directory of Open Access Journals (Sweden)

Zhehuang Huang

2015-01-01

Full Text Available 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.

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

Science.gov (United States)

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.

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

Science.gov (United States)

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

Autonomic Management of Application Workflows on Hybrid Computing Infrastructure

Directory of Open Access Journals (Sweden)

Hyunjoo Kim

2011-01-01

Full Text Available In this paper, we present a programming and runtime framework that enables the autonomic management of complex application workflows on hybrid computing infrastructures. The framework is designed to address system and application heterogeneity and dynamics to ensure that application objectives and constraints are satisfied. The need for such autonomic system and application management is becoming critical as computing infrastructures become increasingly heterogeneous, integrating different classes of resources from high-end HPC systems to commodity clusters and clouds. For example, the framework presented in this paper can be used to provision the appropriate mix of resources based on application requirements and constraints. The framework also monitors the system/application state and adapts the application and/or resources to respond to changing requirements or environment. To demonstrate the operation of the framework and to evaluate its ability, we employ a workflow used to characterize an oil reservoir executing on a hybrid infrastructure composed of TeraGrid nodes and Amazon EC2 instances of various types. Specifically, we show how different applications objectives such as acceleration, conservation and resilience can be effectively achieved while satisfying deadline and budget constraints, using an appropriate mix of dynamically provisioned resources. Our evaluations also demonstrate that public clouds can be used to complement and reinforce the scheduling and usage of traditional high performance computing infrastructure.

Multiple-Swarm Ensembles: Improving the Predictive Power and Robustness of Predictive Models and Its Use in Computational Biology.

Science.gov (United States)

Alves, Pedro; Liu, Shuang; Wang, Daifeng; Gerstein, Mark

2018-01-01

Machine learning is an integral part of computational biology, and has already shown its use in various applications, such as prognostic tests. In the last few years in the non-biological machine learning community, ensembling techniques have shown their power in data mining competitions such as the Netflix challenge; however, such methods have not found wide use in computational biology. In this work, we endeavor to show how ensembling techniques can be applied to practical problems, including problems in the field of bioinformatics, and how they often outperform other machine learning techniques in both predictive power and robustness. Furthermore, we develop a methodology of ensembling, Multi-Swarm Ensemble (MSWE) by using multiple particle swarm optimizations and demonstrate its ability to further enhance the performance of ensembles.

A measurement-based fault detection approach applied to monitor robots swarm

KAUST Repository

Khaldi, Belkacem

2017-07-10

Swarm robotics requires continuous monitoring to detect abnormal events and to sustain normal operations. Indeed, swarm robotics with one or more faulty robots leads to degradation of performances complying with the target requirements. This paper present an innovative data-driven fault detection method for monitoring robots swarm. The method combines the flexibility of principal component analysis (PCA) models and the greater sensitivity of the exponentially-weighted moving average control chart to incipient changes. We illustrate through simulated data collected from the ARGoS simulator that a significant improvement in fault detection can be obtained by using the proposed methods as compared to the use of the conventional PCA-based methods.

Particle Swarm Imaging (PSIM). A swarming algorithm for the reporting of robust, optimal measurement uncertainties

International Nuclear Information System (INIS)

Parvin, Dan; Clarke, Sean

2015-01-01

Particle Swarm Imaging (PSIM) overcomes some of the challenges associated with the accurate declaration of measurement uncertainties of radionuclide inventories within waste items when the distribution of activity is unknown. Implementation requires minimal equipment, making use of gamma‑ray measurements taken from different locations around the waste item, using only a single electrically cooled HRGS gamma‑ray detector for objects up to a UK ISO freight container in size. The PSIM technique is a computational method that iteratively ‘homes‑in’ on the true location of activity concentrations in waste items. PSIM differs from conventional assay techniques by allowing only viable solutions - that is those that could actually give rise to the measured data - to be considered. Thus PSIM avoids the drawback of conventional analyses, namely, the adoption of unrealistic assumptions about the activity distribution that inevitably leads to the declaration of pessimistic (and in some cases optimistic) activity estimates and uncertainties. PSIM applies an optimisation technique based upon ‘particle swarming’ methods to determine a set of candidate solutions within a ‘search space’ defined by the interior volume of a waste item. The positions and activities of the swarm are used in conjunction with a mathematical model to simulate the measurement response for the current swarm location. The swarm is iteratively updated (with modified positions and activities) until a match with sufficient quality is obtained between the simulated and actual measurement data. This process is repeated to build up a distribution of candidate solutions, which is subsequently analysed to calculate a measurement result and uncertainty along with a visual image of the activity distribution. The application of ‘swarming’ computational methods to non‑destructive assay (NDA) measurements is considered novel and this paper is intended to introduce the PSIM concept and provide

Propulsion Trade Studies for Spacecraft Swarm Mission Design

Science.gov (United States)

Dono, Andres; Plice, Laura; Mueting, Joel; Conn, Tracie; Ho, Michael

2018-01-01

Spacecraft swarms constitute a challenge from an orbital mechanics standpoint. Traditional mission design involves the application of methodical processes where predefined maneuvers for an individual spacecraft are planned in advance. This approach does not scale to spacecraft swarms consisting of many satellites orbiting in close proximity; non-deterministic maneuvers cannot be preplanned due to the large number of units and the uncertainties associated with their differential deployment and orbital motion. For autonomous small sat swarms in LEO, we investigate two approaches for controlling the relative motion of a swarm. The first method involves modified miniature phasing maneuvers, where maneuvers are prescribed that cancel the differential delta V of each CubeSat's deployment vector. The second method relies on artificial potential functions (APFs) to contain the spacecraft within a volumetric boundary and avoid collisions. Performance results and required delta V budgets are summarized, indicating that each method has advantages and drawbacks for particular applications. The mini phasing maneuvers are more predictable and sustainable. The APF approach provides a more responsive and distributed performance, but at considerable propellant cost. After considering current state of the art CubeSat propulsion systems, we conclude that the first approach is feasible, but the modified APF method of requires too much control authority to be enabled by current propulsion systems.

Modeling dynamic swarms

KAUST Repository

Ghanem, Bernard

2013-01-01

This paper proposes the problem of modeling video sequences of dynamic swarms (DSs). We define a DS as a large layout of stochastically repetitive spatial configurations of dynamic objects (swarm elements) whose motions exhibit local spatiotemporal interdependency and stationarity, i.e., the motions are similar in any small spatiotemporal neighborhood. Examples of DS abound in nature, e.g., herds of animals and flocks of birds. To capture the local spatiotemporal properties of the DS, we present a probabilistic model that learns both the spatial layout of swarm elements (based on low-level image segmentation) and their joint dynamics that are modeled as linear transformations. To this end, a spatiotemporal neighborhood is associated with each swarm element, in which local stationarity is enforced both spatially and temporally. We assume that the prior on the swarm dynamics is distributed according to an MRF in both space and time. Embedding this model in a MAP framework, we iterate between learning the spatial layout of the swarm and its dynamics. We learn the swarm transformations using ICM, which iterates between estimating these transformations and updating their distribution in the spatiotemporal neighborhoods. We demonstrate the validity of our method by conducting experiments on real and synthetic video sequences. Real sequences of birds, geese, robot swarms, and pedestrians evaluate the applicability of our model to real world data. © 2012 Elsevier Inc. All rights reserved.

A COMPARATIVE STUDY ON MULTI-SWARM OPTIMISATION AND BAT ALGORITHM FOR UNCONSTRAINED NON LINEAR OPTIMISATION PROBLEMS

Directory of Open Access Journals (Sweden)

Evans BAIDOO

2016-12-01

Full Text Available A study branch that mocks-up a population of network of swarms or agents with the ability to self-organise is Swarm intelligence. In spite of the huge amount of work that has been done in this area in both theoretically and empirically and the greater success that has been attained in several aspects, it is still ongoing and at its infant stage. An immune system, a cloud of bats, or a flock of birds are distinctive examples of a swarm system. . In this study, two types of meta-heuristics algorithms based on population and swarm intelligence - Multi Swarm Optimization (MSO and Bat algorithms (BA - are set up to find optimal solutions of continuous non-linear optimisation models. In order to analyze and compare perfect solutions at the expense of performance of both algorithms, a chain of computational experiments on six generally used test functions for assessing the accuracy and the performance of algorithms, in swarm intelligence fields are used. Computational experiments show that MSO algorithm seems much superior to BA.

Intelligent discrete particle swarm optimization for multiprocessor task scheduling problem

Directory of Open Access Journals (Sweden)

S Sarathambekai

2017-03-01

Full Text Available Discrete particle swarm optimization is one of the most recently developed population-based meta-heuristic optimization algorithm in swarm intelligence that can be used in any discrete optimization problems. This article presents a discrete particle swarm optimization algorithm to efficiently schedule the tasks in the heterogeneous multiprocessor systems. All the optimization algorithms share a common algorithmic step, namely population initialization. It plays a significant role because it can affect the convergence speed and also the quality of the final solution. The random initialization is the most commonly used method in majority of the evolutionary algorithms to generate solutions in the initial population. The initial good quality solutions can facilitate the algorithm to locate the optimal solution or else it may prevent the algorithm from finding the optimal solution. Intelligence should be incorporated to generate the initial population in order to avoid the premature convergence. This article presents a discrete particle swarm optimization algorithm, which incorporates opposition-based technique to generate initial population and greedy algorithm to balance the load of the processors. Make span, flow time, and reliability cost are three different measures used to evaluate the efficiency of the proposed discrete particle swarm optimization algorithm for scheduling independent tasks in distributed systems. Computational simulations are done based on a set of benchmark instances to assess the performance of the proposed algorithm.

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

Science.gov (United States)

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.

Elephant swarm water search algorithm for global optimization

Indian Academy of Sciences (India)

S Mandal

2018-02-07

Feb 7, 2018 ... Evolutionary computation and metaheuristics based on swarm intelligence are .... pollen for reproduction or flowering of plants by different pollinators such as insects. Due to long-distance ...... nodes of the denote genes and regulatory interactions between genes are ..... ioral ecology, 3rd ed. Oxford, UK: ...

A Parallel Particle Swarm Optimization Algorithm Accelerated by Asynchronous Evaluations

Science.gov (United States)

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.

Vision Based Autonomous Robot Navigation Algorithms and Implementations

CERN Document Server

Chatterjee, Amitava; Nirmal Singh, N

2013-01-01

This book is devoted to the theory and development of autonomous navigation of mobile robots using computer vision based sensing mechanism. The conventional robot navigation systems, utilizing traditional sensors like ultrasonic, IR, GPS, laser sensors etc., suffer several drawbacks related to either the physical limitations of the sensor or incur high cost. Vision sensing has emerged as a popular alternative where cameras can be used to reduce the overall cost, maintaining high degree of intelligence, flexibility and robustness. This book includes a detailed description of several new approaches for real life vision based autonomous navigation algorithms and SLAM. It presents the concept of how subgoal based goal-driven navigation can be carried out using vision sensing. The development concept of vision based robots for path/line tracking using fuzzy logic is presented, as well as how a low-cost robot can be indigenously developed in the laboratory with microcontroller based sensor systems. The book descri...

Self-regulating and self-evolving particle swarm optimizer

Science.gov (United States)

Wang, Hui-Min; Qiao, Zhao-Wei; Xia, Chang-Liang; Li, Liang-Yu

2015-01-01

In this article, a novel self-regulating and self-evolving particle swarm optimizer (SSPSO) is proposed. Learning from the idea of direction reversal, self-regulating behaviour is a modified position update rule for particles, according to which the algorithm improves the best position to accelerate convergence in situations where the traditional update rule does not work. Borrowing the idea of mutation from evolutionary computation, self-evolving behaviour acts on the current best particle in the swarm to prevent the algorithm from prematurely converging. The performance of SSPSO and four other improved particle swarm optimizers is numerically evaluated by unimodal, multimodal and rotated multimodal benchmark functions. The effectiveness of SSPSO in solving real-world problems is shown by the magnetic optimization of a Halbach-based permanent magnet machine. The results show that SSPSO has good convergence performance and high reliability, and is well matched to actual problems.

Guidance and control of swarms of spacecraft

Science.gov (United States)

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

In search of synergies between policy-based systems management and economic models for autonomic computing

OpenAIRE

Anthony, Richard

2011-01-01

Policy-based systems management (PBM) and economics-based systems management (EBM) are two of the many techniques available for implementing autonomic systems, each having specific benefits and limitations, and thus different applicability; choosing the most appropriate technique is\\ud the first of many challenges faced by the developer. This talk begins with a critical discussion of the general design goals of autonomic systems and the main issues involved with their development and deployme...

A Novel Distributed Quantum-Behaved Particle Swarm Optimization

Directory of Open Access Journals (Sweden)

Yangyang Li

2017-01-01

Full Text Available Quantum-behaved particle swarm optimization (QPSO is an improved version of particle swarm optimization (PSO and has shown superior performance on many optimization problems. But for now, it may not always satisfy the situations. Nowadays, problems become larger and more complex, and most serial optimization algorithms cannot deal with the problem or need plenty of computing cost. Fortunately, as an effective model in dealing with problems with big data which need huge computation, MapReduce has been widely used in many areas. In this paper, we implement QPSO on MapReduce model and propose MapReduce quantum-behaved particle swarm optimization (MRQPSO which achieves parallel and distributed QPSO. Comparisons are made between MRQPSO and QPSO on some test problems and nonlinear equation systems. The results show that MRQPSO could complete computing task with less time. Meanwhile, from the view of optimization performance, MRQPSO outperforms QPSO in many cases.

Swarm, genetic and evolutionary programming algorithms applied to multiuser detection

Directory of Open Access Journals (Sweden)

Paul Jean Etienne Jeszensky

2005-02-01

Full Text Available In this paper, the particles swarm optimization technique, recently published in the literature, and applied to Direct Sequence/Code Division Multiple Access systems (DS/CDMA with multiuser detection (MuD is analyzed, evaluated and compared. The Swarm algorithm efficiency when applied to the DS-CDMA multiuser detection (Swarm-MuD is compared through the tradeoff performance versus computational complexity, being the complexity expressed in terms of the number of necessary operations in order to reach the performance obtained through the optimum detector or the Maximum Likelihood detector (ML. The comparison is accomplished among the genetic algorithm, evolutionary programming with cloning and Swarm algorithm under the same simulation basis. Additionally, it is proposed an heuristics-MuD complexity analysis through the number of computational operations. Finally, an analysis is carried out for the input parameters of the Swarm algorithm in the attempt to find the optimum parameters (or almost-optimum for the algorithm applied to the MuD problem.

Energy group structure determination using particle swarm optimization

International Nuclear Information System (INIS)

Yi, Ce; Sjoden, Glenn

2013-01-01

Highlights: ► Particle swarm optimization is applied to determine broad group structure. ► A graph representation of the broad group structure problem is introduced. ► The approach is tested on a fuel-pin model. - Abstract: Multi-group theory is widely applied for the energy domain discretization when solving the Linear Boltzmann Equation. To reduce the computational cost, fine group cross libraries are often down-sampled into broad group cross section libraries. Cross section data collapsing generally involves two steps: Firstly, the broad group structure has to be determined; secondly, a weighting scheme is used to evaluate the broad cross section library based on the fine group cross section data and the broad group structure. A common scheme is to average the fine group cross section weighted by the fine group flux. Cross section collapsing techniques have been intensively researched. However, most studies use a pre-determined group structure, open based on experience, to divide the neutron energy spectrum into thermal, epi-thermal, fast, etc. energy range. In this paper, a swarm intelligence algorithm, particle swarm optimization (PSO), is applied to optimize the broad group structure. A graph representation of the broad group structure determination problem is introduced. And the swarm intelligence algorithm is used to solve the graph model. The effectiveness of the approach is demonstrated using a fuel-pin model

A coordination model for ultra-large scale systems of systems

Directory of Open Access Journals (Sweden)

Manuela L. Bujorianu

2013-11-01

Full Text Available The ultra large multi-agent systems are becoming increasingly popular due to quick decay of the individual production costs and the potential of speeding up the solving of complex problems. Examples include nano-robots, or systems of nano-satellites for dangerous meteorite detection, or cultures of stem cells for organ regeneration or nerve repair. The topics associated with these systems are usually dealt within the theories of intelligent swarms or biologically inspired computation systems. Stochastic models play an important role and they are based on various formulations of the mechanical statistics. In these cases, the main assumption is that the swarm elements have a simple behaviour and that some average properties can be deduced for the entire swarm. In contrast, complex systems in areas like aeronautics are formed by elements with sophisticated behaviour, which are even autonomous. In situations like this, a new approach to swarm coordination is necessary. We present a stochastic model where the swarm elements are communicating autonomous systems, the coordination is separated from the component autonomous activity and the entire swarm can be abstracted away as a piecewise deterministic Markov process, which constitutes one of the most popular model in stochastic control. Keywords: ultra large multi-agent systems, system of systems, autonomous systems, stochastic hybrid systems.

Power System Stabilizer Design Based on a Particle Swarm Optimization Multiobjective Function Implemented Under Graphical Interface

Directory of Open Access Journals (Sweden)

Ghouraf Djamel Eddine

2016-05-01

Full Text Available Power system stability considered a necessary condition for normal functioning of an electrical network. The role of regulation and control systems is to ensure that stability by determining the essential elements that influence it. This paper proposes a Particle Swarm Optimization (PSO based multiobjective function to tuning optimal parameters of Power System Stabilizer (PSS; this later is used as auxiliary to generator excitation system in order to damp electro mechanicals oscillations of the rotor and consequently improve Power system stability. The computer simulation results obtained by developed graphical user interface (GUI have proved the efficiency of PSS optimized by a Particle Swarm Optimization, in comparison with a conventional PSS, showing stable   system   responses   almost   insensitive   to   large parameter variations.Our present study was performed using a GUI realized under MATLAB in our work.

Fletcher-Reeves based Particle Swarm Optimization for prediction of molecular structure.

Science.gov (United States)

Agrawal, Shikha; Silakari, Sanjay

2014-04-01

The determination of the most stable conformers of a molecule can be formulated as a global optimization problem. Knowing the stable conformers of a molecule is important because it allows us to understand its properties and behavior based on its structure. The most stable conformation is that involving the global minimum of potential energy. The problem of finding this global minimum is highly complex, and is computationally difficult because of the number of local minima, which grows exponentially with molecular size. In this paper, we propose a hybrid approach combining Particle Swarm Optimization (PSO) and the Fletcher-Reeves algorithm to minimize the potential energy function. The proposed hybrid algorithm is applied to a simplified molecular potential energy function in problems with up to 100 degrees of freedom and also to a realistic potential energy function modeling a pseudoethane molecule. The computational results for both the cases show that the proposed method performs significantly better than the other algorithms. Copyright © 2014 Elsevier Inc. All rights reserved.

A meta-analysis of human-system interfaces in unmanned aerial vehicle (UAV) swarm management.

Science.gov (United States)

Hocraffer, Amy; Nam, Chang S

2017-01-01

A meta-analysis was conducted to systematically evaluate the current state of research on human-system interfaces for users controlling semi-autonomous swarms composed of groups of drones or unmanned aerial vehicles (UAVs). UAV swarms pose several human factors challenges, such as high cognitive demands, non-intuitive behavior, and serious consequences for errors. This article presents findings from a meta-analysis of 27 UAV swarm management papers focused on the human-system interface and human factors concerns, providing an overview of the advantages, challenges, and limitations of current UAV management interfaces, as well as information on how these interfaces are currently evaluated. In general allowing user and mission-specific customization to user interfaces and raising the swarm's level of autonomy to reduce operator cognitive workload are beneficial and improve situation awareness (SA). It is clear more research is needed in this rapidly evolving field. Copyright © 2016 Elsevier Ltd. All rights reserved.

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

Science.gov (United States)

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.

A frozen Gaussian approximation-based multi-level particle swarm optimization for seismic inversion

Energy Technology Data Exchange (ETDEWEB)

Li, Jinglai, E-mail: jinglaili@sjtu.edu.cn [Institute of Natural Sciences, Department of Mathematics, and MOE Key Laboratory of Scientific and Engineering Computing, Shanghai Jiao Tong University, Shanghai 200240 (China); Lin, Guang, E-mail: lin491@purdue.edu [Department of Mathematics, School of Mechanical Engineering, Purdue University, West Lafayette, IN 47907 (United States); Computational Sciences and Mathematics Division, Pacific Northwest National Laboratory, Richland, WA 99352 (United States); Yang, Xu, E-mail: xuyang@math.ucsb.edu [Department of Mathematics, University of California, Santa Barbara, CA 93106 (United States)

2015-09-01

In this paper, we propose a frozen Gaussian approximation (FGA)-based multi-level particle swarm optimization (MLPSO) method for seismic inversion of high-frequency wave data. The method addresses two challenges in it: First, the optimization problem is highly non-convex, which makes hard for gradient-based methods to reach global minima. This is tackled by MLPSO which can escape from undesired local minima. Second, the character of high-frequency of seismic waves requires a large number of grid points in direct computational methods, and thus renders an extremely high computational demand on the simulation of each sample in MLPSO. We overcome this difficulty by three steps: First, we use FGA to compute high-frequency wave propagation based on asymptotic analysis on phase plane; Then we design a constrained full waveform inversion problem to prevent the optimization search getting into regions of velocity where FGA is not accurate; Last, we solve the constrained optimization problem by MLPSO that employs FGA solvers with different fidelity. The performance of the proposed method is demonstrated by a two-dimensional full-waveform inversion example of the smoothed Marmousi model.

Optimal Computing Budget Allocation for Particle Swarm Optimization in Stochastic Optimization.

Science.gov (United States)

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.

Multi-Working Modes Product-Color Planning Based on Evolutionary Algorithms and Swarm Intelligence

Directory of Open Access Journals (Sweden)

Man Ding

2010-01-01

Full Text Available In order to assist designer in color planning during product development, a novel synthesized evaluation method is presented to evaluate color-combination schemes of multi-working modes products (MMPs. The proposed evaluation method considers color-combination images in different working modes as evaluating attributes, to which the corresponding weights are assigned for synthesized evaluation. Then a mathematical model is developed to search for optimal color-combination schemes of MMP based on the proposed evaluation method and two powerful search techniques known as Evolution Algorithms (EAs and Swarm Intelligence (SI. In the experiments, we present a comparative study for two EAs, namely, Genetic Algorithm (GA and Difference Evolution (DE, and one SI algorithm, namely, Particle Swarm Optimization (PSO, on searching for color-combination schemes of MMP problem. All of the algorithms are evaluated against a test scenario, namely, an Arm-type aerial work platform, which has two working modes. The results show that the DE obtains the superior solution than the other two algorithms for color-combination scheme searching problem in terms of optimization accuracy and computation robustness. Simulation results demonstrate that the proposed method is feasible and efficient.

Swarm-based wayfinding support in open and distance learning

NARCIS (Netherlands)

Tattersall, Colin; Manderveld, Jocelyn; Van den Berg, Bert; Van Es, René; Janssen, José; Koper, Rob

2005-01-01

Please refer to the original source: Tattersall, C. Manderveld, J., Van den Berg, B., Van Es, R., Janssen, J., & Koper, R. (2005). Swarm-based wayfinding support in open and distance learning. In Alkhalifa, E.M. (Ed). Cognitively Informed Systems: Utilizing Practical Approaches to Enrich Information

Controller Design of DFIG Based Wind Turbine by Using Evolutionary Soft Computational Techniques

Directory of Open Access Journals (Sweden)

O. P. Bharti

2017-06-01

Full Text Available This manuscript illustrates the controller design for a doubly fed induction generator based variable speed wind turbine by using a bioinspired scheme. This methodology is based on exploiting two proficient swarm intelligence based evolutionary soft computational procedures. The particle swarm optimization (PSO and bacterial foraging optimization (BFO techniques are employed to design the controller intended for small damping plant of the DFIG. Wind energy overview and DFIG operating principle along with the equivalent circuit model is adequately discussed in this paper. The controller design for DFIG based WECS using PSO and BFO are described comparatively in detail. The responses of the DFIG system regarding terminal voltage, current, active-reactive power, and DC-Link voltage have slightly improved with the evolutionary soft computational procedure. Lastly, the obtained output is equated with a standard technique for performance improvement of DFIG based wind energy conversion system.

A Suboptimal PTS Algorithm Based on Particle Swarm Optimization Technique for PAPR Reduction in OFDM Systems

Directory of Open Access Journals (Sweden)

Ho-Lung Hung

2008-08-01

Full Text Available A suboptimal partial transmit sequence (PTS based on particle swarm optimization (PSO algorithm is presented for the low computation complexity and the reduction of the peak-to-average power ratio (PAPR of an orthogonal frequency division multiplexing (OFDM system. In general, PTS technique can improve the PAPR statistics of an OFDM system. However, it will come with an exhaustive search over all combinations of allowed phase weighting factors and the search complexity increasing exponentially with the number of subblocks. In this paper, we work around potentially computational intractability; the proposed PSO scheme exploits heuristics to search the optimal combination of phase factors with low complexity. Simulation results show that the new technique can effectively reduce the computation complexity and PAPR reduction.

A Suboptimal PTS Algorithm Based on Particle Swarm Optimization Technique for PAPR Reduction in OFDM Systems

Directory of Open Access Journals (Sweden)

Lee Shu-Hong

2008-01-01

Full Text Available Abstract A suboptimal partial transmit sequence (PTS based on particle swarm optimization (PSO algorithm is presented for the low computation complexity and the reduction of the peak-to-average power ratio (PAPR of an orthogonal frequency division multiplexing (OFDM system. In general, PTS technique can improve the PAPR statistics of an OFDM system. However, it will come with an exhaustive search over all combinations of allowed phase weighting factors and the search complexity increasing exponentially with the number of subblocks. In this paper, we work around potentially computational intractability; the proposed PSO scheme exploits heuristics to search the optimal combination of phase factors with low complexity. Simulation results show that the new technique can effectively reduce the computation complexity and PAPR reduction.

TOWARD HIGHLY SECURE AND AUTONOMIC COMPUTING SYSTEMS: A HIERARCHICAL APPROACH

Energy Technology Data Exchange (ETDEWEB)

Lee, Hsien-Hsin S

2010-05-11

The overall objective of this research project is to develop novel architectural techniques as well as system software to achieve a highly secure and intrusion-tolerant computing system. Such system will be autonomous, self-adapting, introspective, with self-healing capability under the circumstances of improper operations, abnormal workloads, and malicious attacks. The scope of this research includes: (1) System-wide, unified introspection techniques for autonomic systems, (2) Secure information-flow microarchitecture, (3) Memory-centric security architecture, (4) Authentication control and its implication to security, (5) Digital right management, (5) Microarchitectural denial-of-service attacks on shared resources. During the period of the project, we developed several architectural techniques and system software for achieving a robust, secure, and reliable computing system toward our goal.

Adaptive Fuzzy-Lyapunov Controller Using Biologically Inspired Swarm Intelligence

Directory of Open Access Journals (Sweden)

Alejandro Carrasco Elizalde

2008-01-01

Full Text Available The collective behaviour of swarms produces smarter actions than those achieved by a single individual. Colonies of ants, flocks of birds and fish schools are examples of swarms interacting with their environment to achieve a common goal. This cooperative biological intelligence is the inspiration for an adaptive fuzzy controller developed in this paper. Swarm intelligence is used to adjust the parameters of the membership functions used in the adaptive fuzzy controller. The rules of the controller are designed using a computing-with-words approach called Fuzzy-Lyapunov synthesis to improve the stability and robustness of an adaptive fuzzy controller. Computing-with-words provides a powerful tool to manipulate numbers and symbols, like words in a natural language.

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

Science.gov (United States)

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.

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

Directory of Open Access Journals (Sweden)

Shuqiang Huang

2017-01-01

Full Text Available 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.

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

Science.gov (United States)

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

Adaptive Gradient Multiobjective Particle Swarm Optimization.

Science.gov (United States)

Han, Honggui; Lu, Wei; Zhang, Lu; Qiao, Junfei

2017-10-09

An adaptive gradient multiobjective particle swarm optimization (AGMOPSO) algorithm, based on a multiobjective gradient (stocktickerMOG) method and a self-adaptive flight parameters mechanism, is developed to improve the computation performance in this paper. In this AGMOPSO algorithm, the stocktickerMOG method is devised to update the archive to improve the convergence speed and the local exploitation in the evolutionary process. Meanwhile, the self-adaptive flight parameters mechanism, according to the diversity information of the particles, is then established to balance the convergence and diversity of AGMOPSO. Attributed to the stocktickerMOG method and the self-adaptive flight parameters mechanism, this AGMOPSO algorithm not only has faster convergence speed and higher accuracy, but also its solutions have better diversity. Additionally, the convergence is discussed to confirm the prerequisite of any successful application of AGMOPSO. Finally, with regard to the computation performance, the proposed AGMOPSO algorithm is compared with some other multiobjective particle swarm optimization algorithms and two state-of-the-art multiobjective algorithms. The results demonstrate that the proposed AGMOPSO algorithm can find better spread of solutions and have faster convergence to the true Pareto-optimal front.

A quantum particle swarm optimizer with chaotic mutation operator

International Nuclear Information System (INIS)

Coelho, Leandro dos Santos

2008-01-01

Particle swarm optimization (PSO) is a population-based swarm intelligence algorithm that shares many similarities with evolutionary computation techniques. However, the PSO is driven by the simulation of a social psychological metaphor motivated by collective behaviors of bird and other social organisms instead of the survival of the fittest individual. Inspired by the classical PSO method and quantum mechanics theories, this work presents a novel Quantum-behaved PSO (QPSO) using chaotic mutation operator. The application of chaotic sequences based on chaotic Zaslavskii map instead of random sequences in QPSO is a powerful strategy to diversify the QPSO population and improve the QPSO's performance in preventing premature convergence to local minima. The simulation results demonstrate good performance of the QPSO in solving a well-studied continuous optimization problem of mechanical engineering design

An Investigation of the Relationship between College Chinese EFL Students' Autonomous Learning Capacity and Motivation in Using Computer-Assisted Language Learning

Science.gov (United States)

Pu, Minran

2009-01-01

The purpose of the study was to investigate the relationship between college EFL students' autonomous learning capacity and motivation in using web-based Computer-Assisted Language Learning (CALL) in China. This study included three questionnaires: the student background questionnaire, the questionnaire on student autonomous learning capacity, and…

Particle Swarm Optimization with Double Learning Patterns.

Science.gov (United States)

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.

Particle Swarm Optimization with Double Learning Patterns

Science.gov (United States)

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

A minimal model of predator-swarm interactions.

Science.gov (United States)

Chen, Yuxin; Kolokolnikov, Theodore

2014-05-06

We propose a minimal model of predator-swarm interactions which captures many of the essential dynamics observed in nature. Different outcomes are observed depending on the predator strength. For a 'weak' predator, the swarm is able to escape the predator completely. As the strength is increased, the predator is able to catch up with the swarm as a whole, but the individual prey is able to escape by 'confusing' the predator: the prey forms a ring with the predator at the centre. For higher predator strength, complex chasing dynamics are observed which can become chaotic. For even higher strength, the predator is able to successfully capture the prey. Our model is simple enough to be amenable to a full mathematical analysis, which is used to predict the shape of the swarm as well as the resulting predator-prey dynamics as a function of model parameters. We show that, as the predator strength is increased, there is a transition (owing to a Hopf bifurcation) from confusion state to chasing dynamics, and we compute the threshold analytically. Our analysis indicates that the swarming behaviour is not helpful in avoiding the predator, suggesting that there are other reasons why the species may swarm. The complex shape of the swarm in our model during the chasing dynamics is similar to the shape of a flock of sheep avoiding a shepherd.

Adaptively detecting changes in Autonomic Grid Computing

KAUST Repository

Zhang, Xiangliang

2010-10-01

Detecting the changes is the common issue in many application fields due to the non-stationary distribution of the applicative data, e.g., sensor network signals, web logs and gridrunning logs. Toward Autonomic Grid Computing, adaptively detecting the changes in a grid system can help to alarm the anomalies, clean the noises, and report the new patterns. In this paper, we proposed an approach of self-adaptive change detection based on the Page-Hinkley statistic test. It handles the non-stationary distribution without the assumption of data distribution and the empirical setting of parameters. We validate the approach on the EGEE streaming jobs, and report its better performance on achieving higher accuracy comparing to the other change detection methods. Meanwhile this change detection process could help to discover the device fault which was not claimed in the system logs. © 2010 IEEE.

Autonomous power networks based power system

International Nuclear Information System (INIS)

Jokic, A.; Van den Bosch, P.P.J.

2006-01-01

This paper presented the concept of autonomous networks to cope with this increased complexity in power systems while enhancing market-based operation. The operation of future power systems will be more challenging and demanding than present systems because of increased uncertainties, less inertia in the system, replacement of centralized coordinating activities by decentralized parties and the reliance on dynamic markets for both power balancing and system reliability. An autonomous network includes the aggregation of networked producers and consumers in a relatively small area with respect to the overall system. The operation of an autonomous network is coordinated and controlled with one central unit acting as an interface between internal producers/consumers and the rest of the power system. In this study, the power balance problem and system reliability through provision of ancillary services was formulated as an optimization problem for the overall autonomous networks based power system. This paper described the simulation of an optimal autonomous network dispatching in day ahead markets, based on predicted spot prices for real power, and two ancillary services. It was concluded that large changes occur in a power systems structure and operation, most of them adding to the uncertainty and complexity of the system. The introduced concept of an autonomous power network-based power system was shown to be a realistic and consistent approach to formulate and operate a market-based dispatch of both power and ancillary services. 9 refs., 4 figs

Multispecies Coevolution Particle Swarm Optimization Based on Previous Search History

Directory of Open Access Journals (Sweden)

Danping Wang

2017-01-01

Full Text Available A hybrid coevolution particle swarm optimization algorithm with dynamic multispecies strategy based on K-means clustering and nonrevisit strategy based on Binary Space Partitioning fitness tree (called MCPSO-PSH is proposed. Previous search history memorized into the Binary Space Partitioning fitness tree can effectively restrain the individuals’ revisit phenomenon. The whole population is partitioned into several subspecies and cooperative coevolution is realized by an information communication mechanism between subspecies, which can enhance the global search ability of particles and avoid premature convergence to local optimum. To demonstrate the power of the method, comparisons between the proposed algorithm and state-of-the-art algorithms are grouped into two categories: 10 basic benchmark functions (10-dimensional and 30-dimensional, 10 CEC2005 benchmark functions (30-dimensional, and a real-world problem (multilevel image segmentation problems. Experimental results show that MCPSO-PSH displays a competitive performance compared to the other swarm-based or evolutionary algorithms in terms of solution accuracy and statistical tests.

Heterogeneous architecture to process swarm optimization algorithms

Directory of Open Access Journals (Sweden)

Maria A. Dávila-Guzmán

2014-01-01

Full Text Available Since few years ago, the parallel processing has been embedded in personal computers by including co-processing units as the graphics processing units resulting in a heterogeneous platform. This paper presents the implementation of swarm algorithms on this platform to solve several functions from optimization problems, where they highlight their inherent parallel processing and distributed control features. In the swarm algorithms, each individual and dimension problem are parallelized by the granularity of the processing system which also offer low communication latency between individuals through the embedded processing. To evaluate the potential of swarm algorithms on graphics processing units we have implemented two of them: the particle swarm optimization algorithm and the bacterial foraging optimization algorithm. The algorithms’ performance is measured using the acceleration where they are contrasted between a typical sequential processing platform and the NVIDIA GeForce GTX480 heterogeneous platform; the results show that the particle swarm algorithm obtained up to 36.82x and the bacterial foraging swarm algorithm obtained up to 9.26x. Finally, the effect to increase the size of the population is evaluated where we show both the dispersion and the quality of the solutions are decreased despite of high acceleration performance since the initial distribution of the individuals can converge to local optimal solution.

Swarms, swarming and entanglements of fungal hyphae and of plant roots

Science.gov (United States)

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

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

Science.gov (United States)

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.

Particle swarm optimization based support vector machine for damage level prediction of non-reshaped berm breakwater

Digital Repository Service at National Institute of Oceanography (India)

Harish, N.; Mandal, S.; Rao, S.; Patil, S.G.

breakwater. Soft computing tools like Artificial Neural Network, Fuzzy Logic, Support Vector Machine (SVM), etc, are successfully used to solve complex problems. In the present study, SVM and hybrid of Particle Swarm Optimization (PSO) with SVM (PSO...

Global Optimization Based on the Hybridization of Harmony Search and Particle Swarm Optimization Methods

Directory of Open Access Journals (Sweden)

A. P. Karpenko

2014-01-01

Full Text Available We consider a class of stochastic search algorithms of global optimization which in various publications are called behavioural, intellectual, metaheuristic, inspired by the nature, swarm, multi-agent, population, etc. We use the last term.Experience in using the population algorithms to solve challenges of global optimization shows that application of one such algorithm may not always effective. Therefore now great attention is paid to hybridization of population algorithms of global optimization. Hybrid algorithms unite various algorithms or identical algorithms, but with various values of free parameters. Thus efficiency of one algorithm can compensate weakness of another.The purposes of the work are development of hybrid algorithm of global optimization based on known algorithms of harmony search (HS and swarm of particles (PSO, software implementation of algorithm, study of its efficiency using a number of known benchmark problems, and a problem of dimensional optimization of truss structure.We set a problem of global optimization, consider basic algorithms of HS and PSO, give a flow chart of the offered hybrid algorithm called PSO HS , present results of computing experiments with developed algorithm and software, formulate main results of work and prospects of its development.

Discrete ternary particle swarm optimization for area optimization of MPRM circuits

International Nuclear Information System (INIS)

Yu Haizhen; Wang Pengjun; Wang Disheng; Zhang Huihong

2013-01-01

Having the advantage of simplicity, robustness and low computational costs, the particle swarm optimization (PSO) algorithm is a powerful evolutionary computation tool for synthesis and optimization of Reed-Muller logic based circuits. Exploring discrete PSO and probabilistic transition rules, the discrete ternary particle swarm optimization (DTPSO) is proposed for mixed polarity Reed-Muller (MPRM) circuits. According to the characteristics of mixed polarity OR/XNOR expression, a tabular technique is improved, and it is applied in the polarity conversion of MPRM functions. DTPSO is introduced to search the best polarity for an area of MPRM circuits by building parameter mapping relationships between particles and polarities. The computational results show that the proposed DTPSO outperforms the reported method using maxterm conversion starting from POS Boolean functions. The average saving in the number of terms is about 11.5%; the algorithm is quite efficient in terms of CPU time and achieves 12.2% improvement on average. (semiconductor integrated circuits)

Swarm robotics and complex behaviour of continuum material

Science.gov (United States)

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.

Improved Quantum Particle Swarm Optimization for Mangroves Classification

Directory of Open Access Journals (Sweden)

Zhehuang Huang

2016-01-01

Full Text Available Quantum particle swarm optimization (QPSO is a population based optimization algorithm inspired by social behavior of bird flocking which combines the ideas of quantum computing. For many optimization problems, traditional QPSO algorithm can produce high-quality solution within a reasonable computation time and relatively stable convergence characteristics. But QPSO algorithm also showed some unsatisfactory issues in practical applications, such as premature convergence and poor ability in global optimization. To solve these problems, an improved quantum particle swarm optimization algorithm is proposed and implemented in this paper. There are three main works in this paper. Firstly, an improved QPSO algorithm is introduced which can enhance decision making ability of the model. Secondly, we introduce synergetic neural network model to mangroves classification for the first time which can better handle fuzzy matching of remote sensing image. Finally, the improved QPSO algorithm is used to realize the optimization of network parameter. The experiments on mangroves classification showed that the improved algorithm has more powerful global exploration ability and faster convergence speed.

Image de-noising based on mathematical morphology and multi-objective particle swarm optimization

Science.gov (United States)

Dou, Liyun; Xu, Dan; Chen, Hao; Liu, Yicheng

2017-07-01

To overcome the problem of image de-noising, an efficient image de-noising approach based on mathematical morphology and multi-objective particle swarm optimization (MOPSO) is proposed in this paper. Firstly, constructing a series and parallel compound morphology filter based on open-close (OC) operation and selecting a structural element with different sizes try best to eliminate all noise in a series link. Then, combining multi-objective particle swarm optimization (MOPSO) to solve the parameters setting of multiple structural element. Simulation result shows that our algorithm can achieve a superior performance compared with some traditional de-noising algorithm.

Dynamics and Controls of Swarms of Femtosatellites

Data.gov (United States)

National Aeronautics and Space Administration — The proposed research activity is focused on the development of fuel and computationally efficient guidance and control algorithms for spacecraft swarms. The...

Particle Swarm Optimization Toolbox

Science.gov (United States)

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

Swarm Intelligence-Based Smart Energy Allocation Strategy for Charging Stations of Plug-In Hybrid Electric Vehicles

Directory of Open Access Journals (Sweden)

Imran Rahman

2015-01-01

Full Text Available Recent researches towards the use of green technologies to reduce pollution and higher penetration of renewable energy sources in the transportation sector have been gaining popularity. In this wake, extensive participation of plug-in hybrid electric vehicles (PHEVs requires adequate charging allocation strategy using a combination of smart grid systems and smart charging infrastructures. Daytime charging stations will be needed for daily usage of PHEVs due to the limited all-electric range. Intelligent energy management is an important issue which has already drawn much attention of researchers. Most of these works require formulation of mathematical models with extensive use of computational intelligence-based optimization techniques to solve many technical problems. In this paper, gravitational search algorithm (GSA has been applied and compared with another member of swarm family, particle swarm optimization (PSO, considering constraints such as energy price, remaining battery capacity, and remaining charging time. Simulation results obtained for maximizing the highly nonlinear objective function evaluate the performance of both techniques in terms of best fitness.

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

Science.gov (United States)

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.

Chaotic particle swarm optimization with mutation for classification.

Science.gov (United States)

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.

Chaotic Particle Swarm Optimization with Mutation for Classification

Science.gov (United States)

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

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

Science.gov (United States)

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.

Autonomous Driver Based on an Intelligent System of Decision-Making.

Science.gov (United States)

Czubenko, Michał; Kowalczuk, Zdzisław; Ordys, Andrew

The paper presents and discusses a system ( xDriver ) which uses an Intelligent System of Decision-making (ISD) for the task of car driving. The principal subject is the implementation, simulation and testing of the ISD system described earlier in our publications (Kowalczuk and Czubenko in artificial intelligence and soft computing lecture notes in computer science, lecture notes in artificial intelligence, Springer, Berlin, 2010, 2010, In Int J Appl Math Comput Sci 21(4):621-635, 2011, In Pomiary Autom Robot 2(17):60-5, 2013) for the task of autonomous driving. The design of the whole ISD system is a result of a thorough modelling of human psychology based on an extensive literature study. Concepts somehow similar to the ISD system can be found in the literature (Muhlestein in Cognit Comput 5(1):99-105, 2012; Wiggins in Cognit Comput 4(3):306-319, 2012), but there are no reports of a system which would model the human psychology for the purpose of autonomously driving a car. The paper describes assumptions for simulation, the set of needs and reactions (characterizing the ISD system), the road model and the vehicle model, as well as presents some results of simulation. It proves that the xDriver system may behave on the road as a very inexperienced driver.

Improved quantum-behaved particle swarm optimization with local search strategy

Directory of Open Access Journals (Sweden)

Maolong Xi

2017-03-01

Full Text Available Quantum-behaved particle swarm optimization, which was motivated by analysis of particle swarm optimization and quantum system, has shown compared performance in finding the optimal solutions for many optimization problems to other evolutionary algorithms. To address the problem of premature, a local search strategy is proposed to improve the performance of quantum-behaved particle swarm optimization. In proposed local search strategy, a super particle is presented which is a collection body of randomly selected particles’ dimension information in the swarm. The selected probability of particles in swarm is different and determined by their fitness values. To minimization problems, the fitness value of one particle is smaller; the selected probability is more and will contribute more information in constructing the super particle. In addition, in order to investigate the influence on algorithm performance with different local search space, four methods of computing the local search radius are applied in local search strategy and propose four variants of local search quantum-behaved particle swarm optimization. Empirical studies on a suite of well-known benchmark functions are undertaken in order to make an overall performance comparison among the proposed methods and other quantum-behaved particle swarm optimization. The simulation results show that the proposed quantum-behaved particle swarm optimization variants have better advantages over the original quantum-behaved particle swarm optimization.

Observatory data and the Swarm mission

DEFF Research Database (Denmark)

Macmillan, S.; Olsen, Nils

2013-01-01

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......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...

Cat swarm optimization based evolutionary framework for multi document summarization

Science.gov (United States)

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.

3D model generation using an airborne swarm

Energy Technology Data Exchange (ETDEWEB)

Clark, R. A.; Punzo, G.; Macdonald, M. [Department of Mechanical and Aerospace Engineering, University of Strathclyde, Glasgow, G1 1XW (United Kingdom); Dobie, G.; MacLeod, C. N.; Summan, R.; Pierce, G. [Centre for Ultrasonic Engineering, University of Strathclyde, Glasgow, G1 1XW (United Kingdom); Bolton, G. [National Nuclear Laboratory Limited, Chadwick House, Warrington Road, Birchwood Park, Warrington, WA3 6AE (United Kingdom)

2015-03-31

Using an artificial kinematic field to provide co-ordination between multiple inspection UAVs, the authors herein demonstrate full 3D modelling capability based on a photogrammetric system. The operation of the system is demonstrated by generating a full 3D surface model of an intermediate level nuclear waste storage drum. Such drums require periodic inspection to ensure that drum distortion or corrosion is carefully monitored. Performing this inspection with multiple airborne platforms enables rapid inspection of structures that are inaccessible to on-surface remote vehicles and are in human-hazardous environments. A three-dimensional surface-meshed model of the target can then be constructed in post-processing through photogrammetry analysis of the visual inspection data. The inspection environment uses a tracking system to precisely monitor the position of each aerial vehicle within the enclosure. The vehicles used are commercially available Parrot AR. Drone quadcopters, controlled through a computer interface connected over an IEEE 802.11n (WiFi) network, implementing a distributed controller for each vehicle. This enables the autonomous and distributed elements of the control scheme to be retained, while alleviating the vehicles of the control algorithm’s computational load. The control scheme relies on a kinematic field defined with the target at its centre. This field defines the trajectory for all the drones in the volume relative to the central target, enabling the drones to circle the target at a set radius while avoiding drone collisions. This function enables complete coverage along the height of the object, which is assured by transitioning to another inspection band only after completing circumferential coverage. Using a swarm of vehicles, the time until complete coverage can be significantly reduced.

3D model generation using an airborne swarm

International Nuclear Information System (INIS)

Clark, R. A.; Punzo, G.; Macdonald, M.; Dobie, G.; MacLeod, C. N.; Summan, R.; Pierce, G.; Bolton, G.

2015-01-01

Using an artificial kinematic field to provide co-ordination between multiple inspection UAVs, the authors herein demonstrate full 3D modelling capability based on a photogrammetric system. The operation of the system is demonstrated by generating a full 3D surface model of an intermediate level nuclear waste storage drum. Such drums require periodic inspection to ensure that drum distortion or corrosion is carefully monitored. Performing this inspection with multiple airborne platforms enables rapid inspection of structures that are inaccessible to on-surface remote vehicles and are in human-hazardous environments. A three-dimensional surface-meshed model of the target can then be constructed in post-processing through photogrammetry analysis of the visual inspection data. The inspection environment uses a tracking system to precisely monitor the position of each aerial vehicle within the enclosure. The vehicles used are commercially available Parrot AR. Drone quadcopters, controlled through a computer interface connected over an IEEE 802.11n (WiFi) network, implementing a distributed controller for each vehicle. This enables the autonomous and distributed elements of the control scheme to be retained, while alleviating the vehicles of the control algorithm’s computational load. The control scheme relies on a kinematic field defined with the target at its centre. This field defines the trajectory for all the drones in the volume relative to the central target, enabling the drones to circle the target at a set radius while avoiding drone collisions. This function enables complete coverage along the height of the object, which is assured by transitioning to another inspection band only after completing circumferential coverage. Using a swarm of vehicles, the time until complete coverage can be significantly reduced

A parallel competitive Particle Swarm Optimization for non-linear first arrival traveltime tomography and uncertainty quantification

Science.gov (United States)

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.

Improved particle swarm optimization combined with chaos

International Nuclear Information System (INIS)

Liu Bo; Wang Ling; Jin Yihui; Tang Fang; Huang Dexian

2005-01-01

As a novel optimization technique, chaos has gained much attention and some applications during the past decade. For a given energy or cost function, by following chaotic ergodic orbits, a chaotic dynamic system may eventually reach the global optimum or its good approximation with high probability. To enhance the performance of particle swarm optimization (PSO), which is an evolutionary computation technique through individual improvement plus population cooperation and competition, hybrid particle swarm optimization algorithm is proposed by incorporating chaos. Firstly, adaptive inertia weight factor (AIWF) is introduced in PSO to efficiently balance the exploration and exploitation abilities. Secondly, PSO with AIWF and chaos are hybridized to form a chaotic PSO (CPSO), which reasonably combines the population-based evolutionary searching ability of PSO and chaotic searching behavior. Simulation results and comparisons with the standard PSO and several meta-heuristics show that the CPSO can effectively enhance the searching efficiency and greatly improve the searching quality

An immune-inspired swarm aggregation algorithm for self-healing swarm robotic systems.

Science.gov (United States)

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.

Autonomic Modulation in Duchenne Muscular Dystrophy during a Computer Task: A Prospective Control Trial.

Directory of Open Access Journals (Sweden)

Mayra Priscila Boscolo Alvarez

Full Text Available Duchenne Muscular Dystrophy (DMD is characterized by progressive muscle weakness that can lead to disability. Owing to functional difficulties faced by individuals with DMD, the use of assistive technology is essential to provide or facilitate functional abilities. In DMD, cardiac autonomic dysfunction has been reported in addition to musculoskeletal impairment. Consequently, the objective was to investigate acute cardiac autonomic responses, by Heart Rate Variability (HRV, during computer tasks in subjects with DMD.HRV was assessed by linear and nonlinear methods, using the heart rate monitor Polar RS800CX chest strap Electrocardiographic measuring device. Then, 45 subjects were included in the group with DMD and 45 in the healthy Typical Development (TD control group. They were assessed for twenty minutes at rest sitting, and five minutes after undergoing a task on the computer.Individuals with DMD had a statistically significant lower parasympathetic cardiac modulation at rest when compared to the control group, which further declined when undergoing the tasks on the computer.DMD patients presented decreased HRV and exhibited greater intensity of cardiac autonomic responses during computer tasks characterized by vagal withdrawal when compared to the healthy TD control subjects.

ALI (Autonomous Lunar Investigator): Revolutionary Approach to Exploring the Moon with Addressable Reconfigurable Technology

Science.gov (United States)

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

2005-01-01

Addressable Reconfigurable Technology (ART) based structures: Mission Concepts based on Addressable Reconfigurable Technology (ART), originally studied for future ANTS (Autonomous Nanotechnology Swarm) Space Architectures, are now being developed as rovers for nearer term use in lunar and planetary surface exploration. The architecture is based on the reconfigurable tetrahedron as a building block. Tetrahedra are combined to form space-filling networks, shaped for the required function. Basic structural components are highly modular, addressable arrays of robust nodes (tetrahedral apices) from which highly reconfigurable struts (tetrahedral edges), acting as supports or tethers, are efficiently reversibly deployed/stowed, transforming and reshaping the structures as required.

OPTIMIZED PARTICLE SWARM OPTIMIZATION BASED DEADLINE CONSTRAINED TASK SCHEDULING IN HYBRID CLOUD

Directory of Open Access Journals (Sweden)

Dhananjay Kumar

2016-01-01

Full Text Available Cloud Computing is a dominant way of sharing of computing resources that can be configured and provisioned easily. Task scheduling in Hybrid cloud is a challenge as it suffers from producing the best QoS (Quality of Service when there is a high demand. In this paper a new resource allocation algorithm, to find the best External Cloud provider when the intermediate provider’s resources aren’t enough to satisfy the customer’s demand is proposed. The proposed algorithm called Optimized Particle Swarm Optimization (OPSO combines the two metaheuristic algorithms namely Particle Swarm Optimization and Ant Colony Optimization (ACO. These metaheuristic algorithms are used for the purpose of optimization in the search space of the required solution, to find the best resource from the pool of resources and to obtain maximum profit even when the number of tasks submitted for execution is very high. This optimization is performed to allocate job requests to internal and external cloud providers to obtain maximum profit. It helps to improve the system performance by improving the CPU utilization, and handle multiple requests at the same time. The simulation result shows that an OPSO yields 0.1% - 5% profit to the intermediate cloud provider compared with standard PSO and ACO algorithms and it also increases the CPU utilization by 0.1%.

Global volcanic earthquake swarm database and preliminary analysis of volcanic earthquake swarm duration

Directory of Open Access Journals (Sweden)

S. R. McNutt

1996-06-01

Full Text Available Global data from 1979 to 1989 pertaining to volcanic earthquake swarms have been compiled into a custom-designed relational database. The database is composed of three sections: 1 a section containing general information on volcanoes, 2 a section containing earthquake swarm data (such as dates of swarm occurrence and durations, and 3 a section containing eruption information. The most abundant and reliable parameter, duration of volcanic earthquake swarms, was chosen for preliminary analysis. The distribution of all swarm durations was found to have a geometric mean of 5.5 days. Precursory swarms were then separated from those not associated with eruptions. The geometric mean precursory swarm duration was 8 days whereas the geometric mean duration of swarms not associated with eruptive activity was 3.5 days. Two groups of precursory swarms are apparent when duration is compared with the eruption repose time. Swarms with durations shorter than 4 months showed no clear relationship with the eruption repose time. However, the second group, lasting longer than 4 months, showed a significant positive correlation with the log10 of the eruption repose period. The two groups suggest that different suites of physical processes are involved in the generation of volcanic earthquake swarms.

Vision Based Autonomous Robotic Control for Advanced Inspection and Repair

Science.gov (United States)

Wehner, Walter S.

2014-01-01

The advanced inspection system is an autonomous control and analysis system that improves the inspection and remediation operations for ground and surface systems. It uses optical imaging technology with intelligent computer vision algorithms to analyze physical features of the real-world environment to make decisions and learn from experience. The advanced inspection system plans to control a robotic manipulator arm, an unmanned ground vehicle and cameras remotely, automatically and autonomously. There are many computer vision, image processing and machine learning techniques available as open source for using vision as a sensory feedback in decision-making and autonomous robotic movement. My responsibilities for the advanced inspection system are to create a software architecture that integrates and provides a framework for all the different subsystem components; identify open-source algorithms and techniques; and integrate robot hardware.

Glowworm swarm optimization theory, algorithms, and applications

CERN Document Server

Kaipa, Krishnanand N

2017-01-01

This book provides a comprehensive account of the glowworm swarm optimization (GSO) algorithm, including details of the underlying ideas, theoretical foundations, algorithm development, various applications, and MATLAB programs for the basic GSO algorithm. It also discusses several research problems at different levels of sophistication that can be attempted by interested researchers. The generality of the GSO algorithm is evident in its application to diverse problems ranging from optimization to robotics. Examples include computation of multiple optima, annual crop planning, cooperative exploration, distributed search, multiple source localization, contaminant boundary mapping, wireless sensor networks, clustering, knapsack, numerical integration, solving fixed point equations, solving systems of nonlinear equations, and engineering design optimization. The book is a valuable resource for researchers as well as graduate and undergraduate students in the area of swarm intelligence and computational intellige...

A Chaotic Particle Swarm Optimization-Based Heuristic for Market-Oriented Task-Level Scheduling in Cloud Workflow Systems.

Science.gov (United States)

Li, Xuejun; Xu, Jia; Yang, Yun

2015-01-01

Cloud workflow system is a kind of platform service based on cloud computing. It facilitates the automation of workflow applications. Between cloud workflow system and its counterparts, market-oriented business model is one of the most prominent factors. The optimization of task-level scheduling in cloud workflow system is a hot topic. As the scheduling is a NP problem, Ant Colony Optimization (ACO) and Particle Swarm Optimization (PSO) have been proposed to optimize the cost. However, they have the characteristic of premature convergence in optimization process and therefore cannot effectively reduce the cost. To solve these problems, Chaotic Particle Swarm Optimization (CPSO) algorithm with chaotic sequence and adaptive inertia weight factor is applied to present the task-level scheduling. Chaotic sequence with high randomness improves the diversity of solutions, and its regularity assures a good global convergence. Adaptive inertia weight factor depends on the estimate value of cost. It makes the scheduling avoid premature convergence by properly balancing between global and local exploration. The experimental simulation shows that the cost obtained by our scheduling is always lower than the other two representative counterparts.

Evolution of an artificial neural network based autonomous land vehicle controller.

Science.gov (United States)

Baluja, S

1996-01-01

This paper presents an evolutionary method for creating an artificial neural network based autonomous land vehicle controller. The evolved controllers perform better in unseen situations than those trained with an error backpropagation learning algorithm designed for this task. In this paper, an overview of the previous connectionist based approaches to this task is given, and the evolutionary algorithms used in this study are described in detail. Methods for reducing the high computational costs of training artificial neural networks with evolutionary algorithms are explored. Error metrics specific to the task of autonomous vehicle control are introduced; the evolutionary algorithms guided by these error metrics reveal improved performance over those guided by the standard sum-squared error metric. Finally, techniques for integrating evolutionary search and error backpropagation are presented. The evolved networks are designed to control Carnegie Mellon University's NAVLAB vehicles in road following tasks.

Supervised self-organization of homogeneous swarms using ergodic projections of Markov chains.

Science.gov (United States)

Chattopadhyay, Ishanu; Ray, Asok

2009-12-01

This paper formulates a self-organization algorithm to address the problem of global behavior supervision in engineered swarms of arbitrarily large population sizes. The swarms considered in this paper are assumed to be homogeneous collections of independent identical finite-state agents, each of which is modeled by an irreducible finite Markov chain. The proposed algorithm computes the necessary perturbations in the local agents' behavior, which guarantees convergence to the desired observed state of the swarm. The ergodicity property of the swarm, which is induced as a result of the irreducibility of the agent models, implies that while the local behavior of the agents converges to the desired behavior only in the time average, the overall swarm behavior converges to the specification and stays there at all times. A simulation example illustrates the underlying concept.

Transport of Particle Swarms Through Fractures

Science.gov (United States)

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

2011-12-01

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).

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

Science.gov (United States)

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 Novel Consensus-Based Particle Swarm Optimization-Assisted Trust-Tech Methodology for Large-Scale Global Optimization.

Science.gov (United States)

Zhang, Yong-Feng; Chiang, Hsiao-Dong

2017-09-01

A novel three-stage methodology, termed the "consensus-based particle swarm optimization (PSO)-assisted Trust-Tech methodology," to find global optimal solutions for nonlinear optimization problems is presented. It is composed of Trust-Tech methods, consensus-based PSO, and local optimization methods that are integrated to compute a set of high-quality local optimal solutions that can contain the global optimal solution. The proposed methodology compares very favorably with several recently developed PSO algorithms based on a set of small-dimension benchmark optimization problems and 20 large-dimension test functions from the CEC 2010 competition. The analytical basis for the proposed methodology is also provided. Experimental results demonstrate that the proposed methodology can rapidly obtain high-quality optimal solutions that can contain the global optimal solution. The scalability of the proposed methodology is promising.

Feature and Intensity Based Medical Image Registration Using Particle Swarm Optimization.

Science.gov (United States)

Abdel-Basset, Mohamed; Fakhry, Ahmed E; El-Henawy, Ibrahim; Qiu, Tie; Sangaiah, Arun Kumar

2017-11-03

Image registration is an important aspect in medical image analysis, and kinds use in a variety of medical applications. Examples include diagnosis, pre/post surgery guidance, comparing/merging/integrating images from multi-modal like Magnetic Resonance Imaging (MRI), and Computed Tomography (CT). Whether registering images across modalities for a single patient or registering across patients for a single modality, registration is an effective way to combine information from different images into a normalized frame for reference. Registered datasets can be used for providing information relating to the structure, function, and pathology of the organ or individual being imaged. In this paper a hybrid approach for medical images registration has been developed. It employs a modified Mutual Information (MI) as a similarity metric and Particle Swarm Optimization (PSO) method. Computation of mutual information is modified using a weighted linear combination of image intensity and image gradient vector flow (GVF) intensity. In this manner, statistical as well as spatial image information is included into the image registration process. Maximization of the modified mutual information is effected using the versatile Particle Swarm Optimization which is developed easily with adjusted less parameter. The developed approach has been tested and verified successfully on a number of medical image data sets that include images with missing parts, noise contamination, and/or of different modalities (CT, MRI). The registration results indicate the proposed model as accurate and effective, and show the posture contribution in inclusion of both statistical and spatial image data to the developed approach.

Hierarchical Swarm Model: A New Approach to Optimization

Directory of Open Access Journals (Sweden)

Hanning Chen

2010-01-01

Full Text Available This paper presents a novel optimization model called hierarchical swarm optimization (HSO, which simulates the natural hierarchical complex system from where more complex intelligence can emerge for complex problems solving. This proposed model is intended to suggest ways that the performance of HSO-based algorithms on complex optimization problems can be significantly improved. This performance improvement is obtained by constructing the HSO hierarchies, which means that an agent in a higher level swarm can be composed of swarms of other agents from lower level and different swarms of different levels evolve on different spatiotemporal scale. A novel optimization algorithm (named PS2O, based on the HSO model, is instantiated and tested to illustrate the ideas of HSO model clearly. Experiments were conducted on a set of 17 benchmark optimization problems including both continuous and discrete cases. The results demonstrate remarkable performance of the PS2O algorithm on all chosen benchmark functions when compared to several successful swarm intelligence and evolutionary algorithms.

Multi-robot task allocation based on two dimensional artificial fish swarm algorithm

Science.gov (United States)

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.

Novelty-driven Particle Swarm Optimization

DEFF Research Database (Denmark)

Galvao, Diana; Lehman, Joel Anthony; Urbano, Paulo

2015-01-01

Particle Swarm Optimization (PSO) is a well-known population-based optimization algorithm. Most often it is applied to optimize objective-based fitness functions that reward progress towards a desired objective or behavior. As a result, search increasingly focuses on higher-fitness areas. However......, in problems with many local optima, such focus often leads to premature convergence that precludes reaching the intended objective. To remedy this problem in certain types of domains, this paper introduces Novelty-driven Particle Swarm Optimization (NdPSO), which is motivated by the novelty search algorithm...

Fitness Estimation Based Particle Swarm Optimization Algorithm for Layout Design of Truss Structures

Directory of Open Access Journals (Sweden)

Ayang Xiao

2014-01-01

Full Text Available Due to the fact that vastly different variables and constraints are simultaneously considered, truss layout optimization is a typical difficult constrained mixed-integer nonlinear program. Moreover, the computational cost of truss analysis is often quite expensive. In this paper, a novel fitness estimation based particle swarm optimization algorithm with an adaptive penalty function approach (FEPSO-AP is proposed to handle this problem. FEPSO-AP adopts a special fitness estimate strategy to evaluate the similar particles in the current population, with the purpose to reduce the computational cost. Further more, a laconic adaptive penalty function is employed by FEPSO-AP, which can handle multiple constraints effectively by making good use of historical iteration information. Four benchmark examples with fixed topologies and up to 44 design dimensions were studied to verify the generality and efficiency of the proposed algorithm. Numerical results of the present work compared with results of other state-of-the-art hybrid algorithms shown in the literature demonstrate that the convergence rate and the solution quality of FEPSO-AP are essentially competitive.

Smart swarms of bacteria-inspired agents with performance adaptable interactions.

Directory of Open Access Journals (Sweden)

Adi Shklarsh

2011-09-01

Full Text Available Collective navigation and swarming have been studied in animal groups, such as fish schools, bird flocks, bacteria, and slime molds. Computer modeling has shown that collective behavior of simple agents can result from simple interactions between the agents, which include short range repulsion, intermediate range alignment, and long range attraction. Here we study collective navigation of bacteria-inspired smart agents in complex terrains, with adaptive interactions that depend on performance. More specifically, each agent adjusts its interactions with the other agents according to its local environment--by decreasing the peers' influence while navigating in a beneficial direction, and increasing it otherwise. We show that inclusion of such performance dependent adaptable interactions significantly improves the collective swarming performance, leading to highly efficient navigation, especially in complex terrains. Notably, to afford such adaptable interactions, each modeled agent requires only simple computational capabilities with short-term memory, which can easily be implemented in simple swarming robots.

Smart swarms of bacteria-inspired agents with performance adaptable interactions.

Science.gov (United States)

Shklarsh, Adi; Ariel, Gil; Schneidman, Elad; Ben-Jacob, Eshel

2011-09-01

Collective navigation and swarming have been studied in animal groups, such as fish schools, bird flocks, bacteria, and slime molds. Computer modeling has shown that collective behavior of simple agents can result from simple interactions between the agents, which include short range repulsion, intermediate range alignment, and long range attraction. Here we study collective navigation of bacteria-inspired smart agents in complex terrains, with adaptive interactions that depend on performance. More specifically, each agent adjusts its interactions with the other agents according to its local environment--by decreasing the peers' influence while navigating in a beneficial direction, and increasing it otherwise. We show that inclusion of such performance dependent adaptable interactions significantly improves the collective swarming performance, leading to highly efficient navigation, especially in complex terrains. Notably, to afford such adaptable interactions, each modeled agent requires only simple computational capabilities with short-term memory, which can easily be implemented in simple swarming robots.

Computer Vision and Machine Learning for Autonomous Characterization of AM Powder Feedstocks

Science.gov (United States)

DeCost, Brian L.; Jain, Harshvardhan; Rollett, Anthony D.; Holm, Elizabeth A.

2017-03-01

By applying computer vision and machine learning methods, we develop a system to characterize powder feedstock materials for metal additive manufacturing (AM). Feature detection and description algorithms are applied to create a microstructural scale image representation that can be used to cluster, compare, and analyze powder micrographs. When applied to eight commercial feedstock powders, the system classifies powder images into the correct material systems with greater than 95% accuracy. The system also identifies both representative and atypical powder images. These results suggest the possibility of measuring variations in powders as a function of processing history, relating microstructural features of powders to properties relevant to their performance in AM processes, and defining objective material standards based on visual images. A significant advantage of the computer vision approach is that it is autonomous, objective, and repeatable.

Optimization of potential field method parameters through networks for swarm cooperative manipulation tasks

Directory of Open Access Journals (Sweden)

Rocco Furferi

2016-10-01

Full Text Available An interesting current research field related to autonomous robots is mobile manipulation performed by cooperating robots (in terrestrial, aerial and underwater environments. Focusing on the underwater scenario, cooperative manipulation of Intervention-Autonomous Underwater Vehicles (I-AUVs is a complex and difficult application compared with the terrestrial or aerial ones because of many technical issues, such as underwater localization and limited communication. A decentralized approach for cooperative mobile manipulation of I-AUVs based on Artificial Neural Networks (ANNs is proposed in this article. This strategy exploits the potential field method; a multi-layer control structure is developed to manage the coordination of the swarm, the guidance and navigation of I-AUVs and the manipulation task. In the article, this new strategy has been implemented in the simulation environment, simulating the transportation of an object. This object is moved along a desired trajectory in an unknown environment and it is transported by four underwater mobile robots, each one provided with a seven-degrees-of-freedom robotic arm. The simulation results are optimized thanks to the ANNs used for the potentials tuning.

A new ARMAX model based on evolutionary algorithm and particle swarm optimization for short-term load forecasting

International Nuclear Information System (INIS)

Wang, Bo; Tai, Neng-ling; Zhai, Hai-qing; Ye, Jian; Zhu, Jia-dong; Qi, Liang-bo

2008-01-01

In this paper, a new ARMAX model based on evolutionary algorithm and particle swarm optimization for short-term load forecasting is proposed. Auto-regressive (AR) and moving average (MA) with exogenous variables (ARMAX) has been widely applied in the load forecasting area. Because of the nonlinear characteristics of the power system loads, the forecasting function has many local optimal points. The traditional method based on gradient searching may be trapped in local optimal points and lead to high error. While, the hybrid method based on evolutionary algorithm and particle swarm optimization can solve this problem more efficiently than the traditional ways. It takes advantage of evolutionary strategy to speed up the convergence of particle swarm optimization (PSO), and applies the crossover operation of genetic algorithm to enhance the global search ability. The new ARMAX model for short-term load forecasting has been tested based on the load data of Eastern China location market, and the results indicate that the proposed approach has achieved good accuracy. (author)

Foundations of Swarm Intelligence: From Principles to Practice

National Research Council Canada - National Science Library

Fleischer, Mark

2003-01-01

Swarm Intelligence (SI) is a relatively new paradigm being applied in a host of research settings to improve the management and control of large numbers of interacting entities such as communication, computer and sensor...

Biobotic insect swarm based sensor networks for search and rescue

Science.gov (United States)

Bozkurt, Alper; Lobaton, Edgar; Sichitiu, Mihail; Hedrick, Tyson; Latif, Tahmid; Dirafzoon, Alireza; Whitmire, Eric; Verderber, Alexander; Marin, Juan; Xiong, Hong

2014-06-01

The potential benefits of distributed robotics systems in applications requiring situational awareness, such as search-and-rescue in emergency situations, are indisputable. The efficiency of such systems requires robotic agents capable of coping with uncertain and dynamic environmental conditions. For example, after an earthquake, a tremendous effort is spent for days to reach to surviving victims where robotic swarms or other distributed robotic systems might play a great role in achieving this faster. However, current technology falls short of offering centimeter scale mobile agents that can function effectively under such conditions. Insects, the inspiration of many robotic swarms, exhibit an unmatched ability to navigate through such environments while successfully maintaining control and stability. We have benefitted from recent developments in neural engineering and neuromuscular stimulation research to fuse the locomotory advantages of insects with the latest developments in wireless networking technologies to enable biobotic insect agents to function as search-and-rescue agents. Our research efforts towards this goal include development of biobot electronic backpack technologies, establishment of biobot tracking testbeds to evaluate locomotion control efficiency, investigation of biobotic control strategies with Gromphadorhina portentosa cockroaches and Manduca sexta moths, establishment of a localization and communication infrastructure, modeling and controlling collective motion by learning deterministic and stochastic motion models, topological motion modeling based on these models, and the development of a swarm robotic platform to be used as a testbed for our algorithms.

Parallel Global Optimization with the Particle Swarm Algorithm (Preprint)

National Research Council Canada - National Science Library

Schutte, J. F; Reinbolt, J. A; Fregly, B. J; Haftka, R. T; George, A. D

2004-01-01

.... To obtain enhanced computational throughput and global search capability, we detail the coarse-grained parallelization of an increasingly popular global search method, the Particle Swarm Optimization (PSO) algorithm...

Triaxial Accelerometer Error Coefficients Identification with a Novel Artificial Fish Swarm Algorithm

Directory of Open Access Journals (Sweden)

Yanbin Gao

2015-01-01

Full Text Available Artificial fish swarm algorithm (AFSA is one of the state-of-the-art swarm intelligence techniques, which is widely utilized for optimization purposes. Triaxial accelerometer error coefficients are relatively unstable with the environmental disturbances and aging of the instrument. Therefore, identifying triaxial accelerometer error coefficients accurately and being with lower costs are of great importance to improve the overall performance of triaxial accelerometer-based strapdown inertial navigation system (SINS. In this study, a novel artificial fish swarm algorithm (NAFSA that eliminated the demerits (lack of using artificial fishes’ previous experiences, lack of existing balance between exploration and exploitation, and high computational cost of AFSA is introduced at first. In NAFSA, functional behaviors and overall procedure of AFSA have been improved with some parameters variations. Second, a hybrid accelerometer error coefficients identification algorithm has been proposed based on NAFSA and Monte Carlo simulation (MCS approaches. This combination leads to maximum utilization of the involved approaches for triaxial accelerometer error coefficients identification. Furthermore, the NAFSA-identified coefficients are testified with 24-position verification experiment and triaxial accelerometer-based SINS navigation experiment. The priorities of MCS-NAFSA are compared with that of conventional calibration method and optimal AFSA. Finally, both experiments results demonstrate high efficiency of MCS-NAFSA on triaxial accelerometer error coefficients identification.

PARTICLE SWARM OPTIMIZATION BASED OF THE MAXIMUM ...

African Journals Online (AJOL)

2010-06-30

Jun 30, 2010 ... Keywords: Particle Swarm Optimization (PSO), photovoltaic system, MPOP, ... systems from one hand and because of the instantaneous change of ..... Because of the P-V characteristics this heuristic method is used to seek ...

Inverse problem for particle size distributions of atmospheric aerosols using stochastic particle swarm optimization

International Nuclear Information System (INIS)

Yuan Yuan; Yi Hongliang; Shuai Yong; Wang Fuqiang; Tan Heping

2010-01-01

As a part of resolving optical properties in atmosphere radiative transfer calculations, this paper focuses on obtaining aerosol optical thicknesses (AOTs) in the visible and near infrared wave band through indirect method by gleaning the values of aerosol particle size distribution parameters. Although various inverse techniques have been applied to obtain values for these parameters, we choose a stochastic particle swarm optimization (SPSO) algorithm to perform an inverse calculation. Computational performances of different inverse methods are investigated and the influence of swarm size on the inverse problem of computation particles is examined. Next, computational efficiencies of various particle size distributions and the influences of the measured errors on computational accuracy are compared. Finally, we recover particle size distributions for atmospheric aerosols over Beijing using the measured AOT data (at wavelengths λ=0.400, 0.690, 0.870, and 1.020 μm) obtained from AERONET at different times and then calculate other AOT values for this band based on the inverse results. With calculations agreeing with measured data, the SPSO algorithm shows good practicability.

Combinatorial Clustering Algorithm of Quantum-Behaved Particle Swarm Optimization and Cloud Model

Directory of Open Access Journals (Sweden)

Mi-Yuan Shan

2013-01-01

Full Text Available We propose a combinatorial clustering algorithm of cloud model and quantum-behaved particle swarm optimization (COCQPSO to solve the stochastic problem. The algorithm employs a novel probability model as well as a permutation-based local search method. We are setting the parameters of COCQPSO based on the design of experiment. In the comprehensive computational study, we scrutinize the performance of COCQPSO on a set of widely used benchmark instances. By benchmarking combinatorial clustering algorithm with state-of-the-art algorithms, we can show that its performance compares very favorably. The fuzzy combinatorial optimization algorithm of cloud model and quantum-behaved particle swarm optimization (FCOCQPSO in vague sets (IVSs is more expressive than the other fuzzy sets. Finally, numerical examples show the clustering effectiveness of COCQPSO and FCOCQPSO clustering algorithms which are extremely remarkable.

Efficient Scheduling of Scientific Workflows with Energy Reduction Using Novel Discrete Particle Swarm Optimization and Dynamic Voltage Scaling for Computational Grids

Directory of Open Access Journals (Sweden)

M. Christobel

2015-01-01

Full Text Available One of the most significant and the topmost parameters in the real world computing environment is energy. Minimizing energy imposes benefits like reduction in power consumption, decrease in cooling rates of the computing processors, provision of a green environment, and so forth. In fact, computation time and energy are directly proportional to each other and the minimization of computation time may yield a cost effective energy consumption. Proficient scheduling of Bag-of-Tasks in the grid environment ravages in minimum computation time. In this paper, a novel discrete particle swarm optimization (DPSO algorithm based on the particle’s best position (pbDPSO and global best position (gbDPSO is adopted to find the global optimal solution for higher dimensions. This novel DPSO yields better schedule with minimum computation time compared to Earliest Deadline First (EDF and First Come First Serve (FCFS algorithms which comparably reduces energy. Other scheduling parameters, such as job completion ratio and lateness, are also calculated and compared with EDF and FCFS. An energy improvement of up to 28% was obtained when Makespan Conservative Energy Reduction (MCER and Dynamic Voltage Scaling (DVS were used in the proposed DPSO algorithm.

Efficient Scheduling of Scientific Workflows with Energy Reduction Using Novel Discrete Particle Swarm Optimization and Dynamic Voltage Scaling for Computational Grids

Science.gov (United States)

Christobel, M.; Tamil Selvi, S.; Benedict, Shajulin

2015-01-01

One of the most significant and the topmost parameters in the real world computing environment is energy. Minimizing energy imposes benefits like reduction in power consumption, decrease in cooling rates of the computing processors, provision of a green environment, and so forth. In fact, computation time and energy are directly proportional to each other and the minimization of computation time may yield a cost effective energy consumption. Proficient scheduling of Bag-of-Tasks in the grid environment ravages in minimum computation time. In this paper, a novel discrete particle swarm optimization (DPSO) algorithm based on the particle's best position (pbDPSO) and global best position (gbDPSO) is adopted to find the global optimal solution for higher dimensions. This novel DPSO yields better schedule with minimum computation time compared to Earliest Deadline First (EDF) and First Come First Serve (FCFS) algorithms which comparably reduces energy. Other scheduling parameters, such as job completion ratio and lateness, are also calculated and compared with EDF and FCFS. An energy improvement of up to 28% was obtained when Makespan Conservative Energy Reduction (MCER) and Dynamic Voltage Scaling (DVS) were used in the proposed DPSO algorithm. PMID:26075296

A guidance law for UAV autonomous aerial refueling based on the iterative computation method

Directory of Open Access Journals (Sweden)

Luo Delin

2014-08-01

Full Text Available The rendezvous and formation problem is a significant part for the unmanned aerial vehicle (UAV autonomous aerial refueling (AAR technique. It can be divided into two major phases: the long-range guidance phase and the formation phase. In this paper, an iterative computation guidance law (ICGL is proposed to compute a series of state variables to get the solution of a control variable for a UAV conducting rendezvous with a tanker in AAR. The proposed method can make the control variable converge to zero when the tanker and the UAV receiver come to a formation flight eventually. For the long-range guidance phase, the ICGL divides it into two sub-phases: the correction sub-phase and the guidance sub-phase. The two sub-phases share the same iterative process. As for the formation phase, a velocity coordinate system is created by which control accelerations are designed to make the speed of the UAV consistent with that of the tanker. The simulation results demonstrate that the proposed ICGL is effective and robust against wind disturbance.

A Chaotic Particle Swarm Optimization-Based Heuristic for Market-Oriented Task-Level Scheduling in Cloud Workflow Systems

Directory of Open Access Journals (Sweden)

Xuejun Li

2015-01-01

Full Text Available Cloud workflow system is a kind of platform service based on cloud computing. It facilitates the automation of workflow applications. Between cloud workflow system and its counterparts, market-oriented business model is one of the most prominent factors. The optimization of task-level scheduling in cloud workflow system is a hot topic. As the scheduling is a NP problem, Ant Colony Optimization (ACO and Particle Swarm Optimization (PSO have been proposed to optimize the cost. However, they have the characteristic of premature convergence in optimization process and therefore cannot effectively reduce the cost. To solve these problems, Chaotic Particle Swarm Optimization (CPSO algorithm with chaotic sequence and adaptive inertia weight factor is applied to present the task-level scheduling. Chaotic sequence with high randomness improves the diversity of solutions, and its regularity assures a good global convergence. Adaptive inertia weight factor depends on the estimate value of cost. It makes the scheduling avoid premature convergence by properly balancing between global and local exploration. The experimental simulation shows that the cost obtained by our scheduling is always lower than the other two representative counterparts.

Optimization of C4.5 algorithm-based particle swarm optimization for breast cancer diagnosis

Science.gov (United States)

Muslim, M. A.; Rukmana, S. H.; Sugiharti, E.; Prasetiyo, B.; Alimah, S.

2018-03-01

Data mining has become a basic methodology for computational applications in the field of medical domains. Data mining can be applied in the health field such as for diagnosis of breast cancer, heart disease, diabetes and others. Breast cancer is most common in women, with more than one million cases and nearly 600,000 deaths occurring worldwide each year. The most effective way to reduce breast cancer deaths was by early diagnosis. This study aims to determine the level of breast cancer diagnosis. This research data uses Wisconsin Breast Cancer dataset (WBC) from UCI machine learning. The method used in this research is the algorithm C4.5 and Particle Swarm Optimization (PSO) as a feature option and to optimize the algorithm. C4.5. Ten-fold cross-validation is used as a validation method and a confusion matrix. The result of this research is C4.5 algorithm. The particle swarm optimization C4.5 algorithm has increased by 0.88%.

A REVIEW OF SWARMING UNMANNED AERIAL VEHICLES

Directory of Open Access Journals (Sweden)

CORNEA Mihai

2016-11-01

Full Text Available This paper in if fact an overview of state of the art in mobile multi-robot systems as an initial part of our research in implementing a system based on swarm robotics concepts to be used in natural disaster search and rescue missions. The system is to be composed of a group of drones that can detect survivor mobile cell signals and exhibit some other features as well. This paper surveys the swarm robotics research landscape to provide a theoretical background to the implementation and help determine the techniques available to create the system. The Particle swarm optimization (PSO and Glowworm swarm optimization (GSO algorithms are briefly described and there is also insight into Bird flocking behavior and the model behind it

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

Science.gov (United States)

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.

Autonomous sensor manager agents (ASMA)

Science.gov (United States)

Osadciw, Lisa A.

2004-04-01

Autonomous sensor manager agents are presented as an algorithm to perform sensor management within a multisensor fusion network. The design of the hybrid ant system/particle swarm agents is described in detail with some insight into their performance. Although the algorithm is designed for the general sensor management problem, a simulation example involving 2 radar systems is presented. Algorithmic parameters are determined by the size of the region covered by the sensor network, the number of sensors, and the number of parameters to be selected. With straight forward modifications, this algorithm can be adapted for most sensor management problems.

Pressure Prediction of Coal Slurry Transportation Pipeline Based on Particle Swarm Optimization Kernel Function Extreme Learning Machine

Directory of Open Access Journals (Sweden)

Xue-cun Yang

2015-01-01

Full Text Available For coal slurry pipeline blockage prediction problem, through the analysis of actual scene, it is determined that the pressure prediction from each measuring point is the premise of pipeline blockage prediction. Kernel function of support vector machine is introduced into extreme learning machine, the parameters are optimized by particle swarm algorithm, and blockage prediction method based on particle swarm optimization kernel function extreme learning machine (PSOKELM is put forward. The actual test data from HuangLing coal gangue power plant are used for simulation experiments and compared with support vector machine prediction model optimized by particle swarm algorithm (PSOSVM and kernel function extreme learning machine prediction model (KELM. The results prove that mean square error (MSE for the prediction model based on PSOKELM is 0.0038 and the correlation coefficient is 0.9955, which is superior to prediction model based on PSOSVM in speed and accuracy and superior to KELM prediction model in accuracy.

Crop Classification by Forward Neural Network with Adaptive Chaotic Particle Swarm Optimization

Directory of Open Access Journals (Sweden)

Yudong Zhang

2011-05-01

Full Text Available This paper proposes a hybrid crop classifier for polarimetric synthetic aperture radar (SAR images. The feature sets consisted of span image, the H/A/α decomposition, and the gray-level co-occurrence matrix (GLCM based texture features. Then, the features were reduced by principle component analysis (PCA. Finally, a two-hidden-layer forward neural network (NN was constructed and trained by adaptive chaotic particle swarm optimization (ACPSO. K-fold cross validation was employed to enhance generation. The experimental results on Flevoland sites demonstrate the superiority of ACPSO to back-propagation (BP, adaptive BP (ABP, momentum BP (MBP, Particle Swarm Optimization (PSO, and Resilient back-propagation (RPROP methods. Moreover, the computation time for each pixel is only 1.08 × 10−7 s.

The Study on Food Sensory Evaluation based on Particle Swarm Optimization Algorithm

OpenAIRE

Hairong Wang; Huijuan Xu

2015-01-01

In this study, it explores the procedures and methods of the system for establishing food sensory evaluation based on particle swarm optimization algorithm, by means of explaining the interpretation of sensory evaluation and sensory analysis, combined with the applying situation of sensory evaluation in food industry.

Two-Dimensional IIR Filter Design Using Simulated Annealing Based Particle Swarm Optimization

Directory of Open Access Journals (Sweden)

Supriya Dhabal

2014-01-01

Full Text Available We present a novel hybrid algorithm based on particle swarm optimization (PSO and simulated annealing (SA for the design of two-dimensional recursive digital filters. The proposed method, known as SA-PSO, integrates the global search ability of PSO with the local search ability of SA and offsets the weakness of each other. The acceptance criterion of Metropolis is included in the basic algorithm of PSO to increase the swarm’s diversity by accepting sometimes weaker solutions also. The experimental results reveal that the performance of the optimal filter designed by the proposed SA-PSO method is improved. Further, the convergence behavior as well as optimization accuracy of proposed method has been improved significantly and computational time is also reduced. In addition, the proposed SA-PSO method also produces the best optimal solution with lower mean and variance which indicates that the algorithm can be used more efficiently in realizing two-dimensional digital filters.

Swarm v2: highly-scalable and high-resolution amplicon clustering.

Science.gov (United States)

Mahé, Frédéric; Rognes, Torbjørn; Quince, Christopher; de Vargas, Colomban; Dunthorn, Micah

2015-01-01

Previously we presented Swarm v1, a novel and open source amplicon clustering program that produced fine-scale molecular operational taxonomic units (OTUs), free of arbitrary global clustering thresholds and input-order dependency. Swarm v1 worked with an initial phase that used iterative single-linkage with a local clustering threshold (d), followed by a phase that used the internal abundance structures of clusters to break chained OTUs. Here we present Swarm v2, which has two important novel features: (1) a new algorithm for d = 1 that allows the computation time of the program to scale linearly with increasing amounts of data; and (2) the new fastidious option that reduces under-grouping by grafting low abundant OTUs (e.g., singletons and doubletons) onto larger ones. Swarm v2 also directly integrates the clustering and breaking phases, dereplicates sequencing reads with d = 0, outputs OTU representatives in fasta format, and plots individual OTUs as two-dimensional networks.

Swarm v2: highly-scalable and high-resolution amplicon clustering

Directory of Open Access Journals (Sweden)

Frédéric Mahé

2015-12-01

Full Text Available Previously we presented Swarm v1, a novel and open source amplicon clustering program that produced fine-scale molecular operational taxonomic units (OTUs, free of arbitrary global clustering thresholds and input-order dependency. Swarm v1 worked with an initial phase that used iterative single-linkage with a local clustering threshold (d, followed by a phase that used the internal abundance structures of clusters to break chained OTUs. Here we present Swarm v2, which has two important novel features: (1 a new algorithm for d = 1 that allows the computation time of the program to scale linearly with increasing amounts of data; and (2 the new fastidious option that reduces under-grouping by grafting low abundant OTUs (e.g., singletons and doubletons onto larger ones. Swarm v2 also directly integrates the clustering and breaking phases, dereplicates sequencing reads with d = 0, outputs OTU representatives in fasta format, and plots individual OTUs as two-dimensional networks.

Identification of strategy parameters for particle swarm optimizer through Taguchi method

Institute of Scientific and Technical Information of China (English)

KHOSLA Arun; KUMAR Shakti; AGGARWAL K.K.

2006-01-01

Particle swarm optimization (PSO), like other evolutionary algorithms is a population-based stochastic algorithm inspired from the metaphor of social interaction in birds, insects, wasps, etc. It has been used for finding promising solutions in complex search space through the interaction of particles in a swarm. It is a well recognized fact that the performance of evolutionary algorithms to a great extent depends on the choice of appropriate strategy/operating parameters like population size,crossover rate, mutation rate, crossover operator, etc. Generally, these parameters are selected through hit and trial process, which is very unsystematic and requires rigorous experimentation. This paper proposes a systematic based on Taguchi method reasoning scheme for rapidly identifying the strategy parameters for the PSO algorithm. The Taguchi method is a robust design approach using fractional factorial design to study a large number of parameters with small number of experiments. Computer simulations have been performed on two benchmark functions-Rosenbrock function and Griewank function-to validate the approach.

MAGNAS - Magnetic Nanoprobe SWARM

DEFF Research Database (Denmark)

Lubberstedt, H.; Koebel, D.; Hansen, Flemming

2005-01-01

This paper presents the Magnetic Nano-Probe Swarm mission utilising a constellation of several swarms of nano-satellites in order to acquire simultaneous measurements of the geomagnetic field resolving the local field gradients. The space segment comprises of up to 4 S/C swarms each consisting...

Autonomous Cryogenic Load Operations: Knowledge-Based Autonomous Test Engineer

Science.gov (United States)

Schrading, J. Nicolas

2013-01-01

The Knowledge-Based Autonomous Test Engineer (KATE) program has a long history at KSC. Now a part of the Autonomous Cryogenic Load Operations (ACLO) mission, this software system has been sporadically developed over the past 20 years. Originally designed to provide health and status monitoring for a simple water-based fluid system, it was proven to be a capable autonomous test engineer for determining sources of failure in the system. As part of a new goal to provide this same anomaly-detection capability for a complicated cryogenic fluid system, software engineers, physicists, interns and KATE experts are working to upgrade the software capabilities and graphical user interface. Much progress was made during this effort to improve KATE. A display of the entire cryogenic system's graph, with nodes for components and edges for their connections, was added to the KATE software. A searching functionality was added to the new graph display, so that users could easily center their screen on specific components. The GUI was also modified so that it displayed information relevant to the new project goals. In addition, work began on adding new pneumatic and electronic subsystems into the KATE knowledge base, so that it could provide health and status monitoring for those systems. Finally, many fixes for bugs, memory leaks, and memory errors were implemented and the system was moved into a state in which it could be presented to stakeholders. Overall, the KATE system was improved and necessary additional features were added so that a presentation of the program and its functionality in the next few months would be a success.

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

Science.gov (United States)

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.

From organized internal traffic to collective navigation of bacterial swarms

International Nuclear Information System (INIS)

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

2013-01-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. (paper)

Handbook of swarm intelligence concepts, principles and applications

CERN Document Server

Shi, Yuhui; Panigrahi, Bijaya Ketan

2011-01-01

Recent work on the behavior of swarming creatures such as bees posits an innate collective intelligence that gives rise to myriad computational problem-solving techniques. This volume is both an introduction to the topic and a survey of leading-edge research.

Particle Swarm Optimization Based on Local Attractors of Ordinary Differential Equation System

Directory of Open Access Journals (Sweden)

Wenyu Yang

2014-01-01

Full Text Available Particle swarm optimization (PSO is inspired by sociological behavior. In this paper, we interpret PSO as a finite difference scheme for solving a system of stochastic ordinary differential equations (SODE. In this framework, the position points of the swarm converge to an equilibrium point of the SODE and the local attractors, which are easily defined by the present position points, also converge to the global attractor. Inspired by this observation, we propose a class of modified PSO iteration methods (MPSO based on local attractors of the SODE. The idea of MPSO is to choose the next update state near the present local attractor, rather than the present position point as in the original PSO, according to a given probability density function. In particular, the quantum-behaved particle swarm optimization method turns out to be a special case of MPSO by taking a special probability density function. The MPSO methods with six different probability density functions are tested on a few benchmark problems. These MPSO methods behave differently for different problems. Thus, our framework not only gives an interpretation for the ordinary PSO but also, more importantly, provides a warehouse of PSO-like methods to choose from for solving different practical problems.

POLICE OFFICE MODEL IMPROVEMENT FOR SECURITY OF SWARM ROBOTIC SYSTEMS

Directory of Open Access Journals (Sweden)

I. A. Zikratov

2014-09-01

Full Text Available This paper focuses on aspects of information security for group of mobile robotic systems with swarm intellect. The ways for hidden attacks realization by the opposing party on swarm algorithm are discussed. We have fulfilled numerical modeling of potentially destructive information influence on the ant shortest path algorithm. We have demonstrated the consequences of attacks on the ant algorithm with different concentration in a swarm of subversive robots. Approaches are suggested for information security mechanisms in swarm robotic systems, based on the principles of centralized security management for mobile agents. We have developed the method of forming a self-organizing information security management system for robotic agents in swarm groups implementing POM (Police Office Model – a security model based on police offices, to provide information security in multi-agent systems. The method is based on the usage of police station network in the graph nodes, which have functions of identification and authentication of agents, identifying subversive robots by both their formal characteristics and their behavior in the swarm. We have suggested a list of software and hardware components for police stations, consisting of: communication channels between the robots in police office, nodes register, a database of robotic agents, a database of encryption and decryption module. We have suggested the variants of logic for the mechanism of information security in swarm systems with different temporary diagrams of data communication between police stations. We present comparative analysis of implementation of protected swarm systems depending on the functioning logic of police offices, integrated in swarm system. It is shown that the security model saves the ability to operate in noisy environments, when the duration of the interference is comparable to the time necessary for the agent to overcome the path between police stations.

Particle swarm as optimization tool in complex nuclear engineering problems

International Nuclear Information System (INIS)

Medeiros, Jose Antonio Carlos Canedo

2005-06-01

Due to its low computational cost, gradient-based search techniques associated to linear programming techniques are being used as optimization tools. These techniques, however, when applied to multimodal search spaces, can lead to local optima. When finding solutions for complex multimodal domains, random search techniques are being used with great efficacy. In this work we exploit the swarm optimization algorithm search power capacity as an optimization tool for the solution of complex high dimension and multimodal search spaces of nuclear problems. Due to its easy and natural representation of high dimension domains, the particle swarm optimization was applied with success for the solution of complex nuclear problems showing its efficacy in the search of solutions in high dimension and complex multimodal spaces. In one of these applications it enabled a natural and trivial solution in a way not obtained with other methods confirming the validity of its application. (author)

Swarm intelligence based on modified PSO algorithm for the optimization of axial-flow pump impeller

International Nuclear Information System (INIS)

Miao, Fuqing; Kim, Chol Min; Ahn, Seok Young; Park, Hong Seok

2015-01-01

This paper presents a multi-objective optimization of the impeller shape of an axial-flow pump based on the Modified particle swarm optimization (MPSO) algorithm. At first, an impeller shape was designed and used as a reference in the optimization process then NPSHr and η of the axial flow pump were numerically investigated by using the commercial software ANSYS with the design variables concerning hub angle β_h, chord angle β_c, cascade solidity of chord σ_c and maximum thickness of blade H. By using the Group method of data handling (GMDH) type neural networks in commercial software DTREG, the corresponding polynomial representation for NPSHr and η with respect to the design variables were obtained. A benchmark test was employed to evaluate the performance of the MPSO algorithm in comparison with other particle swarm algorithms. Later the MPSO approach was used for Pareto based optimization. Finally, the MPSO optimization result and CFD simulation result were compared in a re-evaluation process. By using swarm intelligence based on the modified PSO algorithm, better performance pump with higher efficiency and lower NPSHr could be obtained. This novel algorithm was successfully applied for the optimization of axial-flow pump impeller shape design

Swarm intelligence based on modified PSO algorithm for the optimization of axial-flow pump impeller

Energy Technology Data Exchange (ETDEWEB)

Miao, Fuqing; Kim, Chol Min; Ahn, Seok Young [Pusan National University, Busan (Korea, Republic of); Park, Hong Seok [Ulsan University, Ulsan (Korea, Republic of)

2015-11-15

This paper presents a multi-objective optimization of the impeller shape of an axial-flow pump based on the Modified particle swarm optimization (MPSO) algorithm. At first, an impeller shape was designed and used as a reference in the optimization process then NPSHr and η of the axial flow pump were numerically investigated by using the commercial software ANSYS with the design variables concerning hub angle β{sub h}, chord angle β{sub c}, cascade solidity of chord σ{sub c} and maximum thickness of blade H. By using the Group method of data handling (GMDH) type neural networks in commercial software DTREG, the corresponding polynomial representation for NPSHr and η with respect to the design variables were obtained. A benchmark test was employed to evaluate the performance of the MPSO algorithm in comparison with other particle swarm algorithms. Later the MPSO approach was used for Pareto based optimization. Finally, the MPSO optimization result and CFD simulation result were compared in a re-evaluation process. By using swarm intelligence based on the modified PSO algorithm, better performance pump with higher efficiency and lower NPSHr could be obtained. This novel algorithm was successfully applied for the optimization of axial-flow pump impeller shape design.

Cooperative Behaviours with Swarm Intelligence in Multirobot Systems for Safety Inspections in Underground Terrains

Directory of Open Access Journals (Sweden)

Chika Yinka-Banjo

2014-01-01

Full Text Available Underground mining operations are carried out in hazardous environments. To prevent disasters from occurring, as often as they do in underground mines, and to prevent safety routine checkers from disasters during safety inspection checks, multirobots are suggested to do the job of safety inspection rather than human beings and single robots. Multirobots are preferred because the inspection task will be done in the minimum amount of time. This paper proposes a cooperative behaviour for a multirobot system (MRS to achieve a preentry safety inspection in underground terrains. A hybrid QLACS swarm intelligent model based on Q-Learning (QL and the Ant Colony System (ACS was proposed to achieve this cooperative behaviour in MRS. The intelligent model was developed by harnessing the strengths of both QL and ACS algorithms. The ACS optimizes the routes used for each robot while the QL algorithm enhances the cooperation between the autonomous robots. A description of a communicating variation within the QLACS model for cooperative behavioural purposes is presented. The performance of the algorithms in terms of without communication, with communication, computation time, path costs, and the number of robots used was evaluated by using a simulation approach. Simulation results show achieved cooperative behaviour between robots.

The Inertia Weight Updating Strategies in Particle Swarm Optimisation Based on the Beta Distribution

Directory of Open Access Journals (Sweden)

Petr Maca

2015-01-01

Full Text Available The presented paper deals with the comparison of selected random updating strategies of inertia weight in particle swarm optimisation. Six versions of particle swarm optimization were analysed on 28 benchmark functions, prepared for the Special Session on Real-Parameter Single Objective Optimisation at CEC2013. The random components of tested inertia weight were generated from Beta distribution with different values of shape parameters. The best analysed PSO version is the multiswarm PSO, which combines two strategies of updating the inertia weight. The first is driven by the temporally varying shape parameters, while the second is based on random control of shape parameters of Beta distribution.

Swarm robotics and minimalism

Science.gov (United States)

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.

Investigating Ground Swarm Robotics Using Agent Based Simulation

National Research Council Canada - National Science Library

Ho, Sze-Tek T

2006-01-01

The concept of employing ground swarm robotics to accomplish tasks has been proposed for future use in humanitarian de-mining, plume monitoring, searching for survivors in a disaster site, and other hazardous activities...

Modeling dynamic swarms

KAUST Repository

Ghanem, Bernard; Ahuja, Narendra

2013-01-01

This paper proposes the problem of modeling video sequences of dynamic swarms (DSs). We define a DS as a large layout of stochastically repetitive spatial configurations of dynamic objects (swarm elements) whose motions exhibit local spatiotemporal

SWARMS Early Trials Management for The SWARMs ECSEL-H2020 Project

Science.gov (United States)

Alcaraz, Daniel; Morales, Tania; Castro, Ayoze; Barrera, Carlos; Hernández, Joaquín; Llinás, Octavio

2017-04-01

The work presented on this paper is aimed to explain how the Early Trials of the Project SWARMS were managed in order to complete the first field demonstrations on real environment. SWARMs aims to reduce the operational cost in the use of maritime robots and vehicles, in order to increase the safety of tasks and reduce profesional divers risks. This will be achieved enabling the AUVs/ROVs to work in a cooperative mesh. The challenge is to design and develop an integrated platform (a set of Software/Hardware components), incorporated into the current generation of underwater vehicles in order to improve autonomy, cooperation, robustness, cost-effectiveness, and reliability of the offshore operations. The first demonstration of the project has been performed at PLOCAN (The Oceanic Platform of the Canary Islands) where these technologies were validated on its first stage. The Early Trials have represented the first in situ deployment and test of the novel technologies developed during the initial 14 months of the Project. Going into the sea supposed a huge challenge also in terms of management. The 32 partners of SWARMS had very different requirements (logistics, technical needs, software/computation needs, etc.), and a limited time frame to test and prove their individual developments. In order to fullfill the project objectives, all these tests were divided in 7 missions that were aimed to cover this early demonstration requiements. From PLOCAN, a management protocol was designed in order to cover all the partners needs and make an efficient resource asignment from the begining. These results will be extended to other two demonstrations of the project that forseen to be held in Romania (2017) and Norway (2018).

Quantitative analysis of distributed control paradigms of robot swarms

DEFF Research Database (Denmark)

Ngo, Trung Dung

2010-01-01

describe the physical and simulated robots, experiment scenario, and experiment setup. Third, we present our robot controllers based on behaviour based and neural network based paradigms. Fourth, we graphically show their experiment results and quantitatively analyse the results in comparison of the two......Given a task of designing controller for mobile robots in swarms, one might wonder which distributed control paradigms should be selected. Until now, paradigms of robot controllers have been within either behaviour based control or neural network based control, which have been recognized as two...... mainstreams of controller design for mobile robots. However, in swarm robotics, it is not clear how to determine control paradigms. In this paper we study the two control paradigms with various experiments of swarm aggregation. First, we introduce the two control paradigms for mobile robots. Second, we...

Metaheuristic Based Scheduling Meta-Tasks in Distributed Heterogeneous Computing Systems

Directory of Open Access Journals (Sweden)

Hesam Izakian

2009-07-01

Full Text Available Scheduling is a key problem in distributed heterogeneous computing systems in order to benefit from the large computing capacity of such systems and is an NP-complete problem. In this paper, we present a metaheuristic technique, namely the Particle Swarm Optimization (PSO algorithm, for this problem. 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. The scheduler aims at minimizing makespan, which is the time when finishes the latest task. Experimental studies show that the proposed method is more efficient and surpasses those of reported PSO and GA approaches for this problem.

Automated computation of autonomous spectral submanifolds for nonlinear modal analysis

Science.gov (United States)

Ponsioen, Sten; Pedergnana, Tiemo; Haller, George

2018-04-01

We discuss an automated computational methodology for computing two-dimensional spectral submanifolds (SSMs) in autonomous nonlinear mechanical systems of arbitrary degrees of freedom. In our algorithm, SSMs, the smoothest nonlinear continuations of modal subspaces of the linearized system, are constructed up to arbitrary orders of accuracy, using the parameterization method. An advantage of this approach is that the construction of the SSMs does not break down when the SSM folds over its underlying spectral subspace. A further advantage is an automated a posteriori error estimation feature that enables a systematic increase in the orders of the SSM computation until the required accuracy is reached. We find that the present algorithm provides a major speed-up, relative to numerical continuation methods, in the computation of backbone curves, especially in higher-dimensional problems. We illustrate the accuracy and speed of the automated SSM algorithm on lower- and higher-dimensional mechanical systems.

Drone Swarms

Science.gov (United States)

2017-05-25

Conversely, drone swarms have significant vulnerabilities and challenges, including electronic and cyber threats (hacking), legal and ethical ...Factors Affecting Success and selection in Goshawk Attacks on Woodpigeons,” Journal of Animal Ecology , Vol. 47, No. 2 (Jun., 1978), p 449-460 6 fish...organizational limitations, and ethical and legal constraints. This chapter answers what utility drone swarms bring to the military by examining

Light-Controlled Swarming and Assembly of Colloidal Particles

Directory of Open Access Journals (Sweden)

Jianhua Zhang

2018-02-01

Full Text Available Swarms and assemblies are ubiquitous in nature and they can perform complex collective behaviors and cooperative functions that they cannot accomplish individually. In response to light, some colloidal particles (CPs, including light active and passive CPs, can mimic their counterparts in nature and organize into complex structures that exhibit collective functions with remote controllability and high temporospatial precision. In this review, we firstly analyze the structural characteristics of swarms and assemblies of CPs and point out that light-controlled swarming and assembly of CPs are generally achieved by constructing light-responsive interactions between CPs. Then, we summarize in detail the recent advances in light-controlled swarming and assembly of CPs based on the interactions arisen from optical forces, photochemical reactions, photothermal effects, and photoisomerizations, as well as their potential applications. In the end, we also envision some challenges and future prospects of light-controlled swarming and assembly of CPs. With the increasing innovations in mechanisms and control strategies with easy operation, low cost, and arbitrary applicability, light-controlled swarming and assembly of CPs may be employed to manufacture programmable materials and reconfigurable robots for cooperative grasping, collective cargo transportation, and micro- and nanoengineering.

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

Science.gov (United States)

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.

Motor execution detection based on autonomic nervous system responses

International Nuclear Information System (INIS)

Marchal-Crespo, Laura; Riener, Robert; Zimmermann, Raphael; Lambercy, Olivier; Edelmann, Janis; Fluet, Marie-Christine; Gassert, Roger; Wolf, Martin

2013-01-01

Triggered assistance has been shown to be a successful robotic strategy for provoking motor plasticity, probably because it requires neurologic patients’ active participation to initiate a movement involving their impaired limb. Triggered assistance, however, requires sufficient residual motor control to activate the trigger and, thus, is not applicable to individuals with severe neurologic injuries. In these situations, brain and body–computer interfaces have emerged as promising solutions to control robotic devices. In this paper, we investigate the feasibility of a body–machine interface to detect motion execution only monitoring the autonomic nervous system (ANS) response. Four physiological signals were measured (blood pressure, breathing rate, skin conductance response and heart rate) during an isometric pinching task and used to train a classifier based on hidden Markov models. We performed an experiment with six healthy subjects to test the effectiveness of the classifier to detect rest and active pinching periods. The results showed that the movement execution can be accurately classified based only on peripheral autonomic signals, with an accuracy level of 84.5%, sensitivity of 83.8% and specificity of 85.2%. These results are encouraging to perform further research on the use of the ANS response in body–machine interfaces. (paper)

Reversals and collisions optimize protein exchange in bacterial swarms

Energy Technology Data Exchange (ETDEWEB)

Amiri, Aboutaleb; Harvey, Cameron; Buchmann, Amy; Christley, Scott; Shrout, Joshua D.; Aranson, Igor S.; Alber, Mark

2017-03-01

Swarming groups of bacteria coordinate their behavior by self-organizing as a population to move over surfaces in search of nutrients and optimal niches for colonization. Many open questions remain about the cues used by swarming bacteria to achieve this self-organization. While chemical cue signaling known as quorum sensing is well-described, swarming bacteria often act and coordinate on time scales that could not be achieved via these extracellular quorum sensing cues. Here, cell-cell contact-dependent protein exchange is explored as amechanism of intercellular signaling for the bacterium Myxococcus xanthus. A detailed biologically calibrated computational model is used to study how M. xanthus optimizes the connection rate between cells and maximizes the spread of an extracellular protein within the population. The maximum rate of protein spreading is observed for cells that reverse direction optimally for swarming. Cells that reverse too slowly or too fast fail to spread extracellular protein efficiently. In particular, a specific range of cell reversal frequencies was observed to maximize the cell-cell connection rate and minimize the time of protein spreading. Furthermore, our findings suggest that predesigned motion reversal can be employed to enhance the collective behavior of biological synthetic active systems.

Directing orbits of chaotic systems by particle swarm optimization

International Nuclear Information System (INIS)

Liu Bo; Wang Ling; Jin Yihui; Tang Fang; Huang Dexian

2006-01-01

This paper applies a novel evolutionary computation algorithm named particle swarm optimization (PSO) to direct the orbits of discrete chaotic dynamical systems towards desired target region within a short time by adding only small bounded perturbations, which could be formulated as a multi-modal numerical optimization problem with high dimension. Moreover, the synchronization of chaotic systems is also studied, which can be dealt with as an online problem of directing orbits. Numerical simulations based on Henon Map demonstrate the effectiveness and efficiency of PSO, and the effects of some parameters are also investigated

A Novel Cluster Head Selection Algorithm Based on Fuzzy Clustering and Particle Swarm Optimization.

Science.gov (United States)

Ni, Qingjian; Pan, Qianqian; Du, Huimin; Cao, Cen; Zhai, Yuqing

2017-01-01

An important objective of wireless sensor network is to prolong the network life cycle, and topology control is of great significance for extending the network life cycle. Based on previous work, for cluster head selection in hierarchical topology control, we propose a solution based on fuzzy clustering preprocessing and particle swarm optimization. More specifically, first, fuzzy clustering algorithm is used to initial clustering for sensor nodes according to geographical locations, where a sensor node belongs to a cluster with a determined probability, and the number of initial clusters is analyzed and discussed. Furthermore, the fitness function is designed considering both the energy consumption and distance factors of wireless sensor network. Finally, the cluster head nodes in hierarchical topology are determined based on the improved particle swarm optimization. Experimental results show that, compared with traditional methods, the proposed method achieved the purpose of reducing the mortality rate of nodes and extending the network life cycle.

TU-FG-201-04: Computer Vision in Autonomous Quality Assurance of Linear Accelerators

Energy Technology Data Exchange (ETDEWEB)

Yu, H; Jenkins, C; Yu, S; Yang, Y; Xing, L [Stanford University, Stanford, CA (United States)

2016-06-15

Purpose: Routine quality assurance (QA) of linear accelerators represents a critical and costly element of a radiation oncology center. Recently, a system was developed to autonomously perform routine quality assurance on linear accelerators. The purpose of this work is to extend this system and contribute computer vision techniques for obtaining quantitative measurements for a monthly multi-leaf collimator (MLC) QA test specified by TG-142, namely leaf position accuracy, and demonstrate extensibility for additional routines. Methods: Grayscale images of a picket fence delivery on a radioluminescent phosphor coated phantom are captured using a CMOS camera. Collected images are processed to correct for camera distortions, rotation and alignment, reduce noise, and enhance contrast. The location of each MLC leaf is determined through logistic fitting and a priori modeling based on knowledge of the delivered beams. Using the data collected and the criteria from TG-142, a decision is made on whether or not the leaf position accuracy of the MLC passes or fails. Results: The locations of all MLC leaf edges are found for three different picket fence images in a picket fence routine to 0.1mm/1pixel precision. The program to correct for image alignment and determination of leaf positions requires a runtime of 21– 25 seconds for a single picket, and 44 – 46 seconds for a group of three pickets on a standard workstation CPU, 2.2 GHz Intel Core i7. Conclusion: MLC leaf edges were successfully found using techniques in computer vision. With the addition of computer vision techniques to the previously described autonomous QA system, the system is able to quickly perform complete QA routines with minimal human contribution.

A persistent homology approach to collective behavior in insect swarms

Science.gov (United States)

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.

NET-COMPUTER: Internet Computer Architecture and its Application in E-Commerce

Directory of Open Access Journals (Sweden)

P. O. Umenne

2012-12-01

Full Text Available Research in Intelligent Agents has yielded interesting results, some of which have been translated into commer­cial ventures. Intelligent Agents are executable software components that represent the user, perform tasks on behalf of the user and when the task terminates, the Agents send the result to the user. Intelligent Agents are best suited for the Internet: a collection of computers connected together in a world-wide computer network. Swarm and HYDRA computer architectures for Agents’ execution were developed at the University of Surrey, UK in the 90s. The objective of the research was to develop a software-based computer architecture on which Agents execution could be explored. The combination of Intelligent Agents and HYDRA computer architecture gave rise to a new computer concept: the NET-Computer in which the comput­ing resources reside on the Internet. The Internet computers form the hardware and software resources, and the user is provided with a simple interface to access the Internet and run user tasks. The Agents autonomously roam the Internet (NET-Computer executing the tasks. A growing segment of the Internet is E-Commerce for online shopping for products and services. The Internet computing resources provide a marketplace for product suppliers and consumers alike. Consumers are looking for suppliers selling products and services, while suppliers are looking for buyers. Searching the vast amount of information available on the Internet causes a great deal of problems for both consumers and suppliers. Intelligent Agents executing on the NET-Computer can surf through the Internet and select specific information of interest to the user. The simulation results show that Intelligent Agents executing HYDRA computer architecture could be applied in E-Commerce.

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

Science.gov (United States)

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

Directory of Open Access Journals (Sweden)

Wei Zhao

2014-01-01

Full Text Available 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.

Multispacecraft current estimates at swarm

DEFF Research Database (Denmark)

Dunlop, M. W.; Yang, Y.-Y.; Yang, J.-Y.

2015-01-01

During the first several months of the three-spacecraft Swarm mission all three spacecraft camerepeatedly into close alignment, providing an ideal opportunity for validating the proposed dual-spacecraftmethod for estimating current density from the Swarm magnetic field data. Two of the Swarm...

New development thoughts on the bio-inspired intelligence based control for unmanned combat aerial vehicle

Institute of Scientific and Technical Information of China (English)

无

2010-01-01

Bio-inspired intelligence is in the spotlight in the field of international artificial intelligence,and unmanned combat aerial vehicle(UCAV),owing to its potential to perform dangerous,repetitive tasks in remote and hazardous,is very promising for the technological leadership of the nation and essential for improving the security of society.On the basis of introduction of bioinspired intelligence and UCAV,a series of new development thoughts on UCAV control are proposed,including artificial brain based high-level autonomous control for UCAV,swarm intelligence based cooperative control for multiple UCAVs,hy-brid swarm intelligence and Bayesian network based situation assessment under complicated combating environments, bio-inspired hardware based high-level autonomous control for UCAV,and meta-heuristic intelligence based heterogeneous cooperative control for multiple UCAVs and unmanned combat ground vehicles(UCGVs).The exact realization of the proposed new development thoughts can enhance the effectiveness of combat,while provide a series of novel breakthroughs for the intelligence,integration and advancement of future UCAV systems.

Analysis in nuclear power accident emergency based on random network and particle swarm optimization

International Nuclear Information System (INIS)

Gong Dichen; Fang Fang; Ding Weicheng; Chen Zhi

2014-01-01

The GERT random network model of nuclear power accident emergency was built in this paper, and the intelligent computation was combined with the random network based on the analysis of Fukushima nuclear accident in Japan. The emergency process was divided into the series link and parallel link, and the parallel link was the part of series link. The overall allocation of resources was firstly optimized, and then the parallel link was analyzed. The effect of the resources for emergency used in different links was analyzed, and it was put forward that the corresponding particle velocity vector was limited under the condition of limited emergency resources. The resource-constrained particle swarm optimization was obtained by using velocity projection matrix to correct the motion of particles. The optimized allocation of resources in emergency process was obtained and the time consumption of nuclear power accident emergency was reduced. (authors)

Design of an Adaptive PID Neural Controller for Continuous Stirred Tank Reactor based on Particle Swarm Optimization

OpenAIRE

Khulood A. Dagher; Ahmed S. Al-Araji

2013-01-01

A particle swarm optimization algorithm and neural network like self-tuning PID controller for CSTR system is presented. The scheme of the discrete-time PID control structure is based on neural network and tuned the parameters of the PID controller by using a particle swarm optimization PSO technique as a simple and fast training algorithm. The proposed method has advantage that it is not necessary to use a combined structure of identification and decision because it used PSO. Simulation resu...

Agent based Particle Swarm Optimization for Load Frequency Control of Distribution Grid

DEFF Research Database (Denmark)

Cha, Seung-Tae; Saleem, Arshad; Wu, Qiuwei

2012-01-01

This paper presents a Particle Swarm Optimization (PSO) based on multi-agent controller. Real-time digital simulator (RTDS) is used for modelling the power system, while a PSO based multi-agent LFC algorithm is developed in JAVA for communicating with resource agents and determines the scenario...... to stabilize the frequency and voltage after the system enters into the islanding operation mode. The proposed algorithm is based on the formulation of an optimization problem using agent based PSO. The modified IEEE 9-bus system is employed to illustrate the performance of the proposed controller via RTDS...

An Aerial Robot for Rice Farm Quality Inspection With Type-2 Fuzzy Neural Networks Tuned by Particle Swarm Optimization-Sliding Mode Control Hybrid Algorithm

DEFF Research Database (Denmark)

Camci, Efe; Kripalan, Devesh Raju; Ma, Linlu

2017-01-01

, an autonomous quality inspection over rice farms is proposed by employing quadcopters. Real-time control of these vehicles, however, is still challenging as they exhibit highly nonlinear behavior especially for agile maneuvers. What is more, these vehicles have to operate under uncertain working conditions...... particle swarm optimization-sliding mode control (PSO-SMC) theory-based hybrid algorithm is proposed for the training of T2-FNNs. In particular, continuous version of PSO is adopted for the identification of the antecedent part of T2-FNNs while SMCbased update rules are utilized for online learning...

Self-Organization in Aggregating Robot Swarms: A DW-KNN Topological Approach

KAUST Repository

Khaldi, Belkacem

2018-02-02

In certain swarm applications, where the inter-agent distance is not the only factor in the collective behaviours of the swarm, additional properties such as density could have a crucial effect. In this paper, we propose applying a Distance-Weighted K-Nearest Neighbouring (DW-KNN) topology to the behaviour of robot swarms performing self-organized aggregation, in combination with a virtual physics approach to keep the robots together. A distance-weighted function based on a Smoothed Particle Hydrodynamic (SPH) interpolation approach, which is used to evaluate the robot density in the swarm, is applied as the key factor for identifying the K-nearest neighbours taken into account when aggregating the robots. The intra virtual physical connectivity among these neighbours is achieved using a virtual viscoelastic-based proximity model. With the ARGoS based-simulator, we model and evaluate the proposed approach, showing various self-organized aggregations performed by a swarm of N foot-bot robots. Also, we compared the aggregation quality of DW-KNN aggregation approach to that of the conventional KNN approach and found better performance.

A constriction factor based particle swarm optimisation algorithm to solve the economic dispatch problem including losses

Energy Technology Data Exchange (ETDEWEB)

Young, Steven; Montakhab, Mohammad; Nouri, Hassan

2011-07-15

Economic dispatch (ED) is one of the most important problems to be solved in power generation as fractional percentage fuel reductions represent significant cost savings. ED wishes to optimise the power generated by each generating unit in a system in order to find the minimum operating cost at a required load demand, whilst ensuring both equality and inequality constraints are met. For the process of optimisation, a model must be created for each generating unit. The particle swarm optimisation technique is an evolutionary computation technique with one of the most powerful methods for solving global optimisation problems. The aim of this paper is to add in a constriction factor to the particle swarm optimisation algorithm (CFBPSO). Results show that the algorithm is very good at solving the ED problem and that CFBPSO must be able to work in a practical environment and so a valve point effect with transmission losses should be included in future work.

Time-delayed autosynchronous swarm control.

Science.gov (United States)

Biggs, James D; Bennet, Derek J; Dadzie, S Kokou

2012-01-01

In this paper a general Morse potential model of self-propelling particles is considered in the presence of a time-delayed term and a spring potential. It is shown that the emergent swarm behavior is dependent on the delay term and weights of the time-delayed function, which can be set to induce a stationary swarm, a rotating swarm with uniform translation, and a rotating swarm with a stationary center of mass. An analysis of the mean field equations shows that without a spring potential the motion of the center of mass is determined explicitly by a multivalued function. For a nonzero spring potential the swarm converges to a vortex formation about a stationary center of mass, except at discrete bifurcation points where the center of mass will periodically trace an ellipse. The analytical results defining the behavior of the center of mass are shown to correspond with the numerical swarm simulations.

Multipeak Mean Based Optimized Histogram Modification Framework Using Swarm Intelligence for Image Contrast Enhancement

Directory of Open Access Journals (Sweden)

P. Babu

2015-01-01

Full Text Available A novel approach, Multipeak mean based optimized histogram modification framework (MMOHM is introduced for the purpose of enhancing the contrast as well as preserving essential details for any given gray scale and colour images. The basic idea of this technique is the calculation of multiple peaks (local maxima from the original histogram. The mean value of multiple peaks is computed and the input image’s histogram is segmented into two subhistograms based on this multipeak mean (mmean value. Then, a bicriteria optimization problem is formulated and the subhistograms are modified by selecting optimal contrast enhancement parameters. While formulating the enhancement parameters, particle swarm optimization is employed to find optimal values of them. Finally, the union of the modified subhistograms produces a contrast enhanced and details preserved output image. This mechanism enhances the contrast of the input image better than the existing contemporary HE methods. The performance of the proposed method is well supported by the contrast enhancement quantitative metrics such as discrete entropy, natural image quality evaluator, and absolute mean brightness error.

Velocity correlations in laboratory insect swarms

Science.gov (United States)

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.

DAILY SCHEDULING OF SMALL HYDRO POWER PLANTS DISPATCH WITH MODIFIED PARTICLES SWARM OPTIMIZATION

Directory of Open Access Journals (Sweden)

Sinvaldo Rodrigues Moreno

2015-04-01

Full Text Available This paper presents a new approach for short-term hydro power scheduling of reservoirs using an algorithm-based Particle Swarm Optimization (PSO. PSO is a population-based algorithm designed to find good solutions to optimization problems, its characteristics have encouraged its adoption to tackle a variety of problems in different fields. In this paper the authors consider an optimization problem related to a daily scheduling of small hydro power dispatch. The goal is construct a feasible solution that maximize the cascade electricity production, following the environmental constraints and water balance. The paper proposes an improved Particle Swarm Optimization (PSO algorithm, which takes advantage of simplicity and facility of implementation. The algorithm was successfully applied to the optimization of the daily schedule strategies of small hydro power plants, considering maximum water utilization and all constraints related to simultaneous water uses. Extensive computational tests and comparisons with other heuristics methods showed the effectiveness of the proposed approach.

A feature matching and fusion-based positive obstacle detection algorithm for field autonomous land vehicles

Directory of Open Access Journals (Sweden)

Tao Wu

2017-03-01

Full Text Available Positive obstacles will cause damage to field robotics during traveling in field. Field autonomous land vehicle is a typical field robotic. This article presents a feature matching and fusion-based algorithm to detect obstacles using LiDARs for field autonomous land vehicles. There are three main contributions: (1 A novel setup method of compact LiDAR is introduced. This method improved the LiDAR data density and reduced the blind region of the LiDAR sensor. (2 A mathematical model is deduced under this new setup method. The ideal scan line is generated by using the deduced mathematical model. (3 Based on the proposed mathematical model, a feature matching and fusion (FMAF-based algorithm is presented in this article, which is employed to detect obstacles. Experimental results show that the performance of the proposed algorithm is robust and stable, and the computing time is reduced by an order of two magnitudes by comparing with other exited algorithms. This algorithm has been perfectly applied to our autonomous land vehicle, which has won the champion in the challenge of Chinese “Overcome Danger 2014” ground unmanned vehicle.

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

Science.gov (United States)

2011-06-01

energy options” [10]. The research of swarm robotics derives much of its inspiration from natural systems. Social insects are known to coordinate their...Monterey, California 9. CPT. Francisco J. Hederra Direccion de Investigacion, Programas y Desarrollo de la Armada Armada de Chile CHILE 10. CAPT Jeffrey Kline, USN(ret.) Naval Postgraduate School Monterey, California 91

Swarm analysis by using transport equations

International Nuclear Information System (INIS)

Dote, Toshihiko.

1985-01-01

As the basis of weak ionization plasma phenomena, the motion, i.e. swarm, of charged particles in the gas is analyzed by use of the transport equations, from which basic nature of the swarm is discussed. The present report is an overview of the studies made in the past several years. Described are principally the most basic aspects concerning behaviors of the electrons and positive ions, that is, the basic equations and their significance, characteristics of the behaviors of the electron and positive ion swarms as revealed by solving the equations, and various characteristics of the swarm parameters. Contents are: Maxwell-Boltzmann's transport equations, behavior of the electron swarm, energy loss of the electrons, and behavior of the positive ion swarm. (Mori, K.)

A Framework for Constrained Optimization Problems Based on a Modified Particle Swarm Optimization

Directory of Open Access Journals (Sweden)

Biwei Tang

2016-01-01

Full Text Available This paper develops a particle swarm optimization (PSO based framework for constrained optimization problems (COPs. Aiming at enhancing the performance of PSO, a modified PSO algorithm, named SASPSO 2011, is proposed by adding a newly developed self-adaptive strategy to the standard particle swarm optimization 2011 (SPSO 2011 algorithm. Since the convergence of PSO is of great importance and significantly influences the performance of PSO, this paper first theoretically investigates the convergence of SASPSO 2011. Then, a parameter selection principle guaranteeing the convergence of SASPSO 2011 is provided. Subsequently, a SASPSO 2011-based framework is established to solve COPs. Attempting to increase the diversity of solutions and decrease optimization difficulties, the adaptive relaxation method, which is combined with the feasibility-based rule, is applied to handle constraints of COPs and evaluate candidate solutions in the developed framework. Finally, the proposed method is verified through 4 benchmark test functions and 2 real-world engineering problems against six PSO variants and some well-known methods proposed in the literature. Simulation results confirm that the proposed method is highly competitive in terms of the solution quality and can be considered as a vital alternative to solve COPs.

A fuzzy controller design for nuclear research reactors using the particle swarm optimization algorithm

International Nuclear Information System (INIS)

Coban, Ramazan

2011-01-01

Research highlights: → A closed-loop fuzzy logic controller based on the particle swarm optimization algorithm was proposed for controlling the power level of nuclear research reactors. → The proposed control system was tested for various initial and desired power levels, and it could control the reactor successfully for most situations. → The proposed controller is robust against the disturbances. - Abstract: In this paper, a closed-loop fuzzy logic controller based on the particle swarm optimization algorithm is proposed for controlling the power level of nuclear research reactors. The principle of the fuzzy logic controller is based on the rules constructed from numerical experiments made by means of a computer code for the core dynamics calculation and from human operator's experience and knowledge. In addition to these intuitive and experimental design efforts, consequent parts of the fuzzy rules are optimally (or near optimally) determined using the particle swarm optimization algorithm. The contribution of the proposed algorithm to a reactor control system is investigated in details. The performance of the controller is also tested with numerical simulations in numerous operating conditions from various initial power levels to desired power levels, as well as under disturbance. It is shown that the proposed control system performs satisfactorily under almost all operating conditions, even in the case of very small initial power levels.

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

Science.gov (United States)

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.

Students' Perceptions of Autonomous Out-of-Class Learning through the Use of Computers

Science.gov (United States)

Liu, Xianghu

2014-01-01

This study investigates the attitudes towards, and practices of, computer-assisted autonomous learning in learning English of 160 students from three different higher education institutions in China. To do this, a questionnaire was completed by 160 participants, and follow-up in-depth interviews were undertaken with six participants and six of…

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

Science.gov (United States)

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.

Particle Swarms in Fractures: Open Versus Partially Closed Systems

Science.gov (United States)

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

2014-12-01

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).

Free Energy Calculations using a Swarm-Enhanced Sampling Molecular Dynamics Approach.

Science.gov (United States)

Burusco, Kepa K; Bruce, Neil J; Alibay, Irfan; Bryce, Richard A

2015-10-26

Free energy simulations are an established computational tool in modelling chemical change in the condensed phase. However, sampling of kinetically distinct substates remains a challenge to these approaches. As a route to addressing this, we link the methods of thermodynamic integration (TI) and swarm-enhanced sampling molecular dynamics (sesMD), where simulation replicas interact cooperatively to aid transitions over energy barriers. We illustrate the approach by using alchemical alkane transformations in solution, comparing them with the multiple independent trajectory TI (IT-TI) method. Free energy changes for transitions computed by using IT-TI grew increasingly inaccurate as the intramolecular barrier was heightened. By contrast, swarm-enhanced sampling TI (sesTI) calculations showed clear improvements in sampling efficiency, leading to more accurate computed free energy differences, even in the case of the highest barrier height. The sesTI approach, therefore, has potential in addressing chemical change in systems where conformations exist in slow exchange. © 2015 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Merging the fields of swarm robotics and new media: Perceiving swarm robotics as new media

Directory of Open Access Journals (Sweden)

Monika O. Ivanova

2014-06-01

Full Text Available The aim of this paper is to provide evidence that swarm robotic systems can be perceived as new media objects. A thorough description of the five principles of new media proposed by Lev Manovich in “The Language of New Media” is presented. This is complemented by a state of the art on swarm robotics with an in-depth comparison of the characteristics of both fields. Also presented are examples of swarm robotics used in new media installations in order to illustrate the cutting-edge applications of robotics and artificial intelligence achieved through the unity of bothfields. The hypothesis of this research is that a novel point of view would be introduced by examining the field of swarm robotics through the scope of new media, which would benefit thework of both new media and swarm robotic researchers.

A Hybrid Method for Image Segmentation Based on Artificial Fish Swarm Algorithm and Fuzzy c-Means Clustering

Directory of Open Access Journals (Sweden)

Li Ma

2015-01-01

Full Text Available Image segmentation plays an important role in medical image processing. Fuzzy c-means (FCM clustering is one of the popular clustering algorithms for medical image segmentation. However, FCM has the problems of depending on initial clustering centers, falling into local optimal solution easily, and sensitivity to noise disturbance. To solve these problems, this paper proposes a hybrid artificial fish swarm algorithm (HAFSA. The proposed algorithm combines artificial fish swarm algorithm (AFSA with FCM whose advantages of global optimization searching and parallel computing ability of AFSA are utilized to find a superior result. Meanwhile, Metropolis criterion and noise reduction mechanism are introduced to AFSA for enhancing the convergence rate and antinoise ability. The artificial grid graph and Magnetic Resonance Imaging (MRI are used in the experiments, and the experimental results show that the proposed algorithm has stronger antinoise ability and higher precision. A number of evaluation indicators also demonstrate that the effect of HAFSA is more excellent than FCM and suppressed FCM (SFCM.

Four-dimensional parameter estimation of plane waves using swarming intelligence

International Nuclear Information System (INIS)

Zaman Fawad; Munir Fahad; Khan Zafar Ullah; Qureshi Ijaz Mansoor

2014-01-01

This paper proposes an efficient approach for four-dimensional (4D) parameter estimation of plane waves impinging on a 2-L shape array. The 4D parameters include amplitude, frequency and the two-dimensional (2D) direction of arrival, namely, azimuth and elevation angles. The proposed approach is based on memetic computation, in which the global optimizer, particle swarm optimization is hybridized with a rapid local search technique, pattern search. For this purpose, a new multi-objective fitness function is used. This fitness function is the combination of mean square error and the correlation between the normalized desired and estimated vectors. The proposed hybrid scheme is not only compared with individual performances of particle swarm optimization and pattern search, but also with the performance of the hybrid genetic algorithm and that of the traditional approach. A large number of Monte—Carlo simulations are carried out to validate the performance of the proposed scheme. It gives promising results in terms of estimation accuracy, convergence rate, proximity effect and robustness against noise. (interdisciplinary physics and related areas of science and technology)

A fuzzy-based particle swarm optimisation approach for task assignment in home healthcare

Directory of Open Access Journals (Sweden)

Mutingi, Michael

2014-11-01

Full Text Available Home healthcare (HHC organisations provide coordinated healthcare services to patients at their homes. Motivated by the ever-increasing need for home-based care, the assignment of tasks to available healthcare staff is a common and complex problem in homecare organisations. Designing high quality task schedules is critical for improving worker morale, job satisfaction, service efficiency, service quality, and competitiveness over the long term. The desire is to provide high quality task assignment schedules that satisfy the patient, the care worker, and the management. This translates to maximising schedule fairness in terms of workload assignments, avoiding task time window violation, and meeting management goals as much as possible. However, in practice, these desires are often subjective as they involve imprecise human perceptions. This paper develops a fuzzy multi-criteria particle swarm optimisation (FPSO approach for task assignment in a home healthcare setting in a fuzzy environment. The proposed approach uses a fuzzy evaluation method from a multi-criteria point of view. Results from illustrative computational experiments show that the approach is promising.

Particle Swarm Optimization Based of the Maximum Photovoltaic ...

African Journals Online (AJOL)

Photovoltaic electricity is seen as an important source of renewable energy. The photovoltaic array is an unstable source of power since the peak power point depends on the temperature and the irradiation level. A maximum peak power point tracking is then necessary for maximum efficiency. In this work, a Particle Swarm ...

Short communication. Platform for bee-hives monitoring based on sound analysis. A perpetual warehouse for swarms daily activity

Energy Technology Data Exchange (ETDEWEB)

Atauri Mezquida, D.; Llorente Martinez, J.

2009-07-01

Bees and beekeeping are suffering a global crisis. Constant information on swarms conditions would be a key to study new diseases like colony collapse disorder and to develop new beekeeping tools to improve the hive management and make it more efficient. A platform for beehives monitoring is presented. It is based on the analysis of the colonies buzz which is registered by a bunch of sensors sending the data to a common database. Data obtained through sound processing shows plenty of patterns and tendency lines related to colonies activities and their conditions. It shows the potential of the sound as a swarm activity gauge. The goal of the platform is the possibility to store information about the swarms activity. The objective is to build a global net of monitored hives covering apiaries with different climates, razes and managements. (Author) 21 refs.

Bifurcating Particle Swarms in Smooth-Walled Fractures

Science.gov (United States)

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

Autonomic Cluster Management System (ACMS): A Demonstration of Autonomic Principles at Work

Science.gov (United States)

Baldassari, James D.; Kopec, Christopher L.; Leshay, Eric S.; Truszkowski, Walt; Finkel, David

2005-01-01

Cluster computing, whereby a large number of simple processors or nodes are combined together to apparently function as a single powerful computer, has emerged as a research area in its own right. The approach offers a relatively inexpensive means of achieving significant computational capabilities for high-performance computing applications, while simultaneously affording the ability to. increase that capability simply by adding more (inexpensive) processors. However, the task of manually managing and con.guring a cluster quickly becomes impossible as the cluster grows in size. Autonomic computing is a relatively new approach to managing complex systems that can potentially solve many of the problems inherent in cluster management. We describe the development of a prototype Automatic Cluster Management System (ACMS) that exploits autonomic properties in automating cluster management.

Swarm Satellites : Design, Characteristics and Applications

NARCIS (Netherlands)

Engelen, S.

2016-01-01

Satellite swarms are a novelty, yet promise to deliver unprecedented robustness and data-collection efficiency. They are so new in fact that even the definition of what a satellite swarm is is disputable, and consequently, the term "swarm" is used for practically any type of distributed space

On the capability of Swarm for surface mass variation monitoring: Quantitative assessment based on orbit information from CHAMP, GRACE and GOCE

Science.gov (United States)

Baur, Oliver; Weigelt, Matthias; Zehentner, Norbert; Mayer-Gürr, Torsten; Jäggi, Adrian

2014-05-01

In the last decade, temporal variations of the gravity field from GRACE observations have become one of the most ubiquitous and valuable sources of information for geophysical and environmental studies. In the context of global climate change, mass balance of the Arctic and Antarctic ice sheets gained particular attention. Because GRACE has outlived its predicted lifetime by several years already, it is very likely that a gap between GRACE and its successor GRACE follow-on (supposed to be launched in 2017, at the earliest) occurs. The Swarm mission - launched on November 22, 2013 - is the most promising candidate to bridge this potential gap, i.e., to directly acquire large-scale mass variation information on the Earth's surface in case of a gap between the present GRACE and the upcoming GRACE follow-on projects. Although the magnetometry mission Swarm has not been designed for gravity field purposes, its three satellites have the characteristics for such an endeavor: (i) low, near-circular and near-polar orbits, (ii) precise positioning with high-quality GNSS receivers, (iii) on-board accelerometers to measure the influence of non-gravitational forces. Hence, from an orbit analysis point of view the Swarm satellites are comparable to the CHAMP, GRACE and GOCE spacecraft. Indeed and as data analysis from CHAMP has been shown, the detection of annual signals and trends from orbit analysis is possible for long-wavelength features of the gravity field, although the accuracy associated with the inter-satellite GRACE measurements cannot be reached. We assess the capability of the (non-dedicated) mission Swarm for mass variation detection in a real-case environment (opposed to simulation studies). For this purpose, we "approximate" the Swarm scenario by the GRACE+CHAMP and GRACE+GOCE constellations. In a first step, kinematic orbits of the individual satellites are derived from GNSS observations. From these orbits, we compute monthly combined GRACE+CHAMP and GRACE

Autonomous target tracking of UAVs based on low-power neural network hardware

Science.gov (United States)

Yang, Wei; Jin, Zhanpeng; Thiem, Clare; Wysocki, Bryant; Shen, Dan; Chen, Genshe

2014-05-01

Detecting and identifying targets in unmanned aerial vehicle (UAV) images and videos have been challenging problems due to various types of image distortion. Moreover, the significantly high processing overhead of existing image/video processing techniques and the limited computing resources available on UAVs force most of the processing tasks to be performed by the ground control station (GCS) in an off-line manner. In order to achieve fast and autonomous target identification on UAVs, it is thus imperative to investigate novel processing paradigms that can fulfill the real-time processing requirements, while fitting the size, weight, and power (SWaP) constrained environment. In this paper, we present a new autonomous target identification approach on UAVs, leveraging the emerging neuromorphic hardware which is capable of massively parallel pattern recognition processing and demands only a limited level of power consumption. A proof-of-concept prototype was developed based on a micro-UAV platform (Parrot AR Drone) and the CogniMemTMneural network chip, for processing the video data acquired from a UAV camera on the y. The aim of this study was to demonstrate the feasibility and potential of incorporating emerging neuromorphic hardware into next-generation UAVs and their superior performance and power advantages towards the real-time, autonomous target tracking.

Exploring with PAM: Prospecting ANTS Missions for Solar System Surveys

Science.gov (United States)

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.

Comparison of Back propagation neural network and Back propagation neural network Based Particle Swarm intelligence in Diagnostic Breast Cancer

Directory of Open Access Journals (Sweden)

Farahnaz SADOUGHI

2014-03-01

Full Text Available Breast cancer is the most commonly diagnosed cancer and the most common cause of death in women all over the world. Use of computer technology supporting breast cancer diagnosing is now widespread and pervasive across a broad range of medical areas. Early diagnosis of this disease can greatly enhance the chances of long-term survival of breast cancer victims. Artificial Neural Networks (ANN as mainly method play important role in early diagnoses breast cancer. This paper studies Levenberg Marquardet Backpropagation (LMBP neural network and Levenberg Marquardet Backpropagation based Particle Swarm Optimization(LMBP-PSO for the diagnosis of breast cancer. The obtained results show that LMBP and LMBP based PSO system provides higher classification efficiency. But LMBP based PSO needs minimum training and testing time. It helps in developing Medical Decision System (MDS for breast cancer diagnosing. It can also be used as secondary observer in clinical decision making.

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

Science.gov (United States)

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

The Swarm Magnetometry Package

DEFF Research Database (Denmark)

Merayo, José M.G.; Jørgensen, John Leif; Friis-Christensen, Eigil

2008-01-01

The Swarm mission under the ESA's Living Planet Programme is planned for launch in 2010 and consists of a constellation of three satellites at LEO. The prime objective of Swarm is to measure the geomagnetic field with unprecedented accuracy in space and time. The magnetometry package consists...

A Novel Artificial Fish Swarm Algorithm for Recalibration of Fiber Optic Gyroscope Error Parameters

Directory of Open Access Journals (Sweden)

Yanbin Gao

2015-05-01

Full Text Available 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.

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

Science.gov (United States)

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.

Osmotic pressure in a bacterial swarm.

Science.gov (United States)

Ping, Liyan; Wu, Yilin; Hosu, Basarab G; Tang, Jay X; Berg, Howard C

2014-08-19

Using Escherichia coli as a model organism, we studied how water is recruited by a bacterial swarm. A previous analysis of trajectories of small air bubbles revealed a stream of fluid flowing in a clockwise direction ahead of the swarm. A companion study suggested that water moves out of the agar into the swarm in a narrow region centered ∼ 30 μm from the leading edge of the swarm and then back into the agar (at a smaller rate) in a region centered ∼ 120 μm back from the leading edge. Presumably, these flows are driven by changes in osmolarity. Here, we utilized green/red fluorescent liposomes as reporters of osmolarity to verify this hypothesis. The stream of fluid that flows in front of the swarm contains osmolytes. Two distinct regions are observed inside the swarm near its leading edge: an outer high-osmolarity band (∼ 30 mOsm higher than the agar baseline) and an inner low-osmolarity band (isotonic or slightly hypotonic to the agar baseline). This profile supports the fluid-flow model derived from the drift of air bubbles and provides new (to our knowledge) insights into water maintenance in bacterial swarms. High osmotic pressure at the leading edge of the swarm extracts water from the underlying agar and promotes motility. The osmolyte is of high molecular weight and probably is lipopolysaccharide. Copyright © 2014 Biophysical Society. Published by Elsevier Inc. All rights reserved.

Biogeography-based particle swarm optimization with fuzzy elitism and its applications to constrained engineering problems

Science.gov (United States)

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.

LinkMind: link optimization in swarming mobile sensor networks.

Science.gov (United States)

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

Directory of Open Access Journals (Sweden)

Trung Dung Ngo

2011-08-01

Full Text Available 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.

PID control for chaotic synchronization using particle swarm optimization

International Nuclear Information System (INIS)

Chang, W.-D.

2009-01-01

In this paper, we attempt to use the proportional-integral-derivative (PID) controller to achieve the chaos synchronization for delayed discrete chaotic systems. Three PID control gains can be optimally determined by means of using a novel optimization algorithm, called the particle swarm optimization (PSO). The algorithm is motivated from the organism behavior of fish schooling and bird flocking, and involves the social psychology principles in socio-cognition human agents and evolutionary computations. It has a good numerical convergence for solving optimization problem. To show the validity of the PSO-based PID control for chaos synchronization, several cases with different initial populations are considered and some simulation results are shown.

PID control for chaotic synchronization using particle swarm optimization

Energy Technology Data Exchange (ETDEWEB)

Chang, W.-D. [Department of Computer and Communication, Shu-Te University, Kaohsiung 824, Taiwan (China)], E-mail: wdchang@mail.stu.edu.tw

2009-01-30

In this paper, we attempt to use the proportional-integral-derivative (PID) controller to achieve the chaos synchronization for delayed discrete chaotic systems. Three PID control gains can be optimally determined by means of using a novel optimization algorithm, called the particle swarm optimization (PSO). The algorithm is motivated from the organism behavior of fish schooling and bird flocking, and involves the social psychology principles in socio-cognition human agents and evolutionary computations. It has a good numerical convergence for solving optimization problem. To show the validity of the PSO-based PID control for chaos synchronization, several cases with different initial populations are considered and some simulation results are shown.

An External Archive-Guided Multiobjective Particle Swarm Optimization Algorithm.

Science.gov (United States)

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.

Multiscale Modelling and Analysis of Collective Decision Making in Swarm Robotics

Science.gov (United States)

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

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

Science.gov (United States)

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.

Hard-real-time resource management for autonomous spacecraft

Science.gov (United States)

Gat, E.

2000-01-01

This paper describes tickets, a computational mechanism for hard-real-time autonomous resource management. Autonomous spacecraftcontrol can be considered abstractly as a computational process whose outputs are spacecraft commands.

Chaotically encoded particle swarm optimization algorithm and its applications

International Nuclear Information System (INIS)

Alatas, Bilal; Akin, Erhan

2009-01-01

This paper proposes a novel particle swarm optimization (PSO) algorithm, chaotically encoded particle swarm optimization algorithm (CENPSOA), based on the notion of chaos numbers that have been recently proposed for a novel meaning to numbers. In this paper, various chaos arithmetic and evaluation measures that can be used in CENPSOA have been described. Furthermore, CENPSOA has been designed to be effectively utilized in data mining applications.

Swarm Verification

Science.gov (United States)

Holzmann, Gerard J.; Joshi, Rajeev; Groce, Alex

2008-01-01

Reportedly, supercomputer designer Seymour Cray once said that he would sooner use two strong oxen to plow a field than a thousand chickens. Although this is undoubtedly wise when it comes to plowing a field, it is not so clear for other types of tasks. Model checking problems are of the proverbial "search the needle in a haystack" type. Such problems can often be parallelized easily. Alas, none of the usual divide and conquer methods can be used to parallelize the working of a model checker. Given that it has become easier than ever to gain access to large numbers of computers to perform even routine tasks it is becoming more and more attractive to find alternate ways to use these resources to speed up model checking tasks. This paper describes one such method, called swarm verification.

Chaotic particle swarm optimization for economic dispatch considering the generator constraints

International Nuclear Information System (INIS)

Cai, Jiejin; Ma, Xiaoqian; Li, Lixiang; Haipeng, Peng

2007-01-01

Chaotic particle swarm optimization (CPSO) methods are optimization approaches based on the proposed particle swarm optimization (PSO) with adaptive inertia weight factor (AIWF) and chaotic local search (CLS). In this paper, two CPSO methods based on the logistic equation and the Tent equation are presented to solve economic dispatch (ED) problems with generator constraints and applied in two power system cases. Compared with the traditional PSO method, the convergence iterative numbers of the CPSO methods are reduced, and the solutions generation costs decrease around 5 $/h in the six unit system and 24 $/h in the 15 unit system. The simulation results show that the CPSO methods have good convergence property. The generation costs of the CPSO methods are lower than those of the traditional particle swarm optimization algorithm, and hence, CPSO methods can result in great economic effect. For economic dispatch problems, the CPSO methods are more feasible and more effective alternative approaches than the traditional particle swarm optimization algorithm

Effectively Tackling Reinsurance Problems by Using Evolutionary and Swarm Intelligence Algorithms

Directory of Open Access Journals (Sweden)

Sancho Salcedo-Sanz

2014-04-01

Full Text Available This paper is focused on solving different hard optimization problems that arise in the field of insurance and, more specifically, in reinsurance problems. In this area, the complexity of the models and assumptions considered in the definition of the reinsurance rules and conditions produces hard black-box optimization problems (problems in which the objective function does not have an algebraic expression, but it is the output of a system (usually a computer program, which must be solved in order to obtain the optimal output of the reinsurance. The application of traditional optimization approaches is not possible in this kind of mathematical problem, so new computational paradigms must be applied to solve these problems. In this paper, we show the performance of two evolutionary and swarm intelligence techniques (evolutionary programming and particle swarm optimization. We provide an analysis in three black-box optimization problems in reinsurance, where the proposed approaches exhibit an excellent behavior, finding the optimal solution within a fraction of the computational cost used by inspection or enumeration methods.

Han's model parameters for microalgae grown under intermittent illumination: Determined using particle swarm optimization.

Science.gov (United States)

Pozzobon, Victor; Perre, Patrick

2018-01-21

This work provides a model and the associated set of parameters allowing for microalgae population growth computation under intermittent lightning. Han's model is coupled with a simple microalgae growth model to yield a relationship between illumination and population growth. The model parameters were obtained by fitting a dataset available in literature using Particle Swarm Optimization method. In their work, authors grew microalgae in excess of nutrients under flashing conditions. Light/dark cycles used for these experimentations are quite close to those found in photobioreactor, i.e. ranging from several seconds to one minute. In this work, in addition to producing the set of parameters, Particle Swarm Optimization robustness was assessed. To do so, two different swarm initialization techniques were used, i.e. uniform and random distribution throughout the search-space. Both yielded the same results. In addition, swarm distribution analysis reveals that the swarm converges to a unique minimum. Thus, the produced set of parameters can be trustfully used to link light intensity to population growth rate. Furthermore, the set is capable to describe photodamages effects on population growth. Hence, accounting for light overexposure effect on algal growth. Copyright © 2017 Elsevier Ltd. All rights reserved.

Swarm.

Science.gov (United States)

Petersen, Hugh

2002-01-01

Describes an eighth grade art project for which students created bug swarms on scratchboard. Explains that the project also teaches students about design principles, such as balance. Discusses how the students created their drawings. (CMK)

The Swarm Satellite Constellation Application and Research Facility (SCARF) and Swarm data products

DEFF Research Database (Denmark)

Olsen, Nils; Friis-Christensen, Eigil; Floberghagen, R.

2013-01-01

Swarm, a three-satellite constellation to study the dynamics of the Earth's magnetic field and its interactions with the Earth system, is expected to be launched in late 2013. The objective of the Swarm mission is to provide the best ever survey of the geomagnetic field and its temporal evolution...

Autonomous e-coaching in the wild: Empirical validation of a model-based reasoning system

OpenAIRE

Kamphorst, B.A.; Klein, M.C.A.; van Wissen, A.

2014-01-01

Autonomous e-coaching systems have the potential to improve people's health behaviors on a large scale. The intelligent behavior change support system eMate exploits a model of the human agent to support individuals in adopting a healthy lifestyle. The system attempts to identify the causes of a person's non-adherence by reasoning over a computational model (COMBI) that is based on established psychological theories of behavior change. The present work presents an extensive, monthlong empiric...

Design and control of swarm dynamics

CERN Document Server

Bouffanais, Roland

2016-01-01

The book is about the key elements required for designing, building and controlling effective artificial swarms comprised of multiple moving physical agents. Therefore this book presents the fundamentals of each of those key elements in the particular frame of dynamic swarming, specifically exposing the profound connections between these elements and establish some general design principles for swarming behaviors. This scientific endeavor requires an inter-disciplinary approach: biomimetic inspiration from ethology and ecology, study of social information flow, analysis of temporal and adaptive signaling network of interaction, considerations of control of networked real-time systems, and lastly, elements of complex adaptive dynamical systems. This book offers a completely new perspective on the scientific understanding of dynamic collective behaviors thanks to its multi-disciplinary approach and its focus on artificial swarm of physical agents. Two of the key problems in understanding the emergence of swarm ...

Scouts behave as streakers in honeybee swarms

Science.gov (United States)

Greggers, Uwe; Schöning, Caspar; Degen, Jacqueline; Menzel, Randolf

2013-08-01

Harmonic radar tracking was used to record the flights of scout bees during takeoff and initial flight path of two honeybee swarms. One swarm remained intact and performed a full flight to a destination beyond the range of the harmonic radar, while a second swarm disintegrated within the range of the radar and most of the bees returned to the queen. The initial stretch of the full flight is characterized by accelerating speed, whereas the disintegrating swarm flew steadily at low speed. The two scouts in the swarm displaying full flight performed characteristic flight maneuvers. They flew at high speed when traveling in the direction of their destination and slowed down or returned over short stretches at low speed. Scouts in the disintegrating swarm did not exhibit the same kind of characteristic flight performance. Our data support the streaker bee hypothesis proposing that scout bees guide the swarm by traveling at high speed in the direction of the new nest site for short stretches of flight and slowing down when reversing flight direction.

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

Science.gov (United States)

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.

Advanced Autonomous Systems for Space Operations

Science.gov (United States)

Gross, A. R.; Smith, B. D.; Muscettola, N.; Barrett, A.; Mjolssness, E.; Clancy, D. J.

2002-01-01

New missions of exploration and space operations will require unprecedented levels of autonomy to successfully accomplish their objectives. Inherently high levels of complexity, cost, and communication distances will preclude the degree of human involvement common to current and previous space flight missions. With exponentially increasing capabilities of computer hardware and software, including networks and communication systems, a new balance of work is being developed between humans and machines. This new balance holds the promise of not only meeting the greatly increased space exploration requirements, but simultaneously dramatically reducing the design, development, test, and operating costs. New information technologies, which take advantage of knowledge-based software, model-based reasoning, and high performance computer systems, will enable the development of a new generation of design and development tools, schedulers, and vehicle and system health management capabilities. Such tools will provide a degree of machine intelligence and associated autonomy that has previously been unavailable. These capabilities are critical to the future of advanced space operations, since the science and operational requirements specified by such missions, as well as the budgetary constraints will limit the current practice of monitoring and controlling missions by a standing army of ground-based controllers. System autonomy capabilities have made great strides in recent years, for both ground and space flight applications. Autonomous systems have flown on advanced spacecraft, providing new levels of spacecraft capability and mission safety. Such on-board systems operate by utilizing model-based reasoning that provides the capability to work from high-level mission goals, while deriving the detailed system commands internally, rather than having to have such commands transmitted from Earth. This enables missions of such complexity and communication` distances as are not

Bio-inspired computation in telecommunications

CERN Document Server

Yang, Xin-She; Ting, TO

2015-01-01

Bio-inspired computation, especially those based on swarm intelligence, has become increasingly popular in the last decade. Bio-Inspired Computation in Telecommunications reviews the latest developments in bio-inspired computation from both theory and application as they relate to telecommunications and image processing, providing a complete resource that analyzes and discusses the latest and future trends in research directions. Written by recognized experts, this is a must-have guide for researchers, telecommunication engineers, computer scientists and PhD students.

Numerical Simulation of a Tumor Growth Dynamics Model Using Particle Swarm Optimization.

Science.gov (United States)

Wang, Zhijun; Wang, Qing

Tumor cell growth models involve high-dimensional parameter spaces that require computationally tractable methods to solve. To address a proposed tumor growth dynamics mathematical model, an instance of the particle swarm optimization method was implemented to speed up the search process in the multi-dimensional parameter space to find optimal parameter values that fit experimental data from mice cancel cells. The fitness function, which measures the difference between calculated results and experimental data, was minimized in the numerical simulation process. The results and search efficiency of the particle swarm optimization method were compared to those from other evolutional methods such as genetic algorithms.

Distance-Based Behaviors for Low-Complexity Control in Multiagent Robotics

Science.gov (United States)

Pierpaoli, Pietro

Several biological examples show that living organisms cooperate to collectively accomplish tasks impossible for single individuals. More importantly, this coordination is often achieved with a very limited set of information. Inspired by these observations, research on autonomous systems has focused on the development of distributed control techniques for control and guidance of groups of autonomous mobile agents, or robots. From an engineering perspective, when coordination and cooperation is sought in large ensembles of robotic vehicles, a reduction in hardware and algorithms' complexity becomes mandatory from the very early stages of the project design. The research for solutions capable of lowering power consumption, cost and increasing reliability are thus worth investigating. In this work, we studied low-complexity techniques to achieve cohesion and control on swarms of autonomous robots. Starting from an inspiring example with two-agents, we introduced effects of neighbors' relative positions on control of an autonomous agent. The extension of this intuition addressed the control of large ensembles of autonomous vehicles, and was applied in the form of a herding-like technique. To this end, a low-complexity distance-based aggregation protocol was defined. We first showed that our protocol produced a cohesion aggregation among the agent while avoiding inter-agent collisions. Then, a feedback leader-follower architecture was introduced for the control of the swarm. We also described how proximity measures and probability of collisions with neighbors can also be used as source of information in highly populated environments.

Multiple Active Contours Driven by Particle Swarm Optimization for Cardiac Medical Image Segmentation

Science.gov (United States)

Cruz-Aceves, I.; Aviña-Cervantes, J. G.; López-Hernández, J. M.; González-Reyna, S. E.

2013-01-01

This paper presents a novel image segmentation method based on multiple active contours driven by particle swarm optimization (MACPSO). The proposed method uses particle swarm optimization over a polar coordinate system to increase the energy-minimizing capability with respect to the traditional active contour model. In the first stage, to evaluate the robustness of the proposed method, a set of synthetic images containing objects with several concavities and Gaussian noise is presented. Subsequently, MACPSO is used to segment the human heart and the human left ventricle from datasets of sequential computed tomography and magnetic resonance images, respectively. Finally, to assess the performance of the medical image segmentations with respect to regions outlined by experts and by the graph cut method objectively and quantifiably, a set of distance and similarity metrics has been adopted. The experimental results demonstrate that MACPSO outperforms the traditional active contour model in terms of segmentation accuracy and stability. PMID:23762177

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

Science.gov (United States)

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.

Selecting Optimal Feature Set in High-Dimensional Data by Swarm Search

Directory of Open Access Journals (Sweden)

Simon Fong

2013-01-01

Full Text Available Selecting the right set of features from data of high dimensionality for inducing an accurate classification model is a tough computational challenge. It is almost a NP-hard problem as the combinations of features escalate exponentially as the number of features increases. Unfortunately in data mining, as well as other engineering applications and bioinformatics, some data are described by a long array of features. Many feature subset selection algorithms have been proposed in the past, but not all of them are effective. Since it takes seemingly forever to use brute force in exhaustively trying every possible combination of features, stochastic optimization may be a solution. In this paper, we propose a new feature selection scheme called Swarm Search to find an optimal feature set by using metaheuristics. The advantage of Swarm Search is its flexibility in integrating any classifier into its fitness function and plugging in any metaheuristic algorithm to facilitate heuristic search. Simulation experiments are carried out by testing the Swarm Search over some high-dimensional datasets, with different classification algorithms and various metaheuristic algorithms. The comparative experiment results show that Swarm Search is able to attain relatively low error rates in classification without shrinking the size of the feature subset to its minimum.

A Hybrid Autonomic Computing-Based Approach to Distributed Constraint Satisfaction Problems

Directory of Open Access Journals (Sweden)

Abhishek Bhatia

2015-03-01

Full Text Available Distributed constraint satisfaction problems (DisCSPs are among the widely endeavored problems using agent-based simulation. Fernandez et al. formulated sensor and mobile tracking problem as a DisCSP, known as SensorDCSP In this paper, we adopt a customized ERE (environment, reactive rules and entities algorithm for the SensorDCSP, which is otherwise proven as a computationally intractable problem. An amalgamation of the autonomy-oriented computing (AOC-based algorithm (ERE and genetic algorithm (GA provides an early solution of the modeled DisCSP. Incorporation of GA into ERE facilitates auto-tuning of the simulation parameters, thereby leading to an early solution of constraint satisfaction. This study further contributes towards a model, built up in the NetLogo simulation environment, to infer the efficacy of the proposed approach.

Dynamic scaling in natural swarms

Science.gov (United States)

Cavagna, Andrea; Conti, Daniele; Creato, Chiara; Del Castello, Lorenzo; Giardina, Irene; Grigera, Tomas S.; Melillo, Stefania; Parisi, Leonardo; Viale, Massimiliano

2017-09-01

Collective behaviour in biological systems presents theoretical challenges beyond the borders of classical statistical physics. The lack of concepts such as scaling and renormalization is particularly problematic, as it forces us to negotiate details whose relevance is often hard to assess. In an attempt to improve this situation, we present here experimental evidence of the emergence of dynamic scaling laws in natural swarms of midges. We find that spatio-temporal correlation functions in different swarms can be rescaled by using a single characteristic time, which grows with the correlation length with a dynamical critical exponent z ~ 1, a value not found in any other standard statistical model. To check whether out-of-equilibrium effects may be responsible for this anomalous exponent, we run simulations of the simplest model of self-propelled particles and find z ~ 2, suggesting that natural swarms belong to a novel dynamic universality class. This conclusion is strengthened by experimental evidence of the presence of non-dissipative modes in the relaxation, indicating that previously overlooked inertial effects are needed to describe swarm dynamics. The absence of a purely dissipative regime suggests that natural swarms undergo a near-critical censorship of hydrodynamics.

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

Science.gov (United States)

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.

Swarm Science objectives and challenges

DEFF Research Database (Denmark)

Friis-Christensen, Eigil; Lühr, Hermann; Hulot, Gauthier

Swarm is the fifth Earth Explorer mission in ESA’s Living Planet Programme to be launched in 2009. The objective of the Swarm mission is to provide the best ever survey of the geomagnetic field and its temporal evolution. The innovative constellation concept and a unique set of dedicated instrume......Swarm is the fifth Earth Explorer mission in ESA’s Living Planet Programme to be launched in 2009. The objective of the Swarm mission is to provide the best ever survey of the geomagnetic field and its temporal evolution. The innovative constellation concept and a unique set of dedicated...... instruments will provide the necessary observations that are required to separate and model the various sources of the geomagnetic field. This will provide new insights into the Earth system by improving our understanding of the Earth’s interior and Sun-Earth connection processes....

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

Science.gov (United States)

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.

Merging the fields of swarm robotics and new media: Perceiving swarm robotics as new media

OpenAIRE

Monika O. Ivanova; Micael S. Couceiro; Fernando M. L. Martins

2014-01-01

The aim of this paper is to provide evidence that swarm robotic systems can be perceived as new media objects. A thorough description of the five principles of new media proposed by Lev Manovich in “The Language of New Media” is presented. This is complemented by a state of the art on swarm robotics with an in-depth comparison of the characteristics of both fields. Also presented are examples of swarm robotics used in new media installations in order to illustrate the cuttin...

Performance evaluation of 3D vision-based semi-autonomous control method for assistive robotic manipulator.

Science.gov (United States)

Ka, Hyun W; Chung, Cheng-Shiu; Ding, Dan; James, Khara; Cooper, Rory

2018-02-01

We developed a 3D vision-based semi-autonomous control interface for assistive robotic manipulators. It was implemented based on one of the most popular commercially available assistive robotic manipulator combined with a low-cost depth-sensing camera mounted on the robot base. To perform a manipulation task with the 3D vision-based semi-autonomous control interface, a user starts operating with a manual control method available to him/her. When detecting objects within a set range, the control interface automatically stops the robot, and provides the user with possible manipulation options through audible text output, based on the detected object characteristics. Then, the system waits until the user states a voice command. Once the user command is given, the control interface drives the robot autonomously until the given command is completed. In the empirical evaluations conducted with human subjects from two different groups, it was shown that the semi-autonomous control can be used as an alternative control method to enable individuals with impaired motor control to more efficiently operate the robot arms by facilitating their fine motion control. The advantage of semi-autonomous control was not so obvious for the simple tasks. But, for the relatively complex real-life tasks, the 3D vision-based semi-autonomous control showed significantly faster performance. Implications for Rehabilitation A 3D vision-based semi-autonomous control interface will improve clinical practice by providing an alternative control method that is less demanding physically as well cognitively. A 3D vision-based semi-autonomous control provides the user with task specific intelligent semiautonomous manipulation assistances. A 3D vision-based semi-autonomous control gives the user the feeling that he or she is still in control at any moment. A 3D vision-based semi-autonomous control is compatible with different types of new and existing manual control methods for ARMs.

Robust design of broadband EUV multilayer beam splitters based on particle swarm optimization

International Nuclear Information System (INIS)

Jiang, Hui; Michette, Alan G.

2013-01-01

A robust design idea for broadband EUV multilayer beam splitters is introduced that achieves the aim of decreasing the influence of layer thickness errors on optical performances. Such beam splitters can be used in interferometry to determine the quality of EUVL masks by comparing with a reference multilayer. In the optimization, particle swarm techniques were used for the first time in such designs. Compared to conventional genetic algorithms, particle swarm optimization has stronger ergodicity, simpler processing and faster convergence

A novel artificial fish swarm algorithm for solving large-scale reliability-redundancy application problem.

Science.gov (United States)

He, Qiang; Hu, Xiangtao; Ren, Hong; Zhang, Hongqi

2015-11-01

A novel artificial fish swarm algorithm (NAFSA) is proposed for solving large-scale reliability-redundancy allocation problem (RAP). In NAFSA, the social behaviors of fish swarm are classified in three ways: foraging behavior, reproductive behavior, and random behavior. The foraging behavior designs two position-updating strategies. And, the selection and crossover operators are applied to define the reproductive ability of an artificial fish. For the random behavior, which is essentially a mutation strategy, the basic cloud generator is used as the mutation operator. Finally, numerical results of four benchmark problems and a large-scale RAP are reported and compared. NAFSA shows good performance in terms of computational accuracy and computational efficiency for large scale RAP. Copyright © 2015 ISA. Published by Elsevier Ltd. All rights reserved.

Collective motion of a class of social foraging swarms

International Nuclear Information System (INIS)

Liu Bo; Chu Tianguang; Wang Long; Wang Zhanfeng

2008-01-01

This paper considers a class of social foraging swarms with a nutrient profile (or an attractant/repellent) and an attraction-repulsion coupling function, which is chosen to guarantee collision avoidance between individuals. The paper also studies non-identical interaction ability or efficiency among different swarm individuals for different profiles. The swarm behavior is a result of a balance between inter-individual interplays as well as the interplays of the swarm individuals (agents) with their environment. It is proved that the individuals of a quasi-reciprocal swarm will aggregate and eventually form a cohesive cluster of finite size for different profiles. It is also shown that the swarm system is completely stable, that is, every solution converges to the set of equilibrium points of the system. Moreover, all the swarm individuals will converge to more favorable areas of the profile under certain conditions. For general non-reciprocal swarms, numerical simulations show that more complex self-organized rotation may occur in the swarms

Swarm algorithms with chaotic jumps for optimization of multimodal functions

Science.gov (United States)

Krohling, Renato A.; Mendel, Eduardo; Campos, Mauro

2011-11-01

In this article, the use of some well-known versions of particle swarm optimization (PSO) namely the canonical PSO, the bare bones PSO (BBPSO) and the fully informed particle swarm (FIPS) is investigated on multimodal optimization problems. A hybrid approach which consists of swarm algorithms combined with a jump strategy in order to escape from local optima is developed and tested. The jump strategy is based on the chaotic logistic map. The hybrid algorithm was tested for all three versions of PSO and simulation results show that the addition of the jump strategy improves the performance of swarm algorithms for most of the investigated optimization problems. Comparison with the off-the-shelf PSO with local topology (l best model) has also been performed and indicates the superior performance of the standard PSO with chaotic jump over the standard both using local topology (l best model).

SWARM-BOT: Pattern Formation in a Swarm of Self-Assembling Mobile Robots

OpenAIRE

El Kamel, A.; Mellouli, K.; Borne, P.; Sahin, E.; Labella, T.H.; Trianni, V.; Deneubourg, J.-L.; Rasse, P.; Floreano, D.; Gambardella, L.M.; Mondada, F.; Nolfi, S.; Dorigo, M.

2002-01-01

In this paper we introduce a new robotic system, called swarm-bot. The system consists of a swarm of mobile robots with the ability to connect to/disconnect from each other to self-assemble into different kinds of structures. First, we describe our vision and the goals of the project. Then we present preliminary results on the formation of patterns obtained from a grid-world simulation of the system.

Nature-inspired computation in engineering

CERN Document Server

2016-01-01

This timely review book summarizes the state-of-the-art developments in nature-inspired optimization algorithms and their applications in engineering. Algorithms and topics include the overview and history of nature-inspired algorithms, discrete firefly algorithm, discrete cuckoo search, plant propagation algorithm, parameter-free bat algorithm, gravitational search, biogeography-based algorithm, differential evolution, particle swarm optimization and others. Applications include vehicle routing, swarming robots, discrete and combinatorial optimization, clustering of wireless sensor networks, cell formation, economic load dispatch, metamodeling, surrogated-assisted cooperative co-evolution, data fitting and reverse engineering as well as other case studies in engineering. This book will be an ideal reference for researchers, lecturers, graduates and engineers who are interested in nature-inspired computation, artificial intelligence and computational intelligence. It can also serve as a reference for relevant...

The Fate of Colloidal Swarms in Fractures

Science.gov (United States)

Pyrak-Nolte, L. J.; Olander, M. K.

2009-12-01

In the next 10-20 years, nano- and micro-sensor engineering will advance to the stage where sensor swarms could be deployed in the subsurface to probe rock formations and the fluids contained in them. Sensor swarms are groups of nano- or micro- sensors that are maintained as a coherent group to enable either sensor-to-sensor communication and/or coherent transmission of information as a group. The ability to maintain a swarm of sensors depends on the complexity of the flow paths in the rock, on the size and shape of the sensors and on the chemical interaction among the sensors, fluids, and rock surfaces. In this study, we investigate the effect of fracture aperture and fluid currents on the formation, evolution and break-up of colloidal swarms under gravity. Transparent cubic samples (100 mm x 100 mm x 100 mm) containing synthetic fractures with uniform and non-uniform aperture distributions were used to quantify the effect of aperture on swarm formation, swarm velocity, and swarm geometry using optical imaging. A fracture with a uniform aperture distribution was fabricated from two polished rectangular prisms of acrylic. A fracture with a non-uniform aperture distribution was created with a polished rectangular acrylic prism and an acrylic replica of an induced fracture surface from a carbonate rock. 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. 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. A swam was created when approximately 0.01 g drop of the suspension was

Elitism set based particle swarm optimization and its application

Directory of Open Access Journals (Sweden)

Yanxia Sun

2017-01-01

Full Text Available Topology plays an important role for Particle Swarm Optimization (PSO to achieve good optimization performance. It is difficult to find one topology structure for the particles to achieve better optimization performance than the others since the optimization performance not only depends on the searching abilities of the particles, also depends on the type of the optimization problems. Three elitist set based PSO algorithm without using explicit topology structure is proposed in this paper. An elitist set, which is based on the individual best experience, is used to communicate among the particles. Moreover, to avoid the premature of the particles, different statistical methods have been used in these three proposed methods. The performance of the proposed PSOs is compared with the results of the standard PSO 2011 and several PSO with different topologies, and the simulation results and comparisons demonstrate that the proposed PSO with adaptive probabilistic preference can achieve good optimization performance.

Improving Vector Evaluated Particle Swarm Optimisation by incorporating nondominated solutions.

Science.gov (United States)

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.

Pareto-Ranking Based Quantum-Behaved Particle Swarm Optimization for Multiobjective Optimization

Directory of Open Access Journals (Sweden)

Na Tian

2015-01-01

Full Text Available A study on pareto-ranking based quantum-behaved particle swarm optimization (QPSO for multiobjective optimization problems is presented in this paper. During the iteration, an external repository is maintained to remember the nondominated solutions, from which the global best position is chosen. The comparison between different elitist selection strategies (preference order, sigma value, and random selection is performed on four benchmark functions and two metrics. The results demonstrate that QPSO with preference order has comparative performance with sigma value according to different number of objectives. Finally, QPSO with sigma value is applied to solve multiobjective flexible job-shop scheduling problems.

Particle swarm genetic algorithm and its application

International Nuclear Information System (INIS)

Liu Chengxiang; Yan Changxiang; Wang Jianjun; Liu Zhenhai

2012-01-01

To solve the problems of slow convergence speed and tendency to fall into the local optimum of the standard particle swarm optimization while dealing with nonlinear constraint optimization problem, a particle swarm genetic algorithm is designed. The proposed algorithm adopts feasibility principle handles constraint conditions and avoids the difficulty of penalty function method in selecting punishment factor, generates initial feasible group randomly, which accelerates particle swarm convergence speed, and introduces genetic algorithm crossover and mutation strategy to avoid particle swarm falls into the local optimum Through the optimization calculation of the typical test functions, the results show that particle swarm genetic algorithm has better optimized performance. The algorithm is applied in nuclear power plant optimization, and the optimization results are significantly. (authors)

Transport of Particle Swarms Through Variable Aperture Fractures

Science.gov (United States)

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

Swarm Optimization-Based Magnetometer Calibration for Personal Handheld Devices

Directory of Open Access Journals (Sweden)

Naser El-Sheimy

2012-09-01

Full Text Available 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 approach based on quantum mechanics and harmonic oscillator potential well for economic load dispatch with valve-point effects

International Nuclear Information System (INIS)

Santos Coelho, Leandro dos; Mariani, Viviana Cocco

2008-01-01

Particle swarm optimization (PSO) algorithm is population-based heuristic global search algorithm inspired by social behavior patterns of organisms that live and interact within large groups. The PSO is based on researches on swarms such as fish schooling and bird flocking. Inspired by the classical PSO method and quantum mechanics theories, this work presents a quantum-inspired version of the PSO (QPSO) using the harmonic oscillator potential well (HQPSO) to solve economic dispatch problems. A 13-units test system with incremental fuel cost function that takes into account the valve-point loading effects is used to illustrate the effectiveness of the proposed HQPSO method compared with the simulation results based on the classical PSO, the QPSO, and other optimization algorithms reported in the literature

Particle swarm approach based on quantum mechanics and harmonic oscillator potential well for economic load dispatch with valve-point effects

Energy Technology Data Exchange (ETDEWEB)

dos Santos Coelho, Leandro [Pontifical Catholic University of Parana, PUCPR Industrial and Systems Engineering Graduate Program, PPGEPS, Imaculada Conceicao, 1155, Zip code 80215-901, Curitiba, PR (Brazil); Mariani, Viviana Cocco [Pontifical Catholic University of Parana, PUCPR Mechanical Engineering Graduate Program, PPGEM, Imaculada Conceicao, 1155, Zip code 80215-901, Curitiba, PR (Brazil)

2008-11-15

Particle swarm optimization (PSO) algorithm is population-based heuristic global search algorithm inspired by social behavior patterns of organisms that live and interact within large groups. The PSO is based on researches on swarms such as fish schooling and bird flocking. Inspired by the classical PSO method and quantum mechanics theories, this work presents a quantum-inspired version of the PSO (QPSO) using the harmonic oscillator potential well (HQPSO) to solve economic dispatch problems. A 13-units test system with incremental fuel cost function that takes into account the valve-point loading effects is used to illustrate the effectiveness of the proposed HQPSO method compared with the simulation results based on the classical PSO, the QPSO, and other optimization algorithms reported in the literature. (author)

Particle swarm approach based on quantum mechanics and harmonic oscillator potential well for economic load dispatch with valve-point effects

Energy Technology Data Exchange (ETDEWEB)

Santos Coelho, Leandro dos [Pontifical Catholic University of Parana, PUCPR Industrial and Systems Engineering Graduate Program, PPGEPS, Imaculada Conceicao, 1155, Zip code 80215-901, Curitiba, PR (Brazil)], E-mail: leandro.coelho@pucpr.br; Mariani, Viviana Cocco [Pontifical Catholic University of Parana, PUCPR Mechanical Engineering Graduate Program, PPGEM, Imaculada Conceicao, 1155, Zip code 80215-901, Curitiba, PR (Brazil)], E-mail: viviana.mariani@pucpr.br

2008-11-15

Particle swarm optimization (PSO) algorithm is population-based heuristic global search algorithm inspired by social behavior patterns of organisms that live and interact within large groups. The PSO is based on researches on swarms such as fish schooling and bird flocking. Inspired by the classical PSO method and quantum mechanics theories, this work presents a quantum-inspired version of the PSO (QPSO) using the harmonic oscillator potential well (HQPSO) to solve economic dispatch problems. A 13-units test system with incremental fuel cost function that takes into account the valve-point loading effects is used to illustrate the effectiveness of the proposed HQPSO method compared with the simulation results based on the classical PSO, the QPSO, and other optimization algorithms reported in the literature.

A New Approach for Flexible Molecular Docking Based on Swarm Intelligence

Directory of Open Access Journals (Sweden)

Yi Fu

2015-01-01

Full Text Available Molecular docking methods play an important role in the field of computer-aided drug design. In the work, on the basis of the molecular docking program AutoDock, we present QLDock as a tool for flexible molecular docking. For the energy evaluation, the algorithm uses the binding free energy function that is provided by the AutoDock 4.2 tool. The new search algorithm combines the features of a quantum-behaved particle swarm optimization (QPSO algorithm and local search method of Solis and Wets for solving the highly flexible protein-ligand docking problem. We compute the interaction of 23 protein-ligand complexes and compare the results with those of the QDock and AutoDock programs. The experimental results show that our approach leads to substantially lower docking energy and higher docking precision in comparison to Lamarckian genetic algorithm and QPSO algorithm alone. QPSO-ls algorithm was able to identify the correct binding mode of 74% of the complexes. In comparison, the accuracy of QPSO and LGA is 52% and 61%, respectively. This difference in performance rises with increasing complexity of the ligand. Thus, the novel algorithm QPSO-ls may be used to dock ligand with many rotatable bonds with high accuracy.

Automated Search-Based Robustness Testing for Autonomous Vehicle Software

Directory of Open Access Journals (Sweden)

Kevin M. Betts

2016-01-01

Full Text Available Autonomous systems must successfully operate in complex time-varying spatial environments even when dealing with system faults that may occur during a mission. Consequently, evaluating the robustness, or ability to operate correctly under unexpected conditions, of autonomous vehicle control software is an increasingly important issue in software testing. New methods to automatically generate test cases for robustness testing of autonomous vehicle control software in closed-loop simulation are needed. Search-based testing techniques were used to automatically generate test cases, consisting of initial conditions and fault sequences, intended to challenge the control software more than test cases generated using current methods. Two different search-based testing methods, genetic algorithms and surrogate-based optimization, were used to generate test cases for a simulated unmanned aerial vehicle attempting to fly through an entryway. The effectiveness of the search-based methods in generating challenging test cases was compared to both a truth reference (full combinatorial testing and the method most commonly used today (Monte Carlo testing. The search-based testing techniques demonstrated better performance than Monte Carlo testing for both of the test case generation performance metrics: (1 finding the single most challenging test case and (2 finding the set of fifty test cases with the highest mean degree of challenge.

Gene expression in Pseudomonas aeruginosa swarming motility

Directory of Open Access Journals (Sweden)

Déziel Eric

2010-10-01

Full Text Available Abstract Background The bacterium Pseudomonas aeruginosa is capable of three types of motilities: swimming, twitching and swarming. The latter is characterized by a fast and coordinated group movement over a semi-solid surface resulting from intercellular interactions and morphological differentiation. A striking feature of swarming motility is the complex fractal-like patterns displayed by migrating bacteria while they move away from their inoculation point. This type of group behaviour is still poorly understood and its characterization provides important information on bacterial structured communities such as biofilms. Using GeneChip® Affymetrix microarrays, we obtained the transcriptomic profiles of both bacterial populations located at the tip of migrating tendrils and swarm center of swarming colonies and compared these profiles to that of a bacterial control population grown on the same media but solidified to not allow swarming motility. Results Microarray raw data were corrected for background noise with the RMA algorithm and quantile normalized. Differentially expressed genes between the three conditions were selected using a threshold of 1.5 log2-fold, which gave a total of 378 selected genes (6.3% of the predicted open reading frames of strain PA14. Major shifts in gene expression patterns are observed in each growth conditions, highlighting the presence of distinct bacterial subpopulations within a swarming colony (tendril tips vs. swarm center. Unexpectedly, microarrays expression data reveal that a minority of genes are up-regulated in tendril tip populations. Among them, we found energy metabolism, ribosomal protein and transport of small molecules related genes. On the other hand, many well-known virulence factors genes were globally repressed in tendril tip cells. Swarm center cells are distinct and appear to be under oxidative and copper stress responses. Conclusions Results reported in this study show that, as opposed to

Particle swarm optimization using multi-information characteristics of all personal-best information.

Science.gov (United States)

Huang, Song; Tian, Na; Wang, Yan; Ji, Zhicheng

2016-01-01

Convergence stagnation is the chief difficulty to solve hard optimization problems for most particle swarm optimization variants. To address this issue, a novel particle swarm optimization using multi-information characteristics of all personal-best information is developed in our research. In the modified algorithm, two positions are defined by personal-best positions and an improved cognition term with three positions of all personal-best information is used in velocity update equation to enhance the search capability. This strategy could make particles fly to a better direction by discovering useful information from all the personal-best positions. The validity of the proposed algorithm is assessed on twenty benchmark problems including unimodal, multimodal, rotated and shifted functions, and the results are compared with that obtained by some published variants of particle swarm optimization in the literature. Computational results demonstrate that the proposed algorithm finds several global optimum and high-quality solutions in most case with a fast convergence speed.

Towards CHAOS-5 - How can Swarm contribute?

DEFF Research Database (Denmark)

Finlay, Chris; Olsen, Nils; Tøffner-Clausen, Lars

2014-01-01

The launch of ESA's satellite trio Swarm in November 2013 opens an exciting new chapter in the observation and monitoring of Earth's magnetic field from space. We report preliminary results from an extension of the CHAOS series of geomagnetic field models to include both scalar and vector field...... observations from the three Swarm satellites, along with the most recent quasi-definitive ground observatory data. The fit of this new update CHAOS field model to the Swarm observations will be presented in detail providing useful insight the initial Swarm data. Enhancements of the CHAOS modelling scheme...

System and method of self-properties for an autonomous and automatic computer environment

Science.gov (United States)

Hinchey, Michael G. (Inventor); Sterritt, Roy (Inventor)

2010-01-01

Systems, methods and apparatus are provided through which in some embodiments self health/urgency data and environment health/urgency data may be transmitted externally from an autonomic element. Other embodiments may include transmitting the self health/urgency data and environment health/urgency data together on a regular basis similar to the lub-dub of a heartbeat. Yet other embodiments may include a method for managing a system based on the functioning state and operating status of the system, wherein the method may include processing received signals from the system indicative of the functioning state and the operating status to obtain an analysis of the condition of the system, generating one or more stay alive signals based on the functioning status and the operating state of the system, transmitting the stay-alive signal, transmitting self health/urgency data, and transmitting environment health/urgency data. Still other embodiments may include an autonomic element that includes a self monitor, a self adjuster, an environment monitor, and an autonomic manager.

Application of Swarm Intelligence Based Routingprotocols for Wireless Adhoc Sensor Network

Directory of Open Access Journals (Sweden)

Mrutyunjaya PANDA

2011-07-01

Full Text Available The enormous growth of wireless sensor network (WSN research has opined challenges about their ease in implementation and performance evaluation. Efficient swarm intelligence based routing protocols that can be used to obtain the application specific service guarantee are the key design issues in designing a WSN model. In this paper, an experimental testbed is designed with 100 sensor nodes deployed in a dense environment to address the scalability and performance issues of WSN. In this paper, we use Flooded Piggyback (FP and SC-MCBR ant colony based routing along with AODV and MCBR Tree in order to design an efficient WSN model. Finally, simulation results are presented with various performance measures to understand the efficacy of the proposed WSN design.

Perception, Planning, Control, and Coordination for Autonomous Vehicles

Directory of Open Access Journals (Sweden)

Scott Drew Pendleton

2017-02-01

Full Text Available Autonomous vehicles are expected to play a key role in the future of urban transportation systems, as they offer potential for additional safety, increased productivity, greater accessibility, better road efficiency, and positive impact on the environment. Research in autonomous systems has seen dramatic advances in recent years, due to the increases in available computing power and reduced cost in sensing and computing technologies, resulting in maturing technological readiness level of fully autonomous vehicles. The objective of this paper is to provide a general overview of the recent developments in the realm of autonomous vehicle software systems. Fundamental components of autonomous vehicle software are reviewed, and recent developments in each area are discussed.

Complex emergent dynamics of anisotropic swarms: Convergence vs oscillation

International Nuclear Information System (INIS)

Chu Tianguang; Wang Long; Chen Tongwen; Mu Shumei

2006-01-01

This paper considers an anisotropic swarm model with a simple attraction and repulsion function. It is shown that the members of a reciprocal swarm will aggregate and eventually form a cohesive cluster of finite size around the swarm center. Moreover, the swarm system is also completely stable, i.e., every solution converges to the set of equilibrium points of the system. These results are also valid for a class of non-reciprocal swarms under the detailed balance condition on coupling weights. For general non-reciprocal swarms, numerical simulations are worked out to demonstrate more complex oscillatory motions in the systems. The study provides further insight into the effect of the interaction pattern on the collective behavior of a swarm system

Improving Vector Evaluated Particle Swarm Optimisation by Incorporating Nondominated Solutions

Directory of Open Access Journals (Sweden)

Kian Sheng Lim

2013-01-01

Full Text Available 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.

Autonomous entropy-based intelligent experimental design

Science.gov (United States)

Malakar, Nabin Kumar

2011-07-01

The aim of this thesis is to explore the application of probability and information theory in experimental design, and to do so in a way that combines what we know about inference and inquiry in a comprehensive and consistent manner. Present day scientific frontiers involve data collection at an ever-increasing rate. This requires that we find a way to collect the most relevant data in an automated fashion. By following the logic of the scientific method, we couple an inference engine with an inquiry engine to automate the iterative process of scientific learning. The inference engine involves Bayesian machine learning techniques to estimate model parameters based upon both prior information and previously collected data, while the inquiry engine implements data-driven exploration. By choosing an experiment whose distribution of expected results has the maximum entropy, the inquiry engine selects the experiment that maximizes the expected information gain. The coupled inference and inquiry engines constitute an autonomous learning method for scientific exploration. We apply it to a robotic arm to demonstrate the efficacy of the method. Optimizing inquiry involves searching for an experiment that promises, on average, to be maximally informative. If the set of potential experiments is described by many parameters, the search involves a high-dimensional entropy space. In such cases, a brute force search method will be slow and computationally expensive. We develop an entropy-based search algorithm, called nested entropy sampling, to select the most informative experiment. This helps to reduce the number of computations necessary to find the optimal experiment. We also extended the method of maximizing entropy, and developed a method of maximizing joint entropy so that it could be used as a principle of collaboration between two robots. This is a major achievement of this thesis, as it allows the information-based collaboration between two robotic units towards a same

Swarm: ESA's Magnetic Field Mission

Science.gov (United States)

Plank, G.; Floberghagen, R.; Menard, Y.; Haagmans, R.

2013-12-01

Swarm is the fifth Earth Explorer mission in ESA's Living Planet Programme, and is scheduled for launch in fall 2013. The objective of the Swarm mission is to provide the best-ever survey of the geomagnetic field and its temporal evolution using a constellation of three identical satellites. The mission shall deliver data that allow access to new insights into the Earth system by improved scientific understanding of the Earth's interior and near-Earth electromagnetic environment. After launch and triple satellite release at an initial altitude of about 490 km, a pair of the satellites will fly side-by-side with slowly decaying altitude, while the third satellite will be lifted to 530 km to complete the Swarm constellation. High-precision and high-resolution measurements of the strength, direction and variation of the magnetic field, complemented by precise navigation, accelerometer and electric field measurements, will provide the observations required to separate and model various sources of the geomagnetic field and near-Earth current systems. The mission science goals are to provide a unique view into Earth's core dynamics, mantle conductivity, crustal magnetisation, ionospheric and magnetospheric current systems and upper atmosphere dynamics - ranging from understanding the geodynamo to contributing to space weather. The scientific objectives and results from recent scientific studies will be presented. In addition the current status of the project, which is presently in the final stage of the development phase, will be addressed. A consortium of European scientific institutes is developing a distributed processing system to produce geophysical (Level 2) data products for the Swarm user community. The setup of the Swarm ground segment and the contents of the data products will be addressed. In case the Swarm satellites are already in orbit, a summary of the on-going mission operations activities will be given. More information on Swarm can be found at www.esa.int/esaLP/LPswarm.html.

Algorithmic requirements for swarm intelligence in differently coupled collective systems

International Nuclear Information System (INIS)

Stradner, Jürgen; Thenius, Ronald; Zahadat, Payam; Hamann, Heiko; Crailsheim, Karl; Schmickl, Thomas

2013-01-01

Swarm systems are based on intermediate connectivity between individuals and dynamic neighborhoods. In natural swarms self-organizing principles bring their agents to that favorable level of connectivity. They serve as interesting sources of inspiration for control algorithms in swarm robotics on the one hand, and in modular robotics on the other hand. In this paper we demonstrate and compare a set of bio-inspired algorithms that are used to control the collective behavior of swarms and modular systems: BEECLUST, AHHS (hormone controllers), FGRN (fractal genetic regulatory networks), and VE (virtual embryogenesis). We demonstrate how such bio-inspired control paradigms bring their host systems to a level of intermediate connectivity, what delivers sufficient robustness to these systems for collective decentralized control. In parallel, these algorithms allow sufficient volatility of shared information within these systems to help preventing local optima and deadlock situations, this way keeping those systems flexible and adaptive in dynamic non-deterministic environments

Estimation of Valve Stiction Using Particle Swarm Optimization

Directory of Open Access Journals (Sweden)

S. Sivagamasundari

2011-06-01

Full Text Available This paper presents a procedure for quantifying valve stiction in control loops based on particle swarm optimization. Measurements of the Process Variable (PV and Controller Output (OP are used to estimate the parameters of a Hammerstein system, consisting of connection of a non linear control valve stiction model and a linear process model. The parameters of the Hammerstein model are estimated using particle swarm optimization, from the input-output data by minimizing the error between the true model output and the identified model output. Using particle swarm optimization, Hammerstein models with known nonlinear structure and unknown parameters can be identified. A cost-effective optimization technique is adopted to find the best valve stiction models representing a more realistic valve behavior in the oscillating loop. Simulation and practical laboratory control system results are included, which demonstrates the effectiveness and robustness of the identification scheme.

Investigating the effect of the reality gap on the human psychophysiological state in the context of human-swarm interaction

Directory of Open Access Journals (Sweden)

Gaëtan Podevijn

2016-09-01

Full Text Available The reality gap is the discrepancy between simulation and reality—the same behavioural algorithm results in different robot swarm behaviours in simulation and in reality (with real robots. In this paper, we study the effect of the reality gap on the psychophysiological reactions of humans interacting with a robot swarm. We compare the psychophysiological reactions of 28 participants interacting with a simulated robot swarm and with a real (non-simulated robot swarm. Our results show that a real robot swarm provokes stronger reactions in our participants than a simulated robot swarm. We also investigate how to mitigate the effect of the reality gap (i.e., how to diminish the difference in the psychophysiological reactions between reality and simulation by comparing psychophysiological reactions in simulation displayed on a computer screen and psychophysiological reactions in simulation displayed in virtual reality. Our results show that our participants tend to have stronger psychophysiological reactions in simulation displayed in virtual reality (suggesting a potential way of diminishing the effect of the reality gap.

Lifecycle-Based Swarm Optimization Method for Numerical Optimization

Directory of Open Access Journals (Sweden)

Hai Shen

2014-01-01

Full Text Available Bioinspired optimization algorithms have been widely used to solve various scientific and engineering problems. Inspired by biological lifecycle, this paper presents a novel optimization algorithm called lifecycle-based swarm optimization (LSO. Biological lifecycle includes four stages: birth, growth, reproduction, and death. With this process, even though individual organism died, the species will not perish. Furthermore, species will have stronger ability of adaptation to the environment and achieve perfect evolution. LSO simulates Biological lifecycle process through six optimization operators: chemotactic, assimilation, transposition, crossover, selection, and mutation. In addition, the spatial distribution of initialization population meets clumped distribution. Experiments were conducted on unconstrained benchmark optimization problems and mechanical design optimization problems. Unconstrained benchmark problems include both unimodal and multimodal cases the demonstration of the optimal performance and stability, and the mechanical design problem was tested for algorithm practicability. The results demonstrate remarkable performance of the LSO algorithm on all chosen benchmark functions when compared to several successful optimization techniques.

Development of an autonomous power system testbed

International Nuclear Information System (INIS)

Barton, J.R.; Adams, T.; Liffring, M.E.

1985-01-01

A power system testbed has been assembled to advance the development of large autonomous electrical power systems required for the space station, spacecraft, and aircraft. The power system for this effort was designed to simulate single- or dual-bus autonomous power systems, or autonomous systems that reconfigure from a single bus to a dual bus following a severe fault. The approach taken was to provide a flexible power system design with two computer systems for control and management. One computer operates as the control system and performs basic control functions, data and command processing, charge control, and provides status to the second computer. The second computer contains expert system software for mission planning, load management, fault identification and recovery, and sends load and configuration commands to the control system

Seismicity And Accretion Process Along The North Mid-Atlantic Ridge From The SIRENA Autonomous Hydrophone Data

Science.gov (United States)

Perrot, J.; Goslin, J.; Dziak, R. P.; Haxel, J. H.; Maia, M. A.; Tisseau, C.; Royer, J.

2009-12-01

The seismicity of the North Atlantic Ocean was recorded by the SIRENA array of 6 autonomous underwater hydrophones (AUH) moored within the SOFAR channel on the flanks of the Mid-Atlantic Ridge (MAR). The instruments were deployed north of the Azores Plateau between 40° and 50°N from June 2002 to September 2003. The low attenuation properties of the SOFAR channel for earthquake T-wave propagation result in a detection threshold reduction to a magnitude completeness level (Mc) of ~2.8, to be compared to a Mc~4.7 for MAR events recorded by land-based seismic networks. A spatio-temporal analysis was performed over the 1696 events localized inside the SIRENA array. For hydrophone-derived catalogs, the acoustic magnitude, or Source Level (SL), is used as a measure of earthquake size. The ''source level completeness'', above which the data set is complete, is SLc=208 dB. The SIRENA catalog was searched for swarms using the cluster software of the SEISAN distribution. A minimum SL of 210 dB was chosen to detect a possible mainshock, and all subsequent events within 40 days following the possible mainshock, located within a radius of 15 km from the mainshock were considered as events of the swarm. 15 km correspond to the maximum fault length in a slow-ridge context. 11 swarms with more than 15 events were detected along the MAR between 40°et 50°N during the SIRENA deployment. The maximum number of earthquakes in a swarm is 40 events. The SL vs. time distribution within each swarm allowed a first discrimination between the swarms occurring in a tectonic context and those which can be attributed to volcanic processes, the latter showing a more constant SL vs. time distribution. Moreover, the swarms occurring in a tectonic context show a "mainshock-afterschock" distribution of the cumulative number of events vs. time, fitting a Modified Omori Law. The location of tectonic and volcanic swarms correlates well with regions where a positive and negative Mantle Bouguer

Particle Swarm Social Adaptive Model for Multi-Agent Based Insurgency Warfare Simulation

Energy Technology Data Exchange (ETDEWEB)

Cui, Xiaohui [ORNL; Potok, Thomas E [ORNL

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 not the necessary requirements for insurgents to efficiently attain their objective.

On the performance of accelerated particle swarm optimization for charging plug-in hybrid electric vehicles

Directory of Open Access Journals (Sweden)

Imran Rahman

2016-03-01

Full Text Available Transportation electrification has undergone major changes since the last decade. Success of smart grid with renewable energy integration solely depends upon the large-scale penetration of plug-in hybrid electric vehicles (PHEVs for a sustainable and carbon-free transportation sector. One of the key performance indicators in hybrid electric vehicle is the State-of-Charge (SoC which needs to be optimized for the betterment of charging infrastructure using stochastic computational methods. In this paper, a newly emerged Accelerated particle swarm optimization (APSO technique was applied and compared with standard particle swarm optimization (PSO considering charging time and battery capacity. Simulation results obtained for maximizing the highly nonlinear objective function indicate that APSO achieves some improvements in terms of best fitness and computation time.

Predator confusion is sufficient to evolve swarming behaviour

OpenAIRE

Olson, Randal S.; Hintze, Arend; Dyer, Fred C.; Knoester, David B.; Adami, Christoph

2013-01-01

Swarming behaviours in animals have been extensively studied owing to their implications for the evolution of cooperation, social cognition and predator–prey dynamics. An important goal of these studies is discerning which evolutionary pressures favour the formation of swarms. One hypothesis is that swarms arise because the presence of multiple moving prey in swarms causes confusion for attacking predators, but it remains unclear how important this selective force is. Using an evolutionary mo...

Predator confusion is sufficient to evolve swarming behavior

OpenAIRE

Olson, Randal S.; Hintze, Arend; Dyer, Fred C.; Knoester, David B.; Adami, Christoph

2012-01-01

Swarming behaviors in animals have been extensively studied due to their implications for the evolution of cooperation, social cognition, and predator-prey dynamics. An important goal of these studies is discerning which evolutionary pressures favor the formation of swarms. One hypothesis is that swarms arise because the presence of multiple moving prey in swarms causes confusion for attacking predators, but it remains unclear how important this selective force is. Using an evolutionary model...

Knowledge-based and integrated monitoring and diagnosis in autonomous power systems

Science.gov (United States)

Momoh, J. A.; Zhang, Z. Z.

1990-01-01

A new technique of knowledge-based and integrated monitoring and diagnosis (KBIMD) to deal with abnormalities and incipient or potential failures in autonomous power systems is presented. The KBIMD conception is discussed as a new function of autonomous power system automation. Available diagnostic modelling, system structure, principles and strategies are suggested. In order to verify the feasibility of the KBIMD, a preliminary prototype expert system is designed to simulate the KBIMD function in a main electric network of the autonomous power system.

Identifying Interacting Genetic Variations by Fish-Swarm Logic Regression

Science.gov (United States)

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

Identifying Interacting Genetic Variations by Fish-Swarm Logic Regression

Directory of Open Access Journals (Sweden)

Xuanping Zhang

2013-01-01

Full Text Available 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.

Particle swarm optimization based feature enhancement and feature selection for improved emotion recognition in speech and glottal signals.

Science.gov (United States)

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.

Investigation of Evolutionary Pheromone Communication Based on External Measurement and Emergence of Swarm Intelligence

OpenAIRE

川村, 秀憲; 山本, 雅人; 大内, 東

2001-01-01

In this paper, we focus on the emergence phenomenon related with artificial pheromone communication and swarm intelligence among many agents in Ants War environment, in which two colonies of artificial ant agents compete for the limited number of food items in order to survive in evolutionary process. The purpose of this research is to clarify the emerging process of communication and the relationship between communication and swarm intelligence. For investigation of communication, we introdu...

A multi-agent decentralized energy management system based on distributed intelligence for the design and control of autonomous polygeneration microgrids

International Nuclear Information System (INIS)

Karavas, Christos-Spyridon; Kyriakarakos, George; Arvanitis, Konstantinos G.; Papadakis, George

2015-01-01

Highlights: • A decentralized energy management system based on multi agent systems theory. • A decentralized energy management system is technically feasible. • A decentralized approach utilizes the devices better than a centralized one. • A decentralized energy management system is economically competitive. - Abstract: The autonomous polygeneration microgrid topology has been developed in order to cover holistically needs in a remote area such as electrical energy, space heating and cooling, potable water through desalination and hydrogen as fuel for transportation. The existence of an advanced energy management system is essential for the operation of an autonomous polygeneration microgrid. So far, energy management systems based on a centralized management and control have been developed for the autonomous polygeneration microgrid topology based on computational intelligence approaches. A decentralized management and control energy management system can have important benefits, when taking into consideration the autonomous character of these microgrids. This paper presents the design and investigation of a decentralized energy management system for the autonomous polygeneration microgrid topology. The decentralized energy management system gives the possibility to control each unit of the microgrid independently. The most important advantage of using a decentralized architecture is that the managed microgrid has much higher chances of partial operation in cases when malfunctions occur at different parts of it, instead of a complete system breakdown. The designed system was based on a multi-agent system and employed Fuzzy Cognitive Maps for its implementation. It was then compared through a case study with an existing centralized energy management system. The technical performance of the decentralized solution performance is on par with the existing centralized one, presenting improvements in financial and operational terms for the implementation and

A science-based executive for autonomous planetary vehicles

Science.gov (United States)

Peters, S.

2001-01-01

If requests for scientific observations, rather than specific plans, are uplinked to an autonomous execution system on the vehicle, it would be able to adjust its execution based upon actual performance. Such a science-based executive control system had been developed and demonstrated for the Rocky7 research rover.

A Particle Swarm Optimization of Natural Ventilation Parameters in a Greenhouse with Continuous Roof Vents

Directory of Open Access Journals (Sweden)

Abdelhafid HASNI

2009-03-01

Full Text Available Although natural ventilation plays an important role in the affecting greenhouse climate, as defined by temperature, humidity and CO2 concentration, particularly in Mediterranean countries, little information and data are presently available on full-scale greenhouse ventilation mechanisms. In this paper, we present a new method for selecting the parameters based on a particle swarm optimization (PSO algorithm which optimize the choice of parameters by minimizing a cost function. The simulator was based on a published model with some minor modifications as we were interested in the parameter of ventilation. The function is defined by a reduced model that could be used to simulate and predict the greenhouse environment, as well as the tuning methods to compute their parameters. This study focuses on the dynamic behavior of the inside air temperature and humidity during ventilation. Our approach is validated by comparison with some experimental results. Various experimental techniques were used to make full-scale measurements of the air exchange rate in a 400 m2 plastic greenhouse. The model which we propose based on natural ventilation parameters optimized by a particle swarm optimization was compared with the measurements results.

Feature Selection and Parameter Optimization of Support Vector Machines Based on Modified Artificial Fish Swarm Algorithms

Directory of Open Access Journals (Sweden)

Kuan-Cheng Lin

2015-01-01

Full Text Available Rapid advances in information and communication technology have made ubiquitous computing and the Internet of Things popular and practicable. These applications create enormous volumes of data, which are available for analysis and classification as an aid to decision-making. Among the classification methods used to deal with big data, feature selection has proven particularly effective. One common approach involves searching through a subset of the features that are the most relevant to the topic or represent the most accurate description of the dataset. Unfortunately, searching through this kind of subset is a combinatorial problem that can be very time consuming. Meaheuristic algorithms are commonly used to facilitate the selection of features. The artificial fish swarm algorithm (AFSA employs the intelligence underlying fish swarming behavior as a means to overcome optimization of combinatorial problems. AFSA has proven highly successful in a diversity of applications; however, there remain shortcomings, such as the likelihood of falling into a local optimum and a lack of multiplicity. This study proposes a modified AFSA (MAFSA to improve feature selection and parameter optimization for support vector machine classifiers. Experiment results demonstrate the superiority of MAFSA in classification accuracy using subsets with fewer features for given UCI datasets, compared to the original FASA.

Scaling and spatial complementarity of tectonic earthquake swarms

KAUST Repository

Passarelli, Luigi

2017-11-10

Tectonic earthquake swarms (TES) often coincide with aseismic slip and sometimes precede damaging earthquakes. In spite of recent progress in understanding the significance and properties of TES at plate boundaries, their mechanics and scaling are still largely uncertain. Here we evaluate several TES that occurred during the past 20 years on a transform plate boundary in North Iceland. We show that the swarms complement each other spatially with later swarms discouraged from fault segments activated by earlier swarms, which suggests efficient strain release and aseismic slip. The fault area illuminated by earthquakes during swarms may be more representative of the total moment release than the cumulative moment of the swarm earthquakes. We use these findings and other published results from a variety of tectonic settings to discuss general scaling properties for TES. The results indicate that the importance of TES in releasing tectonic strain at plate boundaries may have been underestimated.

A measurement-based fault detection approach applied to monitor robots swarm

KAUST Repository

Khaldi, Belkacem; Harrou, Fouzi; Sun, Ying; Cherif, Foudil

2017-01-01

present an innovative data-driven fault detection method for monitoring robots swarm. The method combines the flexibility of principal component analysis (PCA) models and the greater sensitivity of the exponentially-weighted moving average control chart

AN AUTONOMOUS GPS-DENIED UNMANNED VEHICLE PLATFORM BASED ON BINOCULAR VISION FOR PLANETARY EXPLORATION

Directory of Open Access Journals (Sweden)

M. Qin

2018-04-01

Full Text Available Vision-based navigation has become an attractive solution for autonomous navigation for planetary exploration. This paper presents our work of designing and building an autonomous vision-based GPS-denied unmanned vehicle and developing an ARFM (Adaptive Robust Feature Matching based VO (Visual Odometry software for its autonomous navigation. The hardware system is mainly composed of binocular stereo camera, a pan-and tilt, a master machine, a tracked chassis. And the ARFM-based VO software system contains four modules: camera calibration, ARFM-based 3D reconstruction, position and attitude calculation, BA (Bundle Adjustment modules. Two VO experiments were carried out using both outdoor images from open dataset and indoor images captured by our vehicle, the results demonstrate that our vision-based unmanned vehicle is able to achieve autonomous localization and has the potential for future planetary exploration.

An Autonomous Gps-Denied Unmanned Vehicle Platform Based on Binocular Vision for Planetary Exploration

Science.gov (United States)

Qin, M.; Wan, X.; Shao, Y. Y.; Li, S. Y.

2018-04-01

Vision-based navigation has become an attractive solution for autonomous navigation for planetary exploration. This paper presents our work of designing and building an autonomous vision-based GPS-denied unmanned vehicle and developing an ARFM (Adaptive Robust Feature Matching) based VO (Visual Odometry) software for its autonomous navigation. The hardware system is mainly composed of binocular stereo camera, a pan-and tilt, a master machine, a tracked chassis. And the ARFM-based VO software system contains four modules: camera calibration, ARFM-based 3D reconstruction, position and attitude calculation, BA (Bundle Adjustment) modules. Two VO experiments were carried out using both outdoor images from open dataset and indoor images captured by our vehicle, the results demonstrate that our vision-based unmanned vehicle is able to achieve autonomous localization and has the potential for future planetary exploration.

Wavefront Propagation and Fuzzy Based Autonomous Navigation

Directory of Open Access Journals (Sweden)

Adel Al-Jumaily

2005-06-01

Full Text Available Path planning and obstacle avoidance are the two major issues in any navigation system. Wavefront propagation algorithm, as a good path planner, can be used to determine an optimal path. Obstacle avoidance can be achieved using possibility theory. Combining these two functions enable a robot to autonomously navigate to its destination. This paper presents the approach and results in implementing an autonomous navigation system for an indoor mobile robot. The system developed is based on a laser sensor used to retrieve data to update a two dimensional world model of therobot environment. Waypoints in the path are incorporated into the obstacle avoidance. Features such as ageing of objects and smooth motion planning are implemented to enhance efficiency and also to cater for dynamic environments.

Computing energy-optimal trajectories for an autonomous underwater vehicle using direct shooting

Directory of Open Access Journals (Sweden)

Inge Spangelo

1992-07-01

Full Text Available Energy-optimal trajectories for an autonomous underwater vehicle can be computed using a numerical solution of the optimal control problem. The vehicle is modeled with the six dimensional nonlinear and coupled equations of motion, controlled with DC-motors in all degrees of freedom. The actuators are modeled and controlled with velocity loops. The dissipated energy is expressed in terms of the control variables as a nonquadratic function. Direct shooting methods, including control vector parameterization (CVP arc used in this study. Numerical calculations are performed and good results are achieved.

Two-stage simplified swarm optimization for the redundancy allocation problem in a multi-state bridge system

International Nuclear Information System (INIS)

Lai, Chyh-Ming; Yeh, Wei-Chang

2016-01-01

The redundancy allocation problem involves configuring an optimal system structure with high reliability and low cost, either by alternating the elements with more reliable elements and/or by forming them redundantly. The multi-state bridge system is a special redundancy allocation problem and is commonly used in various engineering systems for load balancing and control. Traditional methods for redundancy allocation problem cannot solve multi-state bridge systems efficiently because it is impossible to transfer and reduce a multi-state bridge system to series and parallel combinations. Hence, a swarm-based approach called two-stage simplified swarm optimization is proposed in this work to effectively and efficiently solve the redundancy allocation problem in a multi-state bridge system. For validating the proposed method, two experiments are implemented. The computational results indicate the advantages of the proposed method in terms of solution quality and computational efficiency. - Highlights: • Propose two-stage SSO (SSO_T_S) to deal with RAP in multi-state bridge system. • Dynamic upper bound enhances the efficiency of searching near-optimal solution. • Vector-update stages reduces the problem dimensions. • Statistical results indicate SSO_T_S is robust both in solution quality and runtime.

A Diversity-Guided Particle Swarm Optimizer - the ARPSO

DEFF Research Database (Denmark)

Vesterstrøm, Jacob Svaneborg; Riget, Jacques

2002-01-01

The particle swarm optimization (PSO) algorithm is a new population based search strat- egy, which has exhibited good performance on well-known numerical test problems. How- ever, on strongly multi-modal test problems the PSO tends to suffer from premature convergence. This is due to a decrease...... that the ARPSO prevents premature convergence to a high degree, but still keeps a rapid convergence like the basic PSO. Thus, it clearly outperforms the basic PSO as well as the implemented GA in multi-modal optimization. Keywords Particle Swarm Optimization, Diversity-Guided Search 1 Introduction The PSO model...

Modeling and Flocking Consensus Analysis for Large-Scale UAV Swarms

Directory of Open Access Journals (Sweden)

Li Bing

2013-01-01

Full Text Available Recently, distributed coordination control of the unmanned aerial vehicle (UAV swarms has been a particularly active topic in intelligent system field. In this paper, through understanding the emergent mechanism of the complex system, further research on the flocking and the dynamic characteristic of UAV swarms will be given. Firstly, this paper analyzes the current researches and existent problems of UAV swarms. Afterwards, by the theory of stochastic process and supplemented variables, a differential-integral model is established, converting the system model into Volterra integral equation. The existence and uniqueness of the solution of the system are discussed. Then the flocking control law is given based on artificial potential with system consensus. At last, we analyze the stability of the proposed flocking control algorithm based on the Lyapunov approach and prove that the system in a limited time can converge to the consensus direction of the velocity. Simulation results are provided to verify the conclusion.

SOLVING ENGINEERING OPTIMIZATION PROBLEMS WITH THE SWARM INTELLIGENCE METHODS

Directory of Open Access Journals (Sweden)

V. Panteleev Andrei

2017-01-01

Full Text Available An important stage in problem solving process for aerospace and aerostructures designing is calculating their main charac- teristics optimization. The results of the four constrained optimization problems related to the design of various technical systems: such as determining the best parameters of welded beams, pressure vessel, gear, spring are presented. The purpose of each task is to minimize the cost and weight of the construction. The object functions in optimization practical problem are nonlinear functions with a lot of variables and a complex layer surface indentations. That is why using classical approach for extremum seeking is not efficient. Here comes the necessity of using such methods of optimization that allow to find a near optimal solution in acceptable amount of time with the minimum waste of computer power. Such methods include the methods of Swarm Intelligence: spiral dy- namics algorithm, stochastic diffusion search, hybrid seeker optimization algorithm. The Swarm Intelligence methods are designed in such a way that a swarm consisting of agents carries out the search for extremum. In search for the point of extremum, the parti- cles exchange information and consider their experience as well as the experience of population leader and the neighbors in some area. To solve the listed problems there has been designed a program complex, which efficiency is illustrated by the solutions of four applied problems. Each of the considered applied optimization problems is solved with all the three chosen methods. The ob- tained numerical results can be compared with the ones found in a swarm with a particle method. The author gives recommenda- tions on how to choose methods parameters and penalty function value, which consider inequality constraints.

Short-Term Wind Power Forecasting Using the Enhanced Particle Swarm Optimization Based Hybrid Method

OpenAIRE

Wen-Yeau Chang

2013-01-01

High penetration of wind power in the electricity system provides many challenges to power system operators, mainly due to the unpredictability and variability of wind power generation. Although wind energy may not be dispatched, an accurate forecasting method of wind speed and power generation can help power system operators reduce the risk of an unreliable electricity supply. This paper proposes an enhanced particle swarm optimization (EPSO) based hybrid forecasting method for short-term wi...

Multi-Objective Optimization of Squeeze Casting Process using Genetic Algorithm and Particle Swarm Optimization

Directory of Open Access Journals (Sweden)

Patel G.C.M.

2016-09-01

Full Text Available The near net shaped manufacturing ability of squeeze casting process requiresto set the process variable combinations at their optimal levels to obtain both aesthetic appearance and internal soundness of the cast parts. The aesthetic and internal soundness of cast parts deal with surface roughness and tensile strength those can readily put the part in service without the requirement of costly secondary manufacturing processes (like polishing, shot blasting, plating, hear treatment etc.. It is difficult to determine the levels of the process variable (that is, pressure duration, squeeze pressure, pouring temperature and die temperature combinations for extreme values of the responses (that is, surface roughness, yield strength and ultimate tensile strength due to conflicting requirements. In the present manuscript, three population based search and optimization methods, namely genetic algorithm (GA, particle swarm optimization (PSO and multi-objective particle swarm optimization based on crowding distance (MOPSO-CD methods have been used to optimize multiple outputs simultaneously. Further, validation test has been conducted for the optimal casting conditions suggested by GA, PSO and MOPSO-CD. The results showed that PSO outperformed GA with regard to computation time.

Enhanced fuzzy-connective-based hierarchical aggregation network using particle swarm optimization

Science.gov (United States)

Wang, Fang-Fang; Su, Chao-Ton

2014-11-01

The fuzzy-connective-based aggregation network is similar to the human decision-making process. It is capable of aggregating and propagating degrees of satisfaction of a set of criteria in a hierarchical manner. Its interpreting ability and transparency make it especially desirable. To enhance its effectiveness and further applicability, a learning approach is successfully developed based on particle swarm optimization to determine the weights and parameters of the connectives in the network. By experimenting on eight datasets with different characteristics and conducting further statistical tests, it has been found to outperform the gradient- and genetic algorithm-based learning approaches proposed in the literature; furthermore, it is capable of generating more accurate estimates. The present approach retains the original benefits of fuzzy-connective-based aggregation networks and is widely applicable. The characteristics of the learning approaches are also discussed and summarized, providing better understanding of the similarities and differences among these three approaches.

Improving the Bin Packing Heuristic through Grammatical Evolution Based on Swarm Intelligence

Directory of Open Access Journals (Sweden)

Marco Aurelio Sotelo-Figueroa

2014-01-01

Full Text Available In recent years Grammatical Evolution (GE has been used as a representation of Genetic Programming (GP which has been applied to many optimization problems such as symbolic regression, classification, Boolean functions, constructed problems, and algorithmic problems. GE can use a diversity of searching strategies including Swarm Intelligence (SI. Particle Swarm Optimisation (PSO is an algorithm of SI that has two main problems: premature convergence and poor diversity. Particle Evolutionary Swarm Optimization (PESO is a recent and novel algorithm which is also part of SI. PESO uses two perturbations to avoid PSO’s problems. In this paper we propose using PESO and PSO in the frame of GE as strategies to generate heuristics that solve the Bin Packing Problem (BPP; it is possible however to apply this methodology to other kinds of problems using another Grammar designed for that problem. A comparison between PESO, PSO, and BPP’s heuristics is performed through the nonparametric Friedman test. The main contribution of this paper is proposing a Grammar to generate online and offline heuristics depending on the test instance trying to improve the heuristics generated by other grammars and humans; it also proposes a way to implement different algorithms as search strategies in GE like PESO to obtain better results than those obtained by PSO.

Energy-Aware Real-Time Task Scheduling for Heterogeneous Multiprocessors with Particle Swarm Optimization Algorithm

Directory of Open Access Journals (Sweden)

Weizhe Zhang

2014-01-01

Full Text Available Energy consumption in computer systems has become a more and more important issue. High energy consumption has already damaged the environment to some extent, especially in heterogeneous multiprocessors. In this paper, we first formulate and describe the energy-aware real-time task scheduling problem in heterogeneous multiprocessors. Then we propose a particle swarm optimization (PSO based algorithm, which can successfully reduce the energy cost and the time for searching feasible solutions. Experimental results show that the PSO-based energy-aware metaheuristic uses 40%–50% less energy than the GA-based and SFLA-based algorithms and spends 10% less time than the SFLA-based algorithm in finding the solutions. Besides, it can also find 19% more feasible solutions than the SFLA-based algorithm.

DNA-assisted swarm control in a biomolecular motor system.

Science.gov (United States)

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.

Power Provision Based on Self-Sacrificing Craft

Science.gov (United States)

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

2015-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 self-sacrifice can involve donating resources or assets, such as power provisions, to a different component of an autonomous system. A receiving component of the system can benefit from receiving the donated resource or power provision.

Particle Swarm Optimization and harmony search based clustering and routing in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Veena Anand

2017-01-01

Full Text Available Wireless Sensor Networks (WSN has the disadvantage of limited and non-rechargeable energy resource in WSN creates a challenge and led to development of various clustering and routing algorithms. The paper proposes an approach for improving network lifetime by using Particle swarm optimization based clustering and Harmony Search based routing in WSN. So in this paper, global optimal cluster head are selected and Gateway nodes are introduced to decrease the energy consumption of the CH while sending aggregated data to the Base station (BS. Next, the harmony search algorithm based Local Search strategy finds best routing path for gateway nodes to the Base Station. Finally, the proposed algorithm is presented.

Monitoring a robot swarm using a data-driven fault detection approach

KAUST Repository

Khaldi, Belkacem

2017-06-30

Using swarm robotics system, with one or more faulty robots, to accomplish specific tasks may lead to degradation in performances complying with the target requirements. In such circumstances, robot swarms require continuous monitoring to detect abnormal events and to sustain normal operations. In this paper, an innovative exogenous fault detection method for monitoring robots swarm is presented. The method merges the flexibility of principal component analysis (PCA) models and the greater sensitivity of the exponentially-weighted moving average (EWMA) and cumulative sum (CUSUM) control charts to insidious changes. The method is tested and evaluated on a swarm of simulated foot-bot robots performing a circle formation task, via the viscoelastic control model. We illustrate through simulated data collected from the ARGoS simulator that a significant improvement in fault detection can be obtained by using the proposed method where compared to the conventional PCA-based methods (i.e., T2 and Q).

ESA Swarm Mission - Level 1b Products

Science.gov (United States)

Tøffner-Clausen, Lars; Floberghagen, Rune; Mecozzi, Riccardo; Menard, Yvon

2014-05-01

Swarm, a three-satellite constellation to study the dynamics of the Earth's magnetic field and its interactions with the Earth system, has been launched in November 2013. The objective of the Swarm mission is to provide the best ever survey of the geomagnetic field and its temporal evolution, which will bring new insights into the Earth system by improving our understanding of the Earth's interior and environment. The Level 1b Products of the Swarm mission contain time-series of the quality screened, calibrated, corrected, and fully geo-localized measurements of the magnetic field intensity, the magnetic field vector (provided in both instrument and Earth-fixed frames), the plasma density, temperature, and velocity. Additionally, quality screened and pre-calibrated measurements of the nongravitational accelerations are provided. Geo-localization is performed by 24- channel GPS receivers and by means of unique, three head Advanced Stellar Compasses for high-precision satellite attitude information. The Swarm Level 1b data will be provided in daily products separately for each of the three Swarm spacecrafts. This poster will present detailed lists of the contents of the Swarm Level 1b Products and brief descriptions of the processing algorithms used in the generation of these data.

Predator confusion is sufficient to evolve swarming behaviour.

Science.gov (United States)

Olson, Randal S; Hintze, Arend; Dyer, Fred C; Knoester, David B; Adami, Christoph

2013-08-06

Swarming behaviours in animals have been extensively studied owing to their implications for the evolution of cooperation, social cognition and predator-prey dynamics. An important goal of these studies is discerning which evolutionary pressures favour the formation of swarms. One hypothesis is that swarms arise because the presence of multiple moving prey in swarms causes confusion for attacking predators, but it remains unclear how important this selective force is. Using an evolutionary model of a predator-prey system, we show that predator confusion provides a sufficient selection pressure to evolve swarming behaviour in prey. Furthermore, we demonstrate that the evolutionary effect of predator confusion on prey could in turn exert pressure on the structure of the predator's visual field, favouring the frontally oriented, high-resolution visual systems commonly observed in predators that feed on swarming animals. Finally, we provide evidence that when prey evolve swarming in response to predator confusion, there is a change in the shape of the functional response curve describing the predator's consumption rate as prey density increases. Thus, we show that a relatively simple perceptual constraint--predator confusion--could have pervasive evolutionary effects on prey behaviour, predator sensory mechanisms and the ecological interactions between predators and prey.

A Novel Chaotic Particle Swarm Optimization Algorithm for Parking Space Guidance

Directory of Open Access Journals (Sweden)

Na Dong

2016-01-01

Full Text Available An evolutionary approach of parking space guidance based upon a novel Chaotic Particle Swarm Optimization (CPSO algorithm is proposed. In the newly proposed CPSO algorithm, the chaotic dynamics is combined into the position updating rules of Particle Swarm Optimization to improve the diversity of solutions and to avoid being trapped in the local optima. This novel approach, that combines the strengths of Particle Swarm Optimization and chaotic dynamics, is then applied into the route optimization (RO problem of parking lots, which is an important issue in the management systems of large-scale parking lots. It is used to find out the optimized paths between any source and destination nodes in the route network. Route optimization problems based on real parking lots are introduced for analyzing and the effectiveness and practicability of this novel optimization algorithm for parking space guidance have been verified through the application results.

Swarming Robot Design, Construction and Software Implementation

Science.gov (United States)

Stolleis, Karl A.

2014-01-01

In this paper is presented an overview of the hardware design, construction overview, software design and software implementation for a small, low-cost robot to be used for swarming robot development. In addition to the work done on the robot, a full simulation of the robotic system was developed using Robot Operating System (ROS) and its associated simulation. The eventual use of the robots will be exploration of evolving behaviors via genetic algorithms and builds on the work done at the University of New Mexico Biological Computation Lab.

Precise Localization and Formation Control of Swarm Robots via Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Han Wu

2014-01-01

Full Text Available Precise localization and formation control are one of the key technologies to achieve coordination and control of swarm robots, which is also currently a bottleneck for practical applications of swarm robotic systems. Aiming at overcoming the limited individual perception and the difficulty of achieving precise localization and formation, a localization approach combining dead reckoning (DR with wireless sensor network- (WSN- based methods is proposed in this paper. Two kinds of WSN localization technologies are adopted in this paper, that is, ZigBee-based RSSI (received signal strength indication global localization and electronic tag floors for calibration of local positioning. First, the DR localization information is combined with the ZigBee-based RSSI position information using the Kalman filter method to achieve precise global localization and maintain the robot formation. Then the electronic tag floors provide the robots with their precise coordinates in some local areas and enable the robot swarm to calibrate its formation by reducing the accumulated position errors. Hence, the overall performance of localization and formation control of the swarm robotic system is improved. Both of the simulation results and the experimental results on a real schematic system are given to demonstrate the success of the proposed approach.

A new hybrid optimization method inspired from swarm intelligence: Fuzzy adaptive swallow swarm optimization algorithm (FASSO

Directory of Open Access Journals (Sweden)

Mehdi Neshat

2015-11-01

Full Text Available In this article, the objective was to present effective and optimal strategies aimed at improving the Swallow Swarm Optimization (SSO method. The SSO is one of the best optimization methods based on swarm intelligence which is inspired by the intelligent behaviors of swallows. It has been able to offer a relatively strong method for solving optimization problems. However, despite its many advantages, the SSO suffers from two shortcomings. Firstly, particles movement speed is not controlled satisfactorily during the search due to the lack of an inertia weight. Secondly, the variables of the acceleration coefficient are not able to strike a balance between the local and the global searches because they are not sufficiently flexible in complex environments. Therefore, the SSO algorithm does not provide adequate results when it searches in functions such as the Step or Quadric function. Hence, the fuzzy adaptive Swallow Swarm Optimization (FASSO method was introduced to deal with these problems. Meanwhile, results enjoy high accuracy which are obtained by using an adaptive inertia weight and through combining two fuzzy logic systems to accurately calculate the acceleration coefficients. High speed of convergence, avoidance from falling into local extremum, and high level of error tolerance are the advantages of proposed method. The FASSO was compared with eleven of the best PSO methods and SSO in 18 benchmark functions. Finally, significant results were obtained.

Genetic Particle Swarm Optimization–Based Feature Selection for Very-High-Resolution Remotely Sensed Imagery Object Change Detection

Science.gov (United States)

Chen, Qiang; Chen, Yunhao; Jiang, Weiguo

2016-01-01

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. PMID:27483285

Genetic Particle Swarm Optimization-Based Feature Selection for Very-High-Resolution Remotely Sensed Imagery Object Change Detection.

Science.gov (United States)

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.

A Framework for Autonomous Trajectory-Based Operations, Phase I

Data.gov (United States)

National Aeronautics and Space Administration — The innovation proposed is a framework for autonomous Traffic Flow Management (TFM) under Trajectory Based Operations (TBO) for Unmanned Aerial Systems (UAS). The...

Autonomic intrusion detection: Adaptively detecting anomalies over unlabeled audit data streams in computer networks

KAUST Repository

Wang, Wei; Guyet, Thomas; Quiniou, René ; Cordier, Marie-Odile; Masseglia, Florent; Zhang, Xiangliang

2014-01-01

In this work, we propose a novel framework of autonomic intrusion detection that fulfills online and adaptive intrusion detection over unlabeled HTTP traffic streams in computer networks. The framework holds potential for self-managing: self-labeling, self-updating and self-adapting. Our framework employs the Affinity Propagation (AP) algorithm to learn a subject’s behaviors through dynamical clustering of the streaming data. It automatically labels the data and adapts to normal behavior changes while identifies anomalies. Two large real HTTP traffic streams collected in our institute as well as a set of benchmark KDD’99 data are used to validate the framework and the method. The test results show that the autonomic model achieves better results in terms of effectiveness and efficiency compared to adaptive Sequential Karhunen–Loeve method and static AP as well as three other static anomaly detection methods, namely, k-NN, PCA and SVM.

Autonomic intrusion detection: Adaptively detecting anomalies over unlabeled audit data streams in computer networks

KAUST Repository

Wang, Wei

2014-06-22

In this work, we propose a novel framework of autonomic intrusion detection that fulfills online and adaptive intrusion detection over unlabeled HTTP traffic streams in computer networks. The framework holds potential for self-managing: self-labeling, self-updating and self-adapting. Our framework employs the Affinity Propagation (AP) algorithm to learn a subject’s behaviors through dynamical clustering of the streaming data. It automatically labels the data and adapts to normal behavior changes while identifies anomalies. Two large real HTTP traffic streams collected in our institute as well as a set of benchmark KDD’99 data are used to validate the framework and the method. The test results show that the autonomic model achieves better results in terms of effectiveness and efficiency compared to adaptive Sequential Karhunen–Loeve method and static AP as well as three other static anomaly detection methods, namely, k-NN, PCA and SVM.

Foraging behavior analysis of swarm robotics system

Directory of Open Access Journals (Sweden)

Sakthivelmurugan E.

2018-01-01

Full Text Available Swarm robotics is a number of small robots that are synchronically works together to accomplish a given task. Swarm robotics faces many problems in performing a given task. The problems are pattern formation, aggregation, Chain formation, self-assembly, coordinated movement, hole avoidance, foraging and self-deployment. Foraging is most essential part in swarm robotics. Foraging is the task to discover the item and get back into the shell. The researchers conducted foraging experiments with random-movement of robots and they have end up with unique solutions. Most of the researchers have conducted experiments using the circular arena. The shell is placed at the centre of the arena and environment boundary is well known. In this study, an attempt is made to different strategic movements like straight line approach, parallel line approach, divider approach, expanding square approach, and parallel sweep approach. All these approaches are to be simulated by using player/stage open-source simulation software based on C and C++ programming language in Linux operating system. Finally statistical comparison will be done with task completion time of all these strategies using ANOVA to identify the significant searching strategy.

INHIBITION OF SWARMING BY UREA AND ITS DIAGNOSTIC ...

African Journals Online (AJOL)

The anti-swarming property of urea and effects on antibiotic susceptibility among 52 uropathogenic Proteus strains from Lagos, Nigeria were investigated. Urea caused a reduction in swarming and number of swarmed cells at 0.5% (n = 42, DOCZ = 15.5mm), 0.75% (n= 24, DOCZ = 10.7mm), 1% (n = 17, DOCZ = 3.4mm) and ...

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

Science.gov (United States)

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.

Multi-terminal pipe routing by Steiner minimal tree and particle swarm optimisation

Science.gov (United States)

Liu, Qiang; Wang, Chengen

2012-08-01

Computer-aided design of pipe routing is of fundamental importance for complex equipments' developments. In this article, non-rectilinear branch pipe routing with multiple terminals that can be formulated as a Euclidean Steiner Minimal Tree with Obstacles (ESMTO) problem is studied in the context of an aeroengine-integrated design engineering. Unlike the traditional methods that connect pipe terminals sequentially, this article presents a new branch pipe routing algorithm based on the Steiner tree theory. The article begins with a new algorithm for solving the ESMTO problem by using particle swarm optimisation (PSO), and then extends the method to the surface cases by using geodesics to meet the requirements of routing non-rectilinear pipes on the surfaces of aeroengines. Subsequently, the adaptive region strategy and the basic visibility graph method are adopted to increase the computation efficiency. Numeral computations show that the proposed routing algorithm can find satisfactory routing layouts while running in polynomial time.

Collective motion with anticipation: flocking, spinning, and swarming.

Science.gov (United States)

Morin, Alexandre; Caussin, Jean-Baptiste; Eloy, Christophe; Bartolo, Denis

2015-01-01

We investigate the collective dynamics of self-propelled particles able to probe and anticipate the orientation of their neighbors. We show that a simple anticipation strategy hinders the emergence of homogeneous flocking patterns. Yet anticipation promotes two other forms of self-organization: collective spinning and swarming. In the spinning phase, all particles follow synchronous circular orbits, while in the swarming phase, the population condensates into a single compact swarm that cruises coherently without requiring any cohesive interactions. We quantitatively characterize and rationalize these phases of polar active matter and discuss potential applications to the design of swarming robots.

Particle swarm optimization for programming deep brain stimulation arrays.

Science.gov (United States)

Peña, Edgar; Zhang, Simeng; Deyo, Steve; Xiao, YiZi; Johnson, Matthew D

2017-02-01

Deep brain stimulation (DBS) therapy relies on both precise neurosurgical targeting and systematic optimization of stimulation settings to achieve beneficial clinical outcomes. One recent advance to improve targeting is the development of DBS arrays (DBSAs) with electrodes segmented both along and around the DBS lead. However, increasing the number of independent electrodes creates the logistical challenge of optimizing stimulation parameters efficiently. Solving such complex problems with multiple solutions and objectives is well known to occur in biology, in which complex collective behaviors emerge out of swarms of individual organisms engaged in learning through social interactions. Here, we developed a particle swarm optimization (PSO) algorithm to program DBSAs using a swarm of individual particles representing electrode configurations and stimulation amplitudes. Using a finite element model of motor thalamic DBS, we demonstrate how the PSO algorithm can efficiently optimize a multi-objective function that maximizes predictions of axonal activation in regions of interest (ROI, cerebellar-receiving area of motor thalamus), minimizes predictions of axonal activation in regions of avoidance (ROA, somatosensory thalamus), and minimizes power consumption. The algorithm solved the multi-objective problem by producing a Pareto front. ROI and ROA activation predictions were consistent across swarms (<1% median discrepancy in axon activation). The algorithm was able to accommodate for (1) lead displacement (1 mm) with relatively small ROI (⩽9.2%) and ROA (⩽1%) activation changes, irrespective of shift direction; (2) reduction in maximum per-electrode current (by 50% and 80%) with ROI activation decreasing by 5.6% and 16%, respectively; and (3) disabling electrodes (n  =  3 and 12) with ROI activation reduction by 1.8% and 14%, respectively. Additionally, comparison between PSO predictions and multi-compartment axon model simulations showed discrepancies

Particle Swarm Optimization for Programming Deep Brain Stimulation Arrays

Science.gov (United States)

Peña, Edgar; Zhang, Simeng; Deyo, Steve; Xiao, YiZi; Johnson, Matthew D.

2017-01-01

Objective Deep brain stimulation (DBS) therapy relies on both precise neurosurgical targeting and systematic optimization of stimulation settings to achieve beneficial clinical outcomes. One recent advance to improve targeting is the development of DBS arrays (DBSAs) with electrodes segmented both along and around the DBS lead. However, increasing the number of independent electrodes creates the logistical challenge of optimizing stimulation parameters efficiently. Approach Solving such complex problems with multiple solutions and objectives is well known to occur in biology, in which complex collective behaviors emerge out of swarms of individual organisms engaged in learning through social interactions. Here, we developed a particle swarm optimization (PSO) algorithm to program DBSAs using a swarm of individual particles representing electrode configurations and stimulation amplitudes. Using a finite element model of motor thalamic DBS, we demonstrate how the PSO algorithm can efficiently optimize a multi-objective function that maximizes predictions of axonal activation in regions of interest (ROI, cerebellar-receiving area of motor thalamus), minimizes predictions of axonal activation in regions of avoidance (ROA, somatosensory thalamus), and minimizes power consumption. Main Results The algorithm solved the multi-objective problem by producing a Pareto front. ROI and ROA activation predictions were consistent across swarms (<1% median discrepancy in axon activation). The algorithm was able to accommodate for (1) lead displacement (1 mm) with relatively small ROI (≤9.2%) and ROA (≤1%) activation changes, irrespective of shift direction; (2) reduction in maximum per-electrode current (by 50% and 80%) with ROI activation decreasing by 5.6% and 16%, respectively; and (3) disabling electrodes (n=3 and 12) with ROI activation reduction by 1.8% and 14%, respectively. Additionally, comparison between PSO predictions and multi-compartment axon model simulations

The upper surface of an Escherichia coli swarm is stationary.

Science.gov (United States)

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.

Some recent studies of electron swarms in gases

International Nuclear Information System (INIS)

Tagashira, H.

1992-01-01

Some recent studies of electron swarms in gases under the action of an electric field are introduced. The studies include a new type of continuity equation for electrons having a form in which the partial derivative of the electron density with respect to position and to time are interchanged, a method to deduce the time-of-flight and arrival-time-spectrum swarm parameters based on a Fourier-transformed Boltzmann equation, an examination of the correspondence between experimental and theoretical electron drift velocities, and an automatic technique to deduce the electron-gas molecule collision cross section from electron drift velocity data. A method for the deduction of electron collision cross sections with gas molecules having vibrational excitation cross sections greater than the elastic momentum transfer cross section by using a gas mixture technique, an integral type of method for solution of the Boltzmann equation with salient numerical stability, a quantitative analysis of the effect of Penning ionisation, and the behaviour of electron swarms under radio frequency electric fields, are also briefly discussed. 28 refs., 3 figs

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

Science.gov (United States)

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.

The infrared spectral transmittance of Aspergillus niger spore aggregated particle swarm

Science.gov (United States)

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

Bacterial Swarming: social behaviour or hydrodynamics?

Science.gov (United States)

Vermant, Jan

2010-03-01

Bacterial swarming of colonies is typically described as a social phenomenon between bacteria, whereby groups of bacteria collectively move atop solid surfaces. This multicellular behavior, during which the organized bacterial populations are embedded in an extracellular slime layer, is connected to important features such as biofilm formation and virulence. Despite the possible intricate quorum sensing mechanisms that regulate swarming, several physico-chemical phenomena may play a role in the dynamics of swarming and biofilm formation. Especially the striking fingering patterns formed by some swarmer colonies on relatively soft sub phases have attracted the attention as they could be the signatures of an instability. Recently, a parallel has been drawn between the swarming patterns and the spreading of viscous drops under the influence of a surfactant, which lead to similar patterns [1]. Starting from the observation that several of the molecules, essential in swarming systems, are strong biosurfactants, the possibility of flows driven by gradients in surface tension, has been proposed. This Marangoni flows are known to lead to these characteristic patterns. For Rhizobium etli not only the pattern formation, but also the experimentally observed spreading speed has been shown to be consistent with the one expected for Marangoni flows for the surface pressures, thickness, and viscosities that have been observed [2]. We will present an experimental study of swarming colonies of the bacteria Pseudomonas aeruginosa, the pattern formation, the surfactant gradients and height profiles in comparison with predictions of a thin film hydrodynamic model.[4pt] [1] Matar O.K. and Troian S., Phys. Fluids 11 : 3232 (1999)[0pt] [2] Daniels, R et al., PNAS, 103 (40): 14965-14970 (2006)

Robust electromagnetically guided endoscopic procedure using enhanced particle swarm optimization for multimodal information fusion

International Nuclear Information System (INIS)

Luo, Xiongbiao; Wan, Ying; He, Xiangjian

2015-01-01

Purpose: Electromagnetically guided endoscopic procedure, which aims at accurately and robustly localizing the endoscope, involves multimodal sensory information during interventions. However, it still remains challenging in how to integrate these information for precise and stable endoscopic guidance. To tackle such a challenge, this paper proposes a new framework on the basis of an enhanced particle swarm optimization method to effectively fuse these information for accurate and continuous endoscope localization. Methods: The authors use the particle swarm optimization method, which is one of stochastic evolutionary computation algorithms, to effectively fuse the multimodal information including preoperative information (i.e., computed tomography images) as a frame of reference, endoscopic camera videos, and positional sensor measurements (i.e., electromagnetic sensor outputs). Since the evolutionary computation method usually limits its possible premature convergence and evolutionary factors, the authors introduce the current (endoscopic camera and electromagnetic sensor’s) observation to boost the particle swarm optimization and also adaptively update evolutionary parameters in accordance with spatial constraints and the current observation, resulting in advantageous performance in the enhanced algorithm. Results: The experimental results demonstrate that the authors’ proposed method provides a more accurate and robust endoscopic guidance framework than state-of-the-art methods. The average guidance accuracy of the authors’ framework was about 3.0 mm and 5.6° while the previous methods show at least 3.9 mm and 7.0°. The average position and orientation smoothness of their method was 1.0 mm and 1.6°, which is significantly better than the other methods at least with (2.0 mm and 2.6°). Additionally, the average visual quality of the endoscopic guidance was improved to 0.29. Conclusions: A robust electromagnetically guided endoscopy framework was

Robust electromagnetically guided endoscopic procedure using enhanced particle swarm optimization for multimodal information fusion.

Science.gov (United States)

Luo, Xiongbiao; Wan, Ying; He, Xiangjian

2015-04-01

Electromagnetically guided endoscopic procedure, which aims at accurately and robustly localizing the endoscope, involves multimodal sensory information during interventions. However, it still remains challenging in how to integrate these information for precise and stable endoscopic guidance. To tackle such a challenge, this paper proposes a new framework on the basis of an enhanced particle swarm optimization method to effectively fuse these information for accurate and continuous endoscope localization. The authors use the particle swarm optimization method, which is one of stochastic evolutionary computation algorithms, to effectively fuse the multimodal information including preoperative information (i.e., computed tomography images) as a frame of reference, endoscopic camera videos, and positional sensor measurements (i.e., electromagnetic sensor outputs). Since the evolutionary computation method usually limits its possible premature convergence and evolutionary factors, the authors introduce the current (endoscopic camera and electromagnetic sensor's) observation to boost the particle swarm optimization and also adaptively update evolutionary parameters in accordance with spatial constraints and the current observation, resulting in advantageous performance in the enhanced algorithm. The experimental results demonstrate that the authors' proposed method provides a more accurate and robust endoscopic guidance framework than state-of-the-art methods. The average guidance accuracy of the authors' framework was about 3.0 mm and 5.6° while the previous methods show at least 3.9 mm and 7.0°. The average position and orientation smoothness of their method was 1.0 mm and 1.6°, which is significantly better than the other methods at least with (2.0 mm and 2.6°). Additionally, the average visual quality of the endoscopic guidance was improved to 0.29. A robust electromagnetically guided endoscopy framework was proposed on the basis of an enhanced particle swarm

Robust electromagnetically guided endoscopic procedure using enhanced particle swarm optimization for multimodal information fusion

Energy Technology Data Exchange (ETDEWEB)

Luo, Xiongbiao, E-mail: xluo@robarts.ca, E-mail: Ying.Wan@student.uts.edu.au [Robarts Research Institute, Western University, London, Ontario N6A 5K8 (Canada); Wan, Ying, E-mail: xluo@robarts.ca, E-mail: Ying.Wan@student.uts.edu.au; He, Xiangjian [School of Computing and Communications, University of Technology, Sydney, New South Wales 2007 (Australia)

2015-04-15

Purpose: Electromagnetically guided endoscopic procedure, which aims at accurately and robustly localizing the endoscope, involves multimodal sensory information during interventions. However, it still remains challenging in how to integrate these information for precise and stable endoscopic guidance. To tackle such a challenge, this paper proposes a new framework on the basis of an enhanced particle swarm optimization method to effectively fuse these information for accurate and continuous endoscope localization. Methods: The authors use the particle swarm optimization method, which is one of stochastic evolutionary computation algorithms, to effectively fuse the multimodal information including preoperative information (i.e., computed tomography images) as a frame of reference, endoscopic camera videos, and positional sensor measurements (i.e., electromagnetic sensor outputs). Since the evolutionary computation method usually limits its possible premature convergence and evolutionary factors, the authors introduce the current (endoscopic camera and electromagnetic sensor’s) observation to boost the particle swarm optimization and also adaptively update evolutionary parameters in accordance with spatial constraints and the current observation, resulting in advantageous performance in the enhanced algorithm. Results: The experimental results demonstrate that the authors’ proposed method provides a more accurate and robust endoscopic guidance framework than state-of-the-art methods. The average guidance accuracy of the authors’ framework was about 3.0 mm and 5.6° while the previous methods show at least 3.9 mm and 7.0°. The average position and orientation smoothness of their method was 1.0 mm and 1.6°, which is significantly better than the other methods at least with (2.0 mm and 2.6°). Additionally, the average visual quality of the endoscopic guidance was improved to 0.29. Conclusions: A robust electromagnetically guided endoscopy framework was

Measurement and interpretation of swarm parameters and their application in plasma modelling

International Nuclear Information System (INIS)

Petrovic, Z Lj; Dujko, S; Maric, D; Malovic, G; Nikitovic, Z; Sasic, O; Jovanovic, J; Stojanovic, V; Radmilovic-Radenovic, M

2009-01-01

In this review paper, we discuss the current status of the physics of charged particle swarms, mainly electrons, having plasma modelling in mind. The measurements of the swarm coefficients and the availability of the data are briefly discussed. We try to give a summary of the past ten years and cite the main reviews and databases, which store the majority of the earlier work. The need for reinitiating the swarm experiments and where and how those would be useful is pointed out. We also add some guidance on how to find information on ions and fast neutrals. Most space is devoted to interpretation of transport data, analysis of kinetic phenomena, and accuracy of calculation and proper use of transport data in plasma models. We have tried to show which aspects of kinetic theory developed for swarm physics and which segments of data would be important for further improvement of plasma models. Finally, several examples are given where actual models are mostly based on the physics of swarms and those include Townsend discharges, afterglows, breakdown and some atmospheric phenomena. Finally we stress that, while complex, some of the results from the kinetic theory of swarms and the related phenomenology must be used either to test the plasma models or even to bring in new physics or higher accuracy and reliability to the models. (review article)

Integrated vision-based GNC for autonomous rendezvous and capture around Mars

Science.gov (United States)

Strippoli, L.; Novelli, G.; Gil Fernandez, J.; Colmenarejo, P.; Le Peuvedic, C.; Lanza, P.; Ankersen, F.

2015-06-01

Integrated GNC (iGNC) is an activity aimed at designing, developing and validating the GNC for autonomously performing the rendezvous and capture phase of the Mars sample return mission as defined during the Mars sample return Orbiter (MSRO) ESA study. The validation cycle includes testing in an end-to-end simulator, in a real-time avionics-representative test bench and, finally, in a dynamic HW in the loop test bench for assessing the feasibility, performances and figure of merits of the baseline approach defined during the MSRO study, for both nominal and contingency scenarios. The on-board software (OBSW) is tailored to work with the sensors, actuators and orbits baseline proposed in MSRO. The whole rendezvous is based on optical navigation, aided by RF-Doppler during the search and first orbit determination of the orbiting sample. The simulated rendezvous phase includes also the non-linear orbit synchronization, based on a dedicated non-linear guidance algorithm robust to Mars ascent vehicle (MAV) injection accuracy or MAV failures resulting in elliptic target orbits. The search phase is very demanding for the image processing (IP) due to the very high visual magnitude of the target wrt. the stellar background, and the attitude GNC requires very high pointing stability accuracies to fulfil IP constraints. A trade-off of innovative, autonomous navigation filters indicates the unscented Kalman filter (UKF) as the approach that provides the best results in terms of robustness, response to non-linearities and performances compatibly with computational load. At short range, an optimized IP based on a convex hull algorithm has been developed in order to guarantee LoS and range measurements from hundreds of metres to capture.

Brain response pattern identification of fMRI data using a particle swarm optimization-based approach.

Science.gov (United States)

Ma, Xinpei; Chou, Chun-An; Sayama, Hiroki; Chaovalitwongse, Wanpracha Art

2016-09-01

Many neuroscience studies have been devoted to understand brain neural responses correlating to cognition using functional magnetic resonance imaging (fMRI). In contrast to univariate analysis to identify response patterns, it is shown that multi-voxel pattern analysis (MVPA) of fMRI data becomes a relatively effective approach using machine learning techniques in the recent literature. MVPA can be considered as a multi-objective pattern classification problem with the aim to optimize response patterns, in which informative voxels interacting with each other are selected, achieving high classification accuracy associated with cognitive stimulus conditions. To solve the problem, we propose a feature interaction detection framework, integrating hierarchical heterogeneous particle swarm optimization and support vector machines, for voxel selection in MVPA. In the proposed approach, we first select the most informative voxels and then identify a response pattern based on the connectivity of the selected voxels. The effectiveness of the proposed approach was examined for the Haxby's dataset of object-level representations. The computational results demonstrated higher classification accuracy by the extracted response patterns, compared to state-of-the-art feature selection algorithms, such as forward selection and backward selection.

Particle Swarm Based Approach of a Real-Time Discrete Neural Identifier for Linear Induction Motors

Directory of Open Access Journals (Sweden)

Alma Y. Alanis

2013-01-01

Full Text Available This paper focusses on a discrete-time neural identifier applied to a linear induction motor (LIM model, whose model is assumed to be unknown. This neural identifier is robust in presence of external and internal uncertainties. The proposed scheme is based on a discrete-time recurrent high-order neural network (RHONN trained with a novel algorithm based on extended Kalman filter (EKF and particle swarm optimization (PSO, using an online series-parallel con…figuration. Real-time results are included in order to illustrate the applicability of the proposed scheme.

Particle swarm optimisation classical and quantum perspectives

CERN Document Server

Sun, Jun; Wu, Xiao-Jun

2016-01-01

IntroductionOptimisation Problems and Optimisation MethodsRandom Search TechniquesMetaheuristic MethodsSwarm IntelligenceParticle Swarm OptimisationOverviewMotivationsPSO Algorithm: Basic Concepts and the ProcedureParadigm: How to Use PSO to Solve Optimisation ProblemsSome Harder Examples Some Variants of Particle Swarm Optimisation Why Does the PSO Algorithm Need to Be Improved? Inertia and Constriction-Acceleration Techniques for PSOLocal Best ModelProbabilistic AlgorithmsOther Variants of PSO Quantum-Behaved Particle Swarm Optimisation OverviewMotivation: From Classical Dynamics to Quantum MechanicsQuantum Model: Fundamentals of QPSOQPSO AlgorithmSome Essential ApplicationsSome Variants of QPSOSummary Advanced Topics Behaviour Analysis of Individual ParticlesConvergence Analysis of the AlgorithmTime Complexity and Rate of ConvergenceParameter Selection and PerformanceSummaryIndustrial Applications Inverse Problems for Partial Differential EquationsInverse Problems for Non-Linear Dynamical SystemsOptimal De...

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

Science.gov (United States)

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

Heterogeneous Defensive Naval Weapon Assignment To Swarming Threats In Real Time

Science.gov (United States)

2016-03-01

come under fire from multiple sources simultaneously. These threats would be engaged in a numbers game , seeking to saturate the battlespace with many...optimization extension that uses the Python modeling language. B. TEST SCENARIO The following test scenario was developed to validate the models...Adaptive rapid response to swarming threats Concept Briefing. Presented at Naval Postgraduate School, Monterey, CA. Python [Computer Software]. (2015

LinkMind: Link Optimization in Swarming Mobile Sensor Networks

DEFF Research Database (Denmark)

Ngo, Trung Dung

2012-01-01

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...

Evolving and Controlling Perimeter, Rendezvous, and Foraging Behaviors in a Computation-Free Robot Swarm

Science.gov (United States)

2016-04-01

in extreme environments. Categories and Subject Descriptors I.2.11 [ Artificial Intelligence ]: Distributed Artificial In- telligence—multiagent systems...coherence and coordination; I.2.9 [ Artificial Intelligence ]: Robotics— intelligent vehi- cles Keywords swarm robotics, evolutionary algorithms...collective behaviors. Rubenstein et al. [12] studied how to collectively transport items using a simple control signals and behaviors. Others have looked

Particle swarm optimization algorithm based low cost magnetometer calibration

Science.gov (United States)

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

Toward autonomous spacecraft

Science.gov (United States)

Fogel, L. J.; Calabrese, P. G.; Walsh, M. J.; Owens, A. J.

1982-01-01

Ways in which autonomous behavior of spacecraft can be extended to treat situations wherein a closed loop control by a human may not be appropriate or even possible are explored. Predictive models that minimize mean least squared error and arbitrary cost functions are discussed. A methodology for extracting cyclic components for an arbitrary environment with respect to usual and arbitrary criteria is developed. An approach to prediction and control based on evolutionary programming is outlined. A computer program capable of predicting time series is presented. A design of a control system for a robotic dense with partially unknown physical properties is presented.

A particle swarm optimization algorithm for beam angle selection in intensity-modulated radiotherapy planning

International Nuclear Information System (INIS)

Li Yongjie; Yao Dezhong; Yao, Jonathan; Chen Wufan

2005-01-01

Automatic beam angle selection is an important but challenging problem for intensity-modulated radiation therapy (IMRT) planning. Though many efforts have been made, it is still not very satisfactory in clinical IMRT practice because of overextensive computation of the inverse problem. In this paper, a new technique named BASPSO (Beam Angle Selection with a Particle Swarm Optimization algorithm) is presented to improve the efficiency of the beam angle optimization problem. Originally developed as a tool for simulating social behaviour, the particle swarm optimization (PSO) algorithm is a relatively new population-based evolutionary optimization technique first introduced by Kennedy and Eberhart in 1995. In the proposed BASPSO, the beam angles are optimized using PSO by treating each beam configuration as a particle (individual), and the beam intensity maps for each beam configuration are optimized using the conjugate gradient (CG) algorithm. These two optimization processes are implemented iteratively. The performance of each individual is evaluated by a fitness value calculated with a physical objective function. A population of these individuals is evolved by cooperation and competition among the individuals themselves through generations. The optimization results of a simulated case with known optimal beam angles and two clinical cases (a prostate case and a head-and-neck case) show that PSO is valid and efficient and can speed up the beam angle optimization process. Furthermore, the performance comparisons based on the preliminary results indicate that, as a whole, the PSO-based algorithm seems to outperform, or at least compete with, the GA-based algorithm in computation time and robustness. In conclusion, the reported work suggested that the introduced PSO algorithm could act as a new promising solution to the beam angle optimization problem and potentially other optimization problems in IMRT, though further studies need to be investigated

Market-based autonomous resource and application management in private clouds

KAUST Repository

Costache, Stefania; Kortas, Samuel; Morin, Christine; Parlavantzas, Nikos

2016-01-01

High Performance Computing (HPC) clouds need to be efficiently shared between selfish tenants having applications with different resource requirements and Service Level Objectives (SLOs). The main difficulty relies on providing concurrent resource access to such tenants while maximizing the resource utilization. To overcome this challenge, we propose Merkat, a market-based SLO-driven cloud platform. Merkat relies on a market-based model specifically designed for on-demand fine-grain resource allocation to maximize resource utilization and it uses a combination of currency distribution and dynamic resource pricing to ensure proper resource distribution among tenants. To meet the tenant’s SLO, Merkat uses autonomous controllers, which apply adaptation policies that: (i) dynamically tune the application’s provisioned CPU and memory per virtual machine in contention periods, or (ii) dynamically change the number of virtual machines. Our evaluation with simulation and on the Grid’5000 testbed shows that Merkat provides flexible support for different application types and SLOs and good tenant satisfaction compared to existing centralized systems, while the infrastructure resource utilization is improved.

Market-based autonomous resource and application management in private clouds

KAUST Repository

Costache, Stefania

2016-10-12

High Performance Computing (HPC) clouds need to be efficiently shared between selfish tenants having applications with different resource requirements and Service Level Objectives (SLOs). The main difficulty relies on providing concurrent resource access to such tenants while maximizing the resource utilization. To overcome this challenge, we propose Merkat, a market-based SLO-driven cloud platform. Merkat relies on a market-based model specifically designed for on-demand fine-grain resource allocation to maximize resource utilization and it uses a combination of currency distribution and dynamic resource pricing to ensure proper resource distribution among tenants. To meet the tenant’s SLO, Merkat uses autonomous controllers, which apply adaptation policies that: (i) dynamically tune the application’s provisioned CPU and memory per virtual machine in contention periods, or (ii) dynamically change the number of virtual machines. Our evaluation with simulation and on the Grid’5000 testbed shows that Merkat provides flexible support for different application types and SLOs and good tenant satisfaction compared to existing centralized systems, while the infrastructure resource utilization is improved.

Enhanced Particle Swarm Optimization Algorithm: Efficient Training of ReaxFF Reactive Force Fields.

Science.gov (United States)

Furman, David; Carmeli, Benny; Zeiri, Yehuda; Kosloff, Ronnie

2018-05-04

Particle swarm optimization is a powerful metaheuristic population-based global optimization algorithm. However, when applied to non-separable objective functions its performance on multimodal landscapes is significantly degraded. Here we show that a significant improvement in the search quality and efficiency on multimodal functions can be achieved by enhancing the basic rotation-invariant particle swarm optimization algorithm with isotropic Gaussian mutation operators. The new algorithm demonstrates a superior performance across several nonlinear, multimodal benchmark functions compared to the rotation-invariant Particle Swam Optimization (PSO) algorithm and the well-established simulated annealing and sequential one-parameter parabolic interpolation methods. A search for the optimal set of parameters for the dispersion interaction model in ReaxFF-lg reactive force field is carried out with respect to accurate DFT-TS calculations. The resulting optimized force field accurately describes the equations of state of several high-energy molecular crystals where such interactions are of crucial importance. The improved algorithm also presents a better performance compared to a Genetic Algorithm optimization method in the optimization of a ReaxFF-lg correction model parameters. The computational framework is implemented in a standalone C++ code that allows a straightforward development of ReaxFF reactive force fields.

Towards a Logical Distinction Between Swarms and Aftershock Sequences

Science.gov (United States)

Gardine, M.; Burris, L.; McNutt, S.

2007-12-01

The distinction between swarms and aftershock sequences has, up to this point, been fairly arbitrary and non- uniform. Typically 0.5 to 1 order of magnitude difference between the mainshock and largest aftershock has been a traditional choice, but there are many exceptions. Seismologists have generally assumed that the mainshock carries most of the energy, but this is only true if it is sufficiently large compared to the size and numbers of aftershocks. Here we present a systematic division based on energy of the aftershock sequence compared to the energy of the largest event of the sequence. It is possible to calculate the amount of aftershock energy assumed to be in the sequence using the b-value of the frequency-magnitude relation with a fixed choice of magnitude separation (M-mainshock minus M-largest aftershock). Assuming that the energy of an aftershock sequence is less than the energy of the mainshock, the b-value at which the aftershock energy exceeds that of the mainshock energy determines the boundary between aftershock sequences and swarms. The amount of energy for various choices of b-value is also calculated using different values of magnitude separation. When the minimum b-value at which the sequence energy exceeds that of the largest event/mainshock is plotted against the magnitude separation, a linear trend emerges. Values plotting above this line represent swarms and values plotting below it represent aftershock sequences. This scheme has the advantage that it represents a physical quantity - energy - rather than only statistical features of earthquake distributions. As such it may be useful to help distinguish swarms from mainshock/aftershock sequences and to better determine the underlying causes of earthquake swarms.

3rd international swarm seminar. Proceedings

International Nuclear Information System (INIS)

Lindinger, W.; Villinger, H.; Federer, W.

1983-01-01

47 papers on various problems of ion physics have been presented. The session headings are 1) recombination and electron attachment 2) transport of electrons in gases and liquids 3) swarm studies on collisions of metastable and on collisions of Rydberg atoms 4) ion neutral-interactions 5) ion transport in gases 6) applied aspects of swarm studies. (G.Q.)

Swarm Products and Space Weather Applications

DEFF Research Database (Denmark)

Stolle, Claudia; Olsen, Nils; Martini, Daniel

The Swarm satellite constellation mission provides high precision magnetic field data and models and other observations that enable us to explore near Earth space for example in terms of in situ electron density and electric fields. On board GPS observables can be used for sounding ionospheric...... in aeronomy and space weather. We will emphasize results from the Swarm mission....

A dynamic feedforward neural network based on gaussian particle swarm optimization and its application for predictive control.

Science.gov (United States)

Han, Min; Fan, Jianchao; Wang, Jun

2011-09-01

A dynamic feedforward neural network (DFNN) is proposed for predictive control, whose adaptive parameters are adjusted by using Gaussian particle swarm optimization (GPSO) in the training process. Adaptive time-delay operators are added in the DFNN to improve its generalization for poorly known nonlinear dynamic systems with long time delays. Furthermore, GPSO adopts a chaotic map with Gaussian function to balance the exploration and exploitation capabilities of particles, which improves the computational efficiency without compromising the performance of the DFNN. The stability of the particle dynamics is analyzed, based on the robust stability theory, without any restrictive assumption. A stability condition for the GPSO+DFNN model is derived, which ensures a satisfactory global search and quick convergence, without the need for gradients. The particle velocity ranges could change adaptively during the optimization process. The results of a comparative study show that the performance of the proposed algorithm can compete with selected algorithms on benchmark problems. Additional simulation results demonstrate the effectiveness and accuracy of the proposed combination algorithm in identifying and controlling nonlinear systems with long time delays.

Particle Swarm Transport through Immiscible Fluid Layers in a Fracture

Science.gov (United States)

Teasdale, N. D.; Boomsma, E.; Pyrak-Nolte, L. J.

2011-12-01

Immiscible fluids occur either naturally (e.g. oil & water) or from anthropogenic processes (e.g. liquid CO2 & water) in the subsurface and complicate the transport of natural or engineered micro- or nano-scale particles. In this study, we examined the effect of immiscible fluids on the formation and evolution of particle swarms in a fracture. A particle swarm is a collection of colloidal-size particles in a dilute suspension that exhibits cohesive behavior. Swarms fall under gravity with a velocity that is greater than the settling velocity of a single particle. Thus a particle swarm of colloidal contaminants can potentially travel farther and faster in a fracture than expected for a dispersion or emulsion of colloidal particles. We investigated the formation, evolution, and break-up of colloidal swarms under gravity in a uniform aperture fracture as hydrophobic/hydrophyllic particle swarms move across an oil-water interface. A uniform aperture fracture was fabricated from two transparent acrylic rectangular prisms (100 mm x 50 mm x 100 mm) that are separated by 1, 2.5, 5, 10 or 50 mm. The fracture was placed, vertically, inside a glass tank containing a layer of pure silicone oil (polydimethylsiloxane) on distilled water. Along the length of the fracture, 30 mm was filled with oil and 70 mm with water. Experiments were conducted using silicone oils with viscosities of 5, 10, 100, or 1000 cSt. Particle swarms (5 μl) were comprised of a 1% concentration (by mass) of 25 micron glass beads (hydrophilic) suspended in a water drop, or a 1% concentration (by mass) of 3 micron polystyrene fluorescent beads (hydrophobic) suspended in a water drop. The swarm behavior was imaged using an optical fluorescent imaging system composed of a CCD camera and by green (525 nm) LED arrays for illumination. Swarms were spherical and remained coherent as they fell through the oil because of the immiscibility of oil and water. However, as a swarm approached the oil-water interface, it

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

Science.gov (United States)

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.

Antarctic krill swarm characteristics in the Southeast Atlantic sector of the Southern Ocean

KAUST Repository

Krafft, BA

2012-09-28

Knowledge about swarm dynamics and underlying causes is essential to understand the ecology and distribution of Antarctic krill Euphausia superba. We collected acoustic data and key environmental data continuously across extensive gradients in the little-studied Southeast Atlantic sector of the Southern Ocean. A total of 4791 krill swarms with swarm descriptors including swarm height and length, packing density, swimming depth and inter-swarm distance were extracted. Through multivariate statistics, swarms were categorized into 4 groups. Group 2 swarms were largest (median length 108 m and thickness 18 m), whereas swarms in both Groups 1 and 4 were on average small, but differed markedly in depth distribution (median: 52 m for Group 1 vs. 133 m for Group 4). There was a strong spatial autocorrelation in the occurrence of swarms, and an autologistic regression model found no prediction of swarm occurrence from environmental variables for any of the Groups 1, 2 or 4. Probability of occurrence of Group 3 swarms, however, increased with increasing depth and temperature. Group 3 was the most distinctive swarm group with an order of magnitude higher packing density (median: 226 ind. m−3) than swarms from any of the other groups and about twice the distance to nearest neighbor swarm (median: 493 m). The majority of the krill were present in Group 3 swarms, and the absence of association with hydrographic or topographic concentrating mechanisms strongly suggests that these swarms aggregate through their own locomotion, possibly associated with migration.

Antarctic krill swarm characteristics in the Southeast Atlantic sector of the Southern Ocean

KAUST Repository

Krafft, BA; Skaret, G; Knutsen, T; Melle, W; Klevjer, Thor; Sø iland, H

2012-01-01

Knowledge about swarm dynamics and underlying causes is essential to understand the ecology and distribution of Antarctic krill Euphausia superba. We collected acoustic data and key environmental data continuously across extensive gradients in the little-studied Southeast Atlantic sector of the Southern Ocean. A total of 4791 krill swarms with swarm descriptors including swarm height and length, packing density, swimming depth and inter-swarm distance were extracted. Through multivariate statistics, swarms were categorized into 4 groups. Group 2 swarms were largest (median length 108 m and thickness 18 m), whereas swarms in both Groups 1 and 4 were on average small, but differed markedly in depth distribution (median: 52 m for Group 1 vs. 133 m for Group 4). There was a strong spatial autocorrelation in the occurrence of swarms, and an autologistic regression model found no prediction of swarm occurrence from environmental variables for any of the Groups 1, 2 or 4. Probability of occurrence of Group 3 swarms, however, increased with increasing depth and temperature. Group 3 was the most distinctive swarm group with an order of magnitude higher packing density (median: 226 ind. m−3) than swarms from any of the other groups and about twice the distance to nearest neighbor swarm (median: 493 m). The majority of the krill were present in Group 3 swarms, and the absence of association with hydrographic or topographic concentrating mechanisms strongly suggests that these swarms aggregate through their own locomotion, possibly associated with migration.

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

Science.gov (United States)

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.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.

Iteration particle swarm optimization for contract capacities selection of time-of-use rates industrial customers

International Nuclear Information System (INIS)

Lee, Tsung-Ying; Chen, Chun-Lung

2007-01-01

This paper presents a new algorithm for solving the optimal contract capacities of a time-of-use (TOU) rates industrial customer. This algorithm is named iteration particle swarm optimization (IPSO). A new index, called iteration best is incorporated into particle swarm optimization (PSO) to improve solution quality and computation efficiency. Expanding line construction cost and contract recovery cost are considered, as well as demand contract capacity cost and penalty bill, in the selection of the optimal contract capacities. The resulting optimal contract capacity effectively reaches the minimum electricity charge of TOU rates users. A significant reduction in electricity costs is observed. The effects of expanding line construction cost and contract recovery cost on the selection of optimal contract capacities can also be estimated. The feasibility of the new algorithm is demonstrated by a numerical example, and the IPSO solution quality and computation efficiency are compared to those of other algorithms

Particle Swarm Optimization With Interswarm Interactive Learning Strategy.

Science.gov (United States)

Qin, Quande; Cheng, Shi; Zhang, Qingyu; Li, Li; Shi, Yuhui

2016-10-01

The learning strategy in the canonical particle swarm optimization (PSO) algorithm is often blamed for being the primary reason for loss of diversity. Population diversity maintenance is crucial for preventing particles from being stuck into local optima. In this paper, we present an improved PSO algorithm with an interswarm interactive learning strategy (IILPSO) by overcoming the drawbacks of the canonical PSO algorithm's learning strategy. IILPSO is inspired by the phenomenon in human society that the interactive learning behavior takes place among different groups. Particles in IILPSO are divided into two swarms. The interswarm interactive learning (IIL) behavior is triggered when the best particle's fitness value of both the swarms does not improve for a certain number of iterations. According to the best particle's fitness value of each swarm, the softmax method and roulette method are used to determine the roles of the two swarms as the learning swarm and the learned swarm. In addition, the velocity mutation operator and global best vibration strategy are used to improve the algorithm's global search capability. The IIL strategy is applied to PSO with global star and local ring structures, which are termed as IILPSO-G and IILPSO-L algorithm, respectively. Numerical experiments are conducted to compare the proposed algorithms with eight popular PSO variants. From the experimental results, IILPSO demonstrates the good performance in terms of solution accuracy, convergence speed, and reliability. Finally, the variations of the population diversity in the entire search process provide an explanation why IILPSO performs effectively.

Knowledge Management and Problem Solving in Real Time: The Role of Swarm Intelligence

Directory of Open Access Journals (Sweden)

Chris W Callaghan

2016-06-01

Full Text Available Knowledge management research applied to the development of real-time research capability, or capability to solve societal problems in hours and days instead of years and decades, is perhaps increasingly important, given persistent global problems such as the Zika virus and rapidly developing antibiotic resistance. Drawing on swarm intelligence theory, this paper presents an approach to real-time research problem-solving in the form of a framework for understanding the complexity of real-time research and the challenges associated with maximizing collaboration. The objective of this research is to make explicit certain theoretical, methodological, and practical implications deriving from new literature on emerging technologies and new forms of problem solving and to offer a model of real-time problem solving based on a synthesis of the literature. Drawing from ant colony, bee colony, and particle swarm optimization, as well as other population-based metaheuristics, swarm intelligence principles are derived in support of improved effectiveness and efficiency for multidisciplinary human swarm problem-solving. This synthesis seeks to offer useful insights into the research process, by offering a perspective of what maximized collaboration, as a system, implies for real-time problem solving.

Simplified particle swarm optimization algorithm - doi: 10.4025/actascitechnol.v34i1.9679

Directory of Open Access Journals (Sweden)

Ricardo Paupitz Barbosa dos Santos

2011-11-01

Full Text Available Real ants and bees are considered social insects, which present some remarkable characteristics that can be used, as inspiration, to solve complex optimization problems. This field of study is known as swarm intelligence. Therefore, this paper presents a new algorithm that can be understood as a simplified version of the well known Particle Swarm Optimization (PSO. The proposed algorithm allows saving some computational effort and obtains a considerable performance in the optimization of nonlinear functions. We employed four nonlinear benchmark functions, Sphere, Schwefel, Schaffer and Ackley functions, to test and validate the new proposal. Some simulated results were used in order to clarify the efficiency of the proposed algorithm.