Geodesic
Dynamic path planning algorithm for autonomous mobile robot with a minimum number of turns in unknown environment
Vestnik Sankt-Peterburgskogo universiteta. Prikladnaâ matematika, informatika, processy upravleniâ, Tome 19 (2023) no. 2, pp. 264-274 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

The article is devoted to the problem of reactive navigation of a mobile robot with limited information about the environment. An algorithm for finding a path from source to the target with a minimum number of turns is described. The idea of the algorithm is based on the bug family of algorithms for reactive navigation. The mobile robot remembers the boundaries of obstacles and calculates the angle of rotation depending on the surrounding situation. The difference from bug algorithms is that the robot does not move “along the obstacle”, but turns only in a limited number of cases. The results of testing the algorithm on simulated polygons are presented. Models of fallen trees, stumps and swamps were considered as obstacles. The performance of the algorithm is evaluated by comparing the minimum possible number of turns with the number of turns in the path obtained using the algorithm.
Keywords: path planning, reactive navigation.
Mots-clés : mobile robot 
@article{VSPUI_2023_19_2_a10,
     author = {G. E. Rego and R. V. Voronov},
     title = {Dynamic path planning algorithm for autonomous mobile robot with a minimum number of turns in unknown environment},
     journal = {Vestnik Sankt-Peterburgskogo universiteta. Prikladna\^a matematika, informatika, processy upravleni\^a},
     pages = {264--274},
     year = {2023},
     volume = {19},
     number = {2},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/VSPUI_2023_19_2_a10/}
}
TY  - JOUR
AU  - G. E. Rego
AU  - R. V. Voronov
TI  - Dynamic path planning algorithm for autonomous mobile robot with a minimum number of turns in unknown environment
JO  - Vestnik Sankt-Peterburgskogo universiteta. Prikladnaâ matematika, informatika, processy upravleniâ
PY  - 2023
SP  - 264
EP  - 274
VL  - 19
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/VSPUI_2023_19_2_a10/
LA  - en
ID  - VSPUI_2023_19_2_a10
ER  - 
%0 Journal Article
%A G. E. Rego
%A R. V. Voronov
%T Dynamic path planning algorithm for autonomous mobile robot with a minimum number of turns in unknown environment
%J Vestnik Sankt-Peterburgskogo universiteta. Prikladnaâ matematika, informatika, processy upravleniâ
%D 2023
%P 264-274
%V 19
%N 2
%U http://geodesic.mathdoc.fr/item/VSPUI_2023_19_2_a10/
%G en
%F VSPUI_2023_19_2_a10
G. E. Rego; R. V. Voronov. Dynamic path planning algorithm for autonomous mobile robot with a minimum number of turns in unknown environment. Vestnik Sankt-Peterburgskogo universiteta. Prikladnaâ matematika, informatika, processy upravleniâ, Tome 19 (2023) no. 2, pp. 264-274. http://geodesic.mathdoc.fr/item/VSPUI_2023_19_2_a10/

[1] Alatise M. B., Hancke G. P., “A review on challenges of autonomous mobile robot and sensor fusion methods”, IEEE Access, 8 (2020), 39830–39846 | DOI

[2] Tang L., Yuta S., “Indoor navigation for mobile robots using memorized omni-directional images and robot's motion”, IEEE/RSJ International Conference on Intelligent Robots and Systems, 1 (2002), 269–274

[3] Sukkarieh S., Nebot E. M., Durrant-Whyte H. F., “A high integrity IMU/GPS navigation loop for autonomous land vehicle applications”, IEEE Transactions on Robotics and Automation, 15:3 (1999), 572–578 | DOI

[4] Pardhasaradhi B., Reddy Y. R., Cenkeramaddi L. R., “Machine learning-based screening and measurement to measurement association for navigation in GNSS spoofing environment”, IEEE Sensors Journal, 22:23 (2022), 23423–23435 | DOI

[5] Li X., Song B., Shen Z., Zhou Y., Lyu H., Qin Z., “Consistent localization for autonomous robots with inter-vehicle GNSS information fusion”, IEEE Communications Letters, 2022, 120–124

[6] Smith R. C., Cheeseman P., “On the representation and estimation of spatial uncertainty”, The International Journal of Robotics Research, 5:4 (1986), 56–68 | DOI

[7] Smith R. C., Self M., Cheeseman P., “Estimating uncertain spatial relationships in robotics”, Autonomous robot vehicles, Springer Publ, New York, 1990, 167–193 | DOI

[8] Leonard J. J., Durrant-Whyte H. F., “Simultaneous map building and localization for an autonomous mobile robot”, Proceedings of Intelligent Robots and Systems. Intelligence for Mechanical Systems, v. 3, 1991, 1442–1447

[9] Chen Y., Zhou Y., Lv Q., Deveerasetty K. K., “A review of V-SLAM”, IEEE International Conference on Information and Automation (ICIA), 2018, 603–608

[10] Huang L., “Review on LiDAR-based SLAM techniques”, International Conference on Signal Processing and Machine Learning (CONF-SPML), 2021, 163–168

[11] Hidalgo F., Bräunl T., “Review of underwater SLAM techniques”, 6$^{th}$ International Conference on Automation, Robotics and Applications (ICARA), 2015, 306–311

[12] Lumelsky V. J., Stepanov A. A., “Dynamic path planning for a mobile automaton with limited information on the environment”, IEEE Transactions on Automatic Control, 31 (1986), 1058–1063 | DOI | Zbl

[13] Ng J., Bräunl T., “Performance comparison of bug navigation algorithms”, Journal of Intelligent and Robotic Systems, 50:1 (2007), 73–84 | DOI

[14] Galaktionov O., Zavyalov S., Shchegoleva L., Korzun D., “Features of building a forestry intelligent robotic system”, Proceedings of 29$^{th}$ Conference of Open Innovations Association (FRUCT), 2021, 433–436

[15] Schönauer M., Prinz R., Väätäinen K., Astrup R., Pszenny D., Lindeman H., Jaeger D., “Spatio-temporal prediction of soil moisture using soil maps, topographic indices and SMAP retrievals”, International Journal of Applied Earth Observation and Geoinformation, 108 (2022), 102730 | DOI

[16] Galaktionov O. N., Kuznetsov A. V., “Reduction of negative impact of skidders on the forest environment”, Astra Salvensis, 2018, 381–390

[17] Mitchell J. S. B., Rote G., “Minimum-link paths among obstacles in the plane”, Proceedings of the Sixth annual Symposium on Computational Geometry, 1990, 63–72 | DOI | MR