Using interval methods in the context of robust localization of underwater robots
Open Access
- 1 March 2011
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Abstract
In this paper we will apply interval methods to solve the problem of robust localization of an underwater robot. The localization problem is cast into a constraint satisfaction problem (CSP) where constraint propagation algorithms are particularly efficient. The method is designed to work in real environments with numerous outliers. Besides, we used a new approach to represent the map by a binary image. This allow us to represent even unstructured maps. We tested the algorithm on a real data set gathered by an underwater robot in a marina located in Costa Brava.Keywords
This publication has 13 references indexed in Scilit:
- Robust set-membership state estimation; application to underwater roboticsAutomatica, 2009
- Underwater SLAM in man‐made structured environmentsJournal of Field Robotics, 2008
- Constraints propagation techniques on intervals for a guaranteed localization using redundant dataAutomatica, 2006
- Using interval arithmetic to prove that a set is path-connectedTheoretical Computer Science, 2005
- Initial localization by set inversionIEEE Transactions on Robotics and Automation, 2002
- Estimation of Mobile Robot Localization: Geometric Approaches1996
- Robustness to Outliers of Bounded-Error Estimators and Consequences on Experiment Design1996
- Applications of Interval Computations1996
- OMNE: A new robust membership-set estimator for the parameters of nonlinear modelsJournal of Pharmacokinetics and Biopharmaceutics, 1987
- Methods and Applications of Interval Analysis1979