The development of artificial intelligence systems based on various principles, including anthropomorphic and nature-like systems, as well as progress in the construction of quadrocopters for various purposes, made relevant the practical application of these tools for the effective monitoring of underlying surfaces by groups of such devices. The solution of this problem is associated with the effective control of them in conditions of passive and active interference that impedes the fulfillment of missions, as well as with the problem of reconfiguring their construction in case of fail. The model obtained in the work and the calculations made it possible to conclude that the use of the following approach in the future will allow the creation of a self-government system by an independent group of quadrocopters, capable of performing various missions without control from the Earth under conditions of active and passive interference, as well as with permanent failure of quadrocopters.
The article is devoted to the development of algorithms for operational planning of routes for a group of aircraft (AC). We consider group actions of small and unmanned aircraft in the "air taxi" mode, when there is no regular flight schedule between the points of destination, and requests are received "on call" for flights to points whose composition is unknown in advance and is of a random nature. The multicriteria task of planning a group flight in the "air taxi" mode is being solved. The solution to this problem is proposed using the apparatus of the queuing theory, according to which the system under consideration belongs to the class of multichannel queuing systems with waiting. A method for solving the problem of operational planning of aircraft actions is proposed. An algorithm for group target distribution of new claims between aircraft is developed on the basis of a modified minimax criterion for assigning the nearest aircraft for an object with a maximum service time. The developed algorithm is based on the following four main operations: in the first operation, priority unserved targets are selected according to the criterion of assigning a dynamic priority; in the second operation, the formed list is ranked according to another criterion, taking into account the importance and total distance of each ground object from the aircraft group, in three this operation selects the object with the maximum rank, and for it the task of assigning "own" aircraft is solved according to the third criterion of maximum proximity, in the fourth operation the conditions of non-intersection of the group flight routes are checked. A computer model of the system for servicing requests in the air taxi mode has been developed. The developed model makes it possible to analyze various scheduling algorithms, as well as to determine at each step the number of free claims and the number of free and busy aircraft. A comparison is made between the well-known in the theory of queuing and the proposed minimax approaches. It is shown that, in comparison with the known variants of scheduling in the queuing theory, on the basis of the proposed approach, the optimal number of used aircraft is achieved.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.