2014
DOI: 10.2478/cait-2014-0035
|View full text |Cite
|
Sign up to set email alerts
|

Landmark Sequence Data Association for Simultaneous Localization and Mapping of Robots

Abstract: The paper proposes landmark sequence data association for Simultaneous Localization and Mapping (SLAM) for data association problem under conditions of noise uncertainty increase. According to the space geometric information of the environment landmarks, the information correlations between the landmarks are constructed based on the graph theory. By observing the variations of the innovation covariance using the landmarks of the adjacent two steps, the problem is converted to solve the landmark TSP problem and… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2017
2017
2018
2018

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 15 publications
0
2
0
Order By: Relevance
“…Simultaneous Localization And Mapping (SLAM) methods map the unknown surrounding space and ensure that the movement follows the built path [3]. SLAM presupposes that the mobile robot gathers data on the geometry of the surrounding space and defines the shift vector and rotation angle of the robot between separate time points [4]. Mathematically, this problem becomes the problem of defining the parameters of similarity transformations between two samples of two-dimensional geometrical measurements.…”
Section: Introductionmentioning
confidence: 99%
“…Simultaneous Localization And Mapping (SLAM) methods map the unknown surrounding space and ensure that the movement follows the built path [3]. SLAM presupposes that the mobile robot gathers data on the geometry of the surrounding space and defines the shift vector and rotation angle of the robot between separate time points [4]. Mathematically, this problem becomes the problem of defining the parameters of similarity transformations between two samples of two-dimensional geometrical measurements.…”
Section: Introductionmentioning
confidence: 99%
“…For demonstrating our method's universality, we set up a static environment to archive the requirement of Gmapping to show that DKDR can be simply applied to the existing common SLAM algorithm. If the robot is operating a task under noisier conditions which makes the data association difficult, such as occlusions of features or existence of dynamic features, some existing methods can be applied to deal with these critical situations, such as a robust data association method for noisy and dynamic environment [26], JPDA (Joint Probabilistic Data Association) [27], and LSDA (Landmark Sequence Data Association) [28]. Since the DKDR just needs associated features to judge the kidnapping, these data association methods can be applied before executing the DKDR under noisy conditions.…”
Section: Simulations and Experimentsmentioning
confidence: 99%