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

时变环境下基于非精确梯度反馈的在线轨迹Optimization

Online Trajectory Optimization Using Inexact Gradient Feedback for Time-Varying Environments

Mohan Krishna Nutalapati, Amrit Singh Bedi, Ketan Rajawat, Marceau Coupechoux

摘要:

研究时变环境下的在线轨迹设计问题。我们制定了一般的轨迹最优化问题的框架内的时变约束凸优化,并提出了一种新版本的在线梯度上升算法,这样的问题。此外,梯度反馈是嘈杂的,并允许我们使用所提出的算法的一系列实际应用中,它是很难获得真正的梯度。与大多数现有的文献相比,我们提出了离线次线性遗憾的算法的最佳离线解决方案,累积梯度的路径长度变化,并在梯度变化的错误。此外,我们建立了一个下界的离线动态遗憾,它定义了任何轨迹的最优性。为了显示所提出的算法的有效性,我们考虑两个实际问题的兴趣。首先,我们考虑设备到设备(D2 D)通信设置,目标是设计用户轨迹,同时最大化其与互联网的连接。第二个问题是与在线规划的能量有效的轨迹无人水面车辆(USV)在海洋环境中的强干扰下的静态和动态的目标位置。详细的仿真结果表明,该算法的意义上的合成和真实的数据集。有关真实世界数据集的视频,请访问{https:www.youtube.com/watch? v=FcRqqWtpf\_0}

英文摘要:

This paper considers the problem of online trajectory design under time-varying environments. We formulate the general trajectory optimization problem within the framework of time-varying constrained convex optimization and proposed a novel version of the online gradient ascent algorithm for such problems. Moreover, the gradient feedback is noisy and allows us to use the proposed algorithm for a range of practical applications where it is difficult to acquire the true gradient. In contrast to the most available literature, we present the offline sublinear regret of the proposed algorithm up to the path length variations of the optimal offline solution, the cumulative gradient, and the error in the gradient variations. Furthermore, we establish a lower bound on the offline dynamic regret, which defines the optimality of any trajectory. To show the efficacy of the proposed algorithm, we consider two practical problems of interest. First, we consider a device to device (D2D) communications setting, and the goal is to design a user trajectory while maximizing its connectivity to the internet. The second problem is associated with the online planning of energy-efficient trajectories for unmanned surface vehicles (USV) under strong disturbances in ocean environments with both static and dynamic goal locations. The detailed simulation results demonstrate the significance of the proposed algorithm on synthetic and real data sets. Video on the real-world datasets can be found at {https://www.youtube.com/watch?v=FcRqqWtpf\_0}

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

↑