Abstract
ABSTRACTAccurate, reliable, and efficient robot localization is essential for long‐term autonomous robotic inspection of buried pipe networks. It is necessary for path planning and for locating detected faults in the network. This paper proposes a novel localization algorithm designed for limited, high‐uncertainty sensing in network environments. The localization method is developed from the Viterbi algorithm, which efficiently searches for the most likely robot trajectory amongst multiple hypotheses. It is augmented to facilitate hybrid metric‐topological localization, and it is improved to efficiently spend computation on useful points in time. Results using field robot data from a sewer network demonstrate the algorithm's practical applicability, as the algorithm is shown to robustly produce a coherent trajectory estimate with low error in estimated location, compared with a particle filter alternative that incorrectly jumps between parts of the network. Results using simulated data demonstrate the algorithm's robust performance at large spatial and temporal scales. In 79% of trajectories, the algorithm produces less error than a particle filter, while requiring a median of 0.18 times the computation time, demonstrating a substantial improvement in computational efficiency with comparable or superior accuracy. The flexibility of the algorithm is also demonstrated in simulation by incorporating measurements representing acoustic echo sensing and pipe gradient sensing, which is shown to reduce the error rate from 28% to 7% or below, in the case of large uncertainty in all other inputs. These results demonstrate that the proposed localization method improves the computational efficiency, accuracy, and robustness of localization compared to a particle filter specialized to the pipe environment, even in the presence of limited and high‐uncertainty sensing.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have