In this paper we introduce and study Shortest Path Discovery (SPD) problems, a generalization of shortest path problems: In SPD one is given a directed edgeweighted graph and the ...
CAT's knowledge base contains abstract task or example "abstract flight reservation task," which can be included in a workflow as placeholders. CAT will gest that us...
In this paper we introduce the language Golog+HTNT I for specifying control using procedural and HTN-based constructs together with deadlines and time restrictions. Our language s...
The resource-constrained project scheduling problem with time windows (RCPSP/max) is an important generalization of a number of well studied scheduling problems. In this paper, we...
We present a probabilistic method for path planning that considers trajectories constrained by both the environment and an ensemble of restrictions or preferences on preferred mot...
This paper deals with automatically learning the spatial distribution of a set of images. That is, given a sequence of images acquired from well-separated locations, how can they ...
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorith...
We describe SCoT, a Spoken Conversational Tutor, which has been implemented in order to investigate the advantages of natural language in tutoring, especially spoken language. SCo...
Karl Schultz, Brady Clark, Heather Pon-Barry, Eliz...