Sciweavers

350 search results - page 20 / 70
» Complexity of Planning with Partial Observability
Sort
View
ICTAI
2005
IEEE
14 years 2 months ago
Planning with POMDPs Using a Compact, Logic-Based Representation
Partially Observable Markov Decision Processes (POMDPs) provide a general framework for AI planning, but they lack the structure for representing real world planning problems in a...
Chenggang Wang, James G. Schmolze
ICTAI
2005
IEEE
14 years 2 months ago
Subgoal Ordering and Granularity Control for Incremental Planning
In this paper, we study strategies in incremental planning for ordering and grouping subproblems partitioned by the subgoals of a planning problem when each subproblem is solved b...
Chih-Wei Hsu, Yixin Chen
TBILLC
2005
Springer
14 years 2 months ago
Real World Multi-agent Systems: Information Sharing, Coordination and Planning
Abstract. Applying multi-agent systems in real world scenarios requires several essential research questions to be answered. Agents have to perceive their environment in order to t...
Frans C. A. Groen, Matthijs T. J. Spaan, Jelle R. ...
UAI
2003
13 years 10 months ago
Updating with incomplete observations
Currently, there is renewed interest in the problem, raised by Shafer in 1985, of updating probabilities when observations are incomplete (or setvalued). This is a fundamental pro...
Gert de Cooman, Marco Zaffalon
ISRR
2005
Springer
163views Robotics» more  ISRR 2005»
14 years 2 months ago
POMDP Planning for Robust Robot Control
POMDPs provide a rich framework for planning and control in partially observable domains. Recent new algorithms have greatly improved the scalability of POMDPs, to the point where...
Joelle Pineau, Geoffrey J. Gordon