CONGEST:基于无人机飞行计划的拥堵区域检测算法

Shashank Parmar, Rahul, Shashank Taneja
{"title":"CONGEST:基于无人机飞行计划的拥堵区域检测算法","authors":"Shashank Parmar, Rahul, Shashank Taneja","doi":"10.1109/ViTECoN58111.2023.10157846","DOIUrl":null,"url":null,"abstract":"One of the primary problems in the Unmanned Aerial System (UAS) field is the potential increase in conflicts and congestion as the UAS gets incorporated into traditional manned airspace. Our research work aimed to come up with an innovative idea to identify potential congestion zones based on the UAV flight plans. A flight plan is a planned route for a flight that contains a set waypoint defined by latitudes, longitudes, and altitudes. Congestion is defined as a circle of radius ‘R’ that has more than a given number of crossings. Conventional clustering algorithms such as DBSCAN, K-means, K-medoids, CLIQUE, etc are designed for static points/objects i.e., the features of the objects remain constant. However, in the case of Unmanned Aerial Vehicles (UAVs), the UAVs keep on changing their position from time to time. Hence, conventional clustering algorithms cannot be applied to the given problem. We have proposed a heuristic algorithm named CONGEST, based on the DBSCAN Clustering algorithm. Our algorithm can identify 91.5-98.5% of the congestion zones in a span of a few seconds.","PeriodicalId":407488,"journal":{"name":"2023 2nd International Conference on Vision Towards Emerging Trends in Communication and Networking Technologies (ViTECoN)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"CONGEST: An Algorithm to Detect Congestion Zones Based on Unmanned Aerial Vehicle (UAV) Flight plans\",\"authors\":\"Shashank Parmar, Rahul, Shashank Taneja\",\"doi\":\"10.1109/ViTECoN58111.2023.10157846\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"One of the primary problems in the Unmanned Aerial System (UAS) field is the potential increase in conflicts and congestion as the UAS gets incorporated into traditional manned airspace. Our research work aimed to come up with an innovative idea to identify potential congestion zones based on the UAV flight plans. A flight plan is a planned route for a flight that contains a set waypoint defined by latitudes, longitudes, and altitudes. Congestion is defined as a circle of radius ‘R’ that has more than a given number of crossings. Conventional clustering algorithms such as DBSCAN, K-means, K-medoids, CLIQUE, etc are designed for static points/objects i.e., the features of the objects remain constant. However, in the case of Unmanned Aerial Vehicles (UAVs), the UAVs keep on changing their position from time to time. Hence, conventional clustering algorithms cannot be applied to the given problem. We have proposed a heuristic algorithm named CONGEST, based on the DBSCAN Clustering algorithm. Our algorithm can identify 91.5-98.5% of the congestion zones in a span of a few seconds.\",\"PeriodicalId\":407488,\"journal\":{\"name\":\"2023 2nd International Conference on Vision Towards Emerging Trends in Communication and Networking Technologies (ViTECoN)\",\"volume\":\"49 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-05-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2023 2nd International Conference on Vision Towards Emerging Trends in Communication and Networking Technologies (ViTECoN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ViTECoN58111.2023.10157846\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 2nd International Conference on Vision Towards Emerging Trends in Communication and Networking Technologies (ViTECoN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ViTECoN58111.2023.10157846","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

无人机系统(UAS)领域的主要问题之一是随着无人机进入传统有人空域,冲突和拥堵的潜在增加。我们的研究工作旨在提出一种基于无人机飞行计划识别潜在拥堵区域的创新思路。飞行计划是飞行的计划路线,它包含由纬度、经度和高度定义的一组航路点。拥堵被定义为半径为“R”的圆圈,其中有超过给定数量的交叉口。传统的聚类算法如DBSCAN、K-means、K-medoids、CLIQUE等都是针对静态点/对象设计的,即对象的特征保持不变。然而,在无人驾驶飞行器(uav)的情况下,无人机不断地改变其位置。因此,传统的聚类算法不能应用于给定的问题。在DBSCAN聚类算法的基础上,提出了一种启发式算法CONGEST。我们的算法可以在几秒钟内识别出91.5-98.5%的拥塞区域。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
CONGEST: An Algorithm to Detect Congestion Zones Based on Unmanned Aerial Vehicle (UAV) Flight plans
One of the primary problems in the Unmanned Aerial System (UAS) field is the potential increase in conflicts and congestion as the UAS gets incorporated into traditional manned airspace. Our research work aimed to come up with an innovative idea to identify potential congestion zones based on the UAV flight plans. A flight plan is a planned route for a flight that contains a set waypoint defined by latitudes, longitudes, and altitudes. Congestion is defined as a circle of radius ‘R’ that has more than a given number of crossings. Conventional clustering algorithms such as DBSCAN, K-means, K-medoids, CLIQUE, etc are designed for static points/objects i.e., the features of the objects remain constant. However, in the case of Unmanned Aerial Vehicles (UAVs), the UAVs keep on changing their position from time to time. Hence, conventional clustering algorithms cannot be applied to the given problem. We have proposed a heuristic algorithm named CONGEST, based on the DBSCAN Clustering algorithm. Our algorithm can identify 91.5-98.5% of the congestion zones in a span of a few seconds.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信