Coordinating agile systems through the model-based execution of temporal plans
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Automatica (Journal of IFAC)
Distributed robust execution of qualitative state plan with chance constraints
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Market-based risk allocation for multi-agent systems
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Risk-sensitive plan execution for connected sustainable home
BuildSys '12 Proceedings of the Fourth ACM Workshop on Embedded Sensing Systems for Energy-Efficiency in Buildings
A programmable fenestration system for residential use: functional, social and aesthetic qualities
Proceedings of the 1st workshop on Smart Material Interfaces: A Material Step to the Future
A Probabilistically Robust Path Planning Algorithm for UAVs Using Rapidly-Exploring Random Trees
Journal of Intelligent and Robotic Systems
A hybrid LP-RPG heuristic for modelling numeric resource flows in planning
Journal of Artificial Intelligence Research
Probabilistic planning for continuous dynamic systems under bounded risk
Journal of Artificial Intelligence Research
Robust optimization for hybrid MDPs with state-dependent noise
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
When controlling dynamic systems, such as mobile robots in uncertain environments, there is a trade off between risk and reward. For example, a race car can turn a corner faster by taking a more challenging path. This paper proposes a new approach to planning a control sequence with a guaranteed risk bound. Given a stochastic dynamic model, the problem is to find a control sequence that optimizes a performance metric, while satisfying chance constraints i.e. constraints on the upper bound of the probability of failure. We propose a two-stage optimization approach, with the upper stage optimizing the risk allocation and the lower stage calculating the optimal control sequence that maximizes reward. In general, the upper-stage is a non-convex optimization problem, which is hard to solve. We develop a new iterative algorithm for this stage that efficiently computes the risk allocation with a small penalty to optimality. The algorithm is implemented and tested on the autonomous underwater vehicle (AUV) depth planning problem, and demonstrates a substantial improvement in computation cost and suboptimality, compared to the prior arts.