Sciweavers

34 search results - page 5 / 7
» Probabilistic inference for structured planning in robotics
Sort
View
AIPS
2007
13 years 8 months ago
Approximate Solution Techniques for Factored First-Order MDPs
Most traditional approaches to probabilistic planning in relationally specified MDPs rely on grounding the problem w.r.t. specific domain instantiations, thereby incurring a com...
Scott Sanner, Craig Boutilier
IROS
2008
IEEE
123views Robotics» more  IROS 2008»
14 years 20 days ago
Learning predictive terrain models for legged robot locomotion
— Legged robots require accurate models of their environment in order to plan and execute paths. We present a probabilistic technique based on Gaussian processes that allows terr...
Christian Plagemann, Sebastian Mischke, Sam Prenti...
UAI
2008
13 years 7 months ago
Sampling First Order Logical Particles
Approximate inference in dynamic systems is the problem of estimating the state of the system given a sequence of actions and partial observations. High precision estimation is fu...
Hannaneh Hajishirzi, Eyal Amir
NIPS
2003
13 years 7 months ago
Envelope-based Planning in Relational MDPs
A mobile robot acting in the world is faced with a large amount of sensory data and uncertainty in its action outcomes. Indeed, almost all interesting sequential decision-making d...
Natalia Hernandez-Gardiol, Leslie Pack Kaelbling
GLOBECOM
2010
IEEE
13 years 4 months ago
Cognitive Network Inference through Bayesian Network Analysis
Cognitive networking deals with applying cognition to the entire network protocol stack for achieving stack-wide as well as network-wide performance goals, unlike cognitive radios ...
Giorgio Quer, Hemanth Meenakshisundaram, Tamma Bhe...