Robustness Of Communication Links For Teams Of Unmanned Aircraft By Sensitivity Analysis Of Minimum Spanning Trees

2016 AMERICAN CONTROL CONFERENCE (ACC)(2016)

引用 2|浏览9
暂无评分
摘要
This paper addresses the problem of sensitivity analysis of minimum spanning trees on a weighted graph and its application to optimal communication topologies for teams of unmanned aerial vehicles. In particular, we analyze the robustness of a minimum spanning tree with respect to changing edge weights due to movement of the aircraft. Stability analysis is used to determine whether a previously computed minimum spanning tree remains optimal after the edge weights change. Building upon necessary and sufficient conditions for optimality of a spanning tree, we derive a polyhedral description of the stability region, that is, the set of all perturbations to the edge weights for which a given minimum spanning tree remains optimal, and analyze its properties and relevant subsets. The application of sensitivity analysis to robustness assessment of an optimal communication topology for teams of unmanned aircraft is demonstrated through numerical simulations.
更多
查看译文
关键词
communication link robustness,unmanned aircraft vehicle teams,sensitivity analysis,minimum spanning trees,weighted graph,optimal communication topologies,aircraft movement,stability analysis,necessary and sufficient conditions,perturbations,edge weights,robustness assessment,optimal communication topology
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要