Sciweavers

350 search results - page 27 / 70
» Complexity of Planning with Partial Observability
Sort
View
ENTCS
2006
173views more  ENTCS 2006»
13 years 9 months ago
Concurrent LSC Verification: On Decomposition Properties of Partially Ordered Symbolic Automata
Partially Ordered Symbolic Automata (POSAs) are used as the semantical foundation of visual formalisms like the scenario based language of Live Sequence Charts (LSCs). To check whe...
Tobe Toben, Bernd Westphal
AAAI
2004
13 years 10 months ago
An Instance-Based State Representation for Network Repair
We describe a formal framework for diagnosis and repair problems that shares elements of the well known partially observable MDP and cost-sensitive classification models. Our cost...
Michael L. Littman, Nishkam Ravi, Eitan Fenson, Ri...
AI
2006
Springer
13 years 11 months ago
A Smart Home Agent for Plan Recognition
Assistance to people suffering from cognitive deficiencies in a smart home raises complex issues. Plan recognition is one of them. We propose a formal framework for the recognition...
Bruno Bouchard, Sylvain Giroux, Abdenour Bouzouane
IROS
2008
IEEE
126views Robotics» more  IROS 2008»
14 years 3 months ago
High-dimensional underactuated motion planning via task space control
Abstract— Kinodynamic planning algorithms have the potential to find feasible control trajectories which accomplish a task even in very nonlinear or constrained dynamical system...
Alexander C. Shkolnik, Russ Tedrake

Publication
273views
13 years 4 months ago
Monte Carlo Value Iteration for Continuous-State POMDPs
Partially observable Markov decision processes (POMDPs) have been successfully applied to various robot motion planning tasks under uncertainty. However, most existing POMDP algo...
Haoyu Bai, David Hsu, Wee Sun Lee, and Vien A. Ngo