Sciweavers

536 search results - page 50 / 108
» Planning by Abstraction Using HW[]
Sort
View
AAAI
2006
13 years 9 months ago
Domain-Independent Structured Duplicate Detection
The scalability of graph-search algorithms can be greatly extended by using external memory, such as disk, to store generated nodes. We consider structured duplicate detection, an...
Rong Zhou, Eric A. Hansen
JAIR
2006
120views more  JAIR 2006»
13 years 7 months ago
FluCaP: A Heuristic Search Planner for First-Order MDPs
We present a heuristic search algorithm for solving first-order Markov Decision Processes (FOMDPs). Our approach combines first-order state abstraction that avoids evaluating stat...
Steffen Hölldobler, Eldar Karabaev, Olga Skvo...
ATAL
2010
Springer
13 years 8 months ago
Linear options
Learning, planning, and representing knowledge in large state t multiple levels of temporal abstraction are key, long-standing challenges for building flexible autonomous agents. ...
Jonathan Sorg, Satinder P. Singh
ICRA
2009
IEEE
248views Robotics» more  ICRA 2009»
14 years 2 months ago
Moving obstacle detection in highly dynamic scenes
Abstract— We address the problem of vision-based multiperson tracking in busy pedestrian zones using a stereo rig mounted on a mobile platform. Specifically, we are interested i...
Andreas Ess, Bastian Leibe, Konrad Schindler, Luc ...
JUCS
2008
196views more  JUCS 2008»
13 years 7 months ago
Information Integration for the Masses
Abstract: Information integration applications combine data from heterogeneous sources to assist the user in solving repetitive data-intensive tasks. Currently, such applications r...
Jim Blythe, Dipsy Kapoor, Craig A. Knoblock, Krist...