Sciweavers

99 search results - page 1 / 20
» Fast Planning for Dynamic Preferences
Sort
View
AIPS
2008
13 years 7 months ago
Fast Planning for Dynamic Preferences
We present an algorithm that quickly finds optimal plans for unforeseen agent preferences within graph-based planning domains where actions have deterministic outcomes and action ...
Brian Ziebart, Anind K. Dey, J. Andrew Bagnell
ICRA
1998
IEEE
157views Robotics» more  ICRA 1998»
13 years 9 months ago
Motion Planning for a 3-DOF Robot with a Passive Joint
This paper studies motion planning from one zero velocity state to another for a three-joint robot in a horizontal plane witha passive revolute third joint. Such a robot is small-...
Kevin M. Lynch, Naoji Shiroma, Hirohiko Arai, Kazu...
ECAI
2000
Springer
13 years 9 months ago
Graph Based Representation of Dynamic Planning
Dynamic planning concerns the planning and execution of actions in a dynamic, real world environment. Its goal is to take into account changes generated by unpredicted events occur...
Pavlos Moraitis, Alexis Tsoukiàs
ATAL
2008
Springer
13 years 7 months ago
The permutable POMDP: fast solutions to POMDPs for preference elicitation
The ability for an agent to reason under uncertainty is crucial for many planning applications, since an agent rarely has access to complete, error-free information about its envi...
Finale Doshi, Nicholas Roy
AAAI
2011
12 years 5 months ago
Preferred Explanations: Theory and Generation via Planning
In this paper we examine the general problem of generating preferred explanations for observed behavior with respect to a model of the behavior of a dynamical system. This problem...
Shirin Sohrabi, Jorge A. Baier, Sheila A. McIlrait...