{"title":"An Ant Colony Optimization using training data applied to UAV way point path planning in wind","authors":"A. Jennings, R. Ordóñez, N. Ceccarelli","doi":"10.1109/SIS.2008.4668302","DOIUrl":"https://doi.org/10.1109/SIS.2008.4668302","url":null,"abstract":"Path planning for small unmanned air vehicles (UAVs) becomes a difficult problem when accounting for wind. Wind can affect the path quality in a nonlinear manner requiring extended segment lengths for accurate following. A method is presented to find near-optimal paths through stochastic optimization based on a training set. In general the method applies to quickly find a near-optimal solution of a continuous function with function parameters. The training set is composed of optimized solutions for different parameters. By a method similar to Ant Colony Optimization, a probability distribution is created based on the training set to create random paths. In this case the similarity of the desired path to examples in the training set is used to weight the probability distribution. The training data can be created offline using computationally intensive methods and the stochastic optimization can be used to create good paths in a timely manner.","PeriodicalId":178251,"journal":{"name":"2008 IEEE Swarm Intelligence Symposium","volume":"93 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133821649","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":"Cautious particle swarm","authors":"Hiroshi Someya","doi":"10.1109/SIS.2008.4668292","DOIUrl":"https://doi.org/10.1109/SIS.2008.4668292","url":null,"abstract":"Behavior and search performance of the proposed cautious particle swarm, in which the particles are cautious about imitating the best successful one, are investigated with a question: ldquoIs it really the best strategy for a group that every individual in which obediently imitates the top one?rdquo Their neutral or disobedient attitudes to the global best are expressed by replacing the conventional uniform distribution for random numbers with either of the two probability distributions: slided uniform distribution and asymmetrical normal distribution. Empirical analyses on the behavior of such a single particle in one-dimensional search space have aroused an expectation that appropriate cautiousness balance may accomplish both exploration-oriented search for avoiding local minima and exploitation-oriented search for finding the global optimum near the global best. For discussion on the optimization performance of the cautious particle swarm, experiments in typical test functions were performed. The experimental results have presented an acceptable parameter range of obedience for appropriate cautiousness.","PeriodicalId":178251,"journal":{"name":"2008 IEEE Swarm Intelligence Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122408073","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":"Optimal pheromone distribution for ANCOR","authors":"Deniz Demiray, D. Altilar","doi":"10.1109/SIS.2008.4668311","DOIUrl":"https://doi.org/10.1109/SIS.2008.4668311","url":null,"abstract":"This work investigates the utilization of a new pheromone distribution model for ANCOR. ANCOR is a novel routing algorithm for sensor networks. The main idea behind the algorithm is imitating the real acts of ants for finding new food resources and bringing them to their nests. A new pheromone distribution model for ANCOR, i.e. optimal pheromone distribution model will be presented, and its performance profits over the existing model will be discussed.","PeriodicalId":178251,"journal":{"name":"2008 IEEE Swarm Intelligence Symposium","volume":"289 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117295795","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":"An evaluation of two swarm intelligence MANET routing algorithms in an urban environment","authors":"F. Ducatelle, G. D. Caro, L. Gambardella","doi":"10.1109/SIS.2008.4668322","DOIUrl":"https://doi.org/10.1109/SIS.2008.4668322","url":null,"abstract":"We study through simulation the performance of two swarm intelligence MANET routing algorithms in a realistic urban environment. The two algorithms, ANSI and AntHocNet, implement the swarm intelligence paradigm for routing in different ways: while ANSI applies a reactive approach in which ants are only sent out when no route is available between the source and destination of a communication session, AntHocNet integrates reactive and proactive mechanisms whereby the algorithm sends out ants at regular intervals during the entire duration of running sessions in order to continuously adapt and improve existing routes. The two swarm intelligence routing algorithms are compared to AODV, a state-of-the-art reactive algorithm, and OLSR, a state-of-the-art proactive algorithm. Our objective is to investigate the usefulness of the different approaches adopted by the algorithms when confronted with the peculiarities of urban environments and the requirements of real-world applications. At this aim we define a detailed and realistic simulation setup. We model node mobility by limiting node movements to the streets and open spaces of town, use a ray-tracing approach to model the propagation of radio waves, and investigate different kinds of interactive data traffic patterns, ranging from SMS messaging to VoIP communications.","PeriodicalId":178251,"journal":{"name":"2008 IEEE Swarm Intelligence Symposium","volume":"435 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125802665","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":"Meta-heuristic cross-layer protocol for UWB emergency responder sensor network","authors":"R. Muraleedharan, Weihua Gao, L. Osadciw","doi":"10.1109/SIS.2008.4668325","DOIUrl":"https://doi.org/10.1109/SIS.2008.4668325","url":null,"abstract":"In this paper, an ultra-wideband based sensor network for an emergency responder system is analyzed. Due to multiple objectives such as adaptive data rate, power control and quality-of-service the message transmission can be framed as a non-deterministic polynomial computation time hard problem. Thus a meta-heuristic algorithm is applied to obtain a reliable and optimal solution. The designed cross layer protocol incorporates the signalpsilas physical properties. thus balancing the throughput while reducing latency, sensor resources thus longevity of network is attained.","PeriodicalId":178251,"journal":{"name":"2008 IEEE Swarm Intelligence Symposium","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125651871","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":"Agents based algorithms for design parameter estimation in contaminant transport inverse problems","authors":"T. V. Bharat","doi":"10.1109/SIS.2008.4668312","DOIUrl":"https://doi.org/10.1109/SIS.2008.4668312","url":null,"abstract":"A considerable amount of work has been dedicated on the development of analytical solutions for flow of chemical contaminants through soils. Most of the analytical solutions for complex transport problems are closed-form series solutions. The convergence of these solutions depends on the eigenvalues obtained from a corresponding transcendental equation. Thus, the difficulty in obtaining exact solutions from analytical models encourages the use of numerical solutions for the parameter estimation even though, the later models are computationally expensive. In this paper a combination of two swarm intelligence based algorithms are used for accurate estimation of design transport parameters from the closed-form analytical solutions. Estimation of eigenvalues from a transcendental equation is treated as a multimodal discontinuous function optimization problem. The eigenvalues are estimated using an algorithm derived based on glowworm swarm strategy. Parameter estimation of the inverse problem is handled using standard PSO algorithm. Integration of these two algorithms enables an accurate estimation of design parameters using closed-form analytical solutions. The present solver is applied to a real world inverse problem in environmental engineering. The inverse model based on swarm intelligence techniques is validated and the accuracy in parameter estimation is shown. The proposed solver quickly estimates the design parameters with a great precision.","PeriodicalId":178251,"journal":{"name":"2008 IEEE Swarm Intelligence Symposium","volume":"168 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133848632","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":"Balancing transmission power and hop count in ad hoc unicast routing with swarm intelligence","authors":"Ke Li, Chien-Chung Shen","doi":"10.1109/SIS.2008.4668323","DOIUrl":"https://doi.org/10.1109/SIS.2008.4668323","url":null,"abstract":"This paper describes CEDAR, a unicast routing protocol that balances transmission power and hop count in ad hoc networks. The protocol adopts the mechanism of swarm intelligence to dynamically assign transmission power to nodes along the discovered route (to reduce the sum of transmission power) subject to an end-to-end hop count constraint in data delivery. Simulation results validated the effectiveness of the protocol, and demonstrated the tradeoff relationship between end-to-end total transmission power and hop count.","PeriodicalId":178251,"journal":{"name":"2008 IEEE Swarm Intelligence Symposium","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121823247","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}
Cheng-Hung Chen, K. Bosworth, M. Schoen, S. Bearden, D. Naidu, A. P. Gracia
{"title":"A study of Particle Swarm Optimization on leukocyte adhesion molecules and control strategies for smart prosthetic hand","authors":"Cheng-Hung Chen, K. Bosworth, M. Schoen, S. Bearden, D. Naidu, A. P. Gracia","doi":"10.1109/SIS.2008.4668324","DOIUrl":"https://doi.org/10.1109/SIS.2008.4668324","url":null,"abstract":"Hard computing based optimization algorithms usually require a lot of computational resources and generally do not have the ability to arrive at the global optimum solution. Soft computing algorithms on the other hand negate these deficiencies, by allowing for reduced computational loads and the ability to find global optimal solutions, even for complex cost surfaces. This paper presents two numerical case studies where a particle swarm optimization (PSO) algorithm is applied to biomedical problems. In particular, the problem of identifying the rupture force for leukocyte adhesion molecules and the problem of finding the correct control parameters of a robotic hand, are addressed. Simulation results indicate that PSO is a feasible alternative to the computational expensive hard computing algorithms.","PeriodicalId":178251,"journal":{"name":"2008 IEEE Swarm Intelligence Symposium","volume":"255 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121328681","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}
Luis V. Santana-Quintero, C. Coello, A. G. Hernández-Díaz, J. Velázquez-Reyes
{"title":"Surrogate-based Multi-Objective Particle Swarm Optimization","authors":"Luis V. Santana-Quintero, C. Coello, A. G. Hernández-Díaz, J. Velázquez-Reyes","doi":"10.1109/SIS.2008.4668300","DOIUrl":"https://doi.org/10.1109/SIS.2008.4668300","url":null,"abstract":"This paper presents a new algorithm that approximates real function evaluations using supervised learning with a surrogate method called support vector machine (SVM). We perform a comparative study among different leader selection schemes in a multi-objective particle swarm optimizer (MOPSO), in order to determine the most appropriate approach to be adopted for solving the sort of problems of our interest. The resulting hybrid presents a poor spread of solutions, which motivates the introduction of a second phase to our algorithm, in which an approach called rough sets is adopted in order to improve the spread of solutions along the Pareto front. Rough sets are used as a local search engine, which is able to generate solutions in the neighborhood of the nondominated solutions previously generated by the surrogate-based algorithm. The resulting approach is able to generate reasonably good approximations of the Pareto front of problems of up to 30 decision variables with only 2,000 fitness function evaluations. Our results are compared with respect to the NSGA-II, which is a multi-objective evolutionary algorithm representative of the state-of-the-art in the area.","PeriodicalId":178251,"journal":{"name":"2008 IEEE Swarm Intelligence Symposium","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133489257","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":"Image-based tracking with Particle Swarms and Probabilistic Data Association","authors":"E. Kao, Peter VanMaasdam, John W. Sheppard","doi":"10.1109/SIS.2008.4668297","DOIUrl":"https://doi.org/10.1109/SIS.2008.4668297","url":null,"abstract":"The process of automatically tracking people within video sequences is currently receiving a great deal of interest within the computer vision research community. In this paper we contrast the performance of the popular Mean-Shift algorithmpsilas gradient descent based search strategy with a more advanced swarm intelligence technique. Towards this end, we propose the use of a Particle Swarm Optimization (PSO) algorithm to replace the gradient descent search, and also combine the swarm based search strategy with a Probabilistic Data Association Filter (PDAF) state estimator to perform the track association and maintenance stages. Performance is shown against a variety of data sets, ranging from easy to complex. The PSO-PDAF approach is seen to outperform both the Mean-Shift + Kalman filter and the single-measurement PSO + Kalman filter approach. However, PSOpsilas robustness to low contrast and occlusion comes at the cost of higher computational requirements.","PeriodicalId":178251,"journal":{"name":"2008 IEEE Swarm Intelligence Symposium","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132706624","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}