92 search results - page 8 / 19 » New Heuristics for Timeline-Based Planning |
UAI
2004
14 years 11 months ago
2004
We present a novel POMDP planning algorithm called heuristic search value iteration (HSVI). HSVI is an anytime algorithm that returns a policy and a provable bound on its regret w...
72
Voted
AIPS
2010
14 years 12 months ago
2010
Anytime search algorithms solve optimisation problems by quickly finding a usually suboptimal solution and then finding improved solutions when given additional time. To deliver a...
68
Voted
WSC
2001
14 years 11 months ago
2001
As the semiconductor industry moves into the next millennium, companies increasingly will be faced with production obstacles that impede their ability to remain competitive. Effec...
IAT
2009
IEEE
15 years 1 months ago
2009
IEEE
Variants of the decentralized MDP model focus on problems exhibiting some special structure that makes them easier to solve in practice. Our work is concerned with two main issues...
AI
2008
Springer
14 years 9 months ago
2008
Springer
Dealing with numerical information is practically important in many real-world planning domains where the executability of an action can depend on certain numerical conditions, an...