ALGORITHM FOR DETERMINING THE PATH FOR AUTONOMOUS MOVEMENT OF UNMANNED VEHICLES ALONG THE LINE

Authors

  • N.V. VALKO
  • Т.О. BOLGARIN
  • K.V. VALKO

DOI:

https://doi.org/10.32782/KNTU2618-0340/2020.3.2-1.3

Keywords:

autonomous movement; modeling; algorithm; unmanned vehicles; recognition

Abstract

Creating robotic systems and their programming represents a multidisciplinary field, they are subdivisions of artificial intelligence algorithms and machine learning. An increasingly popular trend is for the leaders of the automotive industry to produce vehicles with autonomous driving technology. Such vehicles are safer, their use helps to reduce the number of accidents and, accordingly, the level of injuries. The same stench is vicious as one of the solutions in the logistic tasks of 'the last mile' − folding, which is tied to the last stage of delivery. At the present stage of technology development, the development of artificial intelligence systems and the automation of such processes are relevant. The problem of autonomous vehicle control requires using specialized methods and general algorithms for machine learning, in particular, computer vision based on image processing. The article presents an algorithm for determining the path for autonomous movement of unmanned vehicles along the line. Existing methods of image processing, algorithms for their application and problems arising in image processing are considered. The presented algorithm for finding a path from a picture from a camera was tested on a computer model of a car. Such a car was prepared for the autonomous model competition in the Robotraffic competition. The task was to increase the efficiency of the existing sensors using additional equipment in the form of an external camera. The video data had to be processed programmatically to determine the path for autonomous traffic. An algorithm was created that works on the principle of sampling the entire path into parts, each of which is processed separately. Part processing is an averaging of binary information about the path width: the path segment width must be greater than the next segment. All segments in the final presentation are combined into a tree of paths from which one is selected for further movement. the algorithm can be easily modified for left or right path priority. The algorithm provides a fairly fast path finding. All calculations are carried out in real time. The advantages are simplicity and speed. The algorithm can be used to create an autonomous control system for car models. The presented algorithm for finding a path in a picture from a camera was tested on a computer model of a car. The presented algorithm can be used to create a more accurate system for controlling autonomous car models, as well as to create your own systems for helping to control real transport using a camera and mini computers. Also one of the next tasks is to develop a system for identifying road signs in the image.

References

Xiao B., Cheng J., Hancock E. R. Graph-Based Methods in Computer Vision: Developments and Applications. Hershey: IGI Global. 2013. 395 p. DOI: 10.4018/978-1-4666-1891-6.

Canny J. A computational approach to edge detection. IEEE Transactions on pattern analysis and machine intelligence. 1986. Vol. PAMI-8 . Issue 6. P. 679−698.

Iannino A. Hough transform theory and image processing experiments. Hoboken: Stevens Institute of Technology, 1980. 231 p.

Harris C. G., Stephens M. A Combined Corner and Edge Detector. Proceedings of the Alvey Vision Conference (UK, Manchester, 31 August − 2 September, 1988), pp. 23.1−23.6. DOI:10.5244/C.2.23

Mikolajczyk K., Schmid C. Scale & Affine Invariant Interest Point Detectors. International Journal of Computer Vision. 2004. Vol. 60. Issue 1. P. 63−86.

Lowe David G. Distinctive Image Features from Scale-Invariant Keypoints. International Journal of Computer Vision. 2004. Vol. 60. Issue 2. P. 91–110. DOI:10.1023/B:VISI.0000029664.99615.94.

Bay H., Tuytelaars T., Van Gool L. Surf: Speeded up Robust Features. Proceedings of the European Conference on Computer Vision. (Austria, Graz, May 7-13, 2006). Berlin, Heidelberg: Springer, 2006. P. 404−417.

Гончаренко М. О. Сравнительный анализ методов формирования дескрипторов изображений в контексте задачи сегментации видеопотока. Бионика Интеллекта. 2015. № 2 (85). C. 90–94.

Deore S. P., Pravin A. Histogram of Oriented Gradients Based Off-Line Handwritten Devanagari Characters Recognition Using SVM, K-NN and NN Classifiers. Revue d’Intelligence Artificielle. 2019. Vol. 33. № 6. P. 441−446.

Сосновський В. А., Хлевний А. О. Аналіз та дослідження основних методів розпізнавання обличчя. Computer-Integrated Technologies: Education, Science, Production. 2019. № 35. C. 192−197.

Rojas R. AdaBoost and the Super Bowl of Classifiers a Tutorial Introduction to Adaptive Boosting. Berlin: Freie University, 2009. 6 р.

Published

2023-08-28