Next Article in Journal
On the Concept of Equilibrium in Sanctions and Countersanctions in a Differential Game
Next Article in Special Issue
Toward Optimal Robot Machining Considering the Workpiece Surface Geometry in a Task-Oriented Approach
Previous Article in Journal
BaMSGAN: Self-Attention Generative Adversarial Network with Blur and Memory for Anime Face Generation
Previous Article in Special Issue
Stiffness Modeling and Dynamics Co-Modeling for Space Cable-Driven Linkage Continuous Manipulators
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Efficient Trajectory Planning for Optimizing Energy Consumption and Completion Time in UAV-Assisted IoT Networks

1
School of Intelligent Systems Engineering, Shenzhen Campus, Sun Yat-Sen University, Shenzhen 518107, China
2
Department of Electrical and Computer Engineering, Vanderbilt University, Nashville, TN 37240, USA
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Mathematics 2023, 11(20), 4399; https://doi.org/10.3390/math11204399
Submission received: 13 September 2023 / Revised: 7 October 2023 / Accepted: 20 October 2023 / Published: 23 October 2023
(This article belongs to the Special Issue Mathematical Modeling in Nonlinear Control and Robotics)

Abstract

:
Quadrotor unmanned aerial vehicles (UAVs) have emerged as ubiquitous and agile robots and data carriers within the framework of the future Internet of Things (IoT) and mobile wireless networks. Yet, the insufficient onboard battery necessitates the optimization of energy consumption for both the UAV and IoT devices while ensuring that communication requirements are met. This paper therefore proposes a more accurate and mathematically tractable model for characterizing a UAV’s energy consumption concerning desired trajectories. This nonlinear model takes into account the UAV’s dynamics, brushless direct current (BLDC) motor dynamics, and aerodynamics. To optimize the communication time between IoT devices and the UAV, IoT devices are clustered using a modified GAK-means algorithm, with dynamically optimized communication coverage radii. Subsequently, a fly–circle–communicate (FCC) trajectory design algorithm is introduced and derived to conserve energy and save mission time. Under the FCC approach, the UAV sequentially visits the cluster centers and performs circular flight and communication. Transitions between cluster centers are smoothed via 3D Dubins curves, which provide physically achievable trajectories. Comprehensive numerical studies indicate that the proposed trajectory planning method reduces overall communication time and preserves UAV battery energy compared to other benchmark schemes.

1. Introduction

Due to low cost, high mobility, and vertical take-off and landing advantages [1,2], unmanned aerial vehicles have found widespread application in mobile communication networks [3], such as UAV-aided ubiquitous coverage [4], UAV-aided relaying [5], and UAV-aided information dissemination and data collection [6]. Generally, UAVs are deployed to fly within certain wireless sensor networks (WSNs), which consist of numerous IoT devices distributed throughout space to collect or transmit data [7,8]. Several protocols have been developed for generating UAV flight trajectories to facilitate mobile data collection tasks [9]. With the extensive research and development in UAV technology, various effective controllers have been designed to ensure precise UAV trajectory tracking. These controllers include simple PID control, LQ control, backstepping control, and sliding mode control [10,11,12]. Recent advancements in controller design have further enhanced UAV flight agility and trajectory tracking capabilities. Lee et al. introduced the renowned geometric tracking control method, enabling highly accurate tracking even for aggressive trajectories [13,14]. Quan et al. developed a practical distributed controller that enables UAVs to accurately navigate through virtual tubes, enhancing trajectory tracking performance [15]. Additionally, Zhu et al. designed a nonlinear integral sliding mode attitude controller using the triple-step method to enable UAVs to withstand unknown disturbances [16].
Nevertheless, despite the significant breakthroughs achieved in UAV controllers, effective trajectory planning for UAV-assisted networks remains an area of active exploration and growing interest [17]. Specifically, due to the limited onboard battery capacity of UAVs, there is a pressing need for trajectory optimization concerning both energy consumption and completion time [3]. Furthermore, when ground nodes are disposable with limited power supplies, the optimization of the UAV’s trajectory must take into account the energy consumption of these ground nodes [18]. In light of these challenges, extending the lifespan of UAV-aided wireless communication networks becomes imperative. Consequently, the optimization of energy-efficient and time-effective trajectory planning for UAVs has emerged as a critical component of network management [3,17]. The following subsections provide a comprehensive review of related works, with a primary focus on energy consumption models and optimal trajectory design.

1.1. Energy Consumption Model

Before designing energy-optimized trajectories for UAVs within mobile networks, it is essential to develop an accurate energy consumption model for quadrotor UAVs. Current UAV energy consumption models can be classified into three types.
The first is data fitting with empirical power data obtained under various flight conditions using an onboard power sensor [19]. Subsequently, an energy consumption curve is fitted against user-defined variables, such as flight speed [20]. Note that the resulting energy consumption model is highly contingent upon experimental conditions and physical attributes, rendering it non-universal across all UAV models. The second type is based on classical helicopter theory [21,22]. Zeng et al. derived an energy consumption model for rotary-wing UAVs based on this theory. It comprehensively considered the profile power, induced power, and parasite power [23]. However, it is worth noting that helicopters and quadrotor UAVs differ in their physical structures, which may lead to inaccurate energy consumption results. The third type considers the unique structure of a quadrotor UAV. Caitlin et al. established the dynamic equations of quadrotor UAVs using the Newton–Euler equation, taking into account the influence of relative wind speed, ground effects, and interferences from nearby UAVs [24]. Bouabdalla et al. deduced the thrust, hub force, and torque coefficients of small quadrotor UAVs based on the blade element theory. This model considers the differences in blade structure between quadrotors and helicopters, resulting in a more comprehensive and accurate deduction of the influence of aerodynamics [25]. Hoffmann et al. studied the influence of three aerodynamic effects, namely, vortex ring state, blade flapping, and the interference caused by the fuselage, resulting in a complex thrust analysis [26]. While the above works focused on the impact of aerodynamics on quadrotor UAVs, they did not derive the energy consumption from the perspective of quadrotor UAVs’ fundamental actuators, namely, BLDC motors.
To address these gaps, a novel energy consumption model considering quadrotor dynamics, aerodynamics, and BLDC motor dynamics has previously been developed by the authors [27], which is more suitable for energy-efficient trajectory planning for UAV-assisted networks.

1.2. Trajectory Optimization Method

