Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
Chance-constrained dynamic programming with application to risk-aware robotic space exploration
by
Balaram, J.
, Ono, Masahiro
, Kuwata, Yoshiaki
, Pavone, Marco
in
Algorithms
/ Artificial Intelligence
/ Computer Imaging
/ Computer simulation
/ Constraints
/ Control
/ Dynamic programming
/ Engineering
/ Formulations
/ Lunar landing
/ Mars landing
/ Mars surface
/ Mechatronics
/ Optimal control
/ Optimization
/ Path planning
/ Pattern Recognition and Graphics
/ Random variables
/ Robotics
/ Robotics and Automation
/ Space exploration
/ Spacecraft landing
/ Statistical analysis
/ Vision
2015
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Chance-constrained dynamic programming with application to risk-aware robotic space exploration
by
Balaram, J.
, Ono, Masahiro
, Kuwata, Yoshiaki
, Pavone, Marco
in
Algorithms
/ Artificial Intelligence
/ Computer Imaging
/ Computer simulation
/ Constraints
/ Control
/ Dynamic programming
/ Engineering
/ Formulations
/ Lunar landing
/ Mars landing
/ Mars surface
/ Mechatronics
/ Optimal control
/ Optimization
/ Path planning
/ Pattern Recognition and Graphics
/ Random variables
/ Robotics
/ Robotics and Automation
/ Space exploration
/ Spacecraft landing
/ Statistical analysis
/ Vision
2015
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
Chance-constrained dynamic programming with application to risk-aware robotic space exploration
by
Balaram, J.
, Ono, Masahiro
, Kuwata, Yoshiaki
, Pavone, Marco
in
Algorithms
/ Artificial Intelligence
/ Computer Imaging
/ Computer simulation
/ Constraints
/ Control
/ Dynamic programming
/ Engineering
/ Formulations
/ Lunar landing
/ Mars landing
/ Mars surface
/ Mechatronics
/ Optimal control
/ Optimization
/ Path planning
/ Pattern Recognition and Graphics
/ Random variables
/ Robotics
/ Robotics and Automation
/ Space exploration
/ Spacecraft landing
/ Statistical analysis
/ Vision
2015
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Chance-constrained dynamic programming with application to risk-aware robotic space exploration
Journal Article
Chance-constrained dynamic programming with application to risk-aware robotic space exploration
2015
Request Book From Autostore
and Choose the Collection Method
Overview
Existing approaches to constrained dynamic programming are limited to formulations where the constraints share the same additive structure of the objective function (that is, they can be represented as an expectation of the summation of one-stage costs). As such, these formulations cannot handle joint probabilistic (chance) constraints, whose structure is not additive. To bridge this gap, this paper presents a novel algorithmic approach for joint chance-constrained dynamic programming problems, where the probability of failure to satisfy given state constraints is explicitly bounded. Our approach is to (conservatively) reformulate a joint chance constraint as a constraint on the expectation of a summation of indicator random variables, which can be incorporated into the cost function by considering a dual formulation of the optimization problem. As a result, the primal variables can be optimized by standard dynamic programming, while the dual variable is optimized by a root-finding algorithm that converges exponentially. Error bounds on the primal and dual objective values are rigorously derived. We demonstrate algorithm effectiveness on three optimal control problems, namely a path planning problem, a Mars entry, descent and landing problem, and a Lunar landing problem. All Mars simulations are conducted using real terrain data of Mars, with four million discrete states at each time step. The numerical experiments are used to validate our theoretical and heuristic arguments that the proposed algorithm is both (i) computationally efficient, i.e., capable of handling real-world problems, and (ii) near-optimal, i.e., its degree of conservatism is very low.
Publisher
Springer US,Springer Nature B.V
Subject
This website uses cookies to ensure you get the best experience on our website.