140 search results - page 7 / 28 » Possibilistic Planning: Representation and Complexity |
ICDT
2009
ACM
14 years 9 months ago
2009
ACM
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
ICRA
2006
IEEE
14 years 2 months ago
2006
IEEE
Abstract— This paper revisits the multi-robot boundary coverage problem in which a group of k robots must inspect every point on the boundary of a 2-dimensional environment. We f...
ECAI
2006
Springer
14 years 15 days ago
2006
Springer
An important application of both data abstraction and plan execution is the execution of clinical guidelines and protocols (CGP), both to validate them against a large set of test ...
TROB
2008
13 years 8 months ago
2008
Abstract--This paper addresses the challenging problem of finding collision-free trajectories for many robots moving toward individual goals within a common environment. Most popul...
ICML
2009
IEEE
14 years 9 months ago
2009
IEEE
Relational world models that can be learned from experience in stochastic domains have received significant attention recently. However, efficient planning using these models rema...