Subsequently, an optimal trajectory can be intricately designed to conserve UAV energy through the application of suitable energy consumption models. In the context of the mobile communication network, classification can be made based on the number of UAVs and IoT users, resulting in three distinct configurations: the one-to-one scenario [28], the one-to-multi scenario [29], and the multi-to-multi scenario [30]. The one-to-one scenario aims to minimize the flight distance required to complete the communication task, effectively transforming it into a traveling salesman problem [31]. The one-to-multi scenario, which involves more optimization constraints compared to the one-to-one scenario, has garnered greater interest and can be readily extended to the multi-to-multi scenario.
Considering the multi-channel communication capabilities of a UAV within a wireless network, IoT devices can be clustered based on their locations, a problem akin to the disk cover problem [32]. K-means is a widely adopted and practical algorithm for clustering multiple objects. Galkin et al. employed the K-means algorithm to partition airborne access points into K clusters and subsequently deployed the UAV at the center of each cluster, thereby alleviating the load on macrocells and achieving superior signal strength compared to static picocell alternatives [33]. Li et al. introduced the BTK-means algorithm, which addresses the issue of millimeter-wave signal blockage and facilitates the clustering of ground users and UAV deployment [34]. Qu et al. proposed the UBK-means algorithm, which considers user bandwidth requirements to determine the number of centers, resolving bandwidth limitations in emergency scenarios [35]. However, one limitation of the classical K-means algorithm is its sensitivity to the initial random selection of cluster centers. Consequently, intelligent clustering of IoT devices is imperative to enhance the performance of both the UAV and the IoT network, with a focus on energy efficiency.
Mozaffari et al. employed the circle packing algorithm to determine the minimum number of disks [36,37]. However, this method’s primary focus on achieving complete coverage of circular areas results in significant cross-coverage issues, as it does not consider the location information of IoT devices. Lyu et al. proposed an algorithm for placing UAV base stations along a spiral line, utilizing the maximum coverage radius of a UAV to cover IoT devices, with the objective of minimizing the number of disks [32]. Zeng et al. applied this spiral algorithm to cluster IoT devices, and the traveling salesman problem (TSP) algorithm was integrated to minimize completion time [30]. Nevertheless, the coverage radius of the disk was chosen as the maximum value of the UAV’s communication range. In cases where some IoT devices are highly aggregated and distant from others, this additional coverage radius results in energy wastage.
To address this aforementioned gap, this paper introduces a variable-radius disk cover method based on the GAK-means algorithm, which dynamically clusters IoT devices based on their locations. This approach enables the design of better-optimized trajectories to achieve efficient energy consumption for both the UAV and IoT devices.

1.3. Overview of the Proposed Method

In this study, a wireless communication network is investigated where one single quadrotor UAV is deployed as a mobile base station to establish communication with multiple IoT devices. The objective is to optimize the energy consumption of both the UAV and IoT devices while ensuring the communication requirements of each IoT device are met. Firstly, the energy consumption model of a quadrotor UAV is formulated. Secondly, a trajectory planning algorithm is designed to optimize the energy consumption of the UAV and IoT devices. The well-established communication model proposed by Al-Hourani et al. [38] is employed to determine the maximum radius of communication coverage. IoT devices located beyond this maximum radius are deemed invalid connections. Within the communication coverage, IoT devices are clustered based on Euclidean distance to minimize total communication time with the UAV. Upon resolution of the disk cover problem, the centers of clusters are connected to minimize distance. An efficient, high-quality approximate solution is obtained by applying a well-established TSP-solving algorithm. Finally, to further enhance the energy efficiency of the UAV, a novel FCC trajectory design is proposed, which combines circular trajectories and 3D Dubins trajectories.
The remainder of this paper is organized as follows: In Section 2.1, the derivation of the energy consumption model of a quadrotor UAV concerning a desired trajectory is introduced. Section 2.2 covers the presentation of the communication model of the wireless network. In Section 2.3, an energy-optimized trajectory design algorithm is proposed, which is based on the modified GAK-means algorithm, TSP algorithm, and Dubins curve, within a UAV-assisted mobile communication network. Section 3 presents numerical studies to evaluate the proposed methodology. The final section comprises the summary and conclusion.

2. Materials and Methods

2.1. UAV Energy Consumption Model

The fundamental idea of this energy consumption model is to calculate the electric power provided by the four BLDC motors of a quadrotor UAV concerning an input trajectory. The energy model takes into account detailed nonlinear dynamics, including quadrotor dynamics, aerodynamics, and BLDC motor dynamics, which are briefly introduced here to explain the calculation of energy consumption. A more comprehensive derivation can be found in a previous work [27].

2.1.1. Dynamic Model of a Quadrotor UAV

Figure 1 illustrates the free body diagram of a general quadrotor UAV. A rigid body frame { b 1 , b 2 , b 3 } and an inertial reference frame { e 1 , e 2 , e 3 } are established. The dynamic equation for a UAV is as follows:
T M 1 M 2 M 3 = k f k f k f k f 0 l k f 0 l k f l k f 0 l k f 0 k τ k τ k τ k τ ω 1 2 ω 2 2 ω 3 2 ω 4 2
where T is the net thrust, M is the resultant moment, k τ and k f are the torque and the thrust coefficients, respectively, and ω i ,   i = 1 , , 4 are the angular velocity of the rotors. To simplify the formula, we convert scalars into vector representations, with F = T ,   F R 3 and M = [ M 1 , M 2 , M 3 ] T . Given a desired trajectory q d ( t ) in frame { e } , the thrust F d and moment M d can be obtained by:
F d = m q ¨ d + m g e 3 + 1 2 ρ S F q ˙ d q ˙ d
M d = J Ω ˙ d + Ω d × J Ω d
Ω d = ( R d T R ˙ d )
Ω ˙ d = ( R ˙ d T R ˙ d + R d T R ¨ d )
For the sake of space, the exact expressions of R d , R ˙ d , and R ¨ d can be found in [27,39] and the explanation of all other parameters are in Table 1. Note that R d , R ˙ d , R ¨ d , F d , and M d are all determined by the desired trajectory q d ( t ) . A fundamental requirement is the trajectory must be third-order differentiable to accommodate q d .

2.1.2. Thrust Coefficient and Torque Coefficient

The thrust coefficient k f and torque coefficient k τ are calculated by k f = t c ρ s A r 2 and k τ = q c ρ s A r 3 [21]. The thrust and torque coefficient parameters t c , i and q c , i can be obtained as [21]:
t c , i = a 4 [ 2 3 θ 0 ( 1 + 3 V 2 ω i 2 r 2 ) λ i ] , t c = 1 4 i = 1 4 t c , i
q c , i = δ 8 ( 1 + 3 V 2 ω i 2 r 2 ) + ( 1 + k ) λ i t c + 1 8 d 0 V 2 ω i 2 r 2 , q c = 1 4 i = 1 4 q c , i
λ i = ( ( m g 8 ρ π r 2 ) 2 + V 4 4 V 2 2 ) 1 2 ω i r
The description of the parameters are presented in Table 1. Note that t c , i and q c , i are both affected by the forward speed V and rotor speed ω i .
Figure 1. Free body diagram of a general quadrotor UAV. { e } represents the inertial reference frame, { b } stands for the rigid body frame, f i and M i are thrusts and torques produced by the four rotor blades.
Figure 1. Free body diagram of a general quadrotor UAV. { e } represents the inertial reference frame, { b } stands for the rigid body frame, f i and M i are thrusts and torques produced by the four rotor blades.
Mathematics 11 04399 g001
Table 1. Physical parameters of a UAV [26,40].
Table 1. Physical parameters of a UAV [26,40].
ParameterValueParameterValue
mass m = 1.3 kggravity g = 9.8 N/kg
rotor radius r = 0.12 mrotor location l = 0.4 m
lift slope a = 5.7 rotor disk area A = 0.0452 m2
fuselage equivalent flat plate area S F = 0.003 m2air density ρ = 1.225 kg/m3
collective pitch angle θ 0 = 0.13 radprofile drag coefficient δ = 0.012
incremental correction factor k = 0.1 rotor solid s = 0.05
viscous damping coefficient D f = 2 × 10 4 Nms/radvoltage constant K E = 0.01 Vs/rad
motor resistance R = 0.2 Ωmoment of inertia x J x = 0.082 kgm2
moment of inertia y J y = 0.084 kgm2moment of inertia z J z = 0.137 kgm2

