PREDICTION OF ROBOTIC MOBILE PLATFORM MOTION IN TWO-DIMENSIONAL SPACE WITH CONSIDERATION OF DYNAMIC OBSTACLES

Authors

DOI:

https://doi.org/10.32782/IT/2025-1-29

Keywords:

navigation system, vector representation of motion, environment modeling, trajectory prediction, optimal route search, mobile robots.

Abstract

This work is devoted to the development of a method for predicting the route of a mobile robot and modeling the environment using the Python language. Objective. Development of a method for predicting mobile robot trajectories in an environment with dynamic obstacles, ensuring adaptive real-time routing and collision avoidance. Methodology. The research is based on mathematical modeling of mobile platform movement in two-dimensional space using a modified D* Lite algorithm. The modeling approach represents the environment as a discrete grid that includes both static and dynamic obstacles. Static obstacles simulate fixed objects such as walls or other immobile elements, while dynamic obstacles are defined by their changing position, speed, and direction of movement. Vector representation of motion is used to predict object paths based on their current state. In particular, the analysis focuses on parameters such as position, velocity, and direction of movement. The proposed statistical criterion involves selecting a stable route by examining the frequency of vertices within the range of potential trajectories. Science novelty. The method of mobile robot path planning in a dynamic environment has been improved through careful evaluation of both static and dynamic obstacles. The mathematical structure used for predicting object movement has been expanded using the incremental D* Lite method. Additionally, a new statistical criterion for optimal trajectory selection has been introduced, which takes into account path stability. Conclusions. The developed methodology enables navigation of a mobile platform in two-dimensional space with moving obstacles. It offers adaptive trajectory planning, responding to changes in obstacle positions to avoid collisions. Software modeling confirmed the algorithm's ability to compute routes in real-time. Different grid sizes were tested: 20 × 20, 50 × 50, 75 × 75, 100 × 100. Further research should be conducted in the direction of justifying the optimal size of environment mapping grids for the mobile platform, grid cell size in terms of required reaction time and positioning accuracy by the navigation system.

References

Ганенко Л. Д., Жебка В. В. Аналітичний огляд питань навігації мобільних роботів в закритих приміщеннях. Телекомунікаційні та інформаційні технології. 2023. № 3. С. 85–98

Nitin Gupta, Kapil Manga, Anand Kumar Jha, Md. Umar. Applying Dijkstra`s Algorithm in Routing Process. Internationl Journal of New Technology and Reasearc (IJNTR). 2016. Vol. 2. № 5. 122–124 p.

Nagib G., Charieb W. Path planning for a mobile robot using Genetic Algorithms. Proceedings of the International Conference on Electrical, Electronic and Computer Engineering (ICEECE). Cairo, Egypt, 5–7 September 2004. 2005. 185–189 p.

Thangamuthu M., et al. Mobile robot path planning and obstacle avoidance using hybrid algorithm. International Journal of Information Technology. 2023. Vol. 15. 4481–4490 p. DOI: 10.1007/s41870-023-01475-5

Duchoň F., Babinec A., Kajan M., Beňo P., Florek M., Fico T., Jurišica L. Path planning with modified A star algorithm for a mobile robot. Procedia Engineering. 2014. Vol. 96. 59–69 p. DOI: 10.1016/j.proeng.2014.12.098

Sven Koenig, Maxim Likhachev. D* lite. The Eighteenth National Conference on Artificial Intelligence, Association for the Advancement of Artificial Intelligence (AAAI). Alberta, Canada, 28 July – 1 August 2002. 2002.

Kretzschmar H., Spies M., Sprunk C., Burgard W. Socially compliant mobile robot navigation via inverse reinforcement learning. International Journal of Robotics Research. 2016. Vol. 35. № 11. 1352–1370 p.

Roberts M., Smith D. Path Following Algorithms in Autonomous Mobile Robots. IEEE Transactions on Robotics. 2016. Vol. 30. № 5. 1123–1140 p.

Stephen T., Jerry B. Classical dynamics of particles and systems. Julie M. DeSilva. Вид. 5. 2004. 30 p.

Farzeen Zehra, Darakhshan, Maha Javed, Maria Pasha. Comparative Analysis of C++ and Python in Terms of Memory and Time. Preprints. 2020. DOI: 10.20944/preprints202012.0516.v1

Published

2025-04-30