Skip to main content
SpringerLink
Log in

Range-only SLAM with indistinguishable landmarks; a constraint programming approach

  • Application
  • Published:
Constraints Aims and scope Submit manuscript

Abstract

This paper deals with the simultaneous localization and mapping problem (SLAM) for a robot. The robot has to build a map of its environment while localizing itself using a partially built map. It is assumed that (i) the map is made of point landmarks, (ii) the landmarks are indistinguishable, (iii) the only exteroceptive measurements correspond to the distance between the robot and the landmarks. This paper shows that SLAM can be cast into a constraint network the variables of which being trajectories, digraphs and subsets of \(\mathbb {R}^{n}.\) Then, we show how constraint propagation can be extended to deal with such generalized constraint networks. As a result, due to the redundancy of measurements of SLAM, we demonstrate that a constraint-based approach provides an efficient backtrack-free algorithm able to solve our SLAM problem in a guaranteed way.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

References

  1. Abdallah, F., Gning, A., & Bonnifait, P. (2008). Box particle filtering for nonlinear state estimation using interval analysis. Automatica, 44(3), 807–815.

    Article  MathSciNet  MATH  Google Scholar 

  2. Apt, K. (1998). The essence of constraint propagation. Theoretical Computer Science, 221(2), 179– 210.

    MathSciNet  MATH  Google Scholar 

  3. Apt, K. (2003). Principles of constraint programming: Cambridge University Press.

  4. Araya, I., Trombettoni, G., & Neveu, B. (2012). A Contractor Based on Convex Interval Taylor, vol. 7, 1–16, LNCS 7298: Springer.

  5. Beldiceanu, N., Carlsson, M., Demassey, S., & Petit, T. (2006). Graph properties based filtering, Constraint Programming. Principles and Practice of Constraint Programming, 13, 59–74.

  6. Chabert, G., & Jaulin, L. (2009). Contractor Programming. Artificial Intelligence, 3(173), 1079–1100.

    Article  MathSciNet  MATH  Google Scholar 

  7. Chabert, G., Jaulin, L., & Lorca, X. (2009). A constraint on the number of distinct vectors with application to localization, CP 2009, Vol. 7.

  8. Colle, E., & Galerne, Mobile robot localization by multiangulation using set inversion (2013). Robotics and Autonomous Systems, 61, 39–48.

    Article  Google Scholar 

  9. Davey, B. A., & Priestley, H. A. (2002). Introduction to Lattices and Order: Cambridge University Press. (ISBN 0521784514).

  10. Dooms, G., Deville, Y., & Dupont, P. (2005). Introducing a graph computation domain in constraint programming. Principles and Practice of Constraint Programming, 7, 211–225.

    MATH  Google Scholar 

  11. Drevelle, V., & Bonnifait, P. (2009). High integrity gnss location zone characterization using interval analysis, ION GNSS, Vol. 7.

  12. Drocourt, C., Delahoche, L., Brassart, E., & Clerentin, A. (2005). Incremental construction of the robot environmental map using interval analysis, Global Optimization and Constraint Satisfaction: Second International Workshop, COCOS 2003, 127–141.

  13. Gning, A., & Bonnifait, P. (2006). Constraints propagation techniques on intervals for a guaranteed localization using redundant data. Automatica, 42, 1167–1175.

    Article  MathSciNet  MATH  Google Scholar 

  14. Jaulin, L. (2009). A Nonlinear Set-membership Approach for the Localization and Map Building of an Underwater Robot using Interval Constraint Propagation. IEEE Transaction on Robotics, 88–98.

  15. Jaulin, L., & maps, Range-only SLAM with occupancy (2011). A set-membership approach. IEEE Transaction on Robotics, 1004–1010.

  16. Jaulin, L. (2012). Solving set-valued constraint satisfaction problems. Computing, 297–311.

  17. Jaulin, L. (2015). MSLAM, a solver for range-only SLAM with indistinguisable landmarks, available at www.ensta-bretagne.fr/jaulin/mslam.html, LabSTICC, ENSTA Bretagne.

  18. Jaulin, L., Kieffer, M., Didrit, O., & Walter, E. (2001). Applied interval analysis, with examples in parameter and state estimation, robust rontrol and robotics. London: Springer-Verlag.

  19. Kurzhanski, A., & Valyi, I. (1997). Ellipsoidal Calculus for Estimation and Control. MA: Birkhauser.

  20. Le Bars, F., Sliwka, J., Reynet, O., & Jaulin, L. (2012). State estimation with fleeting data. Automatica, 381–387.

  21. Leonard, J. J., & Durrant-Whyte, H. F. (1992). Dynamic map building for an autonomous mobile robot.

  22. Messine, F. (2004). Deterministic global optimization using interval constraint propagation techniques. Operations Research, 277–293.

  23. Newman, P., & Leonard, J. (2003). Pure range-only sub-sea slam, ICRA03, pp. 1921–1926. Washington.

  24. Sainudiin, R. (2010). Machine interval experiments: Accounting for the physical limits on empirical and numerical resolutions. Germany: LAP Academic, Koln.

  25. Soares, G., Arnold-Bos, A., Jaulin, L., Vasconcelos, J. A., & Maia, C. A. (2008). An interval-based target tracking approach for range-only multistatic radar. IEEE Transactions on Magnetics, 1350–1353.

  26. Spletzer, J. (2004). A new approach to range-only slam for wireless sensor networks, LU-CSE-04-008. Lehigh University.

  27. Tarski, A. (1955). A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics, 285–309.

  28. Thrun, S., Bugard, W., & Fox, D. (2005). Probabilistic Robotics. Cambridge: MIT Press.

  29. Trombettoni, G., & Chabert, G. (2007). Constructive Interval Disjunction. In Proc. CP, Constraint Programming, LNCS 4741 (pp. 635–650).

  30. Tucker, W. (2002). A Rigorous ODE Solver and Smale’s 14th Problem. Foundations of Computational Mathematics, 53–117.

  31. van Emden, M. (1999). Algorithmic power from declarative use of redundant constraints, p. 363–381.

  32. van Hentenryck, P., Deville, Y., & Michel, L. (1997). Numerica: A modeling language for global optimization. MA: MIT Press.

  33. Waltz, D. (1975). Generating semantic descriptions from drawings of scenes with shadows. In P. H. Winston (Ed.), The Psychology of Computer Vision (pp. 19–91). New York: McGraw-Hill.

  34. Wilczak, D., & Zgliczynski, P. (2011). Cr-lohner algorithm. Schedae Informaticae, 9–46.

Download references

Author information

Authors and Affiliations

  1. LabSTICC, IHSEV, OSM, 2 rue François Verny, 29806, Brest, France

    Luc Jaulin

Authors
  1. Luc Jaulin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Luc Jaulin.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jaulin, L. Range-only SLAM with indistinguishable landmarks; a constraint programming approach. Constraints 21, 557–576 (2016). https://doi.org/10.1007/s10601-015-9231-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10601-015-9231-9

Keywords

Search

Navigation