Abstract. We present SET-PR, a novel case-based plan recognition algorithm that is tolerant to missing and misclassified actions in its input action sequences. SET-PR uses a novel representation called action sequence graphs to represent stored plans in its plan library and a similarity metric that uses a combination of graph degree sequences and object similarity to retrieve relevant plans from its library. We evaluated SET-PR by measuring plan recognition convergence and precision with increasing levels of missing and misclassified actions in its input. In our experiments, SET-PR tolerated 20%-30 % of input errors without compromising plan recognition performance
Case-based planning can fruitfully exploit knowledge gained by solving a large number of problems, s...
An agent can perform erroneous actions. Despite such errors, one might want to understand what the a...
The problem of specifying high-level knowledge bases for planning becomes a hard task in realistic e...
We present a novel case-based plan recognition method that interprets observations of plan behavior ...
In our previous research, we investigated the properties of case-based plan recognition with incompl...
We present a novel approach to plan recognition in which graph construction and analysis is used as ...
Plan recognition is the task of inferring the plan of an agent, based on an incomplete sequence of ...
AbstractWe present the PHATT algorithm for plan recognition. Unlike previous approaches to plan reco...
Plan recognition is the problem of inferring the goals and plans of an agent after partially observ...
The main focus of this research is to establish the techniques and prove feasibility of the case-bas...
Case-based planning can take advantage of former problem-solving experiences by storing in a plan li...
Most of the available plan recognition techniques are based on the use of a plan library in order to...
Plan libraries are the most important knowledge source of many plan recognition systems. The plan de...
this paper, I discuss two areas of work in plan recognition for HCI. The first, expectation driven p...
One of the main bottlenecks in deploying case-based planning systems is authoring the case-base of p...
Case-based planning can fruitfully exploit knowledge gained by solving a large number of problems, s...
An agent can perform erroneous actions. Despite such errors, one might want to understand what the a...
The problem of specifying high-level knowledge bases for planning becomes a hard task in realistic e...
We present a novel case-based plan recognition method that interprets observations of plan behavior ...
In our previous research, we investigated the properties of case-based plan recognition with incompl...
We present a novel approach to plan recognition in which graph construction and analysis is used as ...
Plan recognition is the task of inferring the plan of an agent, based on an incomplete sequence of ...
AbstractWe present the PHATT algorithm for plan recognition. Unlike previous approaches to plan reco...
Plan recognition is the problem of inferring the goals and plans of an agent after partially observ...
The main focus of this research is to establish the techniques and prove feasibility of the case-bas...
Case-based planning can take advantage of former problem-solving experiences by storing in a plan li...
Most of the available plan recognition techniques are based on the use of a plan library in order to...
Plan libraries are the most important knowledge source of many plan recognition systems. The plan de...
this paper, I discuss two areas of work in plan recognition for HCI. The first, expectation driven p...
One of the main bottlenecks in deploying case-based planning systems is authoring the case-base of p...
Case-based planning can fruitfully exploit knowledge gained by solving a large number of problems, s...
An agent can perform erroneous actions. Despite such errors, one might want to understand what the a...
The problem of specifying high-level knowledge bases for planning becomes a hard task in realistic e...