Space emergency launching is to send a satellite into space by using a rapid responsive solid rocket in the bounded time to implement the emergency Earth observation mission.The key and difficult points mainly include...Space emergency launching is to send a satellite into space by using a rapid responsive solid rocket in the bounded time to implement the emergency Earth observation mission.The key and difficult points mainly include the business process construction of launching mission planning,validation of the effectiveness of the launching scheme,etc.This paper pro-poses the agile space emergency launching mission planning simulation and verification method,which systematically con-structs the overall technical framework of space emergency launching mission planning with multi-field area,multi-platform and multi-task parallel under the constraint of resource schedul-ing for the first time.It supports flexible reconstruction of mis-sion planning processes such as launching target planning,tra-jectory planning,path planning,action planning and launching time analysis,and can realize on-demand assembly of operation links under different mission scenarios and different plan condi-tions,so as to quickly modify and generate launching schemes.It supports the fast solution of rocket trajectory data and the accurate analysis of multi-point salvo time window recheck and can realize the fast conflict resolution of launching missions in the dimensions of launching position and launching window sequence.It supports lightweight scenario design,modular flexi-ble simulation,based on launching style,launching platform,launching rules,etc.,can realize the independent mapping of mission planning results to two-dimensional and three-dimen-sional visual simulation models,so as to achieve a smooth con-nection between mission planning and simulation.展开更多
Cooperative search-attack is an important application of unmanned aerial vehicle(UAV)swarm in military field.The coupling between path planning and task allocation,the heterogeneity of UAVs,and the dynamic nature of t...Cooperative search-attack is an important application of unmanned aerial vehicle(UAV)swarm in military field.The coupling between path planning and task allocation,the heterogeneity of UAVs,and the dynamic nature of task environment greatly increase the complexity and difficulty of the UAV swarm cooperative search-attack mission planning problem.Inspired by the collaborative hunting behavior of wolf pack,a distributed selforganizing method for UAV swarm search-attack mission planning is proposed.First,to solve the multi-target search problem in unknown environments,a wolf scouting behavior-inspired cooperative search algorithm for UAV swarm is designed.Second,a distributed self-organizing task allocation algorithm for UAV swarm cooperative attacking of targets is proposed by analyzing the flexible labor division behavior of wolves.By abstracting the UAV as a simple artificial wolf agent,the flexible motion planning and group task coordinating for UAV swarm can be realized by self-organizing.The effectiveness of the proposed method is verified by a set of simulation experiments,the stability and scalability are evaluated,and the integrated solution for the coupled path planning and task allocation problems for the UAV swarm cooperative search-attack task can be well performed.展开更多
Satellite observation schedule is investigated in this paper.A mission planning algorithm of task clustering is proposed to improve the observation efficiency of agile satellite.The newly developed method can make the...Satellite observation schedule is investigated in this paper.A mission planning algorithm of task clustering is proposed to improve the observation efficiency of agile satellite.The newly developed method can make the satellite observe more targets and therefore save observation resources.First,for the densely distributed target points,a preprocessing scheme based on task clustering is proposed.The target points are clustered according to the distance condition.Second,the local observation path is generated by Tabu algorithm in the inner layer of cluster regions.Third,considering the scatter and cluster sets,the global observation path is obtained by adopting Tabu algorithm in the outer layer.Simulation results show that the algorithm can effectively reduce the task planning time of large-scale point targets while ensuring the optimal solution quality.展开更多
This paper concerns the mission scheduling problem for an agile Earth-observing satellite. Mission planning and action planning for the satellite are both taking into account. Multiple mission types( including multi-s...This paper concerns the mission scheduling problem for an agile Earth-observing satellite. Mission planning and action planning for the satellite are both taking into account. Multiple mission types( including multi-strip area,real time download request,and stereoscopic request) and complex satellite actions,such as observe action and data download action,are considered in this paper. Through reasonable analysis of specialties and operational constraints of agile satellites in observing process,the mission scheduling model under multiple objective conditions is constructed. A genetic algorithm combined with heuristic rules is designed to solve problem. Genetic algorithm is designed to arrange user missions and heuristic rules are used to arrange satellite actions. Experiment results suggest that our algorithm works well for the agile Earth-observing satellite scheduling problem.展开更多
This paper studies the problem of the space station short-term mission planning, which aims to allocate the executing time of missions effectively, schedule the corresponding resources reasonably and arrange the time ...This paper studies the problem of the space station short-term mission planning, which aims to allocate the executing time of missions effectively, schedule the corresponding resources reasonably and arrange the time of the astronauts properly. A domain model is developed by using the ontology theory to describe the concepts, constraints and relations of the planning domain formally, abstractly and normatively. A method based on time iteration is adopted to solve the short-term planning problem. Meanwhile, the resolving strategies are proposed to resolve different kinds of conflicts induced by the constraints of power, heat, resource, astronaut and relationship. The proposed approach is evaluated in a test case with fifteen missions, thirteen resources and three astronauts. The results show that the developed domain ontology model is reasonable, and the time iteration method using the proposed resolving strategies can successfully obtain the plan satisfying all considered constraints.展开更多
Reconnaissance mission planning of multiple unmanned aerial vehicles(UAVs)under an adversarial environment is a discrete combinatorial optimization problem which is proved to be a non-deterministic polynomial(NP)-comp...Reconnaissance mission planning of multiple unmanned aerial vehicles(UAVs)under an adversarial environment is a discrete combinatorial optimization problem which is proved to be a non-deterministic polynomial(NP)-complete problem.The purpose of this study is to research intelligent multiUAVs reconnaissance mission planning and online re-planning algorithm under various constraints in mission areas.For numerous targets scattered in the wide area,a reconnaissance mission planning and re-planning system is established,which includes five modules,including intelligence analysis,sub-mission area division,mission sequence planning,path smoothing,and online re-planning.The intelligence analysis module depicts the attribute of targets and the heterogeneous characteristic of UAVs and computes the number of sub-mission areas on consideration of voyage distance constraints.In the sub-mission area division module,an improved K-means clustering algorithm is designed to divide the reconnaissance mission area into several sub-mission areas,and each sub-mission is detected by the UAV loaded with various detective sensors.To control reconnaissance cost,the sampling and iteration algorithms are proposed in the mission sequence planning module,which are utilized to solve the optimal or approximately optimal reconnaissance sequence.In the path smoothing module,the Dubins curve is applied to smooth the flight path,which assure the availability of the planned path.Furthermore,an online re-planning algorithm is designed for the uncertain factor that the UAV is damaged.Finally,reconnaissance planning and re-planning experiment results show that the algorithm proposed in this paper are effective and the algorithms designed for sequence planning have a great advantage in solving efficiency and optimality.展开更多
Unmanned aerial vehicles(UAVs)are increasingly applied in various mission scenarios for their versatility,scalability and cost-effectiveness.In UAV mission planning systems(UMPSs),an efficient mission planning strateg...Unmanned aerial vehicles(UAVs)are increasingly applied in various mission scenarios for their versatility,scalability and cost-effectiveness.In UAV mission planning systems(UMPSs),an efficient mission planning strategy is essential to meet the requirements of UAV missions.However,rapidly changing environments and unforeseen threats pose challenges to UMPSs,making efficient mission planning difficult.To address these challenges,knowledge graph technology can be utilized to manage the complex relations and constraints among UAVs,missions,and environments.This paper investigates knowledge graph application in UMPSs,exploring its modeling,representation,and storage concepts and methodologies.Subsequently,the construction of a specialized knowledge graph for UMPS is detailed.Furthermore,the paper delves into knowledge reasoning within UMPSs,emphasizing its significance in timely updates in the dynamic environment.A graph neural network(GNN)-based approach is proposed for knowledge reasoning,leveraging GNNs to capture structural information and accurately predict missing entities or relations in the knowledge graph.For relation reasoning,path information is also incorporated to improve the accuracy of inference.To account for the temporal dynamics of the environment in UMPS,the influence of timestamps is captured through the attention mechanism.The effectiveness and applicability of the proposed knowledge reasoning method are verified via simulations.展开更多
Unmanned air vehicles(UAVs) have been regularly employed in modern wars to conduct different missions. Instead of addressing mission planning and route planning separately,this study investigates the issue of joint mi...Unmanned air vehicles(UAVs) have been regularly employed in modern wars to conduct different missions. Instead of addressing mission planning and route planning separately,this study investigates the issue of joint mission and route planning for a fleet of UAVs. The mission planning determines the configuration of weapons in UAVs and the weapons to attack targets, while the route planning determines the UAV’s visiting sequence for the targets. The problem is formulated as an integer linear programming model. Due to the inefficiency of CPLEX on large scale optimization problems, an effective learningbased heuristic, namely, population based adaptive large neighborhood search(P-ALNS), is proposed to solve the model. In P-ALNS, seven neighborhood structures are designed and adaptively utilized in terms of their historical performance. The effectiveness and superiority of the proposed model and algorithm are demonstrated on test instances of small, medium and large sizes. In particular, P-ALNS achieves comparable solutions or as good as those of CPLEX on small-size(20 targets)instances in much shorter time.展开更多
This article studies the cooperative search-attack mission problem with dynamic targets and threats, and presents a Distributed Intelligent Self-Organized Mission Planning(DISOMP)algorithm for multiple Unmanned Aerial...This article studies the cooperative search-attack mission problem with dynamic targets and threats, and presents a Distributed Intelligent Self-Organized Mission Planning(DISOMP)algorithm for multiple Unmanned Aerial Vehicles(multi-UAV). The DISOMP algorithm can be divided into four modules: a search module designed based on the distributed Ant Colony Optimization(ACO) algorithm, an attack module designed based on the Parallel Approach(PA)scheme, a threat avoidance module designed based on the Dubins Curve(DC) and a communication module designed for information exchange among the multi-UAV system and the dynamic environment. A series of simulations of multi-UAV searching and attacking the moving targets are carried out, in which the search-attack mission completeness, execution efficiency and system suitability of the DISOMP algorithm are analyzed. The simulation results exhibit that the DISOMP algorithm based on online distributed down-top strategy is characterized by good flexibility, scalability and adaptability, in the dynamic targets searching and attacking problem.展开更多
A spatial orthogonal allocation method is devised for multirobot tasks allocation.A 3D space model is adopted to describe exploration mission;meanwhile spatial orthogonal tentative technology is utilized to update the...A spatial orthogonal allocation method is devised for multirobot tasks allocation.A 3D space model is adopted to describe exploration mission;meanwhile spatial orthogonal tentative technology is utilized to update the attractor position for load balance.Heterogeneous interactive cultural hybrid architecture is proposed to solve a robot route planning problem;it utilizes good-point-set to initialize population spaces,redefine novel evolution model and particle evolution ability,and introduce near-neighbor local search strategy in order to enhance search capability.Finally,spatial orthogonal allocation and heterogeneous cultural hybrid algorithm (SOAHCHA) are verified by simulation analysis and MORCS2 planning experiments;those results show that the proposed algorithm is efficient because of its successful performance and balanced allocation.展开更多
The scale expansion of the space information networks(SINs)makes the demands for tacking,telemetry and command(TT&C)missions increase dramatically.An increasing number of missions and a sharp conflict of resources...The scale expansion of the space information networks(SINs)makes the demands for tacking,telemetry and command(TT&C)missions increase dramatically.An increasing number of missions and a sharp conflict of resources make it much more challenging to schedule missions reasonably.In order to ensure both the mission completion rate of the high concurrent emergency missions and the performance of regular missions,a conflict degree scheduling algorithm based on transfer strategy(CDSA-TS)is proposed concurrently reconfiguring multi-dimensional resources reasonably.Furthermore,we design an emergency mission planning algorithm based on simulated annealing algorithm(EMPA-SA)to increase the probability of jumping out of the trap through the iterative neighborhood searching strategy and destabilization.Finally,we design a simulation system to verify the network performance in terms of the integrated weights of completed missions and the time consumption of the proposed algorithms.We also investigate the impact of the scheduling strategy for emergency missions on regular missions to improve the overall network performance,which provides guidance for emergency mission planning in the future for the large scale constellation oriented SINs.展开更多
Multi-robot mission planning is composed of assignment allocation and mobile-robot route planning in this paper.Multi-robot exploration missions adopts fuzzy c-mean(FCM)algorithm to allocate,and then,heterogeneous int...Multi-robot mission planning is composed of assignment allocation and mobile-robot route planning in this paper.Multi-robot exploration missions adopts fuzzy c-mean(FCM)algorithm to allocate,and then,heterogeneous interactive cultural hybrid algorithm(HICHA)is devised for route planning in order to optimize mobilerobot execution path.Meanwhile,we design multi-robot mission replanning mechanism based on the rules system of greedy algorithm for dynamic stochastic increment missions.Finally,extensive simulation experiments were shown that FCM for assignment allocation and HICHA for route planning were efficacious for mobile-robot exploration mission planning.Furthermore,the improved greedy algorithm based on experience rules met dynamic stochastic increment missions replanning requirement for load balance.展开更多
Improvement of integrated battlefield situational awareness in complex environments involving dynamic factors such as restricted communications and electromagnetic interference(EMI)has become a contentious research pr...Improvement of integrated battlefield situational awareness in complex environments involving dynamic factors such as restricted communications and electromagnetic interference(EMI)has become a contentious research problem.In certain mission environments,due to the impact of many interference sources on real-time communication or mission requirements such as the need to implement communication regulations,the mission stages are represented as a dynamic combination of several communication-available and communication-unavailable stages.Furthermore,the data interaction between unmanned aerial vehicles(UAVs)can only be performed in specific communication-available stages.Traditional cooperative search algorithms cannot handle such situations well.To solve this problem,this study constructed a distributed model predictive control(DMPC)architecture for a collaborative control of UAVs and used the Voronoi diagram generation method to re-plan the search areas of all UAVs in real time to avoid repetition of search areas and UAV collisions while improving the search efficiency and safety factor.An attention mechanism ant-colony optimization(AACO)algorithm is proposed for UAV search-control decision planning.The search strategy is adaptively updated by introducing an attention mechanism for regular instruction information,a priori information,and emergent information of the mission to satisfy different search expectations to the maximum extent.Simulation results show that the proposed algorithm achieves better search performance than traditional algorithms in restricted communication constraint scenarios.展开更多
According to the characteristic of cruise missiles,navigation point setting is simplified,and the principle of route planning for saturation attack and a concept of reference route are put forward.With the help of the...According to the characteristic of cruise missiles,navigation point setting is simplified,and the principle of route planning for saturation attack and a concept of reference route are put forward.With the help of the shortest-tangent idea in route-planning and the algorithm of back reasoning from targets,a reference route algorithm is built on the shortest range and threat avoidance.Then a route-flight-time algorithm is built on navigation points.Based on the conditions of multi-direction saturation attack,a route planning algorithm of multi-direction saturation attack is built on reference route,route-flight-time,and impact azimuth.Simulation results show that the algorithm can realize missiles fired in a salvo launch reaching the target simultaneously from different directions while avoiding threat.展开更多
Unmanned combat air vehicles(UCAVs) mission planning is a fairly complicated global optimum problem. Military attack missions often employ a fleet of UCAVs equipped with weapons to attack a set of known targets. A UCA...Unmanned combat air vehicles(UCAVs) mission planning is a fairly complicated global optimum problem. Military attack missions often employ a fleet of UCAVs equipped with weapons to attack a set of known targets. A UCAV can carry different weapons to accomplish different combat missions. Choice of different weapons will have different effects on the final combat effectiveness. This work presents a mixed integer programming model for simultaneous weapon configuration and route planning of UCAVs, which solves the problem optimally using the IBM ILOG CPLEX optimizer for simple missions. This paper develops a heuristic algorithm to handle the medium-scale and large-scale problems. The experiments demonstrate the performance of the heuristic algorithm in solving the medium scale and large scale problems. Moreover, we give suggestions on how to select the most appropriate algorithm to solve different scale problems.展开更多
In order to solve the current situation that unmanned aerial vehicles(UAVs)ignore safety indicators and cannot guarantee safe operation when operating in low-altitude airspace,a UAV route planning method that consider...In order to solve the current situation that unmanned aerial vehicles(UAVs)ignore safety indicators and cannot guarantee safe operation when operating in low-altitude airspace,a UAV route planning method that considers regional risk assessment is proposed.Firstly,the low-altitude airspace is discretized based on rasterization,and then the UAV operating characteristics and environmental characteristics are combined to quantify the risk value in the low-altitude airspace to obtain a 3D risk map.The path risk value is taken as the cost,the particle swarm optimization-beetle antennae search(PSO-BAS)algorithm is used to plan the spatial 3D route,and it effectively reduces the generated path redundancy.Finally,cubic B-spline curve is used to smooth the planned discrete path.A flyable path with continuous curvature and pitch angle is generated.The simulation results show that the generated path can exchange for a path with a lower risk value at a lower path cost.At the same time,the path redundancy is low,and the curvature and pitch angle continuously change.It is a flyable path that meets the UAV performance constraints.展开更多
Unmanned aerial vehicle(UAV) resource scheduling means to allocate and aggregate the available UAV resources depending on the mission requirements and the battlefield situation assessment.In previous studies,the mod...Unmanned aerial vehicle(UAV) resource scheduling means to allocate and aggregate the available UAV resources depending on the mission requirements and the battlefield situation assessment.In previous studies,the models cannot reflect the mission synchronization;the targets are treated respectively,which results in the large scale of the problem and high computational complexity.To overcome these disadvantages,a model for UAV resource scheduling under mission synchronization is proposed,which is based on single-objective non-linear integer programming.And several cooperative teams are aggregated for the target clusters from the available resources.The evaluation indices of weapon allocation are referenced in establishing the objective function and the constraints for the issue.The scales of the target clusters are considered as the constraints for the scales of the cooperative teams to make them match in scale.The functions of the intersection between the "mission time-window" and the UAV "arrival time-window" are introduced into the objective function and the constraints in order to describe the mission synchronization effectively.The results demonstrate that the proposed expanded model can meet the requirement of mission synchronization,guide the aggregation of cooperative teams for the target clusters and control the scale of the problem effectively.展开更多
This study concentrates of the new generation of the agile (AEOS). AEOS is a key study object on management problems earth observation satellite in many countries because of its many advantages over non-agile satell...This study concentrates of the new generation of the agile (AEOS). AEOS is a key study object on management problems earth observation satellite in many countries because of its many advantages over non-agile satellites. Hence, the mission planning and scheduling of AEOS is a popular research problem. This research investigates AEOS characteristics and establishes a mission planning model based on the working principle and constraints of AEOS as per analysis. To solve the scheduling issue of AEOS, several improved algorithms are developed. Simulation results suggest that these algorithms are effective.展开更多
Recently, if you look at the trend of the Unmanned Combat Entities (UCE) on the world that are actually operational, a large number of personnel per one UCE has been operating the GCS. However, UCEs to perform the att...Recently, if you look at the trend of the Unmanned Combat Entities (UCE) on the world that are actually operational, a large number of personnel per one UCE has been operating the GCS. However, UCEs to perform the attack/reconnaissance mission are very expensive assets and require a considerable amount of time to train for UCE operations. Accordingly, the future battlefield environment has become important to develop multiple UCE ground control station. In this study, we developed a multiple UCE GCS that one operator can operate up to four UCEs. The software was built with a total of 6 displays using a Lockheed Martin Corporation’s prepar3D. Scenario of research takes into account the operation of the South Korea-type future multiple UCEs, to take advantage of the simulation system, in this paper, we propose for each of the concepts and technologies.展开更多
Airborne landing with shipboard helicopters gradually replaces surface landing to dominate joint amphibious operations.A problem with shipboard helicopter mission planning is conducted in the context of amphibious ope...Airborne landing with shipboard helicopters gradually replaces surface landing to dominate joint amphibious operations.A problem with shipboard helicopter mission planning is conducted in the context of amphibious operations.First,the typical missions of shipborne helicopters in amphibious operations are analyzed.An Amphibious Operational Mission Planning Model for Shipboard Helicopters(AOMPMSH)is established,with the objectives of minimizing the completion time of the amphibious campaign and minimizing troop and helicopter losses,taking the available operational resources and the order of the mission sub-phases into account.Then,a simulationbased amphibious operations effectiveness assessment model is constructed to calculate the optimization objectives of AOMPMSH by simulating the campaign development with an amphibious objective area situation transfer model and simulating the engagement process with a modified Lanchester model.A reference point based multi-objective optimization algorithm is designed to solve the proposed AOMPMSH.The population iteration mechanism employs an initial population generation method and a local search method to solve the problem of vast definition space.The population ranking selection mechanism employs a population distribution based reference point generation method to solve the problem of population irregular distribution.Finally,a simulation case with the background of a battalion-scaled amphibious campaign is presented.The calculation results verify the rationality of the proposed model and the superiority of the designed algorithm and have some reference value for the operational applications of shipboard helicopters in amphibious operations.展开更多
文摘Space emergency launching is to send a satellite into space by using a rapid responsive solid rocket in the bounded time to implement the emergency Earth observation mission.The key and difficult points mainly include the business process construction of launching mission planning,validation of the effectiveness of the launching scheme,etc.This paper pro-poses the agile space emergency launching mission planning simulation and verification method,which systematically con-structs the overall technical framework of space emergency launching mission planning with multi-field area,multi-platform and multi-task parallel under the constraint of resource schedul-ing for the first time.It supports flexible reconstruction of mis-sion planning processes such as launching target planning,tra-jectory planning,path planning,action planning and launching time analysis,and can realize on-demand assembly of operation links under different mission scenarios and different plan condi-tions,so as to quickly modify and generate launching schemes.It supports the fast solution of rocket trajectory data and the accurate analysis of multi-point salvo time window recheck and can realize the fast conflict resolution of launching missions in the dimensions of launching position and launching window sequence.It supports lightweight scenario design,modular flexi-ble simulation,based on launching style,launching platform,launching rules,etc.,can realize the independent mapping of mission planning results to two-dimensional and three-dimen-sional visual simulation models,so as to achieve a smooth con-nection between mission planning and simulation.
基金supported by the National Natural Science Foundation of China(61502534)the Shaanxi Provincial Natural Science Foundation(2020JQ-493)+2 种基金the Integrative Equipment Research Project of Armed Police Force(WJ20211A030018)the Military Science Project of the National Social Science Fund(WJ2019-SKJJ-C-092)the Theoretical Research Foundation of Armed Police Engineering University(WJY202148)。
文摘Cooperative search-attack is an important application of unmanned aerial vehicle(UAV)swarm in military field.The coupling between path planning and task allocation,the heterogeneity of UAVs,and the dynamic nature of task environment greatly increase the complexity and difficulty of the UAV swarm cooperative search-attack mission planning problem.Inspired by the collaborative hunting behavior of wolf pack,a distributed selforganizing method for UAV swarm search-attack mission planning is proposed.First,to solve the multi-target search problem in unknown environments,a wolf scouting behavior-inspired cooperative search algorithm for UAV swarm is designed.Second,a distributed self-organizing task allocation algorithm for UAV swarm cooperative attacking of targets is proposed by analyzing the flexible labor division behavior of wolves.By abstracting the UAV as a simple artificial wolf agent,the flexible motion planning and group task coordinating for UAV swarm can be realized by self-organizing.The effectiveness of the proposed method is verified by a set of simulation experiments,the stability and scalability are evaluated,and the integrated solution for the coupled path planning and task allocation problems for the UAV swarm cooperative search-attack task can be well performed.
基金the National Key Research and Development Program of China(Grant No.2016YFB0500801)sponsored by Qing Lan Project.
文摘Satellite observation schedule is investigated in this paper.A mission planning algorithm of task clustering is proposed to improve the observation efficiency of agile satellite.The newly developed method can make the satellite observe more targets and therefore save observation resources.First,for the densely distributed target points,a preprocessing scheme based on task clustering is proposed.The target points are clustered according to the distance condition.Second,the local observation path is generated by Tabu algorithm in the inner layer of cluster regions.Third,considering the scatter and cluster sets,the global observation path is obtained by adopting Tabu algorithm in the outer layer.Simulation results show that the algorithm can effectively reduce the task planning time of large-scale point targets while ensuring the optimal solution quality.
基金Sponsored by the National Natural Science Foundation of China(Grant No.70601035 and 70801062)
文摘This paper concerns the mission scheduling problem for an agile Earth-observing satellite. Mission planning and action planning for the satellite are both taking into account. Multiple mission types( including multi-strip area,real time download request,and stereoscopic request) and complex satellite actions,such as observe action and data download action,are considered in this paper. Through reasonable analysis of specialties and operational constraints of agile satellites in observing process,the mission scheduling model under multiple objective conditions is constructed. A genetic algorithm combined with heuristic rules is designed to solve problem. Genetic algorithm is designed to arrange user missions and heuristic rules are used to arrange satellite actions. Experiment results suggest that our algorithm works well for the agile Earth-observing satellite scheduling problem.
基金supported by the National Natural Science Foundation of China(11402295)the Science Project of National University of Defense Technology(JC14-01-05)the Hunan Provincial Natural Science Foundation of China(2015JJ3020)
文摘This paper studies the problem of the space station short-term mission planning, which aims to allocate the executing time of missions effectively, schedule the corresponding resources reasonably and arrange the time of the astronauts properly. A domain model is developed by using the ontology theory to describe the concepts, constraints and relations of the planning domain formally, abstractly and normatively. A method based on time iteration is adopted to solve the short-term planning problem. Meanwhile, the resolving strategies are proposed to resolve different kinds of conflicts induced by the constraints of power, heat, resource, astronaut and relationship. The proposed approach is evaluated in a test case with fifteen missions, thirteen resources and three astronauts. The results show that the developed domain ontology model is reasonable, and the time iteration method using the proposed resolving strategies can successfully obtain the plan satisfying all considered constraints.
文摘Reconnaissance mission planning of multiple unmanned aerial vehicles(UAVs)under an adversarial environment is a discrete combinatorial optimization problem which is proved to be a non-deterministic polynomial(NP)-complete problem.The purpose of this study is to research intelligent multiUAVs reconnaissance mission planning and online re-planning algorithm under various constraints in mission areas.For numerous targets scattered in the wide area,a reconnaissance mission planning and re-planning system is established,which includes five modules,including intelligence analysis,sub-mission area division,mission sequence planning,path smoothing,and online re-planning.The intelligence analysis module depicts the attribute of targets and the heterogeneous characteristic of UAVs and computes the number of sub-mission areas on consideration of voyage distance constraints.In the sub-mission area division module,an improved K-means clustering algorithm is designed to divide the reconnaissance mission area into several sub-mission areas,and each sub-mission is detected by the UAV loaded with various detective sensors.To control reconnaissance cost,the sampling and iteration algorithms are proposed in the mission sequence planning module,which are utilized to solve the optimal or approximately optimal reconnaissance sequence.In the path smoothing module,the Dubins curve is applied to smooth the flight path,which assure the availability of the planned path.Furthermore,an online re-planning algorithm is designed for the uncertain factor that the UAV is damaged.Finally,reconnaissance planning and re-planning experiment results show that the algorithm proposed in this paper are effective and the algorithms designed for sequence planning have a great advantage in solving efficiency and optimality.
基金This work was supported in part by the National Natural Science Foundation of China(62271097,U23A20279).
文摘Unmanned aerial vehicles(UAVs)are increasingly applied in various mission scenarios for their versatility,scalability and cost-effectiveness.In UAV mission planning systems(UMPSs),an efficient mission planning strategy is essential to meet the requirements of UAV missions.However,rapidly changing environments and unforeseen threats pose challenges to UMPSs,making efficient mission planning difficult.To address these challenges,knowledge graph technology can be utilized to manage the complex relations and constraints among UAVs,missions,and environments.This paper investigates knowledge graph application in UMPSs,exploring its modeling,representation,and storage concepts and methodologies.Subsequently,the construction of a specialized knowledge graph for UMPS is detailed.Furthermore,the paper delves into knowledge reasoning within UMPSs,emphasizing its significance in timely updates in the dynamic environment.A graph neural network(GNN)-based approach is proposed for knowledge reasoning,leveraging GNNs to capture structural information and accurately predict missing entities or relations in the knowledge graph.For relation reasoning,path information is also incorporated to improve the accuracy of inference.To account for the temporal dynamics of the environment in UMPS,the influence of timestamps is captured through the attention mechanism.The effectiveness and applicability of the proposed knowledge reasoning method are verified via simulations.
基金supportes by the National Nature Science Foundation o f China (71771215,62122093)。
文摘Unmanned air vehicles(UAVs) have been regularly employed in modern wars to conduct different missions. Instead of addressing mission planning and route planning separately,this study investigates the issue of joint mission and route planning for a fleet of UAVs. The mission planning determines the configuration of weapons in UAVs and the weapons to attack targets, while the route planning determines the UAV’s visiting sequence for the targets. The problem is formulated as an integer linear programming model. Due to the inefficiency of CPLEX on large scale optimization problems, an effective learningbased heuristic, namely, population based adaptive large neighborhood search(P-ALNS), is proposed to solve the model. In P-ALNS, seven neighborhood structures are designed and adaptively utilized in terms of their historical performance. The effectiveness and superiority of the proposed model and algorithm are demonstrated on test instances of small, medium and large sizes. In particular, P-ALNS achieves comparable solutions or as good as those of CPLEX on small-size(20 targets)instances in much shorter time.
基金supported in part by National Natural Science Foundation of China (Nos. 61741313, 61673209, and 61533008)Jiangsu Six Peak of Talents Program, China (No. KTHY-027)Postgraduate Research & Practice Innovation Program of Jiangsu Province, China (No. KYCX18_0303)
文摘This article studies the cooperative search-attack mission problem with dynamic targets and threats, and presents a Distributed Intelligent Self-Organized Mission Planning(DISOMP)algorithm for multiple Unmanned Aerial Vehicles(multi-UAV). The DISOMP algorithm can be divided into four modules: a search module designed based on the distributed Ant Colony Optimization(ACO) algorithm, an attack module designed based on the Parallel Approach(PA)scheme, a threat avoidance module designed based on the Dubins Curve(DC) and a communication module designed for information exchange among the multi-UAV system and the dynamic environment. A series of simulations of multi-UAV searching and attacking the moving targets are carried out, in which the search-attack mission completeness, execution efficiency and system suitability of the DISOMP algorithm are analyzed. The simulation results exhibit that the DISOMP algorithm based on online distributed down-top strategy is characterized by good flexibility, scalability and adaptability, in the dynamic targets searching and attacking problem.
基金supported by the National Natural Science Foundation of China (No. 90820302)the Research Fund for the Doctoral Program of Higher Education (No. 200805330005)+1 种基金Hunan S & T Funds (No. 06IJY3035)the Postdoctoral Science Foundation of Central South University
文摘A spatial orthogonal allocation method is devised for multirobot tasks allocation.A 3D space model is adopted to describe exploration mission;meanwhile spatial orthogonal tentative technology is utilized to update the attractor position for load balance.Heterogeneous interactive cultural hybrid architecture is proposed to solve a robot route planning problem;it utilizes good-point-set to initialize population spaces,redefine novel evolution model and particle evolution ability,and introduce near-neighbor local search strategy in order to enhance search capability.Finally,spatial orthogonal allocation and heterogeneous cultural hybrid algorithm (SOAHCHA) are verified by simulation analysis and MORCS2 planning experiments;those results show that the proposed algorithm is efficient because of its successful performance and balanced allocation.
基金the Natural Science Foundation of China under Grant U19B2025 and Grant 62001347China Postdoctoral Science Foundation under Grant 2019TQ0241 and Grant 2020M673344the Fundamental Research Funds for the Central Universities under Grant XJS200117。
文摘The scale expansion of the space information networks(SINs)makes the demands for tacking,telemetry and command(TT&C)missions increase dramatically.An increasing number of missions and a sharp conflict of resources make it much more challenging to schedule missions reasonably.In order to ensure both the mission completion rate of the high concurrent emergency missions and the performance of regular missions,a conflict degree scheduling algorithm based on transfer strategy(CDSA-TS)is proposed concurrently reconfiguring multi-dimensional resources reasonably.Furthermore,we design an emergency mission planning algorithm based on simulated annealing algorithm(EMPA-SA)to increase the probability of jumping out of the trap through the iterative neighborhood searching strategy and destabilization.Finally,we design a simulation system to verify the network performance in terms of the integrated weights of completed missions and the time consumption of the proposed algorithms.We also investigate the impact of the scheduling strategy for emergency missions on regular missions to improve the overall network performance,which provides guidance for emergency mission planning in the future for the large scale constellation oriented SINs.
基金This work was supported in part by the National Natural Science Foundation of China(Grant No.90820302)the Research Fund for the Doctoral Program of Higher Education(No.200805330005)Hunan S&T Funds(No.06IJY3035).
文摘Multi-robot mission planning is composed of assignment allocation and mobile-robot route planning in this paper.Multi-robot exploration missions adopts fuzzy c-mean(FCM)algorithm to allocate,and then,heterogeneous interactive cultural hybrid algorithm(HICHA)is devised for route planning in order to optimize mobilerobot execution path.Meanwhile,we design multi-robot mission replanning mechanism based on the rules system of greedy algorithm for dynamic stochastic increment missions.Finally,extensive simulation experiments were shown that FCM for assignment allocation and HICHA for route planning were efficacious for mobile-robot exploration mission planning.Furthermore,the improved greedy algorithm based on experience rules met dynamic stochastic increment missions replanning requirement for load balance.
基金the support of the National Natural Science Foundation of China(Grant No.62076204)the Seed Foundation of Innovation and Creation for Graduate Students in Northwestern Polytechnical University(Grant No.CX2020019)in part by the China Postdoctoral Science Foundation(Grants No.2021M700337)。
文摘Improvement of integrated battlefield situational awareness in complex environments involving dynamic factors such as restricted communications and electromagnetic interference(EMI)has become a contentious research problem.In certain mission environments,due to the impact of many interference sources on real-time communication or mission requirements such as the need to implement communication regulations,the mission stages are represented as a dynamic combination of several communication-available and communication-unavailable stages.Furthermore,the data interaction between unmanned aerial vehicles(UAVs)can only be performed in specific communication-available stages.Traditional cooperative search algorithms cannot handle such situations well.To solve this problem,this study constructed a distributed model predictive control(DMPC)architecture for a collaborative control of UAVs and used the Voronoi diagram generation method to re-plan the search areas of all UAVs in real time to avoid repetition of search areas and UAV collisions while improving the search efficiency and safety factor.An attention mechanism ant-colony optimization(AACO)algorithm is proposed for UAV search-control decision planning.The search strategy is adaptively updated by introducing an attention mechanism for regular instruction information,a priori information,and emergent information of the mission to satisfy different search expectations to the maximum extent.Simulation results show that the proposed algorithm achieves better search performance than traditional algorithms in restricted communication constraint scenarios.
基金supported by the Aeronautical Science Foundation of China (20085584010)
文摘According to the characteristic of cruise missiles,navigation point setting is simplified,and the principle of route planning for saturation attack and a concept of reference route are put forward.With the help of the shortest-tangent idea in route-planning and the algorithm of back reasoning from targets,a reference route algorithm is built on the shortest range and threat avoidance.Then a route-flight-time algorithm is built on navigation points.Based on the conditions of multi-direction saturation attack,a route planning algorithm of multi-direction saturation attack is built on reference route,route-flight-time,and impact azimuth.Simulation results show that the algorithm can realize missiles fired in a salvo launch reaching the target simultaneously from different directions while avoiding threat.
基金supported by the National Natural Science Foundation of China(7147117571471174)
文摘Unmanned combat air vehicles(UCAVs) mission planning is a fairly complicated global optimum problem. Military attack missions often employ a fleet of UCAVs equipped with weapons to attack a set of known targets. A UCAV can carry different weapons to accomplish different combat missions. Choice of different weapons will have different effects on the final combat effectiveness. This work presents a mixed integer programming model for simultaneous weapon configuration and route planning of UCAVs, which solves the problem optimally using the IBM ILOG CPLEX optimizer for simple missions. This paper develops a heuristic algorithm to handle the medium-scale and large-scale problems. The experiments demonstrate the performance of the heuristic algorithm in solving the medium scale and large scale problems. Moreover, we give suggestions on how to select the most appropriate algorithm to solve different scale problems.
基金supported by the National Natural Science Foundation of China(61601497)the Natural Science Basic Research Plan in Shaanxi Province of China(2022JM-412)the Air Force Engineering University Principal Fund(XZJ2020005).
文摘In order to solve the current situation that unmanned aerial vehicles(UAVs)ignore safety indicators and cannot guarantee safe operation when operating in low-altitude airspace,a UAV route planning method that considers regional risk assessment is proposed.Firstly,the low-altitude airspace is discretized based on rasterization,and then the UAV operating characteristics and environmental characteristics are combined to quantify the risk value in the low-altitude airspace to obtain a 3D risk map.The path risk value is taken as the cost,the particle swarm optimization-beetle antennae search(PSO-BAS)algorithm is used to plan the spatial 3D route,and it effectively reduces the generated path redundancy.Finally,cubic B-spline curve is used to smooth the planned discrete path.A flyable path with continuous curvature and pitch angle is generated.The simulation results show that the generated path can exchange for a path with a lower risk value at a lower path cost.At the same time,the path redundancy is low,and the curvature and pitch angle continuously change.It is a flyable path that meets the UAV performance constraints.
文摘Unmanned aerial vehicle(UAV) resource scheduling means to allocate and aggregate the available UAV resources depending on the mission requirements and the battlefield situation assessment.In previous studies,the models cannot reflect the mission synchronization;the targets are treated respectively,which results in the large scale of the problem and high computational complexity.To overcome these disadvantages,a model for UAV resource scheduling under mission synchronization is proposed,which is based on single-objective non-linear integer programming.And several cooperative teams are aggregated for the target clusters from the available resources.The evaluation indices of weapon allocation are referenced in establishing the objective function and the constraints for the issue.The scales of the target clusters are considered as the constraints for the scales of the cooperative teams to make them match in scale.The functions of the intersection between the "mission time-window" and the UAV "arrival time-window" are introduced into the objective function and the constraints in order to describe the mission synchronization effectively.The results demonstrate that the proposed expanded model can meet the requirement of mission synchronization,guide the aggregation of cooperative teams for the target clusters and control the scale of the problem effectively.
基金supported by the National Natural Science Foundation of China(7127106671171065+1 种基金71202168)the Natural Science Foundation of Heilongjiang Province(GC13D506)
文摘This study concentrates of the new generation of the agile (AEOS). AEOS is a key study object on management problems earth observation satellite in many countries because of its many advantages over non-agile satellites. Hence, the mission planning and scheduling of AEOS is a popular research problem. This research investigates AEOS characteristics and establishes a mission planning model based on the working principle and constraints of AEOS as per analysis. To solve the scheduling issue of AEOS, several improved algorithms are developed. Simulation results suggest that these algorithms are effective.
文摘Recently, if you look at the trend of the Unmanned Combat Entities (UCE) on the world that are actually operational, a large number of personnel per one UCE has been operating the GCS. However, UCEs to perform the attack/reconnaissance mission are very expensive assets and require a considerable amount of time to train for UCE operations. Accordingly, the future battlefield environment has become important to develop multiple UCE ground control station. In this study, we developed a multiple UCE GCS that one operator can operate up to four UCEs. The software was built with a total of 6 displays using a Lockheed Martin Corporation’s prepar3D. Scenario of research takes into account the operation of the South Korea-type future multiple UCEs, to take advantage of the simulation system, in this paper, we propose for each of the concepts and technologies.
文摘Airborne landing with shipboard helicopters gradually replaces surface landing to dominate joint amphibious operations.A problem with shipboard helicopter mission planning is conducted in the context of amphibious operations.First,the typical missions of shipborne helicopters in amphibious operations are analyzed.An Amphibious Operational Mission Planning Model for Shipboard Helicopters(AOMPMSH)is established,with the objectives of minimizing the completion time of the amphibious campaign and minimizing troop and helicopter losses,taking the available operational resources and the order of the mission sub-phases into account.Then,a simulationbased amphibious operations effectiveness assessment model is constructed to calculate the optimization objectives of AOMPMSH by simulating the campaign development with an amphibious objective area situation transfer model and simulating the engagement process with a modified Lanchester model.A reference point based multi-objective optimization algorithm is designed to solve the proposed AOMPMSH.The population iteration mechanism employs an initial population generation method and a local search method to solve the problem of vast definition space.The population ranking selection mechanism employs a population distribution based reference point generation method to solve the problem of population irregular distribution.Finally,a simulation case with the background of a battalion-scaled amphibious campaign is presented.The calculation results verify the rationality of the proposed model and the superiority of the designed algorithm and have some reference value for the operational applications of shipboard helicopters in amphibious operations.