13 search results - page 1 / 3 » Iterative Strengthening: An Algorithm for Generating Anytime... |
ICTAI
1994
IEEE
13 years 9 months ago
1994
IEEE
In order to perform adequately in real-world situations, a planning system must be able to nd the \best" solution while still supporting anytime behavior. We have developed ...
CORR
2012
Springer
12 years 21 days ago
2012
Springer
Abstract— In this paper, we consider a class of continuoustime, continuous-space stochastic optimal control problems. Building upon recent advances in Markov chain approximation ...
IJCAI
2003
13 years 6 months ago
2003
Markov decision processes (MDPs) and contingency planning (CP) are two widely used approaches to planning under uncertainty. MDPs are attractive because the model is extremely gen...
AIPS
2010
13 years 7 months ago
2010
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...
CP
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goa...