{"title":"A discontinuous recurrent neural network with predefined time convergence for solution of linear programming","authors":"J. Sánchez‐Torres, E. Sánchez, A. Loukianov","doi":"10.1109/SIS.2014.7011799","DOIUrl":"https://doi.org/10.1109/SIS.2014.7011799","url":null,"abstract":"The aim of this paper is to introduce a new recurrent neural network to solve linear programming. The main characteristic of the proposed scheme is its design based on the predefined-time stability. The predefined-time stability is a stronger form of finite-time stability which allows the a priori definition of a convergence time that does not depend on the network initial state. The network structure is based on the Karush-Kuhn-Tucker (KKT) conditions and the KKT multipliers are proposed as sliding mode control inputs. This selection yields to an one-layer recurrent neural network in which the only parameter to be tuned is the desired convergence time. With this features, the network can be easily scaled from a small to a higher dimension problem. The simulation of a simple example shows the feasibility of the current approach.","PeriodicalId":380286,"journal":{"name":"2014 IEEE Symposium on Swarm Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128425199","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Improving artifact selection via agent migration in multi-population cultural algorithms","authors":"Felicitas Mokom, Ziad Kobti","doi":"10.1109/SIS.2014.7011810","DOIUrl":"https://doi.org/10.1109/SIS.2014.7011810","url":null,"abstract":"Multi-population cultural algorithms are cultural evolutionary frameworks involving multiple independently evolving subpopulations. Artifact selection involves the ability of agents to autonomously reason about selecting artifacts towards achieving their goals. In this study, agent migration between populations in a multi-population cultural algorithm is explored as an approach for augmenting artifact selection knowledge in social agents. Embedded in a social simulation model the multipopulation cultural algorithm consists of two subpopulations where agents in one subpopulation consistently outperform agents in the other due to the presence of knowledge about certain artifacts. Social networks connect agents within a subpopulation and agent knowledge can be altered by members of their network or the best performers of their subpopulation. The model investigates agent migration with novel artifact knowledge from the advanced subpopulation to the underperforming one. Child safety restraint selection is provided as an implemented case study. Results demonstrate the benefits of migration with a higher likelihood of an increase in agent performance when the social network is enabled. The study shows that culturally evolving agents can improve artifact selection knowledge in the absence of standard interventions as a result of migration.","PeriodicalId":380286,"journal":{"name":"2014 IEEE Symposium on Swarm Intelligence","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125095996","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Asynchronous particle swarm optimization with discrete crossover","authors":"A. Engelbrecht","doi":"10.1109/SIS.2014.7011788","DOIUrl":"https://doi.org/10.1109/SIS.2014.7011788","url":null,"abstract":"Recent work has evaluated the performance of a synchronous global best (gbest) particle swarm optimization (PSO) algorithm hybridized with discrete crossover operators. This paper investigates if using asynchronous position updates instead of synchronous updates will result in improved performance of a gbest PSO that uses these discrete crossover operators. Empirical analysis of the performance of the resulting algorithms provides strong evidence that asynchronous position updates significantly improves performance of the PSO discrete crossover hybrid algorithms, mainly with respect to accuracy and convergence speed. These improvements were seen over an extensive benchmark suite of 60 boundary constrained minimization problems of various characteristics.","PeriodicalId":380286,"journal":{"name":"2014 IEEE Symposium on Swarm Intelligence","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122709547","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The hybrid swarm intelligence for S-system model-based genetic network","authors":"W. Yeh, Chia-Ling Huang","doi":"10.1109/SIS.2014.7011785","DOIUrl":"https://doi.org/10.1109/SIS.2014.7011785","url":null,"abstract":"The importance of any inferences that can be taken from underlying genetic networks of observed time-series data of gene expression patterns should not be overlooked. They are one of the largest topics within bioinformatics. The S-system model is one good choice for analyzing such genetic networks due to the fact that it can capture various dynamics. One problem this model faces is the fact that the number of S-system parameters is in proportion with the square of the number of genes. This is also the reasoning as to why the S-system model tends to be used on smaller scales. Its parameters are optimized by hybrid soft computing. Furthermore, it also uses the problem decomposition strategy to deal with the vast amount of problems a system might face. First of all the original problem is split into several smaller parts, which are then separately solved by the SSO. Afterwards, all of these separate solutions are merged together and used to solve the original problem along with the ABC. This shows the effectiveness of the SSO in solving such sub problems. Lastly, the SSO also utilizes the hybrid soft computing system, which infers the possibility of having S-systems on a larger scale.","PeriodicalId":380286,"journal":{"name":"2014 IEEE Symposium on Swarm Intelligence","volume":"176 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129899328","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A fuzzy system for parameter adaptation in ant colony optimization","authors":"Frumen Olivas, F. Valdez, O. Castillo","doi":"10.1109/SIS.2014.7011780","DOIUrl":"https://doi.org/10.1109/SIS.2014.7011780","url":null,"abstract":"In this paper we propose a fuzzy system for parameter adaptation in ant colony optimization (ACO). ACO is a method inspired in the behavior of ant colonies to find food and its objective are discrete optimization problems. We developed various fuzzy systems for parameter adaptation and in this paper a comparison was made between them. The use of a fuzzy system is to control the diversity of the solutions, this is, control the ability of exploration and exploitation of the ant colony.","PeriodicalId":380286,"journal":{"name":"2014 IEEE Symposium on Swarm Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128854116","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Repellent pheromones for effective swarm robot search in unknown environments","authors":"Filip Fossum, Jean-Marc Montanier, P. Haddow","doi":"10.1109/SIS.2014.7011802","DOIUrl":"https://doi.org/10.1109/SIS.2014.7011802","url":null,"abstract":"In time-critical situations such as rescue missions, effective exploration is essential. Exploration of such unknown environments may be achieved through the dispersion of a swarm of robots. Recent research has turned to biology where pheromone trails provide a form of collective memory of visited areas. Rather than the attractive pheromones that have been the focus of much research, this paper considers locally distributed repellent pheromones. Further, the conditions for maximising search efficiency are investigated.","PeriodicalId":380286,"journal":{"name":"2014 IEEE Symposium on Swarm Intelligence","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124577594","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Comparison of self-adaptive particle swarm optimizers","authors":"E. V. Zyl, A. Engelbrecht","doi":"10.1109/SIS.2014.7011775","DOIUrl":"https://doi.org/10.1109/SIS.2014.7011775","url":null,"abstract":"Particle swarm optimization (PSO) algorithms have a number of parameters to which their behaviour is sensitive. In order to avoid problem-specific parameter tuning, a number of self-adaptive PSO algorithms have been proposed over the past few years. This paper compares the behaviour and performance of a selection of self-adaptive PSO algorithms to that of time-variant algorithms on a suite of 22 boundary constrained benchmark functions of varying complexities. It was found that only two of the nine selected self-adaptive PSO algorithms performed comparably to similar time-variant PSO algorithms. Possible reasons for the poor behaviour of the other algorithms as well as an analysis of the more successful algorithms is performed in this paper.","PeriodicalId":380286,"journal":{"name":"2014 IEEE Symposium on Swarm Intelligence","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124727811","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Communication-aware distributed PSO for dynamic robotic search","authors":"L. Perreault, Mike P. Wittie, John W. Sheppard","doi":"10.1109/SIS.2014.7011777","DOIUrl":"https://doi.org/10.1109/SIS.2014.7011777","url":null,"abstract":"The use of swarm robotics in search tasks is an active area of research. A variety of algorithms have been developed that effectively direct robots toward a desired target by leveraging their collaborative sensing capabilities. Unfortunately, these algorithms often neglect the task of communicating possible task solutions outside of the swarm. Many scenarios require a monitoring station that must receive updates from robots within the swarm. This task is trivial in constrained locations, but becomes difficult as the search area increases and communication between nodes is not always possible. A second shortcoming of existing algorithms is the inability to find and track mobile targets. We propose an extension to the distributed Particle Swarm Optimization algorithm that is both communication-aware and capable of tracking mobile targets within a search space. Simulated experiments show that our algorithm returns more accurate solutions to a monitoring station than existing algorithms, especially in scenarios, where the target value or location changes over time.","PeriodicalId":380286,"journal":{"name":"2014 IEEE Symposium on Swarm Intelligence","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123244164","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Engineering optimization using interior search algorithm","authors":"A. Gandomi, D. Roke","doi":"10.1109/SIS.2014.7011771","DOIUrl":"https://doi.org/10.1109/SIS.2014.7011771","url":null,"abstract":"A new global optimization algorithm, the interior search algorithm (ISA), is introduced for solving engineering optimization problems. The ISA has been recently proposed and has two new search operators, composition optimization and mirror search. In the current study, the optimization process starts with composition optimization and linearly switches to mirror search. For validation against engineering optimization problems, ISA is applied to several benchmark engineering problems reported in the literature. The optimal solutions obtained by ISA are better than the best solutions obtained by the other methods representative of the state-of-the-art in optimization algorithms.","PeriodicalId":380286,"journal":{"name":"2014 IEEE Symposium on Swarm Intelligence","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122757043","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Daniel W. Palmer, M. Kirschenbaum, Eric Mustee, Jason Dengler
{"title":"Human-swarm hybrids outperform both humans and swarms solving digital Jigsaw puzzles","authors":"Daniel W. Palmer, M. Kirschenbaum, Eric Mustee, Jason Dengler","doi":"10.1109/SIS.2014.7011797","DOIUrl":"https://doi.org/10.1109/SIS.2014.7011797","url":null,"abstract":"We compare three approaches to solving digital jigsaw puzzles with wrap-around connections: human-only, swarm-only, and a hybrid approach that requires humans to interact with the swarm in a high-level, scalable manner. Using an iterative improvement strategy, some positive aspects of the human solvers migrate to the swarm-only approach. As the swarm-only approach gets better, humans continue to assist and the hybrid outperforms either of the independent approaches. This strategy for improving swarms is general, and continuously applicable. We show that even after many iterations and significant improvements to the swarm-only approach, support from a human improves the performance of the swarm.","PeriodicalId":380286,"journal":{"name":"2014 IEEE Symposium on Swarm Intelligence","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128078764","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}