大规模无人机自主作战的鲁棒性

Sunghun Jung, K. Ariyur
{"title":"大规模无人机自主作战的鲁棒性","authors":"Sunghun Jung, K. Ariyur","doi":"10.1109/SYSCON.2011.5929115","DOIUrl":null,"url":null,"abstract":"Unmanned aerial vehicles (UAVs) need multiple operators as of today. Because of limitations of human attention and sensory cueing the operators cannot use all of the data coming in through these sensors. Large scale autonomy would mean the following: fewer operators, larger areas of coverage, and more vehicles. Rigorous optimization of decision theory based approaches to handling this problem suffer from speed limits to real-time computations. Soft-computing methods based on heuristics (AI, reasoning, neural networks and fuzzy logic) are able to handle certain circumstances but cannot supply any guarantees of performance in unstructured environments. We provide solutions based on rigorous approaches, but avoid heavy real-time computation through off line processing. For mapped regions, we convert maps into traversability graphs using trapezoidal map/voronoi type algorithms. We then find the shortest permissible paths for different vehicles using Dijkstra's algorithm and then preening the allowable paths using constraints on individual vehicles. Out third step consists in determining the minimum time taken by a given vehicle over those paths. We insert margins of safety at each level of this hierarchy: buffer zones (size of buffer zone is a ten meters extended polygon around each building) around mapped structures to account for map errors; buffer zones around flight paths to account for position uncertainty of vehicles; performing 1-D optimal control within limits of the vehicles performance so that vehicles can slow down or speed up in response to unexpected events.","PeriodicalId":109868,"journal":{"name":"2011 IEEE International Systems Conference","volume":"91 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Robustness for large scale UAV autonomous operations\",\"authors\":\"Sunghun Jung, K. Ariyur\",\"doi\":\"10.1109/SYSCON.2011.5929115\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Unmanned aerial vehicles (UAVs) need multiple operators as of today. Because of limitations of human attention and sensory cueing the operators cannot use all of the data coming in through these sensors. Large scale autonomy would mean the following: fewer operators, larger areas of coverage, and more vehicles. Rigorous optimization of decision theory based approaches to handling this problem suffer from speed limits to real-time computations. Soft-computing methods based on heuristics (AI, reasoning, neural networks and fuzzy logic) are able to handle certain circumstances but cannot supply any guarantees of performance in unstructured environments. We provide solutions based on rigorous approaches, but avoid heavy real-time computation through off line processing. For mapped regions, we convert maps into traversability graphs using trapezoidal map/voronoi type algorithms. We then find the shortest permissible paths for different vehicles using Dijkstra's algorithm and then preening the allowable paths using constraints on individual vehicles. Out third step consists in determining the minimum time taken by a given vehicle over those paths. We insert margins of safety at each level of this hierarchy: buffer zones (size of buffer zone is a ten meters extended polygon around each building) around mapped structures to account for map errors; buffer zones around flight paths to account for position uncertainty of vehicles; performing 1-D optimal control within limits of the vehicles performance so that vehicles can slow down or speed up in response to unexpected events.\",\"PeriodicalId\":109868,\"journal\":{\"name\":\"2011 IEEE International Systems Conference\",\"volume\":\"91 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-04-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE International Systems Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SYSCON.2011.5929115\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE International Systems Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYSCON.2011.5929115","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

目前,无人驾驶飞行器(uav)需要多个操作人员。由于人类注意力和感官提示的限制,操作人员无法使用通过这些传感器输入的所有数据。大规模的自动驾驶意味着:更少的运营商、更大的覆盖范围和更多的车辆。基于决策理论的严格优化处理该问题的方法受到实时计算速度限制的影响。基于启发式(人工智能、推理、神经网络和模糊逻辑)的软计算方法能够处理某些情况,但不能在非结构化环境中提供任何性能保证。我们提供基于严格方法的解决方案,但通过离线处理避免了繁重的实时计算。对于映射区域,我们使用梯形地图/voronoi类型算法将地图转换为可遍历图。然后,我们使用Dijkstra算法找到不同车辆的最短允许路径,然后使用单个车辆的约束来调整允许路径。我们的第三步是确定给定车辆通过这些路径所需的最小时间。我们在这个层次结构的每一层插入安全边界:在地图结构周围的缓冲区(缓冲区的大小是每个建筑物周围10米长的延伸多边形),以解释地图错误;飞行路径周围的缓冲区,以考虑车辆位置的不确定性;在车辆性能限制范围内进行一维最优控制,使车辆在遇到突发事件时能够减速或加速。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Robustness for large scale UAV autonomous operations
Unmanned aerial vehicles (UAVs) need multiple operators as of today. Because of limitations of human attention and sensory cueing the operators cannot use all of the data coming in through these sensors. Large scale autonomy would mean the following: fewer operators, larger areas of coverage, and more vehicles. Rigorous optimization of decision theory based approaches to handling this problem suffer from speed limits to real-time computations. Soft-computing methods based on heuristics (AI, reasoning, neural networks and fuzzy logic) are able to handle certain circumstances but cannot supply any guarantees of performance in unstructured environments. We provide solutions based on rigorous approaches, but avoid heavy real-time computation through off line processing. For mapped regions, we convert maps into traversability graphs using trapezoidal map/voronoi type algorithms. We then find the shortest permissible paths for different vehicles using Dijkstra's algorithm and then preening the allowable paths using constraints on individual vehicles. Out third step consists in determining the minimum time taken by a given vehicle over those paths. We insert margins of safety at each level of this hierarchy: buffer zones (size of buffer zone is a ten meters extended polygon around each building) around mapped structures to account for map errors; buffer zones around flight paths to account for position uncertainty of vehicles; performing 1-D optimal control within limits of the vehicles performance so that vehicles can slow down or speed up in response to unexpected events.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信