首页 > 最新文献

Swarm Intelligence最新文献

英文 中文
On the evolution of adaptable and scalable mechanisms for collective decision-making in a swarm of robots 论机器人群集体决策的适应性和可扩展机制的演化
IF 2.6 4区 计算机科学 Q3 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-01-19 DOI: 10.1007/s11721-023-00233-4
Ahmed Almansoori, Muhanad Alkilabi, Elio Tuci

A swarm of robots can collectively select an option among the available alternatives offered by the environment through a process known as collective decision-making. This process is characterised by the fact that once the group makes a decision, it can not be attributed to any of its group members. In swarm robotics, the individual mechanisms for collective decision-making are generally hand-designed and limited to a restricted set of solutions based on the voter or the majority model. In this paper, we demonstrate that it is possible to take an alternative approach in which the individual mechanisms are implemented using artificial neural network controllers automatically synthesised using evolutionary computation techniques. We qualitatively describe the group dynamics underlying the decision process on a collective perceptual discrimination task. We carry out extensive comparative tests that quantitatively evaluate the performance of the most commonly used decision-making mechanisms (voter model and majority model) with the proposed dynamic neural network model under various operating conditions and for swarms that differ in size. The results of our study clearly indicate that the performances of a swarm employing dynamical neural networks as the decision-making mechanism are more robust, more adaptable to a dynamic environment, and more scalable to a larger swarm size than the performances of the swarms employing the voter and the majority model. These results, generated in simulation, are ecologically validated on a swarm of physical e-puck2 robots.

