355 search results - page 51 / 71 » Motion Planning with Uncertainty: The Information Space Appr... |
166
click to vote
AAAI
1996
1996
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
15 years 7 months ago
: Partially-observable Markov decision processes provide a very general model for decision-theoretic planning problems, allowing the trade-offs between various courses of actions t...
257
click to vote
ICDE
2008
IEEE
16 years 7 months ago
2008
IEEE
We study the problem of computing query results with confidence values in ULDBs: relational databases with uncertainty and lineage. ULDBs, which subsume probabilistic databases, o...
197
click to vote
ALIFE
1999
15 years 5 months ago
1999
A novel machine language genetic programming system that uses one-dimensional core memories is proposed and simulated. The core is compared to a biochemical reaction space, and in ...
179
click to vote
ICML
2009
IEEE
16 years 6 months ago
2009
IEEE
Trajectory planning and optimization is a fundamental problem in articulated robotics. Algorithms used typically for this problem compute optimal trajectories from scratch in a ne...
184
click to vote
LAMAS
2005
Springer
15 years 11 months ago
2005
Springer
In this paper we report on using a relational state space in multi-agent reinforcement learning. There is growing evidence in the Reinforcement Learning research community that a r...