2.1.3. BLDC Motor Dynamic Model

With the current and voltage across the i-th BLDC motor measured, the power required for a single BLDC motor of the UAV is therefore [41]:
P i ( t ) = R K T 2 [ D f ω i + m L ( ω i ) ] 2 + K E ω i K T [ D f ω i + m L ( ω i ) ]
The description of above parameters are in Table 1. Therefore, for a given fly time T f l y along a given trajectory q d ( t ) , the UAV consumes the following amount of energy:
E ( T f l y ) = 0 T f l y i = 1 4 P i ( t ) d t
Note that the only variable of the above equation is ω i , i = 1 , , 4 .

2.1.4. Energy Consumption Calculation

With all the dynamic models developed previously, (1) can be rewritten as functions of the desired trajectory q d ( t ) via substituting (2), (3), (6), and (7) into (1):
i = 1 4 ( C 1 ω i 2 + C 2 ω i + C 3 ) = T d ( q d )
l C 1 ( ω 4 2 ω 2 2 ) + l C 2 ( ω 4 ω 2 ) = M 1 d ( q d )
l C 1 ( ω 3 2 ω 1 2 ) + l C 2 ( ω 3 ω 1 ) = M 2 d ( q d )
i = 1 4 ( 1 ) i ( D 1 ω i 2 + D 2 ω i + D 3 1 ω i ) = M 3 d ( q d )
where C 1 = 1 6 ρ s A a θ 0 r 2 , C 2 = 1 4 ρ s A a v i 0 r , C 3 = 1 2 ρ s A a θ 0 V 2 , D 1 = 1 8 δ ρ s A a r 3 , D 2 = 1 6 ( 1 + k ) v i 0 ρ s A θ 0 r 2 , D 3 = 1 2 ( 1 + k ) v i 0 ρ s A a θ 0 V 2 + 1 8 ρ S F V 3 . C 1 ,   C 2 ,   C 3 ,   D 1 ,   D 2 ,   D 3 are coefficients which are determined by an input trajectory q d ( t ) . Thus, the rotor speed ω i can be obtained by (11) and is then substituted into (9) and (10) to solve for BLDC motor power P ( t ) and energy E ( T f l y ) of a UAV.
The blue line depicted in Figure 2 illustrates the relationship between the forward speed, V, and the propulsion power of a quadrotor UAV, P , which is based on the condition of a linear trajectory with a constant speed represented by q d ( t ) = [ V t ; c o n s t ; c o n s t ] T . As the forward speed of the quadrotor UAV increases, the propulsion power initially decreases before rising again, similar to the power curve of helicopters [26]. This phenomenon results from the effect of forward speed on the torque and thrust coefficients. Consequently, the power consumption of the quadrotor UAV when moving forward at low speed is lower than during hovering. Moreover, there exists a specific speed, denoted as V m i n E , which maximizes the total travel distance for a fixed amount of energy. The graphical determination of V m i n E involves drawing a tangential line from the origin to the power curve [23]. It is worth noting that the UAV speed that minimizes propulsion power, referred to as V m i n p , is not the optimal speed for achieving the minimum energy consumption. This is because it requires more time to cover a fixed distance compared to V m i n E .
The red line in Figure 2 is calculated using the model proposed by Zeng et al. [23]. It should be noted that since this model is based on the helicopter theory, meaning only one rotor is considered during the energy calculation, the resulting power is manually multiplied by four times to account for the quadrotor UAV configuration. The patterns between the forward speed V and the total propulsion power P from Zeng’s model and the proposed model are analogous. However, the proposed model fundamentally enhances the accuracy of energy consumption calculation for a quadrotor UAV in three key aspects: First, while a helicopter maintains a relatively constant rotor blade speed and achieves attitude and velocity adjustments through intricate mechanical alterations of propeller geometric inclination, a quadrotor UAV relies on fixed rotor blade pitch angles and adjusts the angular velocity of its four rotor blades for attitude and velocity control. Second, whereas a helicopter employs large main blades for primary thrust and small tail wings to counteract reaction torque due to air resistance on main blade rotation, a quadrotor UAV utilizes four equally positioned propellers to provide motion force and torque. Lastly, unlike a helicopter, the dynamic coupling of the four blades in a quadrotor UAV renders the simultaneous specification of forward speed and alteration of rotor blade rotation speed impractical.

2.2. Communication Model for Mobile IoT Networks

The communication model is developed in this section, followed by characterization of the relationship between the communication coverage radius and the altitude of the UAV. The model considers a rectangular area, where a number of IoT devices are deployed, and a UAV is dispatched to communicate with a set of N IoT devices simultaneously, as depicted in Figure 3. The objective is to concomitantly optimize the energy consumption of the UAV and IoT devices by means of UAV trajectory planning.
The UAV’s 3D coordinate is denoted as q ( t ) = [ x u a v ( t ) , y u a v ( t ) , z u a v ( t ) ] T , and the coordinate of i-th IoT device is u i = [ x I o T i , y I o T i , 0 ] T . Hence, the time-dependent distance between i-th IoT device and the UAV is:
d i ( t ) = | | q ( t ) u i | |
This paper adopts the communication channel model proposed by Al-Hourani et al. [38] to obtain the UAV’s optimum altitude that maximizes ground coverage. Specifically, the UAV can receive two types of signals including line-of-sight (LoS) and non-line-of-sight (NLoS) signals. The probability of occurrence for each group is determined by various factors, with their corresponding probabilities expressed as follows:
P ( L o S ) = 1 1 + ζ 1 e ζ 2 ( θ S ζ 1 )
P ( N L o S ) = 1 P ( L o S )
where ζ 1 and ζ 2 are S-curve parameters depending on the environment conditions and θ is the elevation angle, θ S = 180 π arctan ( h c o m / R c o m ) , R c o m is radius of communication coverage, and h c o m is UAV height. The pathlosses of the LoS group and NLoS group are:
P L L o S = 20 l o g 4 π F c d i ( t ) c + η L o S
P L N L o S = 20 l o g 4 π F c d i ( t ) c + η N L o S
where F c is the transmission frequency, c is the light speed. The first terms of (15) and (16) represent the free space pathloss between the UAV and an IoT device. The second terms represent the mean value of the excess path loss. The total mean path loss between the UAV and an IoT device, following the expectation rule, can be obtained as follows:
P L m e a n = P L L o S · P ( L o S ) + P L N L o S · P ( N L o S )
Given a maximum allowable pathloss P L m a x and environment condition, (17) becomes:
P L m a x = η L o S η N L o S 1 + ζ 1 e ζ 2 [ a r c t a n ( h R ) ζ 1 ] + 10 l o g ( h c o m 2 + R c o m 2 ) + 20 l o g 4 π F c c + η N L o S
Although the explicit expression of R c o m or h c o m cannot be obtained directly, it can be acquired numerically. Assuming F c = 2 × 10 9 Hz, c = 3 × 10 8 m/s, P L m a x = 10 dB, Figure 4 depicts the relationship between R c o m and h c o m with the environment parameters [42] shown in Table 2.
Hence, the altitude of the UAV can be established in accordance with the corresponding coverage radius. It is noteworthy that only one maximum coverage radius exists. If the distance between the UAV and an IoT device surpasses this threshold, the connection is deemed unsuccessful. Additionally, a UAV typically operates within certain altitude constraints, often remaining below 300 m. During interactions with IoT devices, the received signal-to-noise ratio for i-th IoT device is expressed as:
γ i ( t ) = P t r a n d i ( t ) 2 σ 2 P L m e a n
where P t r a n represents the transmit power of the UAV, and σ 2 is the white noise power. The channel capacity based on the path loss model is then derived as follows:
C i r a t e ( t ) = B log 2 ( 1 + γ i ( t ) )
where B denotes the channel bandwidth. The cumulative amount of data within a communication period T is:
Q i d a t a = 0 T C i r a t e ( t ) d t
Note that the communication time between the UAV and an IoT device is affected by several key parameters. Among them, the communication bandwidth, transmission power, and white noise power are all fixed values under specified conditions. Thus, the communication time only depends on the distance between the UAV and the device. In addition, when the UAV communicates with multiple devices at the same time, the communication time will depend on the device with the farthest distance within the communication range.

