Sciweavers

476 search results - page 75 / 96
» Randomized Robot Navigation Algorithms
Sort
View
FOCS
2003
IEEE
15 years 2 months ago
Approximation Algorithms for Orienteering and Discounted-Reward TSP
In this paper, we give the rst constant-factor approximationalgorithmfor the rooted Orienteering problem, as well as a new problem that we call the Discounted-Reward TSP, motivate...
Avrim Blum, Shuchi Chawla, David R. Karger, Terran...
78
Voted
IROS
2007
IEEE
157views Robotics» more  IROS 2007»
15 years 4 months ago
A spatio-temporal probabilistic model for multi-sensor object recognition
— This paper presents a general framework for multi-sensor object recognition through a discriminative probabilistic approach modelling spatial and temporal correlations. The alg...
Bertrand Douillard, Dieter Fox, Fabio T. Ramos
ICML
2003
IEEE
15 years 10 months ago
Bayes Meets Bellman: The Gaussian Process Approach to Temporal Difference Learning
We present a novel Bayesian approach to the problem of value function estimation in continuous state spaces. We define a probabilistic generative model for the value function by i...
Yaakov Engel, Shie Mannor, Ron Meir
CCR
2006
117views more  CCR 2006»
14 years 9 months ago
Efficient and decentralized computation of approximate global state
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
S. Keshav
RAS
2010
136views more  RAS 2010»
14 years 8 months ago
A realistic benchmark for visual indoor place recognition
An important competence for a mobile robot system is the ability to localize and perform context interpretation. This is required to perform basic navigation and to facilitate loc...
Andrzej Pronobis, Barbara Caputo, Patric Jensfelt,...