4.6 Article

Pose-Graph Neural Network Classifier for Global Optimality Prediction in 2D SLAM

Journal

IEEE ACCESS
Volume 9, Issue -, Pages 80466-80477

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2021.3084599

Keywords

Simultaneous localization and mapping; Optimization; Training; Testing; Trajectory; Uncertainty; Programming; Pose graph optimization; global optimality; graph neural network; simultaneous localization and mapping

Funding

  1. Khalifa University of Science and Technology [CIRA-2020-082, RC1-2018-KUCARS]

Ask authors/readers for more resources

The paper proposes a graph neural network based on PoseConv for pose-graph classification, achieving 92-98% accuracy in testing and significantly faster processing speeds compared to other methods. The model is able to generalize to previously unseen variants of pose-graphs.
The ability to decide if a solution to a pose-graph problem is globally optimal is of high significance for safety-critical applications. Converging to a local-minimum may result in severe estimation errors along the estimated trajectory. In this paper, we propose a graph neural network based on a novel implementation of a graph convolutional-like layer, called PoseConv, to perform classification of pose-graphs as optimal or sub-optimal. The operation of PoseConv required incorporating a new node feature, referred to as cost, to hold the information that the nodes will communicate. A training and testing dataset was generated based on publicly available bench-marking pose-graphs. The neural classifier is then trained and extensively tested on several subsets of the pose-graph samples in the dataset. Testing results have proven the model's capability to perform classification with 92 - 98% accuracy, for the different partitions of the training and testing dataset. In addition, the model was able to generalize to previously unseen variants of pose-graphs in the training dataset. Our method trades a small amount of accuracy for a large improvement in processing time. This makes it faster than other existing methods by up-to three orders of magnitude, which could be of paramount importance when using computationally-limited robots overseen by human operators.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available