arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1503.06133eess.SYcs.SYmath.OC
收藏

数据采集问题的最优控制方法

An Optimal Control Approach for the Data Harvesting Problem

Boston University(波士顿大学)

Yasaman Khazaeni, Christos G. Cassandras

AI总结:

本文提出了一种基于最优控制的方法,用于在二维任务空间中规划轨迹,以最小化预期延迟。通过参数化智能体轨迹并利用微扰分析优化,解决了数据采集和传输问题,展示了方法的鲁棒性和可扩展性。

摘要:

我们提出了一种新的方法用于轨迹规划以解决数据采集问题。在二维任务空间中,N个移动智能体的任务是收集M个静止源生成的数据并将其传输至基地,以最小化预期延迟。该问题的最优控制建模提供了一些初步见解,但计算上不可行,尤其当数据生成过程是随机的时。我们提出将智能体轨迹参数化为通用函数族,随后可通过微扰分析(IPA)在线优化。针对椭圆和傅里叶级数轨迹提供了显式结果,并识别了一些解的性质,包括对数据生成过程的鲁棒性和事件集规模的可扩展性。

英文摘要:

We propose a new method for trajectory planning to solve the data harvesting problem. In a two-dimensional mission space, $N$ mobile agents are tasked with the collection of data generated at $M$ stationary sources and delivery to a base aiming at minimizing expected delays. An optimal control formulation of this problem provides some initial insights regarding its solution, but it is computationally intractable, especially in the case where the data generating processes are stochastic. We propose an agent trajectory parameterization in terms of general function families which can be subsequently optimized on line through the use of Infinitesimal Perturbation Analysis (IPA). Explicit results are provided for the case of elliptical and Fourier series trajectories and some properties of the solution are identified, including robustness with respect to the data generation processes and scalability in the size of an event set characterizing the underlying hybrid dynamic system.

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

↑