复杂山区应急救援无人机快速投送路径研究

2017 13th International Conference on Computational Intelligence and Security (CIS) Pub Date : 2017-12-01 DOI:10.1109/CIS.2017.00081

Zhihua Song, Han Zhang, Y. Wang, Linghui Zhang

{"title":"复杂山区应急救援无人机快速投送路径研究","authors":"Zhihua Song, Han Zhang, Y. Wang, Linghui Zhang","doi":"10.1109/CIS.2017.00081","DOIUrl":null,"url":null,"abstract":"Unmanned Aerial Vehicles rapid delivery routing of the emergency rescue in the complex mountain region was studied as a multistage decision problem. Firstly, the problem is defined in graph theory and the solving framework is analyzed. Secondly, the dynamic programming model is developed due to its multistage characteristic. Thirdly, the tabu list for the dynamic programming model is introduced so that the optimal routing of UAVs can be computed through solving a minimum cost flow problem. Finally, the effectiveness of the dynamic programming model and algorithm is verified through an example.","PeriodicalId":304958,"journal":{"name":"2017 13th International Conference on Computational Intelligence and Security (CIS)","volume":"357 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Unmanned Aerial Vehicles Rapid Delivery Routing of the Emergency Rescue in the Complex Mountain Region\",\"authors\":\"Zhihua Song, Han Zhang, Y. Wang, Linghui Zhang\",\"doi\":\"10.1109/CIS.2017.00081\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Unmanned Aerial Vehicles rapid delivery routing of the emergency rescue in the complex mountain region was studied as a multistage decision problem. Firstly, the problem is defined in graph theory and the solving framework is analyzed. Secondly, the dynamic programming model is developed due to its multistage characteristic. Thirdly, the tabu list for the dynamic programming model is introduced so that the optimal routing of UAVs can be computed through solving a minimum cost flow problem. Finally, the effectiveness of the dynamic programming model and algorithm is verified through an example.\",\"PeriodicalId\":304958,\"journal\":{\"name\":\"2017 13th International Conference on Computational Intelligence and Security (CIS)\",\"volume\":\"357 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 13th International Conference on Computational Intelligence and Security (CIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIS.2017.00081\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 13th International Conference on Computational Intelligence and Security (CIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIS.2017.00081","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

将复杂山区无人机应急救援快速投送路径作为一个多阶段决策问题进行研究。首先从图论的角度对问题进行了定义，分析了问题的求解框架。其次，根据其多阶段特性，建立了动态规划模型。第三，引入动态规划模型的禁忌列表，通过求解最小成本流问题计算出无人机的最优路径;最后，通过实例验证了动态规划模型和算法的有效性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Unmanned Aerial Vehicles Rapid Delivery Routing of the Emergency Rescue in the Complex Mountain Region

Unmanned Aerial Vehicles rapid delivery routing of the emergency rescue in the complex mountain region was studied as a multistage decision problem. Firstly, the problem is defined in graph theory and the solving framework is analyzed. Secondly, the dynamic programming model is developed due to its multistage characteristic. Thirdly, the tabu list for the dynamic programming model is introduced so that the optimal routing of UAVs can be computed through solving a minimum cost flow problem. Finally, the effectiveness of the dynamic programming model and algorithm is verified through an example.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2017 13th International Conference on Computational Intelligence and Security (CIS)

自引率

0.00%

发文量