Donny K. Sutantyo, S. Kernbach, V. Nepomnyashchikh, P. Levi
{"title":"基于lsamvy飞行和人工势场的多机器人搜索算法","authors":"Donny K. Sutantyo, S. Kernbach, V. Nepomnyashchikh, P. Levi","doi":"10.1109/SSRR.2010.5981560","DOIUrl":null,"url":null,"abstract":"An efficient search algorithm is very crucial in robotic area, especially for exploration missions, where the target availability is unknown and the condition of the environment is highly unpredictable. In a very large environment, it is not sufficient to scan an area or volume by a single robot, multiple robots should be involved to perform the collective exploration. In this paper, we propose to combine bio-inspired search algorithm called Lévy flight and artificial potential field method to perform an efficient searching algorithm for multi-robot applications. The main focus of this work is to prove the concept and to measure the efficiency of the algorithm. Several experiments, which compare different search algorithms, are also performed.","PeriodicalId":371261,"journal":{"name":"2010 IEEE Safety Security and Rescue Robotics","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"72","resultStr":"{\"title\":\"Multi-robot searching algorithm using Lévy flight and artificial potential field\",\"authors\":\"Donny K. Sutantyo, S. Kernbach, V. Nepomnyashchikh, P. Levi\",\"doi\":\"10.1109/SSRR.2010.5981560\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An efficient search algorithm is very crucial in robotic area, especially for exploration missions, where the target availability is unknown and the condition of the environment is highly unpredictable. In a very large environment, it is not sufficient to scan an area or volume by a single robot, multiple robots should be involved to perform the collective exploration. In this paper, we propose to combine bio-inspired search algorithm called Lévy flight and artificial potential field method to perform an efficient searching algorithm for multi-robot applications. The main focus of this work is to prove the concept and to measure the efficiency of the algorithm. Several experiments, which compare different search algorithms, are also performed.\",\"PeriodicalId\":371261,\"journal\":{\"name\":\"2010 IEEE Safety Security and Rescue Robotics\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-07-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"72\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE Safety Security and Rescue Robotics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SSRR.2010.5981560\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Safety Security and Rescue Robotics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SSRR.2010.5981560","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Multi-robot searching algorithm using Lévy flight and artificial potential field
An efficient search algorithm is very crucial in robotic area, especially for exploration missions, where the target availability is unknown and the condition of the environment is highly unpredictable. In a very large environment, it is not sufficient to scan an area or volume by a single robot, multiple robots should be involved to perform the collective exploration. In this paper, we propose to combine bio-inspired search algorithm called Lévy flight and artificial potential field method to perform an efficient searching algorithm for multi-robot applications. The main focus of this work is to prove the concept and to measure the efficiency of the algorithm. Several experiments, which compare different search algorithms, are also performed.