2011 IEEE Symposium on Swarm Intelligence最新文献

Magnetic particle swarm optimization 磁粒子群优化

2011 IEEE Symposium on Swarm Intelligence Pub Date : 2011-04-11 DOI: 10.1109/SIS.2011.5952575

P. S. Prampero, R. Attux

引用次数: 18

Exploring different rule quality evaluation functions in ACO-based classification algorithms 探索基于蚁群算法的不同规则质量评价函数

2011 IEEE Symposium on Swarm Intelligence Pub Date : 2011-04-11 DOI: 10.1109/SIS.2011.5952574

Khalid M. Salama, A. M. Abdelbar

引用次数: 16

Analysis of BEECLUST swarm algorithm BEECLUST群算法分析

2011 IEEE Symposium on Swarm Intelligence Pub Date : 2011-04-11 DOI: 10.1109/SIS.2011.5952587

J. Hereford

引用次数: 23

An algorithm for self-organized aggregation of swarm robotics using timer 基于定时器的群体机器人自组织聚合算法

2011 IEEE Symposium on Swarm Intelligence Pub Date : 2011-04-11 DOI: 10.1109/SIS.2011.5952567

Xinan Yan, Alei Liang, Haibing Guan

{"title":"An algorithm for self-organized aggregation of swarm robotics using timer","authors":"Xinan Yan, Alei Liang, Haibing Guan","doi":"10.1109/SIS.2011.5952567","DOIUrl":"https://doi.org/10.1109/SIS.2011.5952567","url":null,"abstract":"Aggregation is a basic collective behavior in biology, and is a prerequisite for many applications of swarm robotics. This paper proposes a new distributed algorithm for aggregation of swarm robotics under the constraints of no central control, no information about positions, and only local interaction among robots. Our control strategy contains two states, Search and Wait, for individual robot, as in the model of probabilistic finite state automata (PFSA). The main difference from PFSA is the way of how individual robot decides to leave from an aggregate. In our approach, each robot in an aggregate has a timer as its lifetime in the aggregate instead of having a leaving probability in PFSA. Further, to make all robots aggregate together, the key idea of our algorithm is that robots in small aggregate have shorter lifetime than those in large aggregate. The lifetime of individual robot in an aggregate is approximated as the lifetime of the aggregate, by making all the timers of the robots in the same aggregate have the same time settings, where the time is proportional to aggregate size and is updated only with the increase of aggregate size. By choosing linear function as the time setting of the timer, experiments based on simulator have been done. The results show that our algorithm is successful and scalable for large scale of robots, and indicate that the performance of the aggregation of all robots is improved by decreasing the lifetime of uncompleted aggregate in high robot density or increasing it in low robot density.","PeriodicalId":175889,"journal":{"name":"2011 IEEE Symposium on Swarm Intelligence","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116648034","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}

引用次数: 13

Frontier-based multi-robot map exploration using Particle Swarm Optimization 基于粒子群算法的边界多机器人地图探索

2011 IEEE Symposium on Swarm Intelligence Pub Date : 2011-04-11 DOI: 10.1109/SIS.2011.5952584

Yiheng Wang, Alei Liang, Haibing Guan

引用次数: 55

A framework for boltzmann-type models of robotic swarms 机器人群体玻尔兹曼型模型的框架

2011 IEEE Symposium on Swarm Intelligence Pub Date : 2011-04-11 DOI: 10.1109/SIS.2011.5952565

A. Kettler, H. Wörn

引用次数: 3

A hybrid ABC-SPSO algorithm for continuous function optimization 连续函数优化的ABC-SPSO混合算法

2011 IEEE Symposium on Swarm Intelligence Pub Date : 2011-04-11 DOI: 10.1109/SIS.2011.5952576

Mohammed El-Abd

引用次数: 38

The Robot Formation Language — A formal description of formations for collective robots 机器人队形语言——对集体机器人队形的正式描述

2011 IEEE Symposium on Swarm Intelligence Pub Date : 2011-04-11 DOI: 10.1109/SIS.2011.5952577

L. Winkler, A. Kettler, Marc Szymanski, H. Wörn

{"title":"The Robot Formation Language — A formal description of formations for collective robots","authors":"L. Winkler, A. Kettler, Marc Szymanski, H. Wörn","doi":"10.1109/SIS.2011.5952577","DOIUrl":"https://doi.org/10.1109/SIS.2011.5952577","url":null,"abstract":"In this paper we will present the Robot Formation Language (RFL), a topology description language for the formation of multi robot systems, such as robot swarms or self-reconfigurable modular robot platforms. The RFL supports homogeneous as well as heterogeneous multi robot platforms. This is important especially for modular robots (we also call them robot organisms), as there can also be robots included which have a different kinematic behaviour. Additionally, it supports tools, such as active wheels, grippers or structural elements, which enhance the capabilities of a modular robot platform. As we focus on creating organisms out of a robot swarm (i.e. the swarm robots have capabilities to connect to each other to build a modular robot organism), it is important to have a common language, which describes the swarm as well as the organism. Using the RFL, we will define a distance between two formations and describe how the calculation for this purpose can be distributed among the members of the collective. RFL cannot only be used to describe the formation of a multi robot system, but it can also be used to retrieve the kinematic chain of an organism or as a genome to evolve different organism shapes for example. It is also useful for the swarm robots to identify their position in the swarm.","PeriodicalId":175889,"journal":{"name":"2011 IEEE Symposium on Swarm Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129542423","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}

引用次数: 8

Ant-Q hyper-heuristic approach for solving 2-dimensional Cutting Stock Problem 求解二维截料问题的蚁q超启发式方法

2011 IEEE Symposium on Swarm Intelligence Pub Date : 2011-04-11 DOI: 10.1109/SIS.2011.5952530

Imen Khamassi, M. Hammami, K. Ghédira

引用次数: 7

Diversity control in particle swarm optimization 粒子群优化中的多样性控制

2011 IEEE Symposium on Swarm Intelligence Pub Date : 2011-04-11 DOI: 10.1109/SIS.2011.5952581

Shi Cheng, Yuhui Shi

引用次数: 55