Person:
Dellaert, Frank

Permanent Link
https://hdl.handle.net/1853/71202
Associated Organization(s)
Organizational Unit
ORCID
ArchiveSpace Name Record

Filters

2002 - 2008 4
2 2 1 1
4
4
Reset filters

Settings
Author: Kaess, Michael × End date: 2009 × Start date: 2002 × search.filters.applied.f.isOrgUnitOfPublicationTitle: College of Computing × search.filters.applied.f.isOrgUnitOfPublicationTitle: Institute for Robotics and Intelligent Machines (IRIM) × Type: Text ×

Publication Search Results

Now showing 1 - 4 of 4
  • Thumbnail Image
    Item
    Place Recognition-Based Fixed-Lag Smoothing for Environments with Unreliable GPS
    (Georgia Institute of Technology, 2008-05) Mottaghi, Roozbeh ; Kaess, Michael ; Ranganathan, Ananth ; Roberts, Richard ; Dellaert, Frank
    Pose estimation of outdoor robots presents some distinct challenges due to the various uncertainties in the robot sensing and action. In particular, global positioning sensors of outdoor robots do not always work perfectly, causing large drift in the location estimate of the robot. To overcome this common problem, we propose a new approach for global localization using place recognition. First, we learn the location of some arbitrary key places using odometry measurements and GPS measurements only at the start and the end of the robot trajectory. In subsequent runs, when the robot perceives a key place, our fixed-lag smoother fuses odometry measurements with the relative location to the key place to improve its pose estimate. Outdoor mobile robot experiments show that place recognition measurements significantly improve the estimate of the smoother in the absence of GPS measurements.
  • Thumbnail Image
    Item
    Square Root SAM Simultaneous Localization and Mapping via Square Root Information Smoothing
    (Georgia Institute of Technology, 2006) Dellaert, Frank ; Kaess, Michael
    Solving the SLAM problem is one way to enable a robot to explore, map, and navigate in a previously unknown environment. We investigate smoothing approaches as a viable alternative to extended Kalman filter-based solutions to the problem. In particular, we look at approaches that factorize either the associated information matrix or the measurement Jacobian into square root form. Such techniques have several significant advantages over the EKF: they are faster yet exact, they can be used in either batch or incremental mode, are better equipped to deal with non-linear process and measurement models, and yield the entire robot trajectory, at lower cost for a large class of SLAM problems. In addition, in an indirect but dramatic way, column ordering heuristics automatically exploit the locality inherent in the geographic nature of the SLAM problem. In this paper we present the theory underlying these methods, along with an interpretation of factorization in terms of the graphical model associated with the SLAM problem. We present both simulation results and actual SLAM experiments in large-scale environments that underscore the potential of these methods as an alternative to EKF-based approaches.
  • Thumbnail Image
    Item
    A Markov Chain Monte Carlo Approach to Closing the Loop in SLAM
    (Georgia Institute of Technology, 2005-04) Kaess, Michael ; Dellaert, Frank
    The problem of simultaneous localization and mapping has received much attention over the last years. Especially large scale environments, where the robot trajectory loops back on itself, are a challenge. In this paper we introduce a new solution to this problem of closing the loop. Our algorithm is EM-based, but differs from previous work. The key is a probability distribution over partitions of feature tracks that is determined in the E-step, based on the current estimate of the motion. This virtual structure is then used in the M-step to obtain a better estimate for the motion. We demonstrate the success of our algorithm in experiments on real laser data.
  • Thumbnail Image
    Item
    The Georgia Tech Yellow Jackets: A Marsupial Team for Urban Search and Rescue
    (Georgia Institute of Technology, 2002) Alegre, Fernando ; Balch, Tucker ; Berhault, Marc ; Dellaert, Frank ; Kaess, Michael ; McGuire, Robert ; Merrill, Ernest ; Moshkina, Lilia ; Ravichandran, Ram ; Walker, Daniel
    We describe our entry in the AAAI 2002 Urban Search and Rescue (USAR) competition, a marsupial team consisting of a larger wheeled robot and several small legged robots, carried around by the larger robot. This setup exploits complimentary strengths of each robot type in a challenging domain. We describe both the hardware and software architecture, and the on-board real-time mapping which forms the basis of accurate victim-localization crucial to the USAR domain. We also evaluate what challenges remain to be resolved in order to deploy search and rescue robots in realistic scenarios.