arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1809.09261cs.AIcs.LGcs.SYeess.SY
收藏

基于动态系统的强化学习鲁棒计算:排序问题案例研究

Resilient Computing with Reinforcement Learning on a Dynamical System: Case Study in Sorting

Google Brain, Mountain View, CA, USA(谷歌大脑,美国加利福尼亚州山景城);Sandia National Labs, Albuquerque, NM, USA(桑迪亚国家实验室,美国新墨西哥州阿尔伯克基)

Aleksandra Faust, James B. Aimone, Conrad D. James, Lydia Tapia

AI总结:

本文将计算过程建模为反馈控制问题,利用强化学习解决序列决策问题,通过排序问题案例展示鲁棒计算方法在克服传统编程局限性方面的有效性。

摘要:

机器人和自主代理在资源有限的情况下,通常依赖不完美的模型和传感器测量来完成目标导向任务。特别是,强化学习(RL)和反馈控制可以用来帮助机器人实现目标。本文基于这一领域的工作,将通用计算建模为反馈控制问题,使代理能够自主克服标准过程语言编程的局限性:对错误的鲁棒性和早期程序终止的容忍。我们的建模将计算视为程序变量空间中的轨迹生成。计算因此成为一个序列决策问题,通过强化学习(RL)解决,并通过李雅普诺夫稳定性理论分析以评估代理的鲁棒性和向目标的进展。我们通过一个典型的计算机科学问题——数组排序的案例研究来实现这一点。评估显示,我们的RL排序代理能够稳定地向渐近稳定的终点进展,对故障组件具有鲁棒性,并且比传统的快速排序和冒泡排序进行的数组操作更少。

英文摘要:

Robots and autonomous agents often complete goal-based tasks with limited resources, relying on imperfect models and sensor measurements. In particular, reinforcement learning (RL) and feedback control can be used to help a robot achieve a goal. Taking advantage of this body of work, this paper formulates general computation as a feedback-control problem, which allows the agent to autonomously overcome some limitations of standard procedural language programming: resilience to errors and early program termination. Our formulation considers computation to be trajectory generation in the program's variable space. The computing then becomes a sequential decision making problem, solved with reinforcement learning (RL), and analyzed with Lyapunov stability theory to assess the agent's resilience and progression to the goal. We do this through a case study on a quintessential computer science problem, array sorting. Evaluations show that our RL sorting agent makes steady progress to an asymptotically stable goal, is resilient to faulty components, and performs less array manipulations than traditional Quicksort and Bubble sort.

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

↑