In many planning applications one can find actions with overlapping effects. If for optimally reaching the goal all that matters is within this overlap, there is no need to consid...
Anytime search algorithms solve optimisation problems by quickly finding a usually suboptimal solution and then finding improved solutions when given additional time. To deliver a...
In our previous research, we investigated the properties of case-based plan recognition with incomplete plan libraries. Incremental construction of plan libraries along with retri...
In order to interact successfully in social situations, a robot must be able to observe others' actions and base its own behavior on its beliefs about their intentions. Many ...
Classical propositional STRIPSplanning is nothing but the searchfor a path in the state-transition graph induced by the operators in the planning problem. Whatmakes the problem ha...