408 search results - page 6 / 82 » A lookahead strategy for solving large planning problems |
AAAI
2010
14 years 11 months ago
2010
Planning in large, partially observable domains is challenging, especially when a long-horizon lookahead is necessary to obtain a good policy. Traditional POMDP planners that plan...
CPAIOR
2006
Springer
15 years 1 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
EWCBR
2008
Springer
14 years 11 months ago
2008
Springer
Case-Based Planning (CBP) is an effective technique for solving planning problems that has the potential to reduce the computational complexity of the generative planning approache...
ICRA
2009
IEEE
15 years 4 months ago
2009
IEEE
— Rapidly-exploring Random Trees (RRTs) are widely used to solve large planning problems where the scope prohibits the feasibility of deterministic solvers, but the efficiency o...
ICTAI
2008
IEEE
15 years 4 months ago
2008
IEEE
In real world we have to deal with changing situations which may partially or entirely invalidate an executable plan. Current strategies for plan repair are basically aimed at sol...