Yibing Li, Xianzhen Meng, Fang Ye, T. Jiang, Yingsong Li
{"title":"基于聚类和改进蚁群算法的无人机辅助无线传感器网络路径规划","authors":"Yibing Li, Xianzhen Meng, Fang Ye, T. Jiang, Yingsong Li","doi":"10.23919/USNC/URSI49741.2020.9321638","DOIUrl":null,"url":null,"abstract":"UAVs as mobile nodes have been introduced into wireless sensor network (WSN) to assist information transmission and reduce the burden of communication. To minimize the path cost of UAVs for information transmission, this paper focuses on the path planning of UAVs. A multi-UAVs path planning combined K-means clustering algorithm and improved MAXMIN ant system (MMAS) is proposed. This algorithm apply the K-means clustering algorithm to reduce the problem size and improve the search efficiency of subsequent path planning. By modifying the node search rules and proposing two optimal solution detection rules of the MMAS, the algorithm searching stagnation and failing into local optimal solution are effectively avoided.","PeriodicalId":443426,"journal":{"name":"2020 IEEE USNC-CNC-URSI North American Radio Science Meeting (Joint with AP-S Symposium)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Path Planning Based on Clustering and Improved ACO in UAV-assisted Wireless Sensor Network\",\"authors\":\"Yibing Li, Xianzhen Meng, Fang Ye, T. Jiang, Yingsong Li\",\"doi\":\"10.23919/USNC/URSI49741.2020.9321638\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"UAVs as mobile nodes have been introduced into wireless sensor network (WSN) to assist information transmission and reduce the burden of communication. To minimize the path cost of UAVs for information transmission, this paper focuses on the path planning of UAVs. A multi-UAVs path planning combined K-means clustering algorithm and improved MAXMIN ant system (MMAS) is proposed. This algorithm apply the K-means clustering algorithm to reduce the problem size and improve the search efficiency of subsequent path planning. By modifying the node search rules and proposing two optimal solution detection rules of the MMAS, the algorithm searching stagnation and failing into local optimal solution are effectively avoided.\",\"PeriodicalId\":443426,\"journal\":{\"name\":\"2020 IEEE USNC-CNC-URSI North American Radio Science Meeting (Joint with AP-S Symposium)\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-07-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE USNC-CNC-URSI North American Radio Science Meeting (Joint with AP-S Symposium)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23919/USNC/URSI49741.2020.9321638\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE USNC-CNC-URSI North American Radio Science Meeting (Joint with AP-S Symposium)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/USNC/URSI49741.2020.9321638","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Path Planning Based on Clustering and Improved ACO in UAV-assisted Wireless Sensor Network
UAVs as mobile nodes have been introduced into wireless sensor network (WSN) to assist information transmission and reduce the burden of communication. To minimize the path cost of UAVs for information transmission, this paper focuses on the path planning of UAVs. A multi-UAVs path planning combined K-means clustering algorithm and improved MAXMIN ant system (MMAS) is proposed. This algorithm apply the K-means clustering algorithm to reduce the problem size and improve the search efficiency of subsequent path planning. By modifying the node search rules and proposing two optimal solution detection rules of the MMAS, the algorithm searching stagnation and failing into local optimal solution are effectively avoided.