arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2603.05286cs.CG
收藏

无人机空交通控制:用最小功率跟踪一组移动物体

Drone Air Traffic Control: Tracking a Set of Moving Objects with Minimal Power

TU Braunschweig(布伦瑞克工业大学);L3S(L3S研究所)

Chek-Manh Loi, Michael Perk, Malte Hoffmann, Sándor Fekete

AI总结:

本文提出了一种基于几何洞察的算法,用于在最小化峰值功率消耗的前提下,优化无人机空交通控制中移动物体的跟踪问题。

摘要:

一个常见的传感问题是使用一组固定跟踪位置来监控一组移动设备:给定n个需要被跟踪的对象,每个都遵循自己的轨迹,以及m个固定交通控制站,每个都有可调整范围的传感区域;如何调整每个传感器的范围以优化能耗?我们为这个重要且自然的挑战提供了既负面的理论结果和正面的实践结果。在理论方面,我们证明即使所有对象以恒定速度沿直线运动,也没有多项式时间算法能保证给定初始解的最优覆盖。在实践方面,我们提出了一种基于几何洞察的算法,能够为该问题的minmax变种找到最优解,该变种旨在最小化峰值功率消耗。具有500个移动对象和25个站点的实例的运行时间在几秒内,演示了我们方法的实时能力。

英文摘要:

A common sensing problem is to use a set of stationary tracking locations to monitor a collection of moving devices: Given $n$ objects that need to be tracked, each following its own trajectory, and $m$ stationary traffic control stations, each with a sensing region of adjustable range; how should we adjust the individual sensor ranges in order to optimize energy consumption? We provide both negative theoretical and positive practical results for this important and natural challenge. On the theoretical side, we show that even if all objects move at constant speed along straight lines, no polynomial-time algorithm can guarantee optimal coverage for a given starting solution. On the practical side, we present an algorithm based on geometric insights that is able to find optimal solutions for the $\min \max$ variant of the problem, which aims at minimizing peak power consumption. Runtimes for instances with 500 moving objects and 25 stations are in the order of seconds for scenarios that take minutes to play out in the real world, demonstrating real-time capability of our methods.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