Optimizing Reference Routes through Waypoint Sequence Variation in Emergency Events of Natural and Technological Origin
Year: 2024
Type: conference-paper
Abstract: The likelihood of rescuing people caught in emergencies of natural or technological origin depends on the speed with which they are provided the necessary information. In conditions where normal communication means (radio, television, Internet) are disrupted, unmanned aerial vehicles (drones) can serve as an alternative means of notification, providing information to the population through built-in audio broadcasting systems or by dropping instructions on paper, plastic, and other carriers. Similarly, essential cargo such as rescue equipment, food, water, etc., can be dropped. In the context of the rapid flow of dangerous processes and the limited number of drones available, optimizing the flight route for time becomes crucial. This work analyses existing methods of constructing flight routes through a given set of waypoints: exhaustive search methods, Bellman’s discrete dynamic programming method, greedy algorithms (nearest neighbor method), and anytime algorithms. To save onboard computer resources, a method for improving the reference trajectory, which was initially found using the nearest neighbor method, was chosen. Improving the reference trajectory is done by varying the sequence of waypoints. The advantage of this approach is that at each step of the iterative improvement of the trajectory, new information that has become available at the current time can be taken into account. Changes to the set of necessary waypoints can occur due to changes in the emergency, the completion of tasks by other drones, or the failure of other drones. The workability of the algorithm with low computational time costs onboard computers was tested for routes that include from 8 to 200 points.
Language: English
Subfield: Industrial and Manufacturing Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W7166317416
