18 search results - page 3 / 4 » Approximate Probabilistic Constraints and Risk-Sensitive Opt... |
CDC
2008
IEEE
14 years 2 months ago
2008
IEEE
— In this paper we study the problem of dynamic optimization of ping schedule in an active sonar buoy network deployed to provide persistent surveillance of a littoral area throu...
CPAIOR
2008
Springer
13 years 9 months ago
2008
Springer
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...
IJCAI
2003
13 years 9 months ago
2003
An agent with limited consumable execution resources needs policies that attempt to achieve good performance while respecting these limitations. Otherwise, an agent (such as a pla...
PE
2011
Springer
13 years 2 months ago
2011
Springer
Structured QBDs by Abstraction Daniel Klink, Anne Remke, Boudewijn R. Haverkort, Fellow, IEEE, and Joost-Pieter Katoen, Member, IEEE Computer Society —This paper studies quantita...
JAIR
2008
13 years 7 months ago
2008
Probabilistic planning problems are typically modeled as a Markov Decision Process (MDP). MDPs, while an otherwise expressive model, allow only for sequential, non-durative action...