13,674 research outputs found

    An Effective Multi-Cue Positioning System for Agricultural Robotics

    Get PDF
    The self-localization capability is a crucial component for Unmanned Ground Vehicles (UGV) in farming applications. Approaches based solely on visual cues or on low-cost GPS are easily prone to fail in such scenarios. In this paper, we present a robust and accurate 3D global pose estimation framework, designed to take full advantage of heterogeneous sensory data. By modeling the pose estimation problem as a pose graph optimization, our approach simultaneously mitigates the cumulative drift introduced by motion estimation systems (wheel odometry, visual odometry, ...), and the noise introduced by raw GPS readings. Along with a suitable motion model, our system also integrates two additional types of constraints: (i) a Digital Elevation Model and (ii) a Markov Random Field assumption. We demonstrate how using these additional cues substantially reduces the error along the altitude axis and, moreover, how this benefit spreads to the other components of the state. We report exhaustive experiments combining several sensor setups, showing accuracy improvements ranging from 37% to 76% with respect to the exclusive use of a GPS sensor. We show that our approach provides accurate results even if the GPS unexpectedly changes positioning mode. The code of our system along with the acquired datasets are released with this paper.Comment: Accepted for publication in IEEE Robotics and Automation Letters, 201

    Cooperative localization for mobile agents: a recursive decentralized algorithm based on Kalman filter decoupling

    Full text link
    We consider cooperative localization technique for mobile agents with communication and computation capabilities. We start by provide and overview of different decentralization strategies in the literature, with special focus on how these algorithms maintain an account of intrinsic correlations between state estimate of team members. Then, we present a novel decentralized cooperative localization algorithm that is a decentralized implementation of a centralized Extended Kalman Filter for cooperative localization. In this algorithm, instead of propagating cross-covariance terms, each agent propagates new intermediate local variables that can be used in an update stage to create the required propagated cross-covariance terms. Whenever there is a relative measurement in the network, the algorithm declares the agent making this measurement as the interim master. By acquiring information from the interim landmark, the agent the relative measurement is taken from, the interim master can calculate and broadcast a set of intermediate variables which each robot can then use to update its estimates to match that of a centralized Extended Kalman Filter for cooperative localization. Once an update is done, no further communication is needed until the next relative measurement

    Robust Incremental SLAM under Constrained Optimization Formulation

    Full text link
    © 2016 IEEE. In this letter, we propose a constrained optimization formulation and a robust incremental framework for the simultaneous localization and mapping problem (SLAM). The new SLAM formulation is derived from the nonlinear least squares (NLS) formulation by mathematically formulating loop-closure cycles as constraints. Under the constrained SLAM formulation, we study the robustness of an incremental SLAM algorithm against local minima and outliers as a constraint/loop-closure cycle selection problem. We find a constraint metric that can predict the objective function growth after including the constraint. By the virtue of the constraint metric, we select constraints into the incremental SLAM according to a least objective function growth principle to increase robustness against local minima and perform χ 2 difference test on the constraint metric to increase robustness against outliers. Finally, using sequential quadratic programming (SQP) as the solver, an incremental SLAM algorithm (iSQP) is proposed. Experimental validations are provided to illustrate the accuracy of the constraint metric and the robustness of the proposed incremental SLAM algorithm. Nonetheless, the proposed approach is currently confined to datasets with sparse loop-closures due to its computational cost
    • …
    corecore