{"title":"在单位磁盘图上用Nomadic lsamvy walk进行目标探测","authors":"K. Sugihara, Naohiro Hayashibara","doi":"10.1504/ijguc.2020.10026552","DOIUrl":null,"url":null,"abstract":"Levy walk has attracted attention for its search efficiency. Homesick Levy walk is a family of random walks whose encounter probability of one another is similar to the one of human behaviour. However, its homing behaviour limits the search area of each agent. In this paper, we propose a variant of Homesick Levy walk called Nomadic Levy walk and analyse the behaviour of the algorithm regarding the cover ratio on unit disk graphs. We also show the comparison of Nomadic Levy walk and Homesick Levy walk regarding the target search problem. Our simulation results indicate that the proposed algorithm is significantly efficient for sparse target detection on unit disk graphs compared to Homesick Levy walk, and it also improves the cover ratio. Moreover, we analyse the impact of the movement of the sink (home position) on the efficiency of the target exploration.","PeriodicalId":375871,"journal":{"name":"Int. J. Grid Util. Comput.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2020-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Target exploration by Nomadic Lévy walk on unit disk graphs\",\"authors\":\"K. Sugihara, Naohiro Hayashibara\",\"doi\":\"10.1504/ijguc.2020.10026552\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Levy walk has attracted attention for its search efficiency. Homesick Levy walk is a family of random walks whose encounter probability of one another is similar to the one of human behaviour. However, its homing behaviour limits the search area of each agent. In this paper, we propose a variant of Homesick Levy walk called Nomadic Levy walk and analyse the behaviour of the algorithm regarding the cover ratio on unit disk graphs. We also show the comparison of Nomadic Levy walk and Homesick Levy walk regarding the target search problem. Our simulation results indicate that the proposed algorithm is significantly efficient for sparse target detection on unit disk graphs compared to Homesick Levy walk, and it also improves the cover ratio. Moreover, we analyse the impact of the movement of the sink (home position) on the efficiency of the target exploration.\",\"PeriodicalId\":375871,\"journal\":{\"name\":\"Int. J. Grid Util. Comput.\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-02-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Grid Util. Comput.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/ijguc.2020.10026552\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Grid Util. Comput.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/ijguc.2020.10026552","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
摘要
Levy walk因其搜索效率而备受关注。想家的利维漫步是一个随机漫步的家族,它们彼此相遇的概率与人类的行为相似。然而,它的归巢行为限制了每个agent的搜索区域。在本文中,我们提出了一种叫做游牧式列维行走的思乡式列维行走的变体,并分析了该算法在单位磁盘图上的覆盖率方面的行为。在目标搜索问题上,我们还比较了Nomadic Levy walk和Homesick Levy walk。仿真结果表明,与Homesick Levy walk相比,该算法在单位磁盘图上的稀疏目标检测效率显著提高,并且提高了覆盖率。此外,还分析了储层的移动对靶区勘探效率的影响。
Target exploration by Nomadic Lévy walk on unit disk graphs
Levy walk has attracted attention for its search efficiency. Homesick Levy walk is a family of random walks whose encounter probability of one another is similar to the one of human behaviour. However, its homing behaviour limits the search area of each agent. In this paper, we propose a variant of Homesick Levy walk called Nomadic Levy walk and analyse the behaviour of the algorithm regarding the cover ratio on unit disk graphs. We also show the comparison of Nomadic Levy walk and Homesick Levy walk regarding the target search problem. Our simulation results indicate that the proposed algorithm is significantly efficient for sparse target detection on unit disk graphs compared to Homesick Levy walk, and it also improves the cover ratio. Moreover, we analyse the impact of the movement of the sink (home position) on the efficiency of the target exploration.