Sciweavers

810 search results - page 70 / 162
» Solving Time-Dependent Planning Problems
Sort
View
AAAI
2008
13 years 10 months ago
Limits and Possibilities of BDDs in State Space Search
This paper investigates the impact of symbolic search for solving domain-independent action planning problems with binary decision diagrams (BDDs). Polynomial upper and exponential...
Stefan Edelkamp, Peter Kissmann
AAAI
2008
13 years 10 months ago
Probabilistic Planning via Determinization in Hindsight
This paper investigates hindsight optimization as an approach for leveraging the significant advances in deterministic planning for action selection in probabilistic domains. Hind...
Sung Wook Yoon, Alan Fern, Robert Givan, Subbarao ...
IJCAI
1989
13 years 9 months ago
Goal Ordering in Partially Ordered Plans
Partially ordered plans have not solved the goal ordering problem. Consider: a goal in a par­ tially ordered plan is an operator precondition that is not yet achieved; operators,...
Mark Drummond, Ken Currie
AAAI
2010
13 years 9 months ago
Multi-Agent Plan Recognition: Formalization and Algorithms
Multi-Agent Plan Recognition (MAPR) seeks to identify the dynamic team structures and team behaviors from the observations of the activity-sequences of a set of intelligent agents...
Bikramjit Banerjee, Landon Kraemer, Jeremy Lyle
JIRS
2000
144views more  JIRS 2000»
13 years 7 months ago
An Integrated Approach of Learning, Planning, and Execution
Agents (hardware or software) that act autonomously in an environment have to be able to integrate three basic behaviors: planning, execution, and learning. This integration is man...
Ramón García-Martínez, Daniel...