2.3. Trajectory Planning

2.3.1. Optimization Problem

To accomplish the task described in Figure 3, where a group of K IoT devices are to be communicated by a quadrotor UAV [32], a carefully planned trajectory q ( t ) should be designed for a UAV, considering the completion time and energy consumption of the UAV and the IoT devices. The optimization problem can be stated as:
min q ( t ) = E U A V ( q ( t ) )
0 T k C k r a t e ( t ) d t Q k d a t a
E U A V E m a x
| | q ˙ ( t ) | | V m a x
| | q ¨ ( t ) | | a m a x
where (23) represents the requirement for information gathering, signifying that data from all IoT devices within the k-th cluster must be collected entirely. Equation (24) sets the limitation on UAV energy consumption, with E m a x representing the maximum energy that the UAV’s battery can provide. Equations (25) and (26) stipulate that the UAV’s speed and acceleration cannot exceed their respective maximum limits. Straightforwardly, the optimal energy consumption solution and the optimal completion time solution are inherently contradictory and therefore cannot be simultaneously attained. Consequently, in addressing the optimization problem above, precedence is given to energy optimization. The optimization of completion time is subsequently achieved through the refinement of both the flight and communication processes, as elaborated in the following subsections.

2.3.2. Disk Cover Clustering

To optimize the energy consumption of the UAV, the IoT devices are clustered into disk-shaped regions of various sizes, ensuring that they remain within the maximum communication coverage. Simultaneously, to optimize the energy consumption of the IoT devices, as well as the devices’ operating time, the total distance between the UAV and IoT devices within the same cluster region should be minimized. The K-means algorithm is a widely used unsupervised clustering technique that involves partitioning a given dataset into K clusters, where K is a predefined number of clusters. The algorithm operates through a series of iterative steps, where each data point is assigned to its nearest cluster center, and the centers of the clusters are recalculated based on the newly assigned points. The objective function aims at minimizing the sum of distances from all IoT devices to their respective cluster centers:
J o b j = j = 1 K u i Θ j u i u ¯ Θ j 2
where Θ j is j-th cluster, u i is the location of IoT devices in cluster Θ j , and u ¯ Θ j is the mean value of all IoT devices’ coordinate in cluster Θ j . However, one limitation of the classical algorithm is that it is prone to sensitivity towards cluster centers’ initial positions, resulting in different final clustering solutions. Therefore, the modified GA is embedded with the classical K-means algorithm to avoid local convergence.
In this work, coordinates of all the cluster centers are concatenated as chromosomes for the GA algorithm. For example, if the coordinates of the four cluster centers are (220, 150), (1230, 15), (140, 112), (251, 3), the chromosome code is (220, 150, 1230, 15, 140, 112, 251, 3). Subsequently, the constituent parameters of these chromosomes are aggregated and subjected to mutation operations to generate novel solutions within the ensuing generation. These novel solutions are rigorously assessed based on their efficacy in addressing the specific problem at hand. This evaluative process is realized through the employment of a fitness function, wherein chromosomes endowed with higher values are considered more adept at addressing the problem. The fitness function is architected as follows:
f i t = 1 1 + J o b j
The selection operation f s e l e c ( ) used here is the championship selection method, namely, selecting two parents randomly and returning the one with the highest fitness. The cross operation used here is the single point crossing method. A single crossover point is arbitrarily chosen in the individual code string, and the chromosome is divided into two parts. Both sides of the offspring chromosome are inherited from the corresponding sides of the parent chromosome. Given chromosomes x 1 , x 2 R 2 k , the index of the intersection j is between 1 and 2 k 1 . Thus, the new chromosomes after cross operation f c r o s s ( ) are:
x 1 = [ x ( 1 : j ) 1 , x ( j + 1 : 2 k ) 2 ] x 2 = [ x ( 1 : j ) 2 , x ( j + 1 : 2 k ) 1 ]
The mutation operation used here is the uniform mutation method. This involves the replacement of the gene value at each location in the individual’s coding sequence with a low probability, using random numbers that are uniformly distributed within a specific range. Given a chromosome x 3 R 2 k and a uniformly distributed random vector x R 2 k , the new chromosome after mutation operation f m u t e ( ) is:
x 3 = x 3 + x
One significant challenge in implementing the GAK-means algorithm is the necessity of predefining the number of cluster centers. It is noteworthy that the maximum radius of the clustered disk decreases as the number of centers increases. When the maximum radius among all disks after clustering falls below the radius limit, the algorithm iteratively adjusts the number of cluster centers. The algorithm is detailed in Algorithm 1, where genetic operations and K-means operations are incorporated into the population evolution process for clustering. This algorithm harnesses the global optimization capabilities of genetic algorithms and the local optimization abilities of the K-means operation. Figure 5 demonstrates a clustering progress. With each disk region, the UAV can efficiently communicate with multiple devices at the center of each disk, ensuring effective link maintenance. Simultaneously, it minimizes the total distance between the UAV and the IoT devices within a disk, thereby optimizing the total transmission time.
Algorithm 1: Disk Cover Problem based on GAK-means Algorithm.
  • 1: Input: limited coverage radius R l i m , population size, mutation probability, crossover probability, maximum iteration number N m a x , center number K = 1 , maximum coverage radius R m a x = +
  • 2: while  R m a x > R l i m
  • 3:     K = K + 1 .
  • 4:     for  i = 1 : N m a x .
  • 5:        Generate the initial populations and calculate the fitness of chromosomes.
  • 6:        f s e l e c ( ) , f c r o s s ( ) , f m u t e ( ) and K-means operations. Screen out new populations.
  • 7:     end for
  • 8:     Calculate R m a x of the chromosome that has the highest f i t ( ) .
  • 9: end while
  • 10: Output: K, and the chromosome that has the highest f i t ( ) .

2.3.3. Clustered Disk Connection

Upon completing the disk clustering process, the shortest visiting sequence is established by connecting the centers of clustered disks, thus solving a traveling salesman problem. Researchers have proposed various solutions for TSP, including genetic algorithms, simulated annealing, and tabu search [43,44,45]. After determining the optimal visiting sequence, the UAV initially flies in a straight line to a position near the center of the disk region at the optimal speed V m i n E . Subsequently, it follows a circular trajectory while collecting data from IoT devices. The radius of the circular trajectory is chosen to be R c i r , and the velocity is set as V c i r . This fly–circle–communicate approach has demonstrated lower energy consumption than hovering flight when optimal speed and circular radius are selected [27].
Note that the communication time for flying around each disk region by the UAV is determined by the data volume of IoT devices within that disk region. The entry and exit positions of the UAV at each disk region must be calculated, and then these positions are connected following the same order as the TSP solution. Additionally, the different radii of the disks are achieved by adjusting the height of the UAV. Consequently, the entry and exit positions that need to be connected exist in a 3D space. To ensure a seamless transition without significant acceleration or deceleration, 3D Dubins curves [46] are employed in this work. These curves are designed to find the shortest smooth path between two points with predetermined orientation angles and bounded curvature. Further details are provided in the following subsection.

