4894 search results - page 32 / 979 » Dynamic Abstraction Planning |
AAAI
1994
14 years 11 months ago
1994
Between sensing the world after every action (as in a reactive plan) and not sensing at all (as in an openloop plan), lies a continuum of strategies for sensing during plan execut...
AIPS
2006
14 years 11 months ago
2006
Planning for partially observable, nondeterministic domains is a very signi cant and computationally hard problem. Often, reasonable assumptions can be drawn over expected/nominal...
CAV
2008
Springer
14 years 11 months ago
2008
Springer
c Abstraction for Programs with Dynamic Memory Heaps Parosh Aziz Abdulla1 , Ahmed Bouajjani2 , Jonathan Cederberg1 , Fr
COLING
1996
14 years 11 months ago
1996
Abstract: Before engaging in a conversation, a message must be planned. While there are many ways to perform this task, I believe that people do this in the following way, in parti...
AIPS
2011
14 years 1 months ago
2011
We consider the problem of finding generalized plans for situations where the number of objects may be unknown and unbounded during planning. The input is a domain specification...