Sciweavers

140 search results - page 10 / 28
» Possibilistic Planning: Representation and Complexity
Sort
View
JAPLL
2008
91views more  JAPLL 2008»
13 years 8 months ago
Undoing the effects of action sequences
In this paper, we study the following basic problem: After having executed a sequence of actions, find a sequence of actions that brings the agent back to the state just before th...
Thomas Eiter, Esra Erdem, Wolfgang Faber
AIPS
2009
13 years 10 months ago
Learning User Plan Preferences Obfuscated by Feasibility Constraints
It has long been recognized that users can have complex preferences on plans. Non-intrusive learning of such preferences by observing the plans executed by the user is an attracti...
Nan Li, William Cushing, Subbarao Kambhampati, Sun...
IJRR
2010
162views more  IJRR 2010»
13 years 7 months ago
Planning under Uncertainty for Robotic Tasks with Mixed Observability
Partially observable Markov decision processes (POMDPs) provide a principled, general framework for robot motion planning in uncertain and dynamic environments. They have been app...
Sylvie C. W. Ong, Shao Wei Png, David Hsu, Wee Sun...
CI
2005
106views more  CI 2005»
13 years 8 months ago
Incremental Learning of Procedural Planning Knowledge in Challenging Environments
Autonomous agents that learn about their environment can be divided into two broad classes. One class of existing learners, reinforcement learners, typically employ weak learning ...
Douglas J. Pearson, John E. Laird
IROS
2007
IEEE
125views Robotics» more  IROS 2007»
14 years 3 months ago
Probabilistic inference for structured planning in robotics
Abstract— Real-world robotic environments are highly structured. The scalability of planning and reasoning methods to cope with complex problems in such environments crucially de...
Marc Toussaint, Christian Goerick