Sciweavers

810 search results - page 88 / 162
» Solving Time-Dependent Planning Problems
Sort
View
JAIR
2010
145views more  JAIR 2010»
13 years 6 months ago
Planning with Noisy Probabilistic Relational Rules
Noisy probabilistic relational rules are a promising world model representation for several reasons. They are compact and generalize over world instantiations. They are usually in...
Tobias Lang, Marc Toussaint
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
13 years 6 months ago
Efficient Planning in Large POMDPs through Policy Graph Based Factorized Approximations
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
Joni Pajarinen, Jaakko Peltonen, Ari Hottinen, Mik...
AAAI
2010
13 years 9 months ago
Integrating a Closed World Planner with an Open World Robot: A Case Study
In this paper, we present an integrated planning and robotic architecture that actively directs an agent engaged in an urban search and rescue (USAR) scenario. We describe three s...
Kartik Talamadupula, J. Benton, Paul W. Schermerho...
ICCBR
2009
Springer
14 years 2 months ago
Using Meta-reasoning to Improve the Performance of Case-Based Planning
Case-based planning (CBP) systems are based on the idea of reusing past successful plans for solving new problems. Previous research has shown the ability of meta-reasoning approac...
Manish Mehta, Santiago Ontañón, Ashw...
ICCBR
2007
Springer
14 years 2 months ago
Using Cases Utility for Heuristic Planning Improvement
Current efficient planners employ an informed search guided by a heuristic function that is quite expensive to compute. Thus, ordering nodes in the search tree becomes a key issue,...
Tomás de la Rosa, Angel García Olaya...