Sciweavers

376 search results - page 39 / 76
» On the Advice Complexity of Online Problems
Sort
View
ICRA
2007
IEEE
165views Robotics» more  ICRA 2007»
15 years 6 months ago
Probabilistic Appearance Based Navigation and Loop Closing
— This paper describes a probabilistic framework for navigation using only appearance data. By learning a generative model of appearance, we can compute not only the similarity o...
Mark Cummins, Paul M. Newman
AAAI
2007
15 years 2 months ago
Anytime Coordination Using Separable Bilinear Programs
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...
Marek Petrik, Shlomo Zilberstein
ICCV
2009
IEEE
14 years 9 months ago
Real-time visual tracking via Incremental Covariance Tensor Learning
Visual tracking is a challenging problem, as an object may change its appearance due to pose variations, illumination changes, and occlusions. Many algorithms have been proposed t...
Yi Wu, Jian Cheng, Jinqiao Wang, Hanqing Lu
117
Voted
UAI
2008
15 years 1 months ago
Dyna-Style Planning with Linear Function Approximation and Prioritized Sweeping
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
Richard S. Sutton, Csaba Szepesvári, Alborz...
56
Voted
CORR
2011
Springer
176views Education» more  CORR 2011»
14 years 6 months ago
Multiplexed Model Predictive Control
: Most academic control schemes for MIMO systems assume all the control variables are updated simultaneously. MPC outperforms other control strategies through its ability to deal w...
Keck Voon Ling, Jan M. Maciejowski, A. G. Richards...