{"title":"Optimal group structure for group chase and escape","authors":"Kohsuke Somemori, Takashi Shimada","doi":"10.1007/s10015-024-00991-2","DOIUrl":null,"url":null,"abstract":"<div><p>Chasing multiple escapees by a group of chasers is an important problem for many living animal species and for various agent systems. On this group chase problem, it has been reported that having two distinct types of chasers in the group, namely diligent and totally lazy chasers, can improve the efficiency of the group of catching all the targets. In this paper, we search for a better group structure by letting each agent have moderate laziness. We find that there exists an optimal group structure, which performs better than the previously reported group which consists of binary (fully diligent and totally lazy) types.</p></div>","PeriodicalId":46050,"journal":{"name":"Artificial Life and Robotics","volume":"30 1","pages":"143 - 147"},"PeriodicalIF":0.8000,"publicationDate":"2024-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Artificial Life and Robotics","FirstCategoryId":"1085","ListUrlMain":"https://link.springer.com/article/10.1007/s10015-024-00991-2","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ROBOTICS","Score":null,"Total":0}
引用次数: 0
Abstract
Chasing multiple escapees by a group of chasers is an important problem for many living animal species and for various agent systems. On this group chase problem, it has been reported that having two distinct types of chasers in the group, namely diligent and totally lazy chasers, can improve the efficiency of the group of catching all the targets. In this paper, we search for a better group structure by letting each agent have moderate laziness. We find that there exists an optimal group structure, which performs better than the previously reported group which consists of binary (fully diligent and totally lazy) types.