Path Planning and Navigation Technologies for Autonomous Mobile Robots in Dynamic Indoor Environments

Shun Jiang

doi:10.54097/0869dc58

Authors

Shun Jiang

DOI:

https://doi.org/10.54097/0869dc58

Keywords:

Autonomous Mobile Robots; Dynamic Indoor Environments; Path Planning; Navigation Technology; Simultaneous Localization and Mapping.

Abstract

The widespread application of Autonomous Mobile Robots (AMRs) in dynamic indoor environments has exposed the shortcomings of traditional navigation systems. For example, they cannot solve problems, like moving obstacles, layout changes, and multi-robot collaboration. The development of artificial intelligence and sensor technologies speeds up the changes in AMR navigation systems. This paper contains the development of AMR navigation systems. It analyses the technical challenges brought by dynamic indoor environments, including problems such as interference from mobile obstacles, bottlenecks in location and map updates, and efficiency conflicts in multi-robot collaboration. Additionally, it explores the key technologies used to solve these challenges, including dynamic object detection and removal in dynamic SLAM, multi-sensor fusion, semantic enhancement of dynamic map construction, and distributed task allocation based on a market auction mechanism, conflict search, and spatiotemporal path coordination in multi-robot collaborative navigation. According to these studies, this paper guides the development of more robust and adaptive AMR navigation frameworks to meet the application needs of modern indoor robots.

Downloads

Download data is not yet available.

References

[1] Alatise M B, Hancke G P. A review on challenges of autonomous mobile robot and sensor fusion methods[J]. IEEE Access, 2020, 8: 39830-39846.

[2] Siegwart R, Nourbakhsh I R, Scaramuzza D. Introduction to autonomous mobile robots[M]. MIT Press, 2011.

[3] Shan E, Dai B, Song J, et al. A dynamic RRT path planning algorithm based on B-spline[C].2009 Second International Symposium on Computational Intelligence and Design. IEEE, 2009, 2: 25-29.

[4] Kuffner J J, LaValle S M. RRT-connect: An efficient approach to single-query path planning[C]. Proceedings 2000 ICRA. Millennium conference. IEEE international conference on robotics and automation. Symposia proceedings (Cat. No. 00CH37065). IEEE, 2000, 2: 995-1001.

[5] Stentz A. Optimal and efficient path planning for partially-known environments[C]. Proceedings of the 1994 IEEE international conference on Robotics and Automation. IEEE, 1994: 3310-3317.

[6] Javaid A. Understanding Dijkstra's algorithm[J]. Available at SSRN 2340905, 2013.

[7] Floreano D, Godjevac J, Martinoli A, et al. Design, control, and applications of autonomous mobile robots [M]. Advances in intelligent autonomous systems. Dordrecht: Springer Netherlands, 1999: 159-186

[8] Xiao L, Wang J, Qiu X, et al. Dynamic-SLAM: Semantic monocular visual localization and mapping based on deep learning in the dynamic environment[J]. Robotics and Autonomous Systems, 2019, 117: 1-16.

[9] Cummins M, Newman P. FAB-MAP: Probabilistic localization and mapping in the space of appearance[J]. The International Journal of Robotics Research, 2008, 27(6): 647-665.

[10] Bai X, Fielbaum A, Kronmüller M, et al. Group-based distributed auction algorithms for multi-robot task assignment[J]. IEEE Transactions on Automation Science and Engineering, 2022, 20(2): 1292-1303.

[11] Bertsekas D P. Auction algorithms for network flow problems: A tutorial introduction[J]. Computational optimization and applications, 1992, 1: 7-66.

[12] Xie W, Liu P X, Zheng M. Moving object segmentation and detection for robust RGBD-SLAM in dynamic environments[J]. IEEE Transactions on Instrumentation and Measurement, 2020, 70: 1-8.

[13] Yu C, Liu Z, Liu X J, et al. DS-SLAM: A semantic visual SLAM towards dynamic environments[C]. 2018 IEEE/RSJ international conference on intelligent robots and systems (IROS). IEEE, 2018: 1168-1174.

[14] Henein M, Zhang J, Mahony R, et al. Dynamic SLAM: The need for speed[C].2020 IEEE International Conference on Robotics and Automation (ICRA). IEEE, 2020: 2123-2129.

[15] Bescos B, Campos C, Tardós J D, et al. DynaSLAM II: Tightly-coupled multi-object tracking and SLAM[J]. IEEE robotics and automation letters, 2021, 6(3): 5191-5198.

[16] Huang S S, Ma Z Y, Mu T J, et al. Lidar-monocular visual odometry using point and line features[C].2020 IEEE International Conference on Robotics and Automation (ICRA). IEEE, 2020: 1091-1097.

[17] Bescos B, Campos C, Tardós J D, et al. DynaSLAM II: Tightly-coupled multi-object tracking and SLAM[J]. IEEE Robotics and Automation Letters, 2021, 6(3): 5191-5198.

[18] Ye W, Yu X, Lan X, et al. DeFlowSLAM: Self-supervised scene motion decomposition for dynamic dense SLAM[J]. arXiv preprint arXiv:2207.08794, 2022, 2.

[19] Bertsekas D P. The auction algorithm for assignment and other network flow problems: A tutorial[J]. Interfaces, 1990, 20(4): 133-149.

[20] Liu L, Shell D A. Optimal Market-based Multi-Robot Task Allocation via Strategic Pricing[C].Robotics: Science and Systems. 2013, 9(1): 33-40.

[21] Lagoudakis M G, et al. Auction-Based Multi-Robot Routing[C].Robotics: Science and Systems. 2005, 5: 343-350.

[22] Otte M, et al. Auctions for multi-robot task allocation in communication-limited environments[J]. Autonomous Robots, 2020, 44: 547-584.

[23] Wen X, Zhao Z G. Multi-robot task allocation based on combinatorial auction[C].2021 9th International Conference on Control, Mechatronics and Automation (ICCMA). IEEE, 2021: 27-32.

[24] Yuan R, Dou J, Li J, et al. Multi-robot task allocation in e-commerce RMFS based on deep reinforcement learning[J]. Mathematical Biosciences and Engineering: MBE, 2023, 20(2): 1903-1918.

[25] Moldagalieva A, Ortiz-Haro J, Toussaint M, et al. db-cbs: Discontinuity-bounded conflict-based search for multi-robot kinodynamic motion planning[C].2024 IEEE International Conference on Robotics and Automation (ICRA). IEEE, 2024: 14569-14575.

[26] Bai Y, Kotpalliwar S, Kanellakis C, et al. Multi-agent Path Planning Based on Conflict-Based Search (CBS) Variations for Heterogeneous Robots[J]. Journal of Intelligent & Robotic Systems, 2025, 111(1): 26.

[27] Kottinger J, Almagor S, Lahijanian M. Conflict-based search for multi-robot motion planning with kinodynamic constraints[C].2022 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). IEEE, 2022: 13494-13499.

[28] Ren Z, Rathinam S, Choset H. Conflict-Based Steiner Search for Multi-Agent Combinatorial Path Finding[C].Proceedings of Robotics: Science and Systems. 2022.

[29] Liang Y, Zhang Z, Luo Y, et al. Multi-robot Task Allocation and Path Planning Method Based on Improved Genetic Algorithm and Conflict-Based Search[C].China Intelligent Robotics Annual Conference. Singapore: Springer Nature Singapore, 2024: 272-285.

[30] Hönig W, Kumar T K, Cohen L, et al. Multi-agent path finding with kinematic constraints[C].Proceedings of the International Conference on Automated Planning and Scheduling. 2016, 26: 477-485.