Sciweavers

80
Voted
AIPS
1996
15 years 5 days ago
A Candidate Set Based Analysis of Subgoal Interactions in Conjunctive Goal Planning
Subgoal interactions have received considerable attention in AI Planning. Earlier analyses by Korf [11] and Joslin and Roach [6] were done in terms of the topology of the space of...
Subbarao Kambhampati, Laurie H. Ihrig, Biplav Sriv...
CLIMA
2004
15 years 7 days ago
Planning Partially for Situated Agents
Abstract. In recent years, within the planning literature there has been a departure from approaches computing total plans for given goals, in favour of approaches computing partia...
Paolo Mancarella, Fariba Sadri, Giacomo Terreni, F...
78
Voted
ICMLA
2007
15 years 8 days ago
Learning to evaluate conditional partial plans
In our research we study rational agents which learn how to choose the best conditional, partial plan in any situation. The agent uses an incomplete symbolic inference engine, emp...
Slawomir Nowaczyk, Jacek Malec
102
Voted
ICTAI
2000
IEEE
15 years 2 months ago
Building efficient partial plans using Markov decision processes
Markov Decision Processes (MDP) have been widely used as a framework for planning under uncertainty. They allow to compute optimal sequences of actions in order to achieve a given...
Pierre Laroche
78
Voted
PAAMS
2010
Springer
15 years 3 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