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...
This paper describes the foundations and algorithms of a new probabilistic roadmap (PRM) planner that is: (1) singlequery –i.e., it does not pre-compute a roadmap, but uses the ...
— Robots acting in populated environments must be capable of safe but also time efficient navigation. Trying to completely avoid regions resulting from worst case predictions of...
The ways in which an agent’s actions affect the world can often be modeled compactly using a set of relational probabilistic planning rules. This paper addresses the problem of ...
Ashwin Deshpande, Brian Milch, Luke S. Zettlemoyer...
— An important problem in position-based visual servoing (PBVS) is to guarantee that a target will remain within the field of view for the duration of the task. In this paper, w...