Papers
Topics
Authors
Recent
Search
2000 character limit reached

Real-Time Line-Based Room Segmentation and Continuous Euclidean Distance Fields

Published 7 Feb 2024 in cs.RO | (2402.05236v1)

Abstract: Continuous maps representations, as opposed to traditional discrete ones such as grid maps, have been gaining traction in the research community. However, current approaches still suffer from high computation costs, making them unable to be used in large environments without sacrificing precision. In this paper, a scalable method building upon Gaussian Process-based Euclidean Distance Fields (GP-EDFs) is proposed. By leveraging structure inherent to indoor environments, namely walls and rooms, we achieve an accurate continuous map representation that is fast enough to be updated and used in real-time. This is possible thanks to a novel line-based room segmentation algorithm, enabling the creation of smaller local GP-EDFs for each room, which in turn also use line segments as its shape priors, thus representing the map more efficiently with fewer data points. We evaluate this method in simulation experiments, and make the code available open-source.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (18)
  1. S. T. O’Callaghan and F. T. Ramos, “Gaussian process occupancy maps,” The International Journal of Robotics Research, vol. 31, no. 1, pp. 42–62, 2012.
  2. F. Ramos and L. Ott, “Hilbert maps: Scalable continuous occupancy mapping with stochastic gradient descent,” The International Journal of Robotics Research, vol. 35, no. 14, pp. 1717–1730, 2016.
  3. J. Ortiz, A. Clegg, J. Dong, E. Sucar, D. Novotny, M. Zollhoefer, and M. Mukadam, “isdf: Real-time neural signed distance fields for robot perception,” arXiv preprint arXiv:2204.02296, 2022.
  4. B. Lee, C. Zhang, Z. Huang, and D. D. Lee, “Online continuous mapping using gaussian process implicit surfaces,” in 2019 International Conference on Robotics and Automation (ICRA).   IEEE, 2019, pp. 6884–6890.
  5. L. Wu, K. M. B. Lee, L. Liu, and T. Vidal-Calleja, “Faithful euclidean distance field from log-gaussian process implicit surfaces,” IEEE Robotics and Automation Letters, vol. 6, no. 2, pp. 2461–2468, 2021.
  6. H. Liu, Y.-S. Ong, X. Shen, and J. Cai, “When gaussian process meets big data: A review of scalable gps,” IEEE transactions on neural networks and learning systems, vol. 31, no. 11, pp. 4405–4423, 2020.
  7. S. Kim and J. Kim, “Efficient clustering for continuous occupancy mapping using a mixture of gaussian processes,” Sensors, vol. 22, no. 18, p. 6832, 2022.
  8. J. A. Stork and T. Stoyanov, “Ensemble of sparse gaussian process experts for implicit surface mapping with streaming data,” in 2020 IEEE International Conference on Robotics and Automation (ICRA), 2020, pp. 10 758–10 764.
  9. Y. Tian, K. Wang, R. Li, and L. Zhao, “A fast incremental map segmentation algorithm based on spectral clustering and quadtree,” Advances in Mechanical Engineering, vol. 10, no. 2, 2018.
  10. H. Bavle, J. L. Sanchez-Lopez, M. Shaheer, J. Civera, and H. Voos, “S-graphs+: Real-time localization and mapping leveraging hierarchical representations,” arXiv preprint arXiv:2212.11770, 2022.
  11. J.-P. A. Ivan, T. Stoyanov, and J. A. Stork, “Online distance field priors for gaussian process implicit surfaces,” IEEE Robotics and Automation Letters, vol. 7, no. 4, pp. 8996–9003, 2022.
  12. Y. Liu, L. Zhang, K. Qian, L. Sui, Y. Lu, F. Qian, T. Yan, H. Yu, and F. Gao, “An adaptive threshold line segment feature extraction algorithm for laser radar scanning environments,” Electronics, vol. 11, no. 11, p. 1759, 2022.
  13. H. Gao, X. Zhang, Y. Fang, and J. Yuan, “A line segment extraction algorithm using laser data based on seeded region growing,” International Journal of Advanced Robotic Systems, vol. 15, no. 1, 2018.
  14. J. Wen, X. Zhang, H. Gao, J. Yuan, and Y. Fang, “Cae-rlsm: Consistent and efficient redundant line segment merging for online feature map building,” IEEE Transactions on Instrumentation and Measurement, vol. 69, no. 7, pp. 4222–4237, 2019.
  15. U. Von Luxburg, “A tutorial on spectral clustering,” Statistics and computing, vol. 17, pp. 395–416, 2007.
  16. A. Damle, V. Minden, and L. Ying, “Simple, direct and efficient multi-way spectral clustering,” Information and Inference: A Journal of the IMA, vol. 8, no. 1, pp. 181–203, 2019.
  17. M. Fiedler, “Algebraic connectivity of graphs,” Czechoslovak mathematical journal, vol. 23, no. 2, pp. 298–305, 1973.
  18. T. Galy-Fajou and M. Opper, “Adaptive inducing points selection for gaussian processes,” arXiv preprint arXiv:2107.10066, 2021.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.