810 search results - page 42 / 162 » Solving Time-Dependent Planning Problems |
MDAI
2009
Springer
14 years 2 months ago
2009
Springer
We propose a means of extending Conditional Random Field modeling to decision-theoretic planning where valuation is dependent upon fullyobservable factors. Representation is discu...
JCO
2006
13 years 8 months ago
2006
In this paper, we compare several 0-1 linear programs for solving the satellite mission planning problem. We prove that one of them presents a smaller integrality gap. Our explana...
AIPS
2009
13 years 9 months ago
2009
We propose an online algorithm for planning under uncertainty in multi-agent settings modeled as DEC-POMDPs. The algorithm helps overcome the high computational complexity of solv...
AUSAI
2005
Springer
14 years 1 months ago
2005
Springer
In this work, we develop a multi-exchange heuristic based on an estimation improvement graph embedded in a simulated annealing to solve a problem arising in plant location planning...
EAAI
2008
13 years 8 months ago
2008
Nowadays, many real problems can be formalized as Distributed CSPs. A distributed constraint satisfaction problem (DisCSP) is a CSP in which variables and constraints are distribu...