Name
Abstract | ||
|---|---|---|
This work studies the design of reliable control laws of robotic systems operating in uncertain environments. We introduce a new approach to stochastic policy optimization based on probably approximately correct (PAC) bounds on the expected performance of control policies. An algorithm is constructed which directly minimizes an upper confidence bound on the expected cost of trajectories instead of employing a standard approach based on the expected cost itself. This algorithm thus has built-in robustness to uncertainty, since the bound can be regarded as a certificate for guaranteed future performance. The approach is evaluated on two challenging robot control scenarios in simulation: a car with side slip and a quadrotor navigating through obstacle-ridden environments. We show that the bound accurately predicts future performance and results in improved robustness measured by lower average cost and lower probability of collision. The performance of the technique is studied empirically and compared to several existing policy search algorithms. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/ICRA.2017.7989271 | ICRA |
Field | DocType | Volume |
Robot control,Approximation algorithm,Mathematical optimization,Search algorithm,Probably approximately correct learning,Computer science,Control theory,Stochastic process,Robustness (computer science),Average cost,Control engineering,Collision | Conference | 2017 |
Issue | Citations | PageRank |
1 | 1 | 0.36 |
References | Authors | |
13 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Matthew Sheckells | 1 | 3 | 1.78 |
| Gowtham Garimella | 2 | 3 | 1.10 |
| Marin Kobilarov | 3 | 103 | 14.28 |