Open AccessMODELING THE TRAJECTORY OF COURIER ROBOTS TAKING INTO ACCOUNT THE PRIORITIES OF THE VISIT
Author(s) -
Nina Diakonenko,
Natalia Khatsko,
Kyrylo Khatsko
Publication year - 2021
Publication title -
vestnik harʹkovskogo nacionalʹnogo avtomobilʹno-dorožnogo universiteta
Language(s) - English
Resource type - Journals
eISSN - 2521-1773
pISSN - 2219-5548
DOI - 10.30977/bul.2219-5548.2021.92.1.27
Subject(s) - simulated annealing , computer science , robot , destinations , probabilistic logic , route planning , trajectory , operations research , product (mathematics) , mathematical optimization , tourism , algorithm , artificial intelligence , engineering , mathematics , physics , geometry , astronomy , political science , law
Problem. Automatic control systems for courier-robots are rapidly developing and need a modern algorithms. It is necessary to take into account the additional characteristics of the visited points to form a route for the movement of the robot that is optimal for solving business problems. The paper discusses the principles of forming additional parameters of destinations, and also describes the annealing algorithm for constructing the route of the courier-robot. The purpose of the work is to develop a method for automatically constructing a route for a courier-robot, taking into account the priorities of destinations and the possibility of avoiding obstacles along the route. Methodology. It is proposed to form an integrated characteristic of destinations in accordance with the parameters of the delivered goods: shelf life, shelf life of the goods required by the consumer, and the urgency of delivery of this product to a specific consumer. The problem of finding the optimal route to taking into account different priorities of destinations is solved using the probabilistic method of annealing. The paper presents an algorithm for the formation of an integral characteristic for each destination with the subsequent construction of a route. An algorithm for applying the annealing method for the task of constructing a route is described. The route formation algorithm has been modified by adding additional characteristics for each destination. To demonstrate the operation of the algorithm, a numerical example is given, which was processed using the created software application with a graphical interface for entering data and outputting the result. Conclusion. The basis for further modification of the algorithm for constructing the route of the robot courier has been created. In further development, it is planned to expand the list of parameters that form the integral characteristic of the destination and change the route construction algorithm taking into account the perimeters of obstacles that arise along the path of the robot.