2.3.4. Three-Dimensional Dubins Curve Connection

Assuming that circular trajectories are executed by the UAV in a counterclockwise direction, the optimal radius of the circular trajectory, as described previously, has been determined, and the UAV’s altitude has been adjusted accordingly based on the disk radius. The centers of two adjacent circular trajectories are denoted as O 1 ( x , y , z ) and O 2 ( x , y , z ) . To obtain the position and directional angle α p t 2 at the point of entry p t 2 , the projection of circular trajectory O 2 onto the plane containing circular trajectory O 1 , denoted as O 2 , is shown in Figure 6a. The horizontal distance between the two centers is:
S D 2 D = | | O 1 O 2 | |
The distance between the center of O 1 and the point p t 2 is:
L t a n = S D 2 D 2 R c i r 2
The orientation angle of at the entry point, p t 2 is therefore:
α p t 2 = arctan O 2 y O 1 y O 2 x O 1 x arctan r c i r L t a n
The coordinate of the entry point p t 2 is:
p t 2 x = L t a n cos α p t 2 + O 1 x
p t 2 y = L t a n sin α p t 2 + O 1 y
p t 2 z = O 2 z
Note that the altitude of the UAV is determined by the coverage radius of disk in (18). The exit point p t 1 is determined by the entry point and the circular path followed by the UAV during communication, which will be derived in the following part.
When the UAV flies near the center of a disk region and starts to execute the circular trajectory, the UAV starts to communicate with multiple IoT devices at the same time. Assuming that all communication data amount of IoT devices are the same, the fly time of circular trajectory eventually depends on the very IoT device located on the edge of disk where the distance between the UAV and the IoT device is the largest, leading to the smallest communication rate and the largest communication time. The geometric relationship of communication distance between the UAV and an IoT device is shown in Figure 6b. The distance in between is:
S U 2 I ( ϕ ) = H 2 + L ( ϕ ) 2 = H 2 + R d i s k 2 + R c i r 2 2 R d i s k R c i r c o s ( ϕ )
where R d i s k is the coverage radius of the UAV, and R c i r is the radius of the UAV circular trajectory. Therefore the distance S U 2 I ( ϕ ) is a function of time, as ϕ = V c i r / R c i r · t . Thus, the communication rate is a function of communication distance according to (20), and channel capacity C r a t e is a function of time. Then, the total communication time T c i r can be calculated by Equation (21). Therefore, the arc of the circular trajectory left during communication is:
Φ = V c i r R c i r T c i r
Finally, the proposed FCC trajectory is generated via linking the exit curve of current arc, the transition curve in a vertical plane, and the entry curve of the next circle, as summarized in Algorithm 2.
Algorithm 2: FCC Trajectory Planning Algorithm.
  • 1: Input: amount of data Q d a t a , IoT device positions { u i } , parameters of the UAV in Table 1.
  • 2: Run Algorithm 1 to obtain K and the center of the disk.
  • 3: Run TSP algorithm to obtain the visiting sequence { π ^ k } .
  • 4: Choose V c i r and R c i r for the circular path, and V m i n E for transition straight path.
  • 5: for  i = 1 : K
  • 6:     Compute entry and exit points p t 1 and p t 2 of disk m ( π ^ k ) .
  • 7:     Connect entry and exit points by Dubins curve.
  • 8: end for
  • 9: Output: UAV’s trajectory.

3. Results

In this section, we present numerical studies to assess the performance of the proposed trajectory design methodology. Two representative examples are provided, with the first showcasing a dense distribution of IoT devices and the second with a sparser distribution. All cases are simulated with dense urban environment parameters ( ζ 1 , ζ 2 , η L o S , η N L o S ) = ( 12.08 , 0.11 , 1.60 , 23.00 ) .
The first illustrative example involves 50 IoT devices, each with a data amount of 0.5 Mb, and their coordinates are randomly distributed between 0 and 1000 m as depicted in Figure 7. Another example comprises 20 IoT devices, each with a data amount of 2 Mb, and their coordinates are randomly distributed between 0 and 1500 m as shown in Figure 8. The UAV’s transmission power is set at 5 W, the bandwidth is 60 MHz, and the white noise power is 110 dBm.

3.1. Benchmark TSP Approach

First, the direct TSP design is employed as the benchmark, where the UAV flies sequentially to each IoT device and performs hover–communicate with every device. The height of the UAV is set as H = 100 m, and the speed during the straight-line segments is set to V m i n E to minimize energy consumption. Simulation results indicate that 2247 s are required for the task’s completion in Figure 7a, with a total energy consumption of 2323 kJ. In the second scenario, the task depicted in Figure 8a necessitates 4553 s for completion by the UAV, with a total energy consumption of 4243 kJ.

3.2. Zigzag Approach

Next, the zigzag approach, also referred to as the strip-based approach, is considered. The zigzag approach is often employed in the context of pesticide-spraying UAV or floor-sweeping robots [47]. In this approach, a rectangular area is efficiently covered by the UAV as it moves back and forth along lines that are either perpendicular or parallel to the boundary. The zigzag approach adopts the ‘fly-and-communicate’ protocol, wherein IoT devices are communicated with by the UAV while in flight. Assuming an absence of limitations on the number of devices that can simultaneously communicate with the UAV [47], it becomes necessary for the UAV to establish communication with as many devices as possible to achieve energy optimization. Consequently, the maximum coverage radius is employed for scanning purposes. To optimize communication performance, special attention is directed towards ensuring successful reception of shared information by IoT devices located farthest from the UAV, as they tend to be the limiting factor. As depicted in Figure 9, a hexagon is employed to approximate the circular communication coverage [47]. Taking the i-th IoT device as an illustrative example for the sweep border, if it can successfully receive the information, all IoT devices within the coverage area will be able to meet the requirements.
When the UAV’s projection on the ground is positioned between the two circle centers, the i-th device is fully covered by the UAV. The distance between the two circle centers is denoted as d O 1 O 2 , which has been determined to be equal to R d i s k through geometric derivation. With the channel capacity C i r a t e ( t ) and time interval T i , the data amount Q i d a t a at the i-th device should ensure that:
Q i d a t a 0 T i C i r a t e ( t ) d t
To achieve the minimum completion time, the equal sign is selected in (37), and the nearest distance between the UAV and the i-th device is used to calculate C i r a t e ( t ) . Consequently, T i can be determined, and the flying speed V z z is adjusted accordingly, V z z = d O 1 O 2 / T i . The UAV’s propulsion power can be determined based on the curve in Figure 2 corresponding to the flight speed. Numerical results demonstrate that the total minimum completion time is 1432 s, with a total minimum energy consumption of 1826 kJ for task 1. For task 2, the UAV requires a total of 13,191 s to complete the task, consuming a total of 16,819 kJ of energy.

3.3. The Proposed Approach

