In recent years, the collaborative operation of multiple unmanned aerial vehicles (UAVs) has been an important advancement in drone technology. The research on multi-UAV collaborative flight path planning has garnered...
详细信息
In recent years, the collaborative operation of multiple unmanned aerial vehicles (UAVs) has been an important advancement in drone technology. The research on multi-UAV collaborative flight path planning has garnered widespread attention in the drone field, demonstrating unique advantages in complex task execution, large-scale monitoring, and disaster response. As one of the core technologies of multi-UAV collaborative operations, the research and technological progress in trajectory planning algorithms directly impact the efficiency and safety of UAV collaborative operations. This paper first reviews the application and research progress of path-planning algorithms based on centralized and distributed control, as well as heuristic algorithms in multi-UAV collaborative trajectory planning. It then summarizes the main technical challenges in multi-UAV path planning and proposes countermeasures for multi-UAV collaborative planning in government, business, and academia. Finally, it looks to future research directions, providing ideas for subsequent studies in multi-UAV collaborative trajectory planning technology.
Given a set (or multiset) S of n numbers and a target number t, the subset sum problem is to decide if there is a subset of S that sums up to t. There are several methods for solving this problem, including exhaustive...
详细信息
Given a set (or multiset) S of n numbers and a target number t, the subset sum problem is to decide if there is a subset of S that sums up to t. There are several methods for solving this problem, including exhaustive search, divide-and-conquer method, and Bellman's dynamic programming method. However, none of them could generate universal and light code. In this paper, we present a new deterministic algorithm based on a novel data arrangement, which could generate such code and return all solutions. If n is small enough, it is efficient for usual purpose. We also present a probabilistic version with one-sided error and a greedy algorithm which could generate a solution with minimized variance.
When trying to enumerate all BIBD's for given parameters, their natural solution space appears to be huge and grows extremely with the number of points of the design. Therefore, constructive enumerations are often...
详细信息
When trying to enumerate all BIBD's for given parameters, their natural solution space appears to be huge and grows extremely with the number of points of the design. Therefore, constructive enumerations are often carried out by assuming additional constraints on design's structure, automorphisms being mostly used ones. It remains a hard task to construct designs with trivial automorphism group - those with no additional symmetry - although it is believed that most of the BIBD's belong to that case. In this paper, very many new designs with parameters 2-(13, 5, 5), 2- (16, 6, 5) and 2-(21, 6, 4) are constructed, assuming an action of an automorphism of order 3. Even more, it was possible to construct millions of such designs with no non-trivial automorphisms.
A procedure for determining whether two graphs are isomorphic is described. During the procedure, from any given graph two graphs, the representative graph and the reordered graph, are derived. The representative grap...
详细信息
The basic theories of load forecasting on the power system are summarized. Fractal theory, which is a new algorithm applied to load forecasting, is introduced. Based on the fractal dimension and fractal interpolation ...
详细信息
The basic theories of load forecasting on the power system are summarized. Fractal theory, which is a new algorithm applied to load forecasting, is introduced. Based on the fractal dimension and fractal interpolation function theories, the correlation algorithms are applied to the model of short-term load forecasting. According to the process of load forecasting, the steps of every process are designed, including load data preprocessing, similar day selecting, short-term load forecasting, and load curve drawing. The attractor is obtained using an improved deterministic algorithm based on the fractal interpolation function, a day's load is predicted by three days' historical loads, the maximum relative error is within 3.7%, and the average relative error is within 1.6%. The experimental result shows the accuracy of this prediction method, which has a certain application reference value in the field of short-term load prediction.
Recently, several studies have considered the use of mobile sink (MS) for data gathering in wireless sensor networks. As, it can enhance lifetime of the sensor network by distributing load among the sensors. In some d...
详细信息
ISBN:
(纸本)9781538619315
Recently, several studies have considered the use of mobile sink (MS) for data gathering in wireless sensor networks. As, it can enhance lifetime of the sensor network by distributing load among the sensors. In some delay-critical applications, a mobile sink is allowed to move along a predefined path. However, due to the predefined path and relatively slower speed of mobile sink, data gathering from sensors may delayed. Thus, time-sensitive data collection in a constrained path environment using mobile sink has increased attention in the research community. Our proposed paper focuses on finding a sub-path on a given path in the network such that the mobile sink can collect maximum data from the network within given time. We refer it as maximum data gathering by optimal sub-path finding problem (MDGOSP). We develop a deterministic algorithm to solve it. Furthermore, performance of the proposed algorithm is validated through simulation experiments using MATLAB.
In System on Chip, buses and point to point links are used as a communication infrastructure between one IP to another, but these cannot provide efficient interconnect from performance point of view. So NoC architectu...
详细信息
ISBN:
(纸本)9781467357593
In System on Chip, buses and point to point links are used as a communication infrastructure between one IP to another, but these cannot provide efficient interconnect from performance point of view. So NoC architecture was proposed to provide communication in multiprocessor SoC and overcome the limitations. This paper has implemented a 5-port 32-bit and 64-bit router architecture using wormhole routing technique for 2D-mesh network by using simple deterministic algorithm, flow control and decoding mechanism. In this router, 2 types of crossbar are used named as multiplexer and tri-state buffer matrix for efficient design. Comparisons of area and power are done for these router designs using ASIC tool flow in Cadence using TSMC 90nm and 180nm process technologies. Simulation results are performed in Cadence NC simulator. It is demonstrated that multiplexer router design is more efficient than a matrix router design as area and power increases for matrix design while using same port-width.
We consider the problem of maintaining the strongly connected components (SCCs) of an n-nodes and medges directed graph that undergoes a sequence of edge deletions. Recently, in SODA 2011, ??cki presented a determinis...
详细信息
ISBN:
(纸本)9781627484855
We consider the problem of maintaining the strongly connected components (SCCs) of an n-nodes and medges directed graph that undergoes a sequence of edge deletions. Recently, in SODA 2011, ??cki presented a deterministic algorithm that preprocess the graph in O(mn) time and creates a data structure that maintains the SCCs of a graph under edge deletions with a total update time of O(mn). The data structure answers strong connectivity queries in O(l) time. The worst case update time after a single edge deletion might be as large as O(mn). In this paper we reduce the preprocessing time and the worst case update time of ??cki's data structure from O(mn) to O(m logn). The query time and the total update time remain unchanged.
Anti-collision algorithm of label is a key technique to enhance identifying efficiency in the RFID *** paper make a new conception of couple of single-bit collision that based on the elementary query tree algorithm an...
详细信息
Anti-collision algorithm of label is a key technique to enhance identifying efficiency in the RFID *** paper make a new conception of couple of single-bit collision that based on the elementary query tree algorithm and two improved algorithm analyzed in *** the both back query tree algorithm and dynamic back query tree algorithm by single-bit anti-collision algorithm could achieve the function that discern double labels at the same time by inquiry *** results show that the single-bit anti-collision could reduce times and time of total inquiries,particularly,dominant improvement of deterministic algorithm by this algorithm when the amount of labels above and beyond half capacity permitted by collision bits.
暂无评论