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

DOI10.1007/s10601-015-9231-9zbMath1368.90108OpenAlexW2193354171MaRDI QIDQ2398514

Jaulin, Luc

Publication date: 16 August 2017

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-015-9231-9

zbMATH Keywords

interval analysislocalizationroboticsconstraint programmingsimultaneous localization and mapping

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Integer programming (90C10)

Uses Software

• CPGraph
• MSLAM
• Numerica
• RODES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving set-valued constraint satisfaction problems
• Contractor programming
• Constraints propagation techniques on intervals for a guaranteed localization using redundant data
• Ellipsoidal calculus for estimation and control
• A rigorous ODE solver and Smale's 14th problem
• Set-membership state estimation with fleeting data
• The essence of constraint propagation
• Algorithmic power from declarative use of redundant constraints
• Box particle filtering for nonlinear state estimation using interval analysis
• A lattice-theoretical fixpoint theorem and its applications
• Interval-based fast fault detection and identification applied to radio-navigation multipath
• Constructive Interval Disjunction
• CP(Graph): Introducing a Graph Computation Domain in Constraint Programming
• Principles of Constraint Programming
• Deterministic global optimization using interval constraint propagation techniques

This page was built for publication: Range-only SLAM with indistinguishable landmarks; a constraint programming approach