{"title":"基于引力搜索和粒子群算法的气味源定位","authors":"Upma Jain, W. W. Godfrey, R. Tiwari","doi":"10.4018/IJRAT.2017010102","DOIUrl":null,"url":null,"abstract":"This paper concerns with the problem of odor source localization by a team of mobile robots. The authors propose two methods for odor source localization which are largely inspired from gravitational search algorithm and particle swarm optimization. The intensity of odor across the plume area is assumed to follow the Gaussian distribution. As robots enter in the vicinity of plume area they form groups using K-nearest neighbor algorithm. The problem of local optima is handled through the use of search counter concept. The proposed approaches are tested and validated through simulation.","PeriodicalId":249760,"journal":{"name":"Int. J. Robotics Appl. Technol.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A Hybridization of Gravitational Search Algorithm and Particle Swarm Optimization for Odor Source Localization\",\"authors\":\"Upma Jain, W. W. Godfrey, R. Tiwari\",\"doi\":\"10.4018/IJRAT.2017010102\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper concerns with the problem of odor source localization by a team of mobile robots. The authors propose two methods for odor source localization which are largely inspired from gravitational search algorithm and particle swarm optimization. The intensity of odor across the plume area is assumed to follow the Gaussian distribution. As robots enter in the vicinity of plume area they form groups using K-nearest neighbor algorithm. The problem of local optima is handled through the use of search counter concept. The proposed approaches are tested and validated through simulation.\",\"PeriodicalId\":249760,\"journal\":{\"name\":\"Int. J. Robotics Appl. Technol.\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Robotics Appl. Technol.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4018/IJRAT.2017010102\",\"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. Robotics Appl. Technol.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4018/IJRAT.2017010102","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Hybridization of Gravitational Search Algorithm and Particle Swarm Optimization for Odor Source Localization
This paper concerns with the problem of odor source localization by a team of mobile robots. The authors propose two methods for odor source localization which are largely inspired from gravitational search algorithm and particle swarm optimization. The intensity of odor across the plume area is assumed to follow the Gaussian distribution. As robots enter in the vicinity of plume area they form groups using K-nearest neighbor algorithm. The problem of local optima is handled through the use of search counter concept. The proposed approaches are tested and validated through simulation.