Abstract:A wide range of applications of the unmanned aerial vehicle (UAV) have been observed in the past few years, and path planning is one of the most critical issues that require to be resolved. UAVs are still prone to meteorological impediments such as thunderstorms, ice accumulation, and severe convective weather for the safety of flights. This paper proposes a meteorology-aware path planning method based on the improved intelligent water drops (IIWD) algorithm. The algorithm consists of both static and dynamic p… Show more
“…If the path to wn from its nearest neighbor nΓ(wn) is feasible (line 17), wn is selected as the new point to add to the tree, i.e., xw. If it is not, the last feasible point of the segment connecting nΓ(wn) to wn (i.e., xc) is used as the central point to perform a random extraction from a gaussian distribution (lines [20][21]. The random point xr becomes the next candidate point to add to the tree (i.e., xw) if the segment going from nΓ(xr) to xr is collision free (lines [22][23][24].…”
Section: B Strategic Deconflictionmentioning
confidence: 99%
“…However also models involving multi-information risk assessment, thus combining population information with urban environment topology have been used in [7], [8]. Weather-based path definition has been tackled both in strategical and tactical phase in [20]. Here, wind module information has been used either to optimize the overall flight time [21], [22] or to minimize the energy consumption of the UAV [22]- [24].…”
This paper introduces a multi-metric multiconstraint strategic path planning framework applicable to unstructured urban airspace. The planner is based on a modular and scalable approach to handle several information sources and aspects characterizing urban flight scenarios, such as risk and weather maps, landing site locations, navigation requirements, and mobile and fixed obstacle characteristics. This information is coupled with dynamic constraints and UAV specifications to derive a flyable and safe path connecting a start position and a destination. Strategies for data gathering and synthesis, used to keep a reduced computational burden, are described along with the path planner algorithm. The latter consists in three steps specifically developed to handle both static and time-varying information. A multi-objective cost function with variable weighting coefficients has been implemented so that the most relevant factors for the considered applications can be selected in an adaptive fashion. The performance of the developed algorithms is tested by investigating the planner behavior when changing its inputs as well as the cost function weighting coefficients, demonstrating the ability of the planner in returning an efficient and safe trajectory.
“…If the path to wn from its nearest neighbor nΓ(wn) is feasible (line 17), wn is selected as the new point to add to the tree, i.e., xw. If it is not, the last feasible point of the segment connecting nΓ(wn) to wn (i.e., xc) is used as the central point to perform a random extraction from a gaussian distribution (lines [20][21]. The random point xr becomes the next candidate point to add to the tree (i.e., xw) if the segment going from nΓ(xr) to xr is collision free (lines [22][23][24].…”
Section: B Strategic Deconflictionmentioning
confidence: 99%
“…However also models involving multi-information risk assessment, thus combining population information with urban environment topology have been used in [7], [8]. Weather-based path definition has been tackled both in strategical and tactical phase in [20]. Here, wind module information has been used either to optimize the overall flight time [21], [22] or to minimize the energy consumption of the UAV [22]- [24].…”
This paper introduces a multi-metric multiconstraint strategic path planning framework applicable to unstructured urban airspace. The planner is based on a modular and scalable approach to handle several information sources and aspects characterizing urban flight scenarios, such as risk and weather maps, landing site locations, navigation requirements, and mobile and fixed obstacle characteristics. This information is coupled with dynamic constraints and UAV specifications to derive a flyable and safe path connecting a start position and a destination. Strategies for data gathering and synthesis, used to keep a reduced computational burden, are described along with the path planner algorithm. The latter consists in three steps specifically developed to handle both static and time-varying information. A multi-objective cost function with variable weighting coefficients has been implemented so that the most relevant factors for the considered applications can be selected in an adaptive fashion. The performance of the developed algorithms is tested by investigating the planner behavior when changing its inputs as well as the cost function weighting coefficients, demonstrating the ability of the planner in returning an efficient and safe trajectory.
Unmanned Aerial Vehicles (UAVs), a subset of aerial robots, play crucial roles in various domains, such as disaster management, agriculture, and healthcare. Their application proves invaluable in situations where human intervention poses risks or involves high costs. However, traditional approaches to UAV path planning struggle in efficiently navigating complex and dynamic environments, often resulting in suboptimal routes and extended mission durations. This study seeks to investigate and improve the utilization of meta-heuristic algorithms for optimizing UAV path planning. Toward this aim, we carried out a systematic review of five major databases focusing on the period from 2018 to 2022. Following a rigorous two-stage screening process and a thorough quality appraisal, we selected 68 papers out of the initial 1500 to answer our research questions. Our findings reveal that hybrid algorithms are the dominant choice, surpassing evolutionary, physics-based, and swarm-based algorithms, indicating their superior performance and adaptability. Notably, time optimization takes precedence in mathematical models, reflecting the emphasis on CPU time efficiency. The prevalence of dynamic environmental types underscores the importance of real-time considerations in UAV path planning, with three-dimensional (3D) models receiving the most attention for accuracy in complex trajectories. Additionally, we highlight the trends and focuses of the UAV path planning optimization research community and several challenges in using meta-heuristic algorithms for the optimization of UAV path planning. Finally, our analysis further highlights a dual focus in UAV research, with a significant interest in optimizing single-UAV operations and a growing recognition of the challenges and potential synergies in multi-UAV systems, alongside a prevalent emphasis on single-target mission scenarios, but with a notable subset exploring the complexities of multi-target missions.
“…(18) Nishi et al considered path planning for obstacle avoidance under AGV acceleration or deceleration conditions, established a continuous-time model, and proposed a heuristic algorithm based on column generation. (19) Duan et al proposed an operator for finely tuning paths to make path fragments shorter and avoid obstacles, and realized dynamic path planning based on a GA. (20) Ahmed et al proposed a collision prediction method based on vertex attributes and real time location information combined with graph theory, established a MIP model, and proposed an improved particle swarm optimization (PSO) algorithm suitable for optimizing collision avoidance decisions of multi-AGV systems. (21) Hu et al established a MIP model by analyzing the obstacles between sections and nodes and proposed an induced ant colony particle swarm algorithm.…”
Section: Agv Path Planning For Obstacle Avoidancementioning
Automated guided vehicles (AGVs) are the main delivery vehicle for the horizontal transport of containers between the quayside and yard of automated container terminals (ACTs). The coordination of AGVs with the quayside bridge and yard bridge is necessary for loading and unloading operations at the wharf and to improve logistics management efficiency. Toward solving the problem of AGV path planning and sensor-aware obstacle avoidance in a dynamic complex environment for the Internet of Things (IoT), we proposed an improved ant colony algorithm based on an adaptive dynamic parameter adjustment strategy (IACA-ADPA) in this paper. The grid method is first used to construct a motion space model because it is easy to implement, analyze, store, and express, and make the AGV reach its target node safely and smoothly. Then the proposed IACA-ADPA is used for global path planning and for efficient AGV path design and adjustment. Finally, the improved time window adjusts the waiting time of the AGV to avoid local collisions. The simulation results of different scale paradigms show that the IACA-ADPA can effectively avoid road section obstacles and node obstacles, and improve the safety and efficiency of a multi-AGV system.
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.