2019
DOI: 10.3390/computers8030063
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic ICSP Graph Optimization Approach for Car-Like Robot Localization in Outdoor Environments

Abstract: Localization has been regarded as one of the most fundamental problems to enable a mobile robot with autonomous capabilities. Probabilistic techniques such as Kalman or Particle filtering have long been used to solve robotic localization and mapping problem. Despite their good performance in practical applications, they could suffer inconsistency problems. This paper presents an Interval Constraint Satisfaction Problem (ICSP) graph based methodology for consistent car-like robot localization in outdoor environ… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 26 publications
(34 reference statements)
0
3
0
Order By: Relevance
“…Such state estimation is difficult due to the absence of knowledge on the initial condition x(0) as well as any other state, and because very few asynchronous non-linear observations are available. In particular, it has been shown in [48] and [49], that the problem is difficult to solve if the heading of the robot is not measured. As it has been said before, classical methods such as Bayesian approaches or particle filters badly behave in presence of few observations and are not suited to deal with large uncertainties because of inaccurate linearizations or convergence issues.…”
Section: A Problem Statementmentioning
confidence: 99%
“…Such state estimation is difficult due to the absence of knowledge on the initial condition x(0) as well as any other state, and because very few asynchronous non-linear observations are available. In particular, it has been shown in [48] and [49], that the problem is difficult to solve if the heading of the robot is not measured. As it has been said before, classical methods such as Bayesian approaches or particle filters badly behave in presence of few observations and are not suited to deal with large uncertainties because of inaccurate linearizations or convergence issues.…”
Section: A Problem Statementmentioning
confidence: 99%
“…Kueviakoe et al [129], [130] introduced a real-time interval constraint propagation algorithm for on-road vehicle orientation correction using GPS, gyro, and odometer sensor data. Wang et al [131], [132] proposed to use interval constraint propagation technique to achieve localisation consistency and accuracy of a car-like robot by fusing DR, camera and map data. Both solutions considered the localisation problem as an interval constraint satisfaction problem.…”
Section: A Multi-sensor-based Data Fusion Localisationmentioning
confidence: 99%
“…It has been used to prove conjectures such as the existence of the Lorenz attractor [54], or that a given system is chaotic [20]. It has also been used for state estimation [31,40,1], localization [43,26,15,55] or SLAM [36].…”
Section: Introductionmentioning
confidence: 99%