Sciweavers

297 search results - page 3 / 60
» Planning Partially for Situated Agents
Sort
View
AAAI
1994
13 years 8 months ago
Situated Plan Attribution for Intelligent Tutoring
Plan recognition techniques frequently make rigid assumptions about the student's plans, and invest substantial effort to infer unobservable properties of the student. The pe...
Randall W. Hill Jr., W. Lewis Johnson
ARGMAS
2009
Springer
14 years 1 months ago
A Generative Dialogue System for Arguing about Plans in Situation Calculus
Abstract. This paper presents an argumentation mechanism for reconciling conflicts between planning agents related to plan proposals, which are caused by inconsistencies between b...
Alexandros Belesiotis, Michael Rovatsos, Iyad Rahw...
AIPS
2007
13 years 9 months ago
A Fast Incremental Algorithm for Maintaining Dispatchability of Partially Controllable Plans
Autonomous systems operating in real-world environments must be able to plan, schedule, and execute missions while robustly adapting to uncertainty and disturbances. Previous work...
Julie A. Shah, John Stedl, Brian C. Williams, Paul...
PAAMS
2010
Springer
13 years 11 months ago
An UCT Approach for Anytime Agent-Based Planning
In this paper, we introduce a new heuristic search algorithm based on mean values for anytime planning, called MHSP. It consists in associating the principles of UCT, a bandit-base...
Damien Pellier, Bruno Bouzy, Marc Métivier
AIPS
2006
13 years 8 months ago
Goal Achievement in Partially Known, Partially Observable Domains
We present a decision making algorithm for agents that act in partially observable domains which they do not know fully. Making intelligent choices in such domains is very difficu...
Allen Chang, Eyal Amir