1897 search results - page 21 / 380 » Conditional Linear Planning |
AIPS
2007
13 years 11 months ago
2007
Many of the benchmark domains in AI planning are tractable on an individual basis. In this paper, we seek a theoretical, domain-independent explanation for their tractability. We ...
AIPS
2006
13 years 10 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...
AAAI
2008
13 years 11 months ago
2008
This paper addresses the problem of plan recognition for multi-agent teams. Complex multi-agent tasks typically require dynamic teams where the team membership changes over time. ...
HICSS
2000
IEEE
14 years 1 months ago
2000
IEEE
In this paper we evaluate the effectiveness of agent-based aiding in support of a time-critical team-planning task for teams of both humans and heterogeneous software agents. The ...
IJCAI
1993
13 years 10 months ago
1993
In multiagent planning, an agent sometimes needs to collaborate with others to construct complex plans, or to accomplish large organizational tasks which it cannot do alone. Since...