UAV path planning based on third-party risk modeling.
Ontology highlight
ABSTRACT:
SUBMITTER: Tang H
PROVIDER: S-EPMC10721927 | biostudies-literature | 2023 Dec
REPOSITORIES: biostudies-literature
Publications
UAV path planning based on third-party risk modeling.
Tang Haoyang H Zhu Qiang Q Qin Bo B Song Ruoyang R Li Zhe Z
Scientific reports 20231214 1
Drones play an important role in modern cities, they bring convenience but also bring corresponding risks. Falling drones can cause casualties or damage to urban facilities and serious property damage, which increases the third-party risk problem. An effective way to reduce these third-party risks is to avoid high-risk areas in path planning, but most current path planning methods are optimized to minimize flight distance, and third-party risk costs are rarely considered. In this paper, a compre ...[more]
Similar Datasets
Project description:Emergency responders require accurate and comprehensive data to make informed decisions. Moreover, the data should be acquired and analyzed swiftly to ensure an efficient response. One of the tasks at hand post-disaster is damage assessment within the impacted areas. In particular, building damage should be assessed to account for possible casualties, and displaced populations, to estimate long-term shelter capacities, and to assess the damage to services that depend on essential infrastructure (e.g. hospitals, schools, etc.). Remote sensing techniques, including satellite imagery, can be used to gathering such information so that the overall damage can be assessed. However, specific points of interest among the damaged buildings need higher resolution images and detailed information to assess the damage situation. These areas can be further assessed through unmanned aerial vehicles and 3D model reconstruction. This paper presents a multi-UAV coverage path planning method for the 3D reconstruction of postdisaster damaged buildings. The methodology has been implemented in NetLogo3D, a multi-agent model environment, and tested in a virtual built environment in Unity3D. The proposed method generates camera location points surrounding targeted damaged buildings. These camera location points are filtered to avoid collision and then sorted using the K-means or the Fuzzy C-means methods. After clustering camera location points and allocating these to each UAV unit, a route optimization process is conducted as a multiple traveling salesman problem. Final corrections are made to paths to avoid obstacles and give a resulting path for each UAV that balances the flight distance and time. The paper presents the details of the model and methodologies, and an examination of the texture resolution obtained from the proposed method and the conventional overhead flight with the nadir-looking method used in 3D mappings. The algorithm outperforms the conventional method in terms of the quality of the generated 3D model.
| S-EPMC8452788 | biostudies-literature
Project description:In response to the challenges faced by the Coati Optimization Algorithm (COA), including imbalance between exploration and exploitation, slow convergence speed, susceptibility to local optima, and low convergence accuracy, this paper introduces an enhanced variant termed the Adaptive Coati Optimization Algorithm (ACOA). ACOA achieves a balanced exploration-exploitation trade-off through refined exploration strategies and developmental methodologies. It integrates chaos mapping to enhance randomness and global search capabilities and incorporates a dynamic antagonistic learning approach employing random protons to mitigate premature convergence, thereby enhancing algorithmic robustness. Additionally, to prevent entrapment in local optima, ACOA introduces an Adaptive Levy Flight strategy to maintain population diversity, thereby improving convergence accuracy. Furthermore, underperforming individuals are eliminated using a cosine disturbance-based differential evolution strategy to enhance the overall quality of the population. The efficacy of ACOA is assessed across four dimensions: population diversity, exploration-exploitation balance, convergence characteristics, and diverse strategy variations. Ablation experiments further validate the effectiveness of individual strategy modules. Experimental results on CEC-2017 and CEC-2022 benchmarks, along with Wilcoxon rank-sum tests, demonstrate superior performance of ACOA compared to COA and other state-of-the-art optimization algorithms. Finally, ACOA's applicability and superiority are reaffirmed through experimentation on five real-world engineering challenges and a complex urban three-dimensional unmanned aerial vehicle (UAV) path planning problem.
| S-EPMC11680969 | biostudies-literature
Project description:With the wave of artificial intelligence sweeping the world in recent years, UAVs is widely used in various fields. UAV path planning has attracted much attention from scientists as an essential part of UAV work. In order to design an efficient and reasonable 3D UAV path planning program, recent researchers have invented and improved many algorithms. This paper proposes an elite RIME algorithm for 3D UAV path planning. First, we propose an elite reverse learning population selection strategy based on piecewise mapping to enhance the population diversity of the algorithm for better exploration. Second, this paper proposes a stochastic factor-controlled elite pool exploration strategy so that the algorithm is difficult to enter the local optimum and can better explore the global optimum. Then, this paper proposes a hard frost puncture exploitation strategy based on the sine-cosine function so that the algorithm can find the global optimum faster during the exploitation process. Meanwhile, in order to test the performance of the algorithm proposed in this paper, we compare it with 13 other intelligent optimization algorithms that are classical and popular nowadays on 52 test functions in three test sets, CEC2017, CEC2020, and CEC2022, and obtain competitive results. Finally, we applied it to the 3D UAV path planning problem in three different terrain scenarios, and the ELRIME algorithm achieved good results in all of them. Especially in the 7-peak model, the ELRIME algorithm improves the performance of the RIME algorithm by a factor of two. In the 9-peak model, the average value aspect also reduce the cost by 91 compared to the RIME algorithm, and more importantly, it has the smallest fluctuation in 30 runs, which is among the most stable of all the compared algorithms. In the 12-peak model, its stability is also significantly enhanced, and in terms of worst-case cost, it improves the cost by 340 compared to RIME.
| S-EPMC11408698 | biostudies-literature
Project description:This paper presents an algorithm for multi-UAV path planning in scenarios with heterogeneous Global Navigation Satellite Systems (GNSS) coverage. In these environments, cooperative strategies can be effectively exploited when flying in GNSS-challenging conditions, e.g., natural/urban canyons, while the different UAVs can fly as independent systems in the absence of navigation issues (i.e., open sky conditions). These different flight environments are taken into account at path planning level, obtaining a distributed multi-UAV system that autonomously reconfigures itself based on mission needs. Path planning, formulated as a vehicle routing problem, aims at defining smooth and flyable polynomial trajectories, whose time of flight is estimated to guarantee coexistence of different UAVs at the same challenging area. The algorithm is tested in a simulation environment directly derived from a real-world 3D scenario, for variable number of UAVs and waypoints. Its solution and computational cost are compared with optimal planning methods. Results show that the computational burden is almost unaffected by the number of UAVs, and it is compatible with near real time implementation even for a relatively large number of waypoints. The provided solution takes full advantage from the available flight resources, reducing mission time for a given set of waypoints and for increasing UAV number.
| S-EPMC6308699 | biostudies-literature
Project description:Addressing the imbalance between exploration and exploitation, slow convergence, local optima Traps, and low convergence precision in the Northern Goshawk Optimizer (NGO): Introducing a Multi-Strategy Integrated Northern Goshawk Optimizer (MINGO). In response to challenges faced by the Northern Goshawk Optimizer (NGO), including issues like the imbalance between exploration and exploitation, slow convergence, susceptibility to local optima, and low convergence precision, this paper introduces an enhanced variant known as the Multi-Strategy Integrated Northern Goshawk Optimizer (MINGO). The algorithm tackles the balance between exploration and exploitation by improving exploration strategies and development approaches. It incorporates Levy flight strategies to preserve population diversity and enhance convergence precision. Additionally, to avoid getting trapped in local optima, the algorithm introduces Cauchy mutation strategies, improving its capability to escape local optima during the search process. Finally, individuals with poor fitness are eliminated using the crossover strategy of the Differential Evolution algorithm to enhance the overall population quality. To assess the performance of MINGO, this paper conducts an analysis from four perspectives: population diversity, balance between exploration and exploitation, convergence behavior, and various strategy variants. Furthermore, MINGO undergoes testing on the CEC-2017 and CEC-2022 benchmark problems. The test results, along with the Wilcoxon rank-sum test results, demonstrate that MINGO outperforms NGO and other advanced optimization algorithms in terms of overall performance. Finally, the applicability and superiority of MINGO are further validated on six real-world engineering problems and a 3D Trajectory planning for UAVs.
| S-EPMC11458596 | biostudies-literature
Project description:Exploring large, unknown, and unstructured environments is challenging for Unmanned Aerial Vehicles (UAVs), but they are valuable tools to inspect large structures safely and efficiently. The Lazy Theta* path-planning algorithm is revisited and adapted to generate paths fast enough to be used in real time and outdoors in large 3D scenarios. In real unknown scenarios, a given minimum safety distance to the nearest obstacle or unknown space should be observed, increasing the associated obstacle detection queries, and creating a bottleneck in the path-planning algorithm. We have reduced the dimension of the problem by considering geometrical properties to speed up these computations. On the other hand, we have also applied a non-regular grid representation of the world to increase the performance of the path-planning algorithm. In particular, a sparse resolution grid in the form of an octree is used, organizing the measurements spatially, merging voxels when they are of the same state. Additionally, the number of neighbors is trimmed to match the sparse tree to reduce the number of obstacle detection queries. The development methodology adopted was Test-Driven Development (TDD) and the outcome was evaluated in real outdoors flights with a multirotor UAV. In the results, the performance shows over 90 percent decrease in overall path generation computation time. Furthermore, our approach scales well with the safety distance increases.
| S-EPMC6339096 | biostudies-literature
Project description:The paper presents the concept of mission planning for a short-range tactical class Unmanned Aerial Vehicle (UAV) that recognizes targets using the sensors it has been equipped with. Tasks carried out by such systems are mainly associated with aerial reconnaissance employing Electro Optical (EO)/Near Infra-Red (NIR) heads, Synthetic Aperture Radar (SAR), and Electronic Intelligence (ELINT) systems. UAVs of this class are most often used in NATO armies to support artillery actions, etc. The key task, carried out during their activities, is to plan a reconnaissance mission in which the flight route will be determined that optimally uses the sensors' capabilities. The paper describes the scenario of determining the mission plan and, in particular, the UAV flight routes to which the recognition targets are assigned. The problem was decomposed into several subproblems: assigning reconnaissance tasks to UAVs with choosing the reconnaissance sensors and designating an initial UAV flight plan. The last step is planning a detailed flight route taking into account the time constraints imposed on recognition and the characteristics of the reconnaissance sensors. The final step is to generate the real UAV flight trajectory based on its technical parameters. The algorithm for determining exact flight routes for the indicated reconnaissance purposes was also discussed, taking into account the presence of enemy troops and available air corridors. The task scheduling algorithm-Vehicle Route Planning with Time Window (VRPTW)-using time windows is formulated in the form of the Mixed Integer Linear Problem (MILP). The MILP formulation was used to solve the UAV flight route planning task. The algorithm can be used both when planning individual UAV missions and UAV groups cooperating together. The approach presented is a practical way of establishing mission plans implemented in real unmanned systems.
| S-EPMC7070659 | biostudies-literature
Project description:The question of how cooperation evolves and is maintained among nonkin is central to the biological, social, and behavioral sciences. Previous research has focused on explaining how cooperation in social dilemmas can be maintained by direct and indirect reciprocity among the participants of the social dilemma. However, in complex human societies, both modern and ancient, cooperation is frequently maintained by means of specialized third-party enforcement. We provide an evolutionary-game-theoretic model that explains how specialized third-party enforcement of cooperation (specialized reciprocity) can emerge. A population consists of producers and enforcers. First, producers engage in a joint undertaking represented by a prisoner's dilemma. They are paired randomly and receive no information about their partner's history, which precludes direct and indirect reciprocity. Then, enforcers tax producers and may punish their clients. Finally, the enforcers are randomly paired and may try to grab resources from each other. In order to sustain producer cooperation, enforcers must punish defecting producers, but punishing is costly to enforcers. We show that the threat of potential intraenforcer conflict can incentivize enforcers to engage in costly punishment of producers, provided they are sufficiently informed to maintain a reputation system. That is, the "guards" are guarded by the guards themselves. We demonstrate the key mechanisms analytically and corroborate our results with numerical simulations.
| S-EPMC10268577 | biostudies-literature
Project description:Punishment can help maintain cooperation by deterring free-riding and cheating. Of particular importance in large-scale human societies is third-party punishment in which individuals punish a transgressor or norm violator even when they themselves are not affected. Nonhuman primates and other animals aggress against conspecifics with some regularity, but it is unclear whether this is ever aimed at punishing others for noncooperation, and whether third-party punishment occurs at all. Here we report an experimental study in which one of humans' closest living relatives, chimpanzees (Pan troglodytes), could punish an individual who stole food. Dominants retaliated when their own food was stolen, but they did not punish when the food of third-parties was stolen, even when the victim was related to them. Third-party punishment as a means of enforcing cooperation, as humans do, might therefore be a derived trait in the human lineage.
| S-EPMC3443148 | biostudies-literature
Project description:Third-party punishment of antisocial others is unique to humans and seems to be universal across cultures. However, its emergence in ontogeny remains unknown. We developed a participatory cognitive paradigm using gaze-contingency techniques, in which infants can use their gaze to affect agents displayed on a monitor. In this paradigm, fixation on an agent triggers the event of a stone crushing the agent. Throughout five experiments (total N = 120), we show that eight-month-old infants punished antisocial others. Specifically, infants increased their selective looks at the aggressor after watching aggressive interactions. Additionally, three control experiments excluded alternative interpretations of their selective gaze, suggesting that punishment-related decision-making influenced looking behaviour. These findings indicate that a disposition for third-party punishment of antisocial others emerges in early infancy and emphasize the importance of third-party punishment for human cooperation. This behavioural tendency may be a human trait acquired over the course of evolution.
| S-EPMC9489529 | biostudies-literature