控制任务连续空间的次优覆盖
Suboptimal coverings for continuous spaces of control tasks
摘要:
我们提出了α-次优覆盖数来刻画多任务控制问题,其中动力系统和/或费用函数的集合是无限的,类似于有限任务集合的基数.这个概念可以帮助量化表示良好的多任务策略所需的函数类表达能力,这对于使用参数化函数近似的基于学习的控制方法很重要。研究了二次型线性动力系统(LQR)问题的次优覆盖数,并构造了一类易于分析的多任务LQR问题。对于标量的情况下,我们表现出对数依赖的“宽度”的空间。对于矩阵的情况下,我们提出的实验1)测量一个特定的建设性覆盖的效率,和2)可视化的行为的两个候选系统的下界。
英文摘要:
We propose the α-suboptimal covering number to characterize multi-task control problems where the set of dynamical systems and/or cost functions is infinite, analogous to the cardinality of finite task sets. This notion may help quantify the function class expressiveness needed to represent a good multi-task policy, which is important for learning-based control methods that use parameterized function approximation. We study suboptimal covering numbers for linear dynamical systems with quadratic cost (LQR problems) and construct a class of multi-task LQR problems amenable to analysis. For the scalar case, we show logarithmic dependence on the "breadth" of the space. For the matrix case, we present experiments 1) measuring the efficiency of a particular constructive cover, and 2) visualizing the behavior of two candidate systems for the lower bound.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。