{"title":"Learning Automata-Based Multi-target Search Strategy Using Swarm Robotics","authors":"Junqi Zhang, Peng Zu, Huan Liu","doi":"10.1109/ICIST52614.2021.9440567","DOIUrl":null,"url":null,"abstract":"Swarm robotics is widely studied in multi-target search problem because of its low cost and adaptability in dangerous environments. But current multi-target search strategies have the problem of searching the same area repeatedly and are difficult to search the undetected area effectively. This paper proposes a learning automata-based multi-target search strategy (LAS). The strategy divides the search space into multiple cells and initializes each cell with an equal search probability. The probability distribution of cells is learned and updated by a learning automaton and employed to assign robots to search cells. If a robot detects the presence of a target in an assigned cell, it uses the simulated annealing algorithm to search the exact location of the target. The experimental results demonstrate that the proposed strategy significantly improves the search efficiency compared with the state-of-the-art methods.","PeriodicalId":371599,"journal":{"name":"2021 11th International Conference on Information Science and Technology (ICIST)","volume":"128 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 11th International Conference on Information Science and Technology (ICIST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIST52614.2021.9440567","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Swarm robotics is widely studied in multi-target search problem because of its low cost and adaptability in dangerous environments. But current multi-target search strategies have the problem of searching the same area repeatedly and are difficult to search the undetected area effectively. This paper proposes a learning automata-based multi-target search strategy (LAS). The strategy divides the search space into multiple cells and initializes each cell with an equal search probability. The probability distribution of cells is learned and updated by a learning automaton and employed to assign robots to search cells. If a robot detects the presence of a target in an assigned cell, it uses the simulated annealing algorithm to search the exact location of the target. The experimental results demonstrate that the proposed strategy significantly improves the search efficiency compared with the state-of-the-art methods.