Sciweavers

2178 search results - page 32 / 436
» Inferring complex plans
Sort
View
IJCAI
1989
13 years 10 months ago
Solving Time-Dependent Planning Problems
A planning problem is time-dependent, if the time spent planning affects the utility of the system's performance. In [Dean and Boddy, 1988], we define a framework for constru...
Mark S. Boddy, Thomas Dean
ECCC
2008
117views more  ECCC 2008»
13 years 8 months ago
The complexity of learning SUBSEQ(A)
Higman essentially showed that if A is any language then SUBSEQ(A) is regular, where SUBSEQ(A) is the language of all subsequences of strings in A. Let s1, s2, s3, . . . be the sta...
Stephen A. Fenner, William I. Gasarch, Brian Posto...
IJCAI
2003
13 years 10 months ago
Generalizing GraphPlan by Formulating Planning as a CSP
We examine the approach of encoding planning problems as CSPs more closely. First we present a simple CSP encoding for planning problems and then a set of transformations that can...
Adriana Lopez, Fahiem Bacchus
WSC
2007
13 years 11 months ago
Allocation of resources for hospital evacuations via simulation
Department of Health and Environmental Control (DHEC) issued an order recently requiring that all hospitals have an evacuation plan with the following components: sheltering plan,...
Esengul Tayfur, Kevin Taaffe
ATAL
2008
Springer
13 years 10 months ago
Robust and efficient plan recognition for dynamic multi-agent teams
This paper addresses the problem of plan recognition for multiagent teams. Complex multi-agent tasks typically require dynamic teams where the team membership changes over time. T...
Gita Sukthankar, Katia P. Sycara