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

Scalable Synthesis of Minimum-Information Linear-Gaussian Control by Distributed Optimization

University of Texas, Austin(德克萨斯大学奥斯汀分校)

Murat Cubuktepe, Takashi Tanaka, Ufuk Topcu

英文摘要:

We consider a discrete-time linear-quadratic Gaussian control problem in which we minimize a weighted sum of the directed information from the state of the system to the control input and the control cost. The optimal control and sensing policies can be synthesized jointly by solving a semidefinite programming problem. However, the existing solutions typically scale cubic with the horizon length. We leverage the structure in the problem to develop a distributed algorithm that decomposes the synthesis problem into a set of smaller problems, one for each time step. We prove that the algorithm runs in time linear in the horizon length. As an application of the algorithm, we consider a path-planning problem in a state space with obstacles under the presence of stochastic disturbances. The algorithm computes a locally optimal solution that jointly minimizes the perception and control cost while ensuring the safety of the path. The numerical examples show that the algorithm can scale to thousands of horizon length and compute locally optimal solutions.

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

↑