Finally, the trajectory designs proposed in this study are depicted in Figure 7c and Figure 8c for the two scenarios, respectively. The red dotted lines represent the communication coverage of the UAV, while the small red plus signs indicate the centers of the clustered disks, coinciding with the centers of the circular trajectories. During circular trajectories, the UAV can communicate with multiple IoT devices located within each disk region. The number of disk centers, determined by Algorithm 1, is nine when the maximum coverage radius is 217 m, which is slightly smaller than the limited radius of 220 m. In terms of energy consumption, circular flight proves more efficient than hovering flight when optimal parameters are selected, with V c i r set to 8.1 m/s and R c i r set to 33.1 m, as reported as the optimal values for a specific UAV with parameters listed in Table 1 [27]. For straight-line flight, the UAV speed is chosen as V m i n E , as shown in Figure 2. The numerical results demonstrate that the total minimum completion time is 1217 s, with a total minimum energy consumption of 1551 kJ. For task 2, the UAV requires a total of 3048 s to complete the task shown in Figure 8, during which it consumes a total of 3887 kJ of energy.

3.4. Comparison and Discussion

To provide a more comprehensive comparison and evaluate the proposed methodology, additional test cases have been investigated, considering factors such as area size, data volume, and the number of IoT devices. To clearly present the results, we introduce a new attribute called ‘data density’, which measures the amount of data within a unit area. Subsequently, completion time and energy consumption of the three approaches across various test cases are plotted against the data density of each test case, as illustrated in Figure 10. Table 3 highlights some representative cases, marked with stars in Figure 10.
The proposed approach outperforms the other two classical approaches, regardless of the area size, data volume, and number of IoT devices. It is worth noting that the direct TSP approach is highly energy-inefficient, especially in smaller areas where it fails to harness the potential advantages of multiple communications. While the zigzag approach takes advantage of multiple communications, it neglects the location information of IoT devices, making it less energy-efficient. Additionally, the performance of the zigzag approach degrades in larger areas with sparsely distributed IoT devices, as the task completion distance increases. IoT devices with larger data volumes can further slow down the UAV’s scanning speed. In contrast, the proposed approach not only fully leverages the benefits of multiple communications but also considers the locations of IoT devices. This results in the shortest completion time and lowest energy consumption compared to the other approaches. Finally, compared with the fixed-size disk clustering methods [30,32], the proposed method intelligently clusters IoT devices with optimal coverage radii, enhancing the energy efficiency of both the UAV and the IoT network.

4. Conclusions

This work presents a novel methodology to optimize UAV trajectory with respect to energy consumption and completion time for a UAV-assisted communication network. By leveraging aerodynamics, a UAV operates more efficiently when flying in a circle rather than hovering. The distribution of IoT devices inevitably affects the deployment of the UAV. Therefore, IoT devices should be intelligently clustered for the UAV to communicate with them. Finally, physically achievable 3D trajectories are essential to ensure the transmission of the UAV from one IoT device cluster to another. Conclusively, the proposed method reduces the overall communication time and preserves UAV battery energy compared to other benchmark schemes dramatically. The contributions can be summarized as follows:
  • An intelligently designed clustering algorithm is introduced to cluster IoT devices with optimal coverage radii, enhancing the energy efficiency of both the UAV and the IoT network.
  • A methodology for designing trajectories with optimized energy consumption and completion time using circular paths and 3D Dubins curves in UAV-assisted communication networks is derived, providing physically achievable trajectory planning for UAVs.
  • The proposed methodology significantly reduces the overall communication time and conserves more energy compared to other classical benchmark schemes.

Author Contributions

Conceptualization, M.L.; methodology, M.L. and G.J.; software, G.J.; validation, G.J., X.L. and H.Q.; investigation, M.L. and G.J.; writing—original draft preparation, G.J.; writing—review and editing, M.L., X.L. and H.Q. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

Source codes are available from the corresponding author M.L. upon request.

Acknowledgments

The authors would like to thank Minjun Qiu and Jia Tan from DJ-Innovations (DJI) for their insightful comments about quadrotor UAVs.

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

The following abbreviations are used in this manuscript:
BLDCBrushless direct current
CoGCenter of gravity
FCCFly–circle–communicate
GAGenetic Algorithm
IoTInternet of Things
LoSLine-of-sight
NLoSNon-line-of-sight
TSPTraveling salesman problem
UAVUnmanned aerial vehicle
WSNWireless sensor network

