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(自主控制与决策系统实验室)
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.
IA-TIGRIS: An Incremental and Adaptive Sampling-Based Planner for Online Informative Path Planning
Robotics Institute, School of Computer Science, Carnegie Mellon University(卡内基梅隆大学计算机科学学院机器人研究所);Department of Mechanical Engineering, Brigham Young University(杨百翰大学机械工程系)
An Incremental Sampling and Segmentation-Based Approach for Motion Planning Infeasibility
Robotics Research Center, IIIT Hyderabad(IIIT海得拉巴机器人研究中心);Department of Informatics, Bioengineering, Robotics, and Systems Engineering, University of Genoa(热那亚大学信息学院、生物工程、机器人与系统工程系)