arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1405.7392cs.ROcs.SYeess.SY
收藏

基于增量采样的信息论随机最优控制

Information-Theoretic Stochastic Optimal Control via Incremental Sampling-based Algorithms

Georgia Institute of Technology(佐治亚理工学院);The Daniel Guggenheim School of Aerospace Engineering(航空航天工程丹尼尔·古根海姆学校);Institute of Robotics and Intelligent Machines(机器人与智能机器研究所);Control Systems Laboratory(控制系统实验室);Autonomous Control and Decision Systems Laboratory(自主控制与决策系统实验室)

Oktay Arslan, Evangelos Theodorou, Panagiotis Tsiotras

AI总结:

本文提出基于增量采样的算法,将RRT与信息论随机最优控制相结合,解决大系统中非线性随机微分方程的最优控制问题。

摘要:

本文考虑由非线性随机微分方程表示的动力系统最优控制问题。已知最优控制策略可通过满足非线性偏微分方程(即哈密顿-雅可比-贝尔曼方程)的价值函数获得。该非线性PDE必须逆向求解,但对于大规模系统来说计算不可行。在某些假设下,应用对数变换后,最优策略可表示为路径积分。基于路径积分的控制方法最近被证明能优雅地解决广泛类别的随机最优控制问题。其中一个实现挑战是计算成本函数在未受力动力学轨迹上的期望值。在均匀采样轨迹上计算此类期望可能导致数值不稳定性,因为成本的指数化。因此,采样低成本轨迹对PI方法的实用实现至关重要。本文使用基于增量采样的算法从未受力系统动力学中采样有用的轨迹,并建立了RRT与信息论随机最优控制之间的新联系。我们展示了所提出方法在多个示例中的数值实现结果。

英文摘要:

This paper considers optimal control of dynamical systems which are represented by nonlinear stochastic differential equations. It is well-known that the optimal control policy for this problem can be obtained as a function of a value function that satisfies a nonlinear partial differential equation, namely, the Hamilton-Jacobi-Bellman equation. This nonlinear PDE must be solved backwards in time, and this computation is intractable for large scale systems. Under certain assumptions, and after applying a logarithmic transformation, an alternative characterization of the optimal policy can be given in terms of a path integral. Path Integral (PI) based control methods have recently been shown to provide elegant solutions to a broad class of stochastic optimal control problems. One of the implementation challenges with this formalism is the computation of the expectation of a cost functional over the trajectories of the unforced dynamics. Computing such expectation over trajectories that are sampled uniformly may induce numerical instabilities due to the exponentiation of the cost. Therefore, sampling of low-cost trajectories is essential for the practical implementation of PI-based methods. In this paper, we use incremental sampling-based algorithms to sample useful trajectories from the unforced system dynamics, and make a novel connection between Rapidly-exploring Random Trees (RRTs) and information-theoretic stochastic optimal control. We show the results from the numerical implementation of the proposed approach to several examples.

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

↑