=Paper=
{{Paper
|id=Vol-3403/paper43
|storemode=property
|title=The Evaluation of Factors that Influence the Route Formation of the Mobile Rescue Robot
|pdfUrl=https://ceur-ws.org/Vol-3403/paper43.pdf
|volume=Vol-3403
|authors=Roman Zinko,Vasyl Teslyuk,Mariana Seneta
|dblpUrl=https://dblp.org/rec/conf/colins/ZinkoTS23
}}
==The Evaluation of Factors that Influence the Route Formation of the Mobile Rescue Robot==
https://ceur-ws.org/Vol-3403/paper43.pdf
The Evaluation of Factors that Influence the Route Formation of
the Mobile Rescue Robot
Roman Zinko, Vasyl Teslyuk and Mariana Seneta
Lviv Polythechnic National University, 12 Bandery St., Lviv, 79000, Ukraine
Abstract
Algorithms of solving the route movement problem are analyzed in the work. These issues
are the basis for the functioning of expert systems while choosing the route under the
circumstances of uncertainty. The factors that influence the motion algorithm construction by
the expert system are systematized.
By using ranking, it is proposed the list of factors which are the most significant in the
process of the mobile rescue robot’s motion algorithm construction by the expert system.
The algorithm performance depends on the required accuracy of the route construction and
the selection of the factors taken into account. To construct quasi-optimal solutions, it is
sufficient to confine oneself to the basic (initial) algorithm. In this case, the computational
costs are minimal and proportional to the number of nodes of the transport graph.
Consideration of weight share of the factors will ensure the improvement of solutions within
the optimal limit, while the computational efficiency of the integral algorithm will not be
worse than the basic algorithm. Therefore, for a specific task, the use of the proposed
algorithms can be significantly more effective than the use of the basic algorithm. The
application of factors ranking method makes it possible to determine their importance when
implementing the mobile robot route selection method. Such an expert information system
will allow to reduce the uncertainty that is present in tasks with a low level of information.
In contrast to the selection of factors, when they were used in methods randomly, here we can
significantly reduce the cost of calculations with a high predictability of obtaining the best
results.
Keywords 1
Mobile robot, expert system, route, movement algorithm, ranking method
1. Introduction
The task of finding the best possible routes according to the transportation expenses is topical for a
range of technical applications, which include the following: the estimate of availability for multi-
location security systems, planning of the best routes for robotic systems on the cross-country terrains,
modeling of routing in simulators of mobile systems and in computer games.
The task of planning the optimal path in the general formulation is explained as follows. On the
map of the area, it is necessary to determine the route of movement from the starting set of points to
the set of end points, taking into account the minimum transport costs. In such a statement, the
starting and ending points are not known and are determined in the calculation procedure. The
following variants of tasks are possible in the partial setting:
• to lay the optimal route from a set of starting points to a given ending point;
• to lay an optimal route from a set of starting points to a given set of ending points;
• to lay the optimal route from the given starting point to the given ending point;
COLINS-2023: 7th International Conference on Computational Linguistics and Intelligent Systems, April 20–21, 2023, Kharkiv, Ukraine
EMAIL: roman.v.zinko@lpnu.ua (R. Zinko); vasyl.m.teslyuk@lpnu.ua (V. Teslyuk); mariana.y.seneta@lpnu.ua (M. Seneta)
ORCID: 0000-0002-3275-8188 (R. Zinko); 0000-0002-5974-9310 (V. Teslyuk); 0000-0003-1249-0935 (M. Seneta)
©️ 2023 Copyright for this paper by its authors.
Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).
CEUR Workshop Proceedings (CEUR-WS.org)
• to build a transport accessibility front with a given level of costs in relation to a set of starting
points.
In this case the criteria and factors, basing on which the factors of choosing the best route are
chosen, are very important.
The choice of a movement route generally is the task with a high degree of uncertainty. In
addition, to the task of reaching the final point of the route, a number of factors must be taken into
account, which will significantly affect the options for movement in the area. In addition, the method
of achieving the goal is important. To solve this problem, it is necessary to determine the necessary
and sufficient factors that will influence the choice of the route. It is also important to determine their
importance in the implementation of the movement towards the goal.
The object of our research is the planning of the routes of special vehicles.
The subject of the work is planning methods in the field of problems of transportation under
uncertainty conditions.
The purpose of the research is to improve the process of planning and managing traffic routes in
the field of transportation in uncertainty conditions by developing methods for constructing a route
with the required accuracy and selecting factors that are taken into account.
The main task of the research is to determine the weight parts of the factors that form the basis for
creating the expert system that will build an algorithm for the motion of mobile rescue robot.
Research methods are: the methods of solving the routing problem with minimal costs for moving
taking into account the selection of factors; the methodology of adapting the algorithm of rational
decisions using expert systems in uncertainty conditions for special vehicles.
The result of the study is the algorithm for planning the route of the movement of special vehicles.
It takes into account the ranking of the factors forming the route by expert systems under uncertainty
conditions.
Field of use: the applied spheres where there is a need for the movement of vehicles arises in
conditions of uncertainty (research of unknown territories, zones of man-made and ecological
disasters and accidents, military clashes).
2. Related works
Currently, the issue of developing mobile robotic systems with autonomous control is actual [1–4].
Numerous path-planning studies have been conducted in past decades due to the challenges of
obtaining optimal solutions [5].
This paper reviews multi-robot path-planning approaches and decision-making strategies and
presents the path-planning algorithms for various types of robots, including aerial, ground, and
underwater robots. The multi-robot path-planning approaches have been classified as classical
approaches, heuristic algorithms, bio-inspired techniques, and artificial intelligence approaches. Bio-
inspired techniques are the most employed approaches, and artificial intelligence approaches have
gained more attention recently. The decision-making strategies mainly consist of centralized and
decentralized approaches. The trend of the decision-making system is to move towards a
decentralized planner. Finally, the new challenge in multi-robot path planning is proposed as fault
tolerance, which is important for real-time operations.
The authors propose Robot Wireless Sensor Networks (RWSNs) management method for
maintaining wireless communication connectivity for a mobile robot teleoperation with considering a
distance between sensor nodes [6].
Recent studies for reducing disaster damage focus on a disaster area information gathering in
underground spaces. Since information gathering activities in such post disaster underground spaces
present a high risk of personal injury by secondary disasters, a lot of rescue workers were injured or
killed in the past. On basis of this background, gathering information by utilizing the mobile robot is
discussed in wide area. However, maintaining wireless communication infrastructures for
teleoperation of a mobile rescue robot in the post-disaster underground space by various reasons.
Therefore, the authors have been discussing the wireless communication infrastructures
construction method for teleoperation of the rescue robot by utilizing the RWSN. In this paper, the
authors evaluated the proposed method for changing routing path by utilizing the RWSN in field
operation test in order to confirm the availability of performance of communication connectivity and
the throughputs between End-to-End communications via constructed network.
In graph theory, the shortest route problem can be generalized as a single-source shortest path
problem, in which the shortest route from the initial vertex of the graph and all others is found. To
solve this problem, the Dijkstra and Bellman-Ford algorithms are used, which are based on the
method of dynamic planning on weighted graphs (1956-1958) [7–10].
On the cross-country terrain the peaks of the route graph are the centers of the elementary map
areas and the edges of the graph stand for transitions between the centers of the neighboring areas.
The multitudes of algorithms, suggested in the following years (the algorithms of Dijkstra, Kalab, A-
star etc.), in general, are the variations of the basic algorithm for fragmentary setting.
Thanks to the fact above it is possible to reach higher computation efficiency of the given
algorithms if comparing to the basic algorithm. The main optimization criterion is the shortest route
distance.
The methods of solving the transport problems according to the criteria of time limitation for both
static and dynamic problems can be divided into exact approaches, heuristic approaches and
metaheuristic [11–14].
The dynamic change of route’s geometric parameters is taken into account in papers [15–17].
Transportation tasks or vehicle routing tasks arise in various areas of human activity: delivery of
goods from a supplier to a customer, delivery of raw materials for production, collection of industrial
waste, postal delivery, etc. Since the price of transportation of various types of goods is clearly or not
clearly present in their value, the reduction of transport costs is an important and urgent economic
task. The goal of solving all transport problems (TP) is to draw up vehicle routes with minimal costs.
TP with a time limit is a subclass of TP, they take into account the time during which the customer
must be served. Being more complex in formulation, these tasks more fully describe the real process,
since in many practical tasks of goods delivery, the time of arrival at the client and the time of
customer service play a significant role. In transport tasks with a time limit, each customer is assigned
a time period during which the customer must be served. If all customer requests are known in
advance and are unchanged, the time of movement from customer to customer is known and also does
not change, then such tasks are called static TP.
However, in practice, customer requests may change during the implementation of the transport
plan, the time of movement due to breakdowns or accidents also changes, so a new class of tasks,
dynamic TP with a time limit, appears. This class of tasks more fully simulates TP that occurs in
practice, and therefore allows finding a better solution compared to less adequate models [11].
The criteria of the best route choice are formed on the basis of the decision principle with due
consideration of factors that define the conditions of the object transportation and their condition [18–
20].
Usually there are no typical factors, basing on which, one or other criteria are defined. The weight
part of any given factor, while making decision regarding the route optimization or choosing the route
on the terrain under conditions of uncertainty, is not defined.
A relatively new approach to finding trajectories is the ant algorithm [21].
The modification of this method consists in reducing the complexity of the traveling salesman's
task, by indicating the mandatory visit of the desired nodes, it is applied to solve the task of building
individual tourist routes [22].
The optimization of the ant algorithm for static maps of different sizes with typical and random
distribution of obstacles is presented in the work [23], where the dependence of the path length on the
population size was investigated.
The algorithm [24] provides a solution to the problem of finding the trajectory of a vehicle in real
time in urban conditions with an available forecast of the road situation.
In response to the traditional WiFi location fingerprint positioning algorithm still having a low
positioning accuracy, which is difficult to meet the robot indoor positioning and navigation needs, a
series of improvements are made to the traditional WiFi location fingerprint positioning algorithm, so
that the positioning accuracy of the algorithm can be effectively improved [25].
The experimental results show that the probability of the improved algorithm’s positioning error
within 0.4 m is 49%, which is a 35% improvement over the conventional algorithm. Combining the
improved positioning algorithm with our proposed grid-based navigation algorithm, the final
navigation error probability within 0.8 m is 62%.
Providing mobile robots with autonomous capabilities is advantageous [26]. It allows one to
dispense with the intervention of human operators, which may prove beneficial in economic and
safety terms. Autonomy requires, in most cases, the use of path planners that enable the robot to
deliberate about how to move from its location at one moment to another. Looking for the most
appropriate path planning algorithm according to the requirements imposed by users can be
challenging, given the overwhelming number of approaches that exist in the literature.
Moreover, the past review works analyzed here cover only some of these approaches, missing
important ones. For this reason, our paper aims to serve as a starting point for a clear and
comprehensive overview of the research to date. It introduces a global classification of path planning
algorithms, with a focus on those approaches used along with autonomous ground vehicles, but is also
extendable to other robots moving on surfaces, such as autonomous boats.
Moreover, the models used to represent the environment, together with the robot mobility and
dynamics, are also addressed from the perspective of path planning. Each of the path planning
categories presented in the classification is disclosed and analyzed, and a discussion about their
applicability is added at the end.
So, a number of factors, as well as their importance in the implementation of one or another
option, are common to the implementation of navigation tasks with various options.
Based on the review and analysis of publications in the field of mobile robots, we determine the
main directions of research (Figure 1).
The basics of mobile robotics
The field of The field of The field of The field of
locomotion perception cognition navigation
The planning The information The artificial
algorithms theory intelligence
Algorithms for groups of transportation problems by formulation
Problems of minimizing the Problems of minimizing the
Problems of minimizing the
length of the route during terms of goods
cost of goods transportation
transportation from one transportation from points
from points of production to
supplier to several of production to points of
consumption
consumers consumption, etc
Figure 1: Directions of research in the field of mobile robots
3. Methods and materials
One of the directions of mobile robot navigation is categorized into the following tasks [27]:
• Generating a model of the world in the form of a map.
• Computing a collision-free trajectory from a starting position to a target position.
• Moving along the calculated trajectory, avoiding collision with obstacles.
The components of such tasks are: navigation skill, localization and mapping, path, trajectory, and
motion planning, tracking planning, obstacle avoidance. In the article we consider the computing a
collision-free trajectory from a starting position to a target position with minimization of the length of
the rescue robot route.
Navigation skill. It is essential to provide enough information about the robot’s location so that it
can navigate. Therefore, localization techniques are key to the navigation process. Besides, additional
skills are required for mobile robot navigation.
The first of these is trajectory planning. Given a map and an objective location, it involves
obtaining the trajectory that the robot must follow in order to reach the objective location. Trajectory
planning is a very important issue in robotics in general, when the robot must choose what to do over
the long term to attain its objectives.
The second skill is obstacle avoidance. It plays an important role in trajectory planning in order to
avoid collisions.
Localization and mapping. In order for the robot to navigate successfully, it must determine its
position in the workplace. So, localization together with perception and motion control are key issues
in robot navigation.
Localization is closely related to representation. If an accurate GPS system could be installed on a
robot, the localization problem would be solved. The robot would always know where it was. But at
the moment, this system is not available or is not accurate enough to work with. In any case,
localization implies not only knowing the robot’s absolute position on Earth but also its relative
position with respect to a target
Path, trajectory, and motion planning. Path planning is concerned with finding the best path in
order for the mobile robot to reach the target without collision, thus allowing a mobile robot to
navigate through obstacles from an initial configuration to another configuration. The temporal
evolution of motion is neglected. No velocities and accelerations are considered.
A more complete study, with broader objectives, is trajectory planning.
The trajectory planning entails to find out the force inputs (control 𝑢(𝑡)) to move the actuators so
that the robot follows a trajectory 𝑞(𝑡) that enables it to go from the initial configuration to the final
one while avoiding obstacles. It takes into account the robot’s dynamics and physical characteristics
to plan the trajectory.
In short, the temporal evolution of the motion is calculated as well as the forces needed to achieve
that motion. Most of the techniques for path and trajectory planning are shared.
The task of planning the best path in general definition is formulated as follows. It is necessary to
define the route from the start set of points to the set of end points on the terrain map that has minimal
expenses for transportation. In such formulation the start and end points are not consciously known
and are defined in the process of computation.
The following variants of the tasks are possible in partial formulation:
An example of bulleted list is as following.
• to map the best route from the set of starting points to the given final one;
• to map the best route from the set of starting points to the given set of final points;
• to map the best route from the given starting point to the given final one;
• to build the front of accessibility of the final points with given level of restrictions with
reference to the starting points set.
The best route is formed on the basis of criterion of the shortest distance, time, safety, saving of
the luggage etc. The definition of the weight part of the factors’ influence on rescue robot’s motion
algorithm formation is the basis for the expert system (ES) creation.
For now, the particular technology of ES (expert system) development has been developed. It
includes the following six stages: identification, conceptualization, formalization, implementation,
testing and experimental use [28].
Expert
Start systems
Testing Experimental use
Identification
Reformulation
Finalization Rules
Requirements
Improvement
Conceptualization Implementation
Reconstruction
Knowledge
Notion structures
Formalization
Figure 2: The methodology (stages) of the expert system development
Different professionals understand the nature of the environment perception in different ways.
Those of them, for whom the deductive component prevails in the academic experience, are
proponents of the expert systems that are developed on the basis of artificial intelligence theory. The
others prefer the systems, the knowledge base of which is formed on the empiric data. Such
methodology leans on the general theory of systems and the theory of characters recognition.
The major differences between these two ideologies can be observed in the diagrams (Figure 3 and
Figure 4).
The knowledge in such system are the logical rules like IF... THEN... ELSE, that are formulated
by experts (in cooperation with professionals from knowledge engineering area). It means that
approved decisions cannot be higher than the level of experts. The expert cannot enhance the
informational abilities of the system in such organization as interactive communication between a
human and a computer is based on the dialogue with already formed knowledge database (and limited
by its information abilities) [29].
To define which factor is dominating in making decisions regarding the motion algorithm
formation, we will use the ranking method [30]. We will select ten of the most important factors
(n=10), basing on which, ES can build the algorithm of the mobile rescue robot transportation. We
will also propose five experts (𝑚 = 5) to rate them.
The factors suggested for rating:
• the route distance 𝑋1 ;
• the traveling time 𝑋2 ;
• the expenditure of energy for traveling 𝑋3 ;
• camouflaging (visibility, noise) 𝑋4 ;
• the conditions of traveling (obstacles, characteristics of the bearing surface) 𝑋5 ;
• the weather conditions (the temperature, rain, snow) 𝑋6 ;
• the probability of damage (shellfire, mine fields) 𝑋7 ;
• the control of working capacity (minimization of overloading on the mobile robot) 𝑋8 ;
• the commanding decisions of a human 𝑋9 ;
• the tactical characteristics and specifications of the machine 𝑋10 .
Expert estimates of
Knowledge Mechanism of Making the
knowledge by
database logical conclusion decision
specialists
Dialogue
Figure 3: The expert system, established on professionals’ knowledge
Database Mechanism of
Knowledge
(empiric character Making decisions
database
information) recognition
Dialogue
Figure 4: The expert system based on knowledge taken from the empiric data
4. Experiment
The rank matrix, received from the survey forms [29], is given in the table.
12 1829
= = 0,89. (1)
25 (1000-10)-5 72
As the coefficient of concordance significantly differs from zero, we can consider that there is
prominent connection between the opinions of researchers.
Nevertheless, researchers do not rate the factors in the same way (the received value ω
significantly differs from one).
Table 1
The rank matrix, received from the survey forms
Researchers Factors (n=10) T j = (t 3j − t j )
(m) 𝑋1 𝑋2 𝑋3 𝑋4 𝑋5 𝑋6 𝑋7 𝑋8 𝑋9 𝑋10
1 3 8,5 8,5 1 10 2 7 4,5 6 4,5 6+6=12
2 3 7 8 1,5 10 1,5 9 4 5,5 5,5 6+6=12
3 3 8 6 1,5 9 1,5 10 6 6 4 24+6=30
4 2,5 8,5 6 1 10 2,5 8,5 5 4 7 6+6=12
5 4 6,5 9 2 8 1 10 6,5 3 5 6
m 15,5 38,5 37,5 7 47 8,5 44,5 26 24,5 26 5 10
a ij а = 275
1 1
ij
1
i -12 11 10 -20,5 19,5 -19 17 -1,5 -3 -1,5
(i) 2 144 121 100 420,25 380,25 361 289 2,25 9 2,25 S=1829
The significance of the concordance coefficient was checked according to 2 -criterion, taking into
account the formula:
12 1829
2 = = 42,25. (2)
1
5 10(10 + 1) − 72
10 − 1
From the reference literature [18] we can find that for 5% level of importance with number of
degree of freedom f = 10 − 1 = 9 2 = 16,919 . Taking into account the fact that the table value of 2 -
criterion is smaller than the computing, we can claim with 95% probability that the opinion of
researchers regarding the level of factors influence is matched up according to the concordance
coefficient = 0,89 . It allows us to build the medium rank diagram for the given factors (Figure 5).
We can see on the diagram that the distribution is sustainable and the drop is not monotonous.
X5; 47
X7; 44.5
X2; 38.5
X3; 37.5
Rank sum
X10; 26 X8; 26
X9; 24.5
X1; 15.5
X6; 8.5
X4; 7
Factors
Figure 5: The middle prior diagram
5. Results
The rank diagram clearly shows that the expert survey made it possible to distinguish four groups
of processes: the first group includes 𝑋5 , 𝑋7 , which we define as the main ones. The second group
includes 𝑋2 , 𝑋3 . In the third group we can include 𝑋10 , 𝑋9 , 𝑋8 , in the fourth group – 𝑋1 , 𝑋6 , 𝑋4 .
In the paper [31] the methods classification is given according to the following characteristics: the
context of the expert information, the type of the information received, basing on which it is possible
to determine the set of methods under the conditions of uncertainty (Figure 6).
The chain of reference points (trajectory points) connecting the beginning and the end of the path
is the result of such methods as: methods using a map of the environment or its description using a
graph or tree; methods based on cellular decomposition; methods of potential fields; optimization
methods; methods based on intelligent technologies, including behavioral methods. Then the problem
of smoothing the obtained path arises.
6. Discussions
The speed of the algorithms depends on the required accuracy of the route construction and the
selection of the factors taken into account. To construct quasi-optimal solutions, it is sufficient to limit
oneself to the basic (initial) algorithm. In this case, the computational costs are minimal and
proportional to the number of nodes of the transport graph.
Taking into account the weight share of the factors will ensure the improvement of decisions
within the optimal limit, while the computational efficiency of the integral algorithm will not be
worse than the basic algorithm. Therefore, for a specific task, the use of the proposed algorithms can
be significantly more effective than the use of the basic algorithm.
The models have to possess the following features: completeness, accuracy, correctness. These
characteristics are connected by the notion of adequacy. The model, by using which it is possible to
obtain the set goal successfully, is called adequate to this goal.
Information content Information type Methods sets
1. There is no need
Domination
in expert
PR Methods on basis of global criteria
information
Qualitative Lexicographical ordering
(Sequence Comparison of criteria estimates differences
information) Method of “matching”
Method “value efficiency”
2. Information Quantitative
Methods of linear and nonlinear folding
about benefits on evaluation of
Methods of non-comparison thresholds
criteria set criteria benefit
Methods of perfect point
Quantitative
Methods of curved indifferences
information about
Methods of values theory
substitution
3. Information Doubled Quantitative evaluations
about alternatives alternatives Methods of mathematical programming
benefits comparisons Linear and nonlinear folding
Subject evaluations
Methods of making Methods of linear folding
decisions under Methods of grouped ordering
conditions of uncertainty Methods of highlighting the subset of objects
Lack of information about
Method of making decisions with discrete
quantitative information
uncertainty
on consequences
4. Information
about benefits on
criteria set and Qualitative information
Stochastic domination
about about benefits and
Methods of making decisions under conditions of
consequences of quantitative information
uncertainty risk, based on global criteria
alternatives about consequences
Methodology of practical
Qualitative information
Methods of choosing statistical unreliable
about consequences
decisions
Quantitative about Methods of curved indifferences for making
substitution and decisions under conditions of risk and uncertainty
quantitative Methods of decision trebles
consequences Decomposition theory methods (expected utility)
Figure 6: The classification of the methods of making decisions on the basis of the expert
information context under conditions of uncertainty
Adequacy means that the requirements of completeness, accuracy and correctness are performed
not completely, but only to the extent that is enough to accomplish the set goal.
As everything in this world, models have their particular lifecycle: they emerge, develop, match or
get involved into conflict with other models, then give place to the better ones. That is how the
dynamics of the model reveals.
The presented algorithms cover practically significant options for laying optimal routes. The speed
of the algorithms depends on the required accuracy of the route construction and the selection of the
factors taken into account.
To construct quasi-optimal solutions, it is sufficient to limit oneself to the basic (initial) algorithm.
In this case, the computational costs are minimal and are proportional to the number of nodes of the
transport graph. Taking into account the weight share of the factors will ensure the improvement of
decisions within the optimal limit, while the computational efficiency of the integral algorithm will
not be worse than the basic algorithm.
Therefore, for a specific task, the use of the proposed algorithms can be significantly more
effective than the use of the basic algorithm.
The use of expert systems, which include the involved ranking methods, increases the efficiency of
route formation. The application of the factors ranking method provides an opportunity to apply the
values of factors in the implementation the selection method of the mobile robot route in aggressive
environments with a high level of uncertainty.
Such expert information system will reduce the uncertainty that is present in tasks with a low level
of information. In contrast to the selection of factors, when they were used in methods randomly, here
we can significantly reduce the cost of calculations with a high predictability of obtaining the best
results.
7. Conclusions
Path planning tasks are one of the leading directions in the development of modern robotics.
It was proposed the algorithm for planning the route of special vehicles, which takes into account
the ranking of the factors forming the route by expert systems under uncertainty conditions.
Algorithms use factors on the basis of which the minimum path is selected. These factors were
systematized by the ranking method and used in the expert system.
The expert system determined their importance in conditions of uncertainty and can be the basis
for creating a neural network specialized for atypical tasks in aggressive environments with a high
level of uncertainty.
Using the ranking method, the list of the most significant factors for building mobile rescue
robot’s motion algorithm by the expert system, has been proposed.
The ranking method makes it possible to determine the importance of factors as expert information
in conditions of uncertainty for decision-making methods. It will ensure the improvement of solutions
in the limit to the optimum, while the computational efficiency of the integral algorithm will not be
worse than the basic algorithm.
In further research the applying of the ranking method can be used to select the importance of
algorithms for the formation of the trajectory of mobile robots. The use of the algorithm is possible in
the spheres of human activity, where there is a need for the movement of vehicles in conditions of
uncertainty (research of unknown territories, zones of man-made and ecological disasters and
accidents, military clashes).
8. Acknowledgements
This work was performed within the R&D "Experimental mobile robotic platform with intelligent
control system and data protection" carried out by Lviv Polytechnic National University and funded
from the state budget of the Ministry of Education and Science of Ukraine for 2022–2023.
9. References
[1] I. Tsmots, V. Teslyuk, I. Vavruk. "Hardware and software tools for motion control of mobile
robotic system", 12th International Conference: The Experience of Designing and Application of
CAD Systems in Microelectronics, CADSM (2013), 368.
[2] P. Denysyuk, V. Teslyuk, I. Chorna. "Development of mobile robot using LIDAR technology
based on Arduino controller", 2018 XIV-th International Conference on Perspective
Technologies and Methods in MEMS Design, MEMSTECH (2018), 240-244. URL:
https://doi.org/10.1109/MEMSTECH.2018.8365742.
[3] D. Ostrovka, D. Stasenko, V. Teslyuk. "Autonomous intelligent control system for mobile
robotic system", Proceedings of IEEE 17th International conference on computer science and
information technologies, 10-12 November 2022, Lviv, Ukraine, 206–209.
[4] V.R. Skal’s’kyi, D.V. Rudavs’kyi, R.Y. Yarema, Y.I. Kanyuk, Distribution of mechanical
stresses in a tire subjected to pressing on the wheel center of an electric locomotive. Materials
Science, 53 (2018), 623–629. URL: https://doi.org/10.1007/s11003-018-0116-0.
[5] S. Lin, A. Liu, J. Wang, X. Kong, A Review of Path-Planning Approaches for Multiple Mobile
Robots. Machines, 10 (2022), 773:1–27. URL: https://doi.org/10.3390/machines10090773.
[6] Yuta Koike, Kei Sawai, Tsuyoshi Suzuki, A Study of Routing Path Decision Method Using
Mobile Robot Based on Distance Between Sensor Nodes. International Journal of Advanced
Research in Artificial Intelligence, 3 (2014), 25–31.
[7] D.-Z. Du, P.M. Pardalos, X. Hu, W. Wu, Introduction to Combinatorial Optimization. Springer
Nature Switzerland AG (2022), 402. URL: https://doi.org/10.1007/978-3-031-10596-8.
[8] М. Asanov, V. Baranskyi, V. Rasyn, Discrete mathematics: graphs, matroids, algorithms. Lan:
Regular and chaotic dynamics, 2010.
[9] T. Cormen, Ch. Leizerson, R. Rivest, Cl. Shtein, Introduction to algorithms, The MIT Press
Cambridge, Massachusetts London, England, 2009.
[10] M. Chornyi, V. Koroliov, S. Stepanov, Defining the basic direction for the evacuation path
during planned technical maintenance of the operation. Navigation and connection system, 3
(2009), 187-189.
[11] T. Babb. Pickup and delivery problem with time windows, coordinated transportation, Systems:
The State of the Art. Department of Computer Science University of Central Florida Orlando,
Florida, 2005.
[12] J. Caceres-Cruz, P. Arias, D. Guimarans, D. Riera, A.A. Juan, Rich vehicle routing problem:
Survey. ACM Computing Surveys, 47 (2015), 32:1–28.
[13] O. Bräysy, M. Gendreau, Route construction and local search algorithms for the vehicle routing
problem with time windows. Internal Report STF42 A01024, SINTEF Applied Mathematics,
2001.
[14] I. Vikovych, L. Krainyk, R. Zinko, V. Popovych, O. Horbai, Design of Impact Dampers for
Transporting Cargoes by Twolink Vehicles. Eastern-European Journal of Enterprise
Technologiesthis, 2 (2021), 85–94.
[15] D. Hryniov, D. Dvukhglavov, M. Baturynskyi, Method of defining the best routes for
transportation in problems of logistics while creating the complex of operation navigation and
connection system, 1 (2009), 114–117.
[16] V. Koval, V. Kociuruba, I. Sivokha, S. Kotliar, To the question of choosing the rational
maneuver route of connections and parts of air defense missile troops of air troops of Ukraine.
Systems of operation, navigation and connection, 4 (2009), 154–157.
[17] C.-A. Liu, X.-H. Yan, C.-Y. Liu, H. Wu, Dynamic path planning for mobile robot based on
improved ant colony optimization algorithm. Acta Electronica Sinica 39 (2011), 1220–1224.
[18] J. Caceres-Cruz, P. Arias, D. Guimarans, D. Riera, A.A. Juan, Rich vehicle routing problem:
Survey. ACM Computing Surveys 47 (2015), 32:1–28. URL: https://doi.org/10.1145/2666003.
[19] A. Zagorulko, System of making decisions maintenance while operating space machines,
Systems of operation, navigation and connection, 3 (2009), 28–31.
[20] V. Horokhovatskyi, Analysis of alternatives vector as mean of raising the decisions adequacy in
methods of structural recognition, Systems of operation, navigation and connection, 4 (2008),
45–52.
[21] K. Ming. "Solving Path Planning Problem based on Ant Colony Algorithm", 29th Chinese
Control and Decision Conference (CCDC), Chongqing (2017), 5391–5395. URL:
https://doi.org/10.1109/CCDC.2017.7979455.
[22] W. Zhang, X. Gong, G. Han, Y. Zhao. An Improved Ant Colony Algorithm for Path Planning in
One Scenic Area With Many Spots, IEEE Access 5 (2017), 13260–13269. URL:
https://doi.org/10.1109/ACCESS.2017.2723892.
[23] R. Uriol, A. Moran. "Mobile Robot Path Planning in Complex Environments using Ant Colony
Optimization Algorithm", 3rd Intern. Conf. on Control, Automation and Robotics (ICCAR),
Nagoya (2017), 15–21. URL: https://doi.org/10.1109/ICCAR.2017.7942653.
[24] S. Xiao. "Optimal Travel Path Planning and Real Time Forecast System based on Ant Colony
Algorithm", IEEE 2nd Advanced Information Technology, Electronic and Automation Control
Conf. (IAEAC), Chongqing (2017), 2223–2226. URL:
https://doi.org/10.1109/IAEAC.2017.8054413.
[25] Y. Hemin, P. Jiansheng, Robot indoor positioning and navigation based on improved WiFi
location fingerprint positioning algorithm hindawi. Wireless Communications and Mobile
Computing (2022), 8274455: 1–13. URL: https://doi.org/10.1155/2022/8274455.
[26] J.R. Sánchez-Ibáñez, C.J. Pérez-del-Pulgar, A. García-Cerezo, Path planning for autonomous
mobile robots: a review, Sensors 21 (2021), 7898: 1–29. URL:
https://doi.org/10.3390/s21237898.
[27] F. Rubio, F. Valero, C. Llopis-Albert. A review of mobile robots: concepts, methods, theoretical
framework, and applications, International Journal of Advanced Robotic Systems, March-April
(2019), 1–22. URL: https://doi.org/10.1177/1729881419839596.
[28] C. López, A. Ishizaka A scenario-based modeling method for controlling ECM performance,
Expert Systems with Applications 97 (2018), 253–265.
[29] E.F. Mohamed, K. El-Metwally, A.R. Hanafy. “An improved tangent bug method integrated with
artificial potential field for multi-robot path planning”, International symposium on innovations in
intelligent systems and applications (INISTA), DOGUS University (2011), 555–559.
[30] P. Ngulube Handbook of Research on Mixed Methods Research in Information Science, South
Africa, University of South Africa, 2022. URL: https://doi.org/10.4018/978-1-7998-8844-4.
[31] K. Tchoń, R. Muszynski. Mathematical Methods of Automation and Robotics Wrocław, 2018.