122 search results - page 5 / 25 » An Algorithm for Probabilistic Least-Commitment Planning |
AAAI
1998
14 years 11 months ago
1998
Probabilistic planning algorithms seek e ective plans for large, stochastic domains. maxplan is a recently developed algorithm that converts a planning problem into an E-Majsat pr...
74
Voted
IJCAI
2003
14 years 11 months ago
2003
We present a new general framework for online istic plan recognition called the Abstract Hidden Markov Memory Model (AHMEM). The l is an extension of the existing Abstract Hidden ...
ROBOCUP
2001
Springer
15 years 2 months ago
2001
Springer
In multiagent adversarial domains, team agents should adapt to the environment and opponent. We introduce a model representation as part of a planning process for a simulated socce...
82
Voted
JAIR
2010
14 years 8 months ago
2010
Domain-specific features are important in representing problem structure throughout machine learning and decision-theoretic planning. In planning, once state features are provide...
AAAI
2006
14 years 11 months ago
2006
Few temporal planners handle both concurrency and uncertain durations, but these features commonly co-occur in realworld domains. In this paper, we discuss the challenges caused b...