机器人群可以通过一种被称为 "集体决策 "的过程,从环境提供的可选方案中集体选择一个方案。这一过程的特点是,一旦群体做出决定,就不能将其归咎于任何群体成员。在蜂群机器人技术中,用于集体决策的单个机制一般都是手工设计的,而且仅限于基于投票者或多数模式的一组有限的解决方案。在本文中,我们证明了可以采用另一种方法,即使用进化计算技术自动合成的人工神经网络控制器来实施个体机制。我们定性地描述了集体感知辨别任务决策过程中的群体动力学。我们进行了广泛的比较测试,定量评估了最常用的决策机制(投票人模型和多数人模型)与所提出的动态神经网络模型在不同操作条件下和不同规模的蜂群中的性能。我们的研究结果清楚地表明,采用动态神经网络作为决策机制的蜂群比采用投票人和多数人模型的蜂群更稳健、更能适应动态环境、更能扩展到更大的蜂群规模。这些结果是通过模拟产生的,并在物理 e-puck2 机器人群上得到了生态验证。
{"title":"On the evolution of adaptable and scalable mechanisms for collective decision-making in a swarm of robots","authors":"Ahmed Almansoori, Muhanad Alkilabi, Elio Tuci","doi":"10.1007/s11721-023-00233-4","DOIUrl":"https://doi.org/10.1007/s11721-023-00233-4","url":null,"abstract":"<p>A swarm of robots can collectively select an option among the available alternatives offered by the environment through a process known as collective decision-making. This process is characterised by the fact that once the group makes a decision, it can not be attributed to any of its group members. In swarm robotics, the individual mechanisms for collective decision-making are generally hand-designed and limited to a restricted set of solutions based on the voter or the majority model. In this paper, we demonstrate that it is possible to take an alternative approach in which the individual mechanisms are implemented using artificial neural network controllers automatically synthesised using evolutionary computation techniques. We qualitatively describe the group dynamics underlying the decision process on a collective perceptual discrimination task. We carry out extensive comparative tests that quantitatively evaluate the performance of the most commonly used decision-making mechanisms (voter model and majority model) with the proposed dynamic neural network model under various operating conditions and for swarms that differ in size. The results of our study clearly indicate that the performances of a swarm employing dynamical neural networks as the decision-making mechanism are more robust, more adaptable to a dynamic environment, and more scalable to a larger swarm size than the performances of the swarms employing the voter and the majority model. These results, generated in simulation, are ecologically validated on a swarm of physical e-puck2 robots.</p>","PeriodicalId":51284,"journal":{"name":"Swarm Intelligence","volume":"19 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139509403","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Emergent communication enhances foraging behavior in evolved swarms controlled by spiking neural networks 新出现的通信增强了由尖峰神经网络控制的进化蜂群的觅食行为
IF 2.6 4区 计算机科学 Q3 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2023-12-14 DOI: 10.1007/s11721-023-00231-6
Cristian Jimenez Romero, Alper Yegenoglu, Aarón Pérez Martín, Sandra Diaz-Pier, Abigail Morrison

Social insects such as ants and termites communicate via pheromones which allow them to coordinate their activity and solve complex tasks as a swarm, e.g. foraging for food or finding their way back to the nest. This behavior was shaped through evolutionary processes over millions of years. In computational models, self-coordination in swarms has been implemented using probabilistic or pre-defined simple action rules to shape the decision of each agent and the collective behavior. However, manual tuned decision rules may limit the emergent behavior of the swarm. In this work we investigate the emergence of self-coordination and communication in evolved swarms without defining any explicit rule. For this purpose, we evolve a swarm of agents representing an ant colony. We use an evolutionary algorithm to optimize a spiking neural network (SNN) which serves as an artificial brain to control the behavior of each agent. The goal of the evolved colony is to find optimal ways to forage for food and return it to the nest in the shortest amount of time. In the evolutionary phase, the ants are able to learn to collaborate by depositing pheromone near food piles and near the nest to guide other ants. The pheromone usage is not manually encoded into the network; instead, this behavior is established through the optimization procedure. We observe that pheromone-based communication enables the ants to perform better in comparison to colonies where communication via pheromone did not emerge. Furthermore, we assess the foraging performance of the ant colonies by comparing the SNN-based model to a multi-agent rule-based system. Our results show that the SNN-based model can efficiently complete the foraging task in a short amount of time. Our approach illustrates that even in the absence of pre-defined rules, self-coordination via pheromone emerges as a result of the network optimization. This work serves as a proof of concept for the possibility of creating complex applications utilizing SNNs as underlying architectures for multi-agent interactions where communication and self-coordination is desired.

蚂蚁和白蚁等群居昆虫通过信息素进行交流,信息素使它们能够协调活动并作为一个群体解决复杂的任务,例如觅食或找到返回巢穴的路。这种行为是经过数百万年的进化过程形成的。在计算模型中,群体中的自协调已经使用概率或预定义的简单动作规则来实现,以塑造每个代理的决策和集体行为。然而,人工调整的决策规则可能会限制群体的紧急行为。在这项工作中,我们研究了进化群体中自我协调和沟通的出现,而没有定义任何明确的规则。为此,我们进化出一群代表蚁群的代理。我们使用进化算法来优化峰值神经网络(SNN),该网络作为人工大脑来控制每个agent的行为。进化后的蚁群的目标是找到觅食的最佳方式,并在最短的时间内将食物送回巢穴。在进化阶段,蚂蚁能够通过在食物堆附近和巢穴附近储存信息素来学习合作,以指导其他蚂蚁。信息素的使用不是人工编码到网络中;相反,这种行为是通过优化过程建立的。我们观察到,基于信息素的交流使蚂蚁比没有通过信息素进行交流的群体表现得更好。此外,我们通过比较基于snn的模型和基于多智能体规则的系统来评估蚁群的觅食性能。结果表明,基于snn的模型可以在较短的时间内有效地完成觅食任务。我们的方法表明,即使在没有预定义规则的情况下,信息素的自我协调也会作为网络优化的结果出现。这项工作证明了利用snn作为需要通信和自协调的多代理交互的底层架构来创建复杂应用程序的可能性。
{"title":"Emergent communication enhances foraging behavior in evolved swarms controlled by spiking neural networks","authors":"Cristian Jimenez Romero, Alper Yegenoglu, Aarón Pérez Martín, Sandra Diaz-Pier, Abigail Morrison","doi":"10.1007/s11721-023-00231-6","DOIUrl":"https://doi.org/10.1007/s11721-023-00231-6","url":null,"abstract":"<p>Social insects such as ants and termites communicate via pheromones which allow them to coordinate their activity and solve complex tasks as a swarm, e.g. foraging for food or finding their way back to the nest. This behavior was shaped through evolutionary processes over millions of years. In computational models, self-coordination in swarms has been implemented using probabilistic or pre-defined simple action rules to shape the decision of each agent and the collective behavior. However, manual tuned decision rules may limit the emergent behavior of the swarm. In this work we investigate the emergence of self-coordination and communication in evolved swarms without defining any explicit rule. For this purpose, we evolve a swarm of agents representing an ant colony. We use an evolutionary algorithm to optimize a spiking neural network (SNN) which serves as an artificial brain to control the behavior of each agent. The goal of the evolved colony is to find optimal ways to forage for food and return it to the nest in the shortest amount of time. In the evolutionary phase, the ants are able to learn to collaborate by depositing pheromone near food piles and near the nest to guide other ants. The pheromone usage is not manually encoded into the network; instead, this behavior is established through the optimization procedure. We observe that pheromone-based communication enables the ants to perform better in comparison to colonies where communication via pheromone did not emerge. Furthermore, we assess the foraging performance of the ant colonies by comparing the SNN-based model to a multi-agent rule-based system. Our results show that the SNN-based model can efficiently complete the foraging task in a short amount of time. Our approach illustrates that even in the absence of pre-defined rules, self-coordination via pheromone emerges as a result of the network optimization. This work serves as a proof of concept for the possibility of creating complex applications utilizing SNNs as underlying architectures for multi-agent interactions where communication and self-coordination is desired.\u0000</p>","PeriodicalId":51284,"journal":{"name":"Swarm Intelligence","volume":"33 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2023-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138630920","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Improved decentralized cooperative multi-agent path finding for robots with limited communication 为通信受限的机器人改进分散式多代理合作路径搜索
IF 2.6 4区 计算机科学 Q3 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2023-12-12 DOI: 10.1007/s11721-023-00230-7
Abderraouf Maoudj, Anders Lyhne Christensen
{"title":"Improved decentralized cooperative multi-agent path finding for robots with limited communication","authors":"Abderraouf Maoudj, Anders Lyhne Christensen","doi":"10.1007/s11721-023-00230-7","DOIUrl":"https://doi.org/10.1007/s11721-023-00230-7","url":null,"abstract":"","PeriodicalId":51284,"journal":{"name":"Swarm Intelligence","volume":"8 2","pages":""},"PeriodicalIF":2.6,"publicationDate":"2023-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139009780","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Decomposition and merging cooperative particle swarm optimization with random grouping for large-scale optimization problems 大规模优化问题的随机分组分解与融合协同粒子群优化
4区 计算机科学 Q3 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2023-11-14 DOI: 10.1007/s11721-023-00229-0
Alanna McNulty, Beatrice Ombuki-Berman, Andries Engelbrecht
{"title":"Decomposition and merging cooperative particle swarm optimization with random grouping for large-scale optimization problems","authors":"Alanna McNulty, Beatrice Ombuki-Berman, Andries Engelbrecht","doi":"10.1007/s11721-023-00229-0","DOIUrl":"https://doi.org/10.1007/s11721-023-00229-0","url":null,"abstract":"","PeriodicalId":51284,"journal":{"name":"Swarm Intelligence","volume":"67 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134957643","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Elitist artificial bee colony with dynamic population size for multimodal optimization problems 动态种群规模的多模态优化问题的精英人工蜂群
4区 计算机科学 Q3 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2023-11-06 DOI: 10.1007/s11721-023-00228-1
Doğan Aydın, Yunus Özcan, Muhammad Sulaiman, Gürcan Yavuz, Zahid Halim
{"title":"Elitist artificial bee colony with dynamic population size for multimodal optimization problems","authors":"Doğan Aydın, Yunus Özcan, Muhammad Sulaiman, Gürcan Yavuz, Zahid Halim","doi":"10.1007/s11721-023-00228-1","DOIUrl":"https://doi.org/10.1007/s11721-023-00228-1","url":null,"abstract":"","PeriodicalId":51284,"journal":{"name":"Swarm Intelligence","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135635421","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On the automatic design of multi-objective particle swarm optimizers: experimentation and analysis 多目标粒子群优化器的自动设计:实验与分析
4区 计算机科学 Q3 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2023-10-09 DOI: 10.1007/s11721-023-00227-2
Antonio J. Nebro, Manuel López-Ibáñez, José García-Nieto, Carlos A. Coello Coello
Abstract Research in multi-objective particle swarm optimizers (MOPSOs) progresses by proposing one new MOPSO at a time. In spite of the commonalities among different MOPSOs, it is often unclear which algorithmic components are crucial for explaining the performance of a particular MOPSO design. Moreover, it is expected that different designs may perform best on different problem families and identifying a best overall MOPSO is a challenging task. We tackle this challenge here by: (1) proposing AutoMOPSO, a flexible algorithmic template for designing MOPSOs with a design space that can instantiate thousands of potential MOPSOs; and (2) searching for good-performing MOPSO designs given a family of training problems by means of an automatic configuration tool (irace). We apply this automatic design methodology to generate a MOPSO that significantly outperforms two state-of-the-art MOPSOs on four well-known bi-objective problem families. We also identify the key design choices and parameters of the winning MOPSO by means of ablation. AutoMOPSO is publicly available as part of the jMetal framework.
摘要多目标粒子群优化算法的研究是以每次提出一个新的粒子群优化算法的方式进行的。尽管在不同的MOPSO之间的共性,它往往是不清楚哪些算法组件是解释一个特定的MOPSO设计的性能至关重要。此外,不同的设计可能在不同的问题族上表现最佳,确定最佳的整体MOPSO是一项具有挑战性的任务。我们通过以下方式解决了这一挑战:(1)提出AutoMOPSO,这是一种灵活的算法模板,用于设计具有可实例化数千个潜在mopso的设计空间的mopso;(2)利用自动组态工具(irace)在给定一组训练问题的情况下搜索性能良好的MOPSO设计。我们应用这种自动设计方法来生成一个MOPSO,该MOPSO在四个众所周知的双目标问题族上显著优于两个最先进的MOPSO。并通过烧蚀的方法确定了获胜MOPSO的关键设计选择和参数。AutoMOPSO作为jMetal框架的一部分公开提供。
{"title":"On the automatic design of multi-objective particle swarm optimizers: experimentation and analysis","authors":"Antonio J. Nebro, Manuel López-Ibáñez, José García-Nieto, Carlos A. Coello Coello","doi":"10.1007/s11721-023-00227-2","DOIUrl":"https://doi.org/10.1007/s11721-023-00227-2","url":null,"abstract":"Abstract Research in multi-objective particle swarm optimizers (MOPSOs) progresses by proposing one new MOPSO at a time. In spite of the commonalities among different MOPSOs, it is often unclear which algorithmic components are crucial for explaining the performance of a particular MOPSO design. Moreover, it is expected that different designs may perform best on different problem families and identifying a best overall MOPSO is a challenging task. We tackle this challenge here by: (1) proposing AutoMOPSO, a flexible algorithmic template for designing MOPSOs with a design space that can instantiate thousands of potential MOPSOs; and (2) searching for good-performing MOPSO designs given a family of training problems by means of an automatic configuration tool (irace). We apply this automatic design methodology to generate a MOPSO that significantly outperforms two state-of-the-art MOPSOs on four well-known bi-objective problem families. We also identify the key design choices and parameters of the winning MOPSO by means of ablation. AutoMOPSO is publicly available as part of the jMetal framework.","PeriodicalId":51284,"journal":{"name":"Swarm Intelligence","volume":"284 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135092929","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Consensus decision-making in artificial swarms via entropy-based local negotiation and preference updating 基于熵的局部协商和偏好更新的人工蜂群一致决策
IF 2.6 4区 计算机科学 Q3 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2023-05-15 DOI: 10.1007/s11721-023-00226-3
Chuanqi Zheng, Kiju Lee
{"title":"Consensus decision-making in artificial swarms via entropy-based local negotiation and preference updating","authors":"Chuanqi Zheng, Kiju Lee","doi":"10.1007/s11721-023-00226-3","DOIUrl":"https://doi.org/10.1007/s11721-023-00226-3","url":null,"abstract":"","PeriodicalId":51284,"journal":{"name":"Swarm Intelligence","volume":"1 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2023-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48828059","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Effect of swarm density on collective tracking performance 群体密度对集体跟踪性能的影响
4区 计算机科学 Q3 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2023-03-21 DOI: 10.1007/s11721-023-00225-4
Hian Lee Kwa, Julien Philippot, Roland Bouffanais
How does the size of a swarm affect its collective action? Despite being arguably a key parameter, no systematic and satisfactory guiding principles exist to select the number of units required for a given task and environment. Even when limited by practical considerations, system designers should endeavor to identify what a reasonable swarm size should be. Here, we show that this fundamental question is closely linked to that of selecting an appropriate swarm density. Our analysis of the influence of density on the collective performance of a target tracking task reveals different ‘phases’ corresponding to markedly distinct group dynamics. We identify a ‘transition’ phase, in which a complex emergent collective response arises. Interestingly, the collective dynamics within this transition phase exhibit a clear trade-off between exploratory actions and exploitative ones. We show that at any density, the exploration–exploitation balance can be adjusted to maximize the system’s performance through various means, such as by changing the level of connectivity between agents. While the density is the primary factor to be considered, it should not be the sole one to be accounted for when sizing the system. Due to the inherent finite-size effects present in physical systems, we establish that the number of constituents primarily affects system-level properties such as exploitation in the transition phase. These results illustrate that instead of learning and optimizing a swarm’s behavior for a specific set of task parameters, further work should instead concentrate on learning to be adaptive, thereby endowing the swarm with the highly desirable feature of being able to operate effectively over a wide range of circumstances.
蜂群的大小如何影响它们的集体行动?尽管可以说这是一个关键参数,但没有系统和令人满意的指导原则来选择给定任务和环境所需的单位数量。即使受到实际考虑的限制,系统设计师也应该努力确定合理的群体规模。在这里,我们表明这个基本问题与选择适当的群体密度密切相关。我们分析了密度对目标跟踪任务的集体表现的影响,揭示了不同的“阶段”对应着明显不同的群体动态。我们确定了一个“过渡”阶段,在这个阶段,一个复杂的紧急集体反应出现了。有趣的是,这个过渡阶段的集体动力在探索行为和剥削行为之间表现出明显的权衡。我们表明,在任何密度下,可以通过各种方式调整探索-开发平衡以最大化系统性能,例如通过改变代理之间的连接级别。虽然密度是要考虑的主要因素,但在确定系统尺寸时,它不应该是唯一要考虑的因素。由于物理系统中存在固有的有限尺寸效应,我们确定成分的数量主要影响系统级属性,如过渡阶段的开采。这些结果表明,与其针对一组特定的任务参数学习和优化群体的行为,进一步的工作应该集中在学习自适应上,从而赋予群体在广泛的情况下能够有效运行的高度理想的特征。
{"title":"Effect of swarm density on collective tracking performance","authors":"Hian Lee Kwa, Julien Philippot, Roland Bouffanais","doi":"10.1007/s11721-023-00225-4","DOIUrl":"https://doi.org/10.1007/s11721-023-00225-4","url":null,"abstract":"How does the size of a swarm affect its collective action? Despite being arguably a key parameter, no systematic and satisfactory guiding principles exist to select the number of units required for a given task and environment. Even when limited by practical considerations, system designers should endeavor to identify what a reasonable swarm size should be. Here, we show that this fundamental question is closely linked to that of selecting an appropriate swarm density. Our analysis of the influence of density on the collective performance of a target tracking task reveals different ‘phases’ corresponding to markedly distinct group dynamics. We identify a ‘transition’ phase, in which a complex emergent collective response arises. Interestingly, the collective dynamics within this transition phase exhibit a clear trade-off between exploratory actions and exploitative ones. We show that at any density, the exploration–exploitation balance can be adjusted to maximize the system’s performance through various means, such as by changing the level of connectivity between agents. While the density is the primary factor to be considered, it should not be the sole one to be accounted for when sizing the system. Due to the inherent finite-size effects present in physical systems, we establish that the number of constituents primarily affects system-level properties such as exploitation in the transition phase. These results illustrate that instead of learning and optimizing a swarm’s behavior for a specific set of task parameters, further work should instead concentrate on learning to be adaptive, thereby endowing the swarm with the highly desirable feature of being able to operate effectively over a wide range of circumstances.","PeriodicalId":51284,"journal":{"name":"Swarm Intelligence","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136338878","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Multi-agent bandit with agent-dependent expected rewards 期望报酬依赖于agent的多agent盗匪
IF 2.6 4区 计算机科学 Q3 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2023-03-18 DOI: 10.1007/s11721-023-00224-5
Fan Jiang, Huixin. Cheng
{"title":"Multi-agent bandit with agent-dependent expected rewards","authors":"Fan Jiang, Huixin. Cheng","doi":"10.1007/s11721-023-00224-5","DOIUrl":"https://doi.org/10.1007/s11721-023-00224-5","url":null,"abstract":"","PeriodicalId":51284,"journal":{"name":"Swarm Intelligence","volume":"44 1","pages":"219-251"},"PeriodicalIF":2.6,"publicationDate":"2023-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80679086","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Cross-disciplinary approaches for designing intelligent swarms of drones 设计智能无人机群的跨学科方法
IF 2.6 4区 计算机科学 Q3 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2023-02-14 DOI: 10.1007/s11721-023-00223-6
G. D. Croon, W. Hönig, G. Theraulaz, G. Vásárhelyi
{"title":"Cross-disciplinary approaches for designing intelligent swarms of drones","authors":"G. D. Croon, W. Hönig, G. Theraulaz, G. Vásárhelyi","doi":"10.1007/s11721-023-00223-6","DOIUrl":"https://doi.org/10.1007/s11721-023-00223-6","url":null,"abstract":"","PeriodicalId":51284,"journal":{"name":"Swarm Intelligence","volume":"17 1","pages":"1 - 4"},"PeriodicalIF":2.6,"publicationDate":"2023-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47347874","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
期刊
Swarm Intelligence
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1