Direct Policy Optimization using Deterministic Sampling and Collocation
Howell, Taylor A., Fu, Chunjiang, Manchester, Zachary
–arXiv.org Artificial Intelligence
We present an approach for approximately solving discrete-time stochastic optimal-control problems by combining direct trajectory optimization, deterministic sampling, and policy optimization. Our feedback motion-planning algorithm uses a quasi-Newton method to simultaneously optimize a reference trajectory, a set of deterministically chosen sample trajectories, and a parameterized policy. We demonstrate that this approach exactly recovers LQR policies in the case of linear dynamics, quadratic objective, and Gaussian disturbances. We also demonstrate the algorithm on several nonlinear, underactuated robotic systems to highlight its performance and ability to handle control limits, safely avoid obstacles, and generate robust plans in the presence of unmodeled dynamics.
arXiv.org Artificial Intelligence
Jan-10-2023
- Country:
- North America > United States
- Massachusetts (0.04)
- Pennsylvania > Allegheny County
- Pittsburgh (0.14)
- California > Santa Clara County
- Europe > United Kingdom
- England
- Oxfordshire > Oxford (0.04)
- Cambridgeshire > Cambridge (0.04)
- England
- Asia > Japan
- Honshū > Kantō > Saitama Prefecture > Saitama (0.04)
- North America > United States
- Genre:
- Research Report (0.40)
- Technology:
- Information Technology > Artificial Intelligence
- Robots (1.00)
- Representation & Reasoning > Optimization (1.00)
- Machine Learning (1.00)
- Information Technology > Artificial Intelligence