{"title":"研究算法,优化无人机路线,用于安全","authors":"I. Boychev","doi":"10.1109/ET.2018.8549591","DOIUrl":null,"url":null,"abstract":"This paper investigates the applicability of two algorithms for routing the optimal path in a graph, used for navigation of a UAV drone in a security setup. For this purpose we make use of a graph of waypoints, which is based on GPS coordinates of flight path maneuver points in the threedimensional space. The graph is represented by a dynamic adjacency matrix, on which we carry out a comparative evaluation of the predicted drone route. We assess the advantages and disadvantages of the two routing algorithms in the context of area observation mode “go round the area\".","PeriodicalId":374877,"journal":{"name":"2018 IEEE XXVII International Scientific Conference Electronics - ET","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Research algorithms to optimize the drone route used for security\",\"authors\":\"I. Boychev\",\"doi\":\"10.1109/ET.2018.8549591\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper investigates the applicability of two algorithms for routing the optimal path in a graph, used for navigation of a UAV drone in a security setup. For this purpose we make use of a graph of waypoints, which is based on GPS coordinates of flight path maneuver points in the threedimensional space. The graph is represented by a dynamic adjacency matrix, on which we carry out a comparative evaluation of the predicted drone route. We assess the advantages and disadvantages of the two routing algorithms in the context of area observation mode “go round the area\\\".\",\"PeriodicalId\":374877,\"journal\":{\"name\":\"2018 IEEE XXVII International Scientific Conference Electronics - ET\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE XXVII International Scientific Conference Electronics - ET\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ET.2018.8549591\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE XXVII International Scientific Conference Electronics - ET","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ET.2018.8549591","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Research algorithms to optimize the drone route used for security
This paper investigates the applicability of two algorithms for routing the optimal path in a graph, used for navigation of a UAV drone in a security setup. For this purpose we make use of a graph of waypoints, which is based on GPS coordinates of flight path maneuver points in the threedimensional space. The graph is represented by a dynamic adjacency matrix, on which we carry out a comparative evaluation of the predicted drone route. We assess the advantages and disadvantages of the two routing algorithms in the context of area observation mode “go round the area".