scholarly journals A Motif-based Mission Planning Method for UAV Swarms Considering Dynamic Reconfiguration

2018 ◽  
Vol 68 (2) ◽  
pp. 159 ◽  
Author(s):  
Jiajie Liu ◽  
Weiping Wang ◽  
Xiaobo Li ◽  
Tao Wang ◽  
Tongqing Wang
Keyword(s):  
Complex Terrain ◽  
Pareto Front ◽  
Scheduling Algorithm ◽  
Dynamic Reconfiguration ◽  
Difficult Problem ◽  
Planning Method ◽  
Mission Planning ◽  
Basic Unit ◽  
Planning Scheme

Influenced by complex terrain conditions of combat environments and constrained by the level of communication technology, communication among unmanned aerial vehicles (UAV) is greatly restricted. In light of this situation, mission planning for UAV swarms under limited communication has become a difficult problem. This paper introduces motifs as the basic unit of configuration and proposes a motif-based mission planning method considering dynamic reconfiguration. This method uses multidimensional dynamic list scheduling algorithm to generate a mission planning scheme based on the motif-based swarm configuration solution. Then it incorporates order preserved operators with NSGA-III algorithm to find Pareto front solutions of all possible mission planning schemes. The feasibility of this mission planning method is validated through a case study.

scholarly journals The impact of a foehn wind on PM10 concentrations and the urban boundary layer in complex terrain: a case study from Kraków, Poland

Tellus B ◽  
2021 ◽  
Vol 73 (1) ◽  
pp. 1-26
Author(s):  
Piotr Sekuła ◽  
Anita Bokwa ◽  
Zbigniew Ustrnul ◽  
Mirosław Zimnoch ◽  
Bogdan Bochenek
Keyword(s):  
Boundary Layer ◽  
Complex Terrain ◽  
Urban Boundary Layer ◽  
The Impact

Optimal path planning with modified A-Star algorithm for stealth unmanned aerial vehicles in 3D network radar environment

2021 ◽  
pp. 095441002110073
Author(s):  
Zhe Zhang ◽  
Jian Wu ◽  
Jiyang Dai ◽  
Cheng He
Keyword(s):  
Path Planning ◽  
Unmanned Aerial Vehicles ◽  
Optimal Path ◽  
Radar System ◽  
Planning Method ◽  
Optimal Path Planning ◽  
Aerial Vehicles ◽  
3D Network ◽  
Planning Scheme ◽  
Estimation Function

For stealth unmanned aerial vehicles (UAVs), path security and search efficiency of penetration paths are the two most important factors in performing missions. This article investigates an optimal penetration path planning method that simultaneously considers the principles of kinematics, the dynamic radar cross-section of stealth UAVs, and the network radar system. By introducing the radar threat estimation function and a 3D bidirectional sector multilayer variable step search strategy into the conventional A-Star algorithm, a modified A-Star algorithm was proposed which aims to satisfy waypoint accuracy and the algorithm searching efficiency. Next, using the proposed penetration path planning method, new waypoints were selected simultaneously which satisfy the attitude angle constraints and rank-K fusion criterion of the radar system. Furthermore, for comparative analysis of different algorithms, the conventional A-Star algorithm, bidirectional multilayer A-Star algorithm, and modified A-Star algorithm were utilized to settle the penetration path problem that UAVs experience under various threat scenarios. Finally, the simulation results indicate that the paths obtained by employing the modified algorithm have optimal path costs and higher safety in a 3D complex network radar environment, which show the effectiveness of the proposed path planning scheme.

scholarly journals Modeling and Simulation of Sky Survey

2021 ◽  
Vol 11 (16) ◽  
pp. 7584
Author(s):  
Kun Hu ◽  
Hongfei Wang ◽  
Wenzhao Zhang ◽  
Yuohua Xu ◽  
Shengmao He
Keyword(s):  
Modeling And Simulation ◽  
Scheduling Algorithm ◽  
Space Station ◽  
Scientific Output ◽  
Mission Planning ◽  
Design Algorithm ◽  
Sky Survey ◽  
Long Time ◽  
Time Periods ◽  
Design Ideas

Sky surveys with wide and deep field are the key direction of international astronomy research for the next decades. It is worthwhile to study how to design a sky survey algorithm to obtain the maximum scientific output in a limited period of observation. In this paper, the modeling and simulation of a wide and deep sky survey mission are presented using a Staged Design Algorithm (SDA), which takes into account the inefficient time periods and difficult-to-observe sky areas. In order to ensure the effective completion of the long-time survey observation tasks in large sky areas, a two-stage scheduling algorithm is designed. Firstly, the inefficient time periods and difficult observation areas are scheduled, and then the overall observation is carried out. The prearranged schedule is arranged when inefficient time periods or difficult areas are encountered during the overall arrangement. The simulation results are verified on the basic data of the China Space Station Telescope (CSST), and the obtained simulation result is three years ahead of the target of the telescope design to complete the wide and deep sky survey of 15,000 deg2. The design ideas in this paper not only have good results for sky survey observation but also can be extended to similar satellite Earth observation mission planning.

Sign in / Sign up

Export Citation Format

Share Document