References

  1. Boursianis, A.D.; Papadopoulou, M.S.; Diamantoulakis, P.; Liopa-Tsakalidi, A.; Barouchas, P.; Salahas, G.; Karagiannidis, G.; Wan, S.; Goudos, S.K. Internet of things (IoT) and agricultural unmanned aerial vehicles (UAVs) in smart farming: A comprehensive review. Internet Things 2022, 18, 100187. [Google Scholar] [CrossRef]
  2. Sony, S.; Laventure, S.; Sadhu, A. A literature review of next-generation smart sensing technology in structural health monitoring. Struct. Control. Health Monit. 2019, 26, e2321. [Google Scholar] [CrossRef]
  3. Mozaffari, M.; Saad, W.; Bennis, M.; Nam, Y.H.; Debbah, M. A tutorial on UAVs for wireless networks: Applications, challenges, and open problems. IEEE Commun. Surv. Tutor. 2019, 21, 2334–2360. [Google Scholar] [CrossRef]
  4. Zhao, N.; Lu, W.; Sheng, M.; Chen, Y.; Tang, J.; Yu, F.R.; Wong, K.K. UAV-assisted emergency networks in disasters. IEEE Wirel. Commun. 2019, 26, 45–51. [Google Scholar] [CrossRef]
  5. Ahmed, S.; Chowdhury, M.Z.; Jang, Y.M. Energy-efficient UAV relaying communications to serve ground nodes. IEEE Commun. Lett. 2020, 24, 849–852. [Google Scholar] [CrossRef]
  6. Zhan, C.; Zeng, Y. Aerial–ground cost tradeoff for multi-UAV-enabled data collection in wireless sensor networks. IEEE Trans. Commun. 2019, 68, 1937–1950. [Google Scholar] [CrossRef]
  7. Du, R.; Gkatzikis, L.; Fischione, C.; Xiao, M. Energy efficient sensor activation for water distribution networks based on compressive sensing. IEEE J. Sel. Areas Commun. 2015, 33, 2997–3010. [Google Scholar] [CrossRef]
  8. Ouyang, F.; Cheng, H.; Lan, Y.; Zhang, Y.; Yin, X.; Hu, J.; Peng, X.; Wang, G.; Chen, S. Automatic delivery and recovery system of Wireless Sensor Networks (WSN) nodes based on UAV for agricultural applications. Comput. Electron. Agric. 2019, 162, 31–43. [Google Scholar] [CrossRef]
  9. Baek, H.; Lim, J. Design of future UAV-relay tactical data link for reliable UAV control and situational awareness. IEEE Commun. Mag. 2018, 56, 144–150. [Google Scholar] [CrossRef]
  10. Bouabdallah, S.; Noth, A.; Siegwart, R. PID vs LQ control techniques applied to an indoor micro quadrotor. In Proceedings of the 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (IEEE Cat. No. 04CH37566), Sendai, Japan, 28 September–2 October 2004; Volume 3, pp. 2451–2456. [Google Scholar]
  11. Bouabdallah, S.; Siegwart, R. Backstepping and sliding-mode techniques applied to an indoor micro quadrotor. In Proceedings of the 2005 IEEE International Conference on Robotics and Automation, Barcelona, Spain, 18–22 April 2005; pp. 2247–2252. [Google Scholar]
  12. Mahony, R.; Kumar, V.; Corke, P. Multirotor aerial vehicles: Modeling, estimation, and control of quadrotor. IEEE Robot. Autom. Mag. 2012, 19, 20–32. [Google Scholar] [CrossRef]
  13. Lee, T.; Leok, M.; McClamroch, N.H. Geometric tracking control of a quadrotor UAV on SE (3). In Proceedings of the 49th IEEE conference on decision and control (CDC), Atlanta, GA, USA, 15–17 December 2010; pp. 5420–5425. [Google Scholar]
  14. Goodarzi, F.; Lee, D.; Lee, T. Geometric nonlinear PID control of a quadrotor UAV on SE (3). In Proceedings of the 2013 European Control Conference (ECC), Zurich, Switzerland, 17–19 July 2013; pp. 3845–3850. [Google Scholar]
  15. Quan, Q.; Fu, R.; Li, M.; Wei, D.; Gao, Y.; Cai, K.Y. Practical distributed control for VTOL UAVs to pass a virtual tube. IEEE Trans. Intell. Veh. 2021, 7, 342–353. [Google Scholar] [CrossRef]
  16. Zhu, C.; Chen, J.; Zhang, H. Attitude control for quadrotors under unknown disturbances using triple-step method and nonlinear integral sliding mode. IEEE Trans. Ind. Electron. 2022, 70, 5004–5012. [Google Scholar] [CrossRef]
  17. Zeng, Y.; Zhang, R.; Lim, T.J. Wireless communications with unmanned aerial vehicles: Opportunities and challenges. IEEE Commun. Mag. 2016, 54, 36–42. [Google Scholar] [CrossRef]
  18. Zhan, C.; Zeng, Y.; Zhang, R. Energy-efficient data collection in UAV enabled wireless sensor network. IEEE Wirel. Commun. Lett. 2017, 7, 328–331. [Google Scholar] [CrossRef]
  19. Abeywickrama, H.V.; Jayawickrama, B.A.; He, Y.; Dutkiewicz, E. Empirical power consumption model for uavs. In Proceedings of the 2018 IEEE 88th Vehicular Technology Conference (VTC-Fall), Chicago, IL, USA, 27–30 August 2018; pp. 1–5. [Google Scholar]
  20. Di Franco, C.; Buttazzo, G. Energy-aware coverage path planning of UAVs. In Proceedings of the 2015 IEEE International Conference on Autonomous Robot Systems and Competitions, Vila Real, Portugal, 8–10 April 2015; pp. 111–117. [Google Scholar]
  21. Bramwell, A.R.S.; Balmford, D.; Done, G. Bramwell’s Helicopter Dynamics; Elsevier: Amsterdam, The Netherlands, 2001. [Google Scholar]
  22. Filippone, A. Flight Performance of Fixed and Rotary Wing Aircraft; Elsevier: Amsterdam, The Netherlands, 2006. [Google Scholar]
  23. Zeng, Y.; Xu, J.; Zhang, R. Energy minimization for wireless communication with rotary-wing UAV. IEEE Trans. Wirel. Commun. 2019, 18, 2329–2345. [Google Scholar] [CrossRef]
  24. Powers, C.; Mellinger, D.; Kushleyev, A.; Kothmann, B.; Kumar, V. Influence of aerodynamics and proximity effects in quadrotor flight. In Experimental Robotics: The 13th International Symposium on Experimental Robotics; Springer: Berlin/Heidelberg, Germany, 2013; pp. 289–302. [Google Scholar]
  25. Fay, G. Derivation of the Aerodynamic Forces for the Mesicopter Simulation; Standord University: Stanford, CA, USA, 2001. [Google Scholar]
  26. Hoffmann, G.; Huang, H.; Waslander, S.; Tomlin, C. Quadrotor helicopter flight dynamics and control: Theory and experiment. In Proceedings of the AIAA Guidance, Navigation and Control Conference and Exhibit, Hilton Head, SC, USA, 20–23 August 2007; p. 6461. [Google Scholar]
  27. Jia, G.; Li, C.; Li, M. Energy-Efficient Trajectory Planning for Smart Sensing in IoT Networks Using Quadrotor UAVs. Sensors 2022, 22, 8729. [Google Scholar] [CrossRef] [PubMed]
  28. Yang, D.; Wu, Q.; Zeng, Y.; Zhang, R. Energy tradeoff in ground-to-UAV communication via trajectory design. IEEE Trans. Veh. Technol. 2018, 67, 6721–6726. [Google Scholar] [CrossRef]
  29. Ning, Z.; Yang, Y.; Wang, X.; Guo, L.; Gao, X.; Guo, S.; Wang, G. Dynamic computation offloading and server deployment for UAV-enabled multi-access edge computing. IEEE Trans. Mob. Comput. 2021, 22, 2628–2644. [Google Scholar] [CrossRef]
  30. Zeng, Y.; Xu, X.; Zhang, R. Trajectory design for completion time minimization in UAV-enabled multicasting. IEEE Trans. Wirel. Commun. 2018, 17, 2233–2246. [Google Scholar] [CrossRef]
  31. Tran, D.H.; Vu, T.X.; Chatzinotas, S.; ShahbazPanahi, S.; Ottersten, B. Coarse trajectory design for energy minimization in UAV-enabled. IEEE Trans. Veh. Technol. 2020, 69, 9483–9496. [Google Scholar] [CrossRef]
  32. Lyu, J.; Zeng, Y.; Zhang, R.; Lim, T.J. Placement optimization of UAV-mounted mobile base stations. IEEE Commun. Lett. 2016, 21, 604–607. [Google Scholar] [CrossRef]
  33. Galkin, B.; Kibilda, J.; DaSilva, L.A. Deployment of UAV-mounted access points according to spatial user locations in two-tier cellular networks. In Proceedings of the 2016 Wireless Days (WD), Toulouse, France, 23–25 March 2016; pp. 1–6. [Google Scholar]
  34. Li, F.; He, C.; Li, X.; Peng, J.; Yang, K. Geometric Analysis-Based 3D Anti-Block UAV Deployment for mmWave Communications. IEEE Commun. Lett. 2022, 26, 2799–2803. [Google Scholar] [CrossRef]
  35. Qu, H.; Zhang, W.; Zhao, J.; Luan, Z.; Chang, C. Rapid deployment of UAVs based on bandwidth resources in emergency scenarios. In Proceedings of the 2020 Information Communication Technologies Conference (ICTC), Nanjing, China, 29–31 May 2020; pp. 86–90. [Google Scholar]
  36. Mozaffari, M.; Saad, W.; Bennis, M.; Debbah, M. Unmanned aerial vehicle with underlaid device-to-device communications: Performance and tradeoffs. IEEE Trans. Wirel. Commun. 2016, 15, 3949–3963. [Google Scholar] [CrossRef]
  37. Mozaffari, M.; Saad, W.; Bennis, M.; Debbah, M. Efficient deployment of multiple unmanned aerial vehicles for optimal wireless coverage. IEEE Commun. Lett. 2016, 20, 1647–1650. [Google Scholar] [CrossRef]
  38. Al-Hourani, A.; Kandeepan, S.; Lardner, S. Optimal LAP altitude for maximum coverage. IEEE Wirel. Commun. Lett. 2014, 3, 569–572. [Google Scholar] [CrossRef]
  39. Jia, G.; Ding, B.; Li, M. Mathematical Derivation and Simulational Verification for Aggressive Quadrotor Perching Control. In Proceedings of the 2021 China Automation Congress (CAC), Beijing, China, 22–24 October 2021; pp. 5319–5324. [Google Scholar]
  40. Zhu, B.; Bedeer, E.; Nguyen, H.H.; Barton, R.; Henry, J. UAV trajectory planning in wireless sensor networks for energy consumption minimization by deep reinforcement learning. IEEE Trans. Veh. Technol. 2021, 70, 9540–9554. [Google Scholar] [CrossRef]
  41. Stuart, S. DC Motors, Speed Controls, Servo Systems: An Engineering Handbook; Elsevier: Amsterdam, The Netherlands, 2013. [Google Scholar]
  42. Bor-Yaliniz, R.I.; El-Keyi, A.; Yanikomeroglu, H. Efficient 3-D placement of an aerial base station in next generation cellular networks. In Proceedings of the 2016 IEEE International Conference on Communications (ICC), Kuala Lumpur, Malaysia, 22–27 May 2016; pp. 1–5. [Google Scholar]
  43. Laporte, G. The traveling salesman problem: An overview of exact and approximate algorithms. Eur. J. Oper. Res. 1992, 59, 231–247. [Google Scholar] [CrossRef]
  44. Potvin, J.Y. Genetic algorithms for the traveling salesman problem. Ann. Oper. Res. 1996, 63, 337–370. [Google Scholar] [CrossRef]
  45. Aarts, E.H.; Korst, J.H.; van Laarhoven, P.J. A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem. J. Stat. Phys. 1988, 50, 187–206. [Google Scholar] [CrossRef]
  46. Shkel, A.M.; Lumelsky, V. Classification of the Dubins set. Robot. Auton. Syst. 2001, 34, 179–202. [Google Scholar] [CrossRef]
  47. Song, Q.; Jin, S.; Zheng, F.C. Completion time and energy consumption minimization for UAV-enabled multicasting. IEEE Wirel. Commun. Lett. 2019, 8, 821–824. [Google Scholar] [CrossRef]
Figure 2. The relationship between forward speed V and UAV’s entire propulsion power P (the blue and red lines are simulated from the proposed model and the model by Zeng et al. [23], respectively). V m i n E maximizes the total travel distance, while V m i n p minimizes propulsion power.
Figure 2. The relationship between forward speed V and UAV’s entire propulsion power P (the blue and red lines are simulated from the proposed model and the model by Zeng et al. [23], respectively). V m i n E maximizes the total travel distance, while V m i n p minimizes propulsion power.
Mathematics 11 04399 g002
Figure 3. A UAV gathering data from a set of N IoT devices simultaneously in a wireless communication network.
Figure 3. A UAV gathering data from a set of N IoT devices simultaneously in a wireless communication network.
Mathematics 11 04399 g003
Figure 4. Coverage radius versus altitude for different environment. Stars mark the maximum coverage radii.
Figure 4. Coverage radius versus altitude for different environment. Stars mark the maximum coverage radii.
Mathematics 11 04399 g004
Figure 5. A clustering progress. The IoT devices’ locations in the four figures are the same. The maximum radius of all the disk-shaped clusters after clustering decreases as the number increases. (a) K = 5 . (b) K = 6 . (c) K = 7 . (d) K = 8 .
Figure 5. A clustering progress. The IoT devices’ locations in the four figures are the same. The maximum radius of all the disk-shaped clusters after clustering decreases as the number increases. (a) K = 5 . (b) K = 6 . (c) K = 7 . (d) K = 8 .
Mathematics 11 04399 g005
Figure 6. (a) Calculation of the entry and exit points of a Dubins curve. (b) Calculation of the distance between the UAV and an IoT device.
Figure 6. (a) Calculation of the entry and exit points of a Dubins curve. (b) Calculation of the distance between the UAV and an IoT device.
Mathematics 11 04399 g006
Figure 7. Comparison of example 1 of the UAV trajectories with different approaches. Small black dots represent IoT devices. (a) TSP approach. (b) Zigzag approach. (c) Proposed FCC approach. (d) FCC approach’s corresponding height changes.
Figure 7. Comparison of example 1 of the UAV trajectories with different approaches. Small black dots represent IoT devices. (a) TSP approach. (b) Zigzag approach. (c) Proposed FCC approach. (d) FCC approach’s corresponding height changes.
Mathematics 11 04399 g007
Figure 8. Comparison of example 2 of the UAV trajectories with different approaches. Small black dots represent IoT devices. (a) TSP approach. (b) Zigzag approach. (c) Proposed FCC approach. (d) FCC approach’s corresponding height changes.
Figure 8. Comparison of example 2 of the UAV trajectories with different approaches. Small black dots represent IoT devices. (a) TSP approach. (b) Zigzag approach. (c) Proposed FCC approach. (d) FCC approach’s corresponding height changes.
Mathematics 11 04399 g008
Figure 9. Sweep border for the zigzag approach.
Figure 9. Sweep border for the zigzag approach.
Mathematics 11 04399 g009
Figure 10. Comparison with respect to energy consumption and completion time. (a) Completion time vs. data density, (b) energy consumption vs. data density. Stars mark the scenarios shown in Table 3.
Figure 10. Comparison with respect to energy consumption and completion time. (a) Completion time vs. data density, (b) energy consumption vs. data density. Stars mark the scenarios shown in Table 3.
Mathematics 11 04399 g010
Table 2. Communication and environment parameters [42].
Table 2. Communication and environment parameters [42].
EnvironmentParameters ( ζ 1 , ζ 2 , η L o S , η N L o S )
Suburban ( 4.88 , 0.43 , 0.10 , 21.00 )
Urban ( 9.61 , 0.16 , 1.00 , 20.00 )
Dense urban ( 12.08 , 0.11 , 1.60 , 23.00 )
Superdense urban ( 27.23 , 0.08 , 2.30 , 34.00 )
Table 3. Comparison between the different approaches.
Table 3. Comparison between the different approaches.
IoT Numbers20 (2 Mb per IoT)35 (1 Mb per IoT)50 (0.5 Mb per IoT)
area [m2]500210002150025002100021500250021000215002
TSPtime [s]441544774553768177787873281524473058
energy [kJ]406741464243706071837304261323232992
Zigzagtime [s]2591895113,19112954475848264814234241
energy [kJ]330311,41216,8191651570610,81282618265408
Proposedtime [s]875202030484791128225844112171398
energy [kJ]1116257638876111439288056215511782
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Li, M.; Jia, G.; Li, X.; Qiu, H. Efficient Trajectory Planning for Optimizing Energy Consumption and Completion Time in UAV-Assisted IoT Networks. Mathematics 2023, 11, 4399. https://doi.org/10.3390/math11204399

AMA Style

Li M, Jia G, Li X, Qiu H. Efficient Trajectory Planning for Optimizing Energy Consumption and Completion Time in UAV-Assisted IoT Networks. Mathematics. 2023; 11(20):4399. https://doi.org/10.3390/math11204399

Chicago/Turabian Style

Li, Mengtang, Guoku Jia, Xun Li, and Hao Qiu. 2023. "Efficient Trajectory Planning for Optimizing Energy Consumption and Completion Time in UAV-Assisted IoT Networks" Mathematics 11, no. 20: 4399. https://doi.org/10.3390/math11204399

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop