The interaction between many empty vehicles is a very challenging topic from a theoretical and material point of view, with far-reaching indicators of scientific and commercial mechanical conditions. The difficulty of connecting the fastest time of multirotor UAVs includes pre-defined local routes depending on the equipment requirements. With the proposed solution, collaborative control is performed in the presence of time-varying communication networks, as well as strong temporary issues, such as simultaneous arrival at the desired terminals. The proposed definition solves the problem of time consolidation under the acceptance that trajectory generation and subsequent assembly of algorithms is provided for guaranteed integration conditions. Communication is processed in unexpected ways using the following method and targeted graph. Optimized Robot Process Automation is an algorithm for detecting very short routes, which is used to avoid / detect collisions / congestion in unexpected ways. Without the discovery of a collision, it does not seem to be compatible to avoid a collision because there would not be everything to avoid. The Dijikloyd algorithm is used to find shortcuts in a targeted graph with a positive or negative margin. The Primloyd algorithm is used to find shortcuts in a weighted non-target graph to overcome complexity in matrix coding. In case of overcrowding or collision the whole network is read about to all its contacts. Therefore, communication occurs unexpectedly in a secure way.