activity
20092021
most citedAnytime Point-Based Approximations for Large POMDPs

375 citations · 1.9k across the 50 of their papers we have counts for

collaborators
Showing 2012Show all

9 papers · 1 filter

cs.LG2012★ 2 cited

Fast Solutions to Projective Monotone Linear Complementarity Problems

Geoffrey J. Gordon

We present a new interior-point potential-reduction algorithm for solving monotone linear complementarity problems (LCPs) that have a particular special structure: their matrix $M\…

cs.AI2012★ 59 cited

Distributed Planning in Hierarchical Factored MDPs

Carlos E. Guestrin, Geoffrey Gordon

We present a principled and efficient planning algorithm for collaborative multiagent dynamical systems. All computation, during both the planning and the execution phases, is dist…

cs.RO2012★ 52 cited

Policy-contingent abstraction for robust robot control

Joelle Pineau, Geoffrey Gordon, Sebastian Thrun

This paper presents a scalable control algorithm that enables a deployed mobile robot system to make high-level decisions under full consideration of its probabilistic belief. Our…

cs.AI2012★ 153 cited

Decentralized Sensor Fusion With Distributed Particle Filters

Matthew Rosencrantz, Geoffrey Gordon, Sebastian Thrun

This paper presents a scalable Bayesian technique for decentralized state estimation from multiple platforms in dynamic environments. As has long been recognized, centralized archi…

cs.LG2012

A Spectral Learning Approach to Range-Only SLAM

Byron Boots, Geoffrey J. Gordon

We present a novel spectral learning algorithm for simultaneous localization and mapping (SLAM) from range data with known correspondences. This algorithm is an instance of a gener…

cs.LG2012★ 24 cited

Two-Manifold Problems with Applications to Nonlinear System Identification

Byron Boots, Geoff Gordon

Recently, there has been much interest in spectral approaches to learning manifolds---so-called kernel eigenmap methods. These methods have had some successes, but their applicabil…