With applying the information technology to the military field, the advantages and importance of the networked combat are more and more obvious. In order to make full use of limited battlefield resources and maximally...With applying the information technology to the military field, the advantages and importance of the networked combat are more and more obvious. In order to make full use of limited battlefield resources and maximally destroy enemy targets from arbitrary angle in a limited time, the research on firepower nodes dynamic deployment becomes a key problem of command and control. Considering a variety of tactical indexes and actual constraints in air defense, a mathematical model is formulated to minimize the enemy target penetration probability. Based on characteristics of the mathematical model and demands of the deployment problems, an assistance-based algorithm is put forward which combines the artificial potential field （APF） method with a memetic algorithm. The APF method is employed to solve the constraint handling problem and generate feasible solutions. The constrained optimization problem transforms into an optimization problem of APF parameters adjustment, and the dimension of the problem is reduced greatly. The dynamic deployment is accomplished by generation and refinement of feasible solutions. The simulation results show that the proposed algorithm is effective and feasible in dynamic situation.展开更多
Fourier transform ion cyclotron resonance mass spectrometry (FT-ICR-MS) was used to determine the structures of anhydroicaritin glycosides by the MS/MS experiments of anhydroicaritin glycosides and their methylated de...Fourier transform ion cyclotron resonance mass spectrometry (FT-ICR-MS) was used to determine the structures of anhydroicaritin glycosides by the MS/MS experiments of anhydroicaritin glycosides and their methylated derivatives. With high accuracy FT-ICR-MS provides much information about the structures of compounds, FT-ICR-MS shows the great potential application in the structural characterization of unknown compounds.展开更多
The multi-point dynamic aggregation(MPDA)problem is a challenging real-world problem.In the MPDA problem,the demands of tasks keep changing with their inherent incremental rates,while a heterogeneous robot fleet is re...The multi-point dynamic aggregation(MPDA)problem is a challenging real-world problem.In the MPDA problem,the demands of tasks keep changing with their inherent incremental rates,while a heterogeneous robot fleet is required to travel between these tasks to change the time-varying state of each task.The robots are allowed to collaborate on the same task or work separately until all tasks are completed.It is challenging to generate an effective task execution plan due to the tight coupling between robots abilities and tasks'incremental rates,and the complexity of robot collaboration.For effectiveness consideration,we use the variable length encoding to avoid redundancy in the solution space.We creatively use the adaptive large neighborhood search(ALNS)framework to solve the MPDA problem.In the proposed algorithm,high-quality initial solutions are generated through multiple problem-specific solution construction heuristics.These heuristics are also used to fix the broken solution in the novel integrated decoding-construction repair process of the ALNS framework.The results of statistical analysis by the Wilcoxon rank-sum test demonstrate that the proposed ALNS can obtain better task execution plans than some state-of-the-art algorithms in most MPDA instances.展开更多
Salvo attacking a surface target by multiple missiles is an effective tactic to enhance the lethality and penetrate the defense system. However, existing cooperative guidance laws in the midcourse or terminal course a...Salvo attacking a surface target by multiple missiles is an effective tactic to enhance the lethality and penetrate the defense system. However, existing cooperative guidance laws in the midcourse or terminal course are not suitable for long-and medium-range missiles or stand-off attacking. Because the initial conditions of cooperative terminal guidance that are generally generated from the mid-course flight may not lead to a successful cooperative terminal guidance without proper mid-course flight adjustment. Meanwhile, cooperative guidance in the mid-course cannot solely guarantee the accuracy of a simultaneous arrival of multiple missiles. Therefore, a joint mid-course and terminal course cooperative guidance law is developed. By building a distinct leader-follower framework, this paper proposes an efficient coordinated Dubins path planning method to synchronize the arrival time of all engaged missiles in the mid-course flight. The planned flight can generate proper initial conditions for cooperative terminal guidance, and also benefit an earliest simultaneous arrival. In the terminal course, an existing cooperative proportional navigation guidance law guides all the engaged missiles to arrive at a target accurately and simultaneously.The integrated guidance law for an intuitive application is summarized. Simulations demonstrate that the proposed method can generate fast and accurate salvo attack.展开更多
As a cutting-edge branch of unmanned aerial vehicle(UAV)technology,the cooperation of a group of UAVs has attracted increasing attention from both civil and military sectors,due to its remarkable merits in functionali...As a cutting-edge branch of unmanned aerial vehicle(UAV)technology,the cooperation of a group of UAVs has attracted increasing attention from both civil and military sectors,due to its remarkable merits in functionality and flexibility for accomplishing complex extensive tasks,e.g.,search and rescue,fire-fighting,reconnaissance,and surveillance.Cooperative path planning(CPP)is a key problem for a UAV group in executing tasks collectively.In this paper,an attempt is made to perform a comprehensive review of the research on CPP for UAV groups.First,a generalized optimization framework of CPP problems is proposed from the viewpoint of three key elements,i.e.,task,UAV group,and environment,as a basis for a comprehensive classification of different types of CPP problems.By following the proposed framework,a taxonomy for the classification of existing CPP problems is proposed to describe different kinds of CPPs in a unified way.Then,a review and a statistical analysis are presented based on the taxonomy,emphasizing the coordinative elements in the existing CPP research.In addition,a collection of challenging CPP problems are provided to highlight future research directions.展开更多
The multi-robot coverage motion planning(MCMP) problem in which every reachable area must be covered is common in multi-robot systems. To deal with the MCMP problem, we propose an efficient, complete, and off-line alg...The multi-robot coverage motion planning(MCMP) problem in which every reachable area must be covered is common in multi-robot systems. To deal with the MCMP problem, we propose an efficient, complete, and off-line algorithm, named the "auction-based spanning tree coverage(A-STC)" algorithm. First, the configuration space is divided into mega cells whose size is twice the minimum coverage range of a robot. Based on connection relationships among mega cells, a graph structure can be obtained. A robot that circumnavigates a spanning tree of the graph can generate a coverage trajectory. Then, the proposed algorithm adopts an auction mechanism to construct one spanning tree for each robot. In this mechanism, an auctioneer robot chooses a suitable vertex of the graph as an auction item from neighboring vertexes of its spanning tree by heuristic rules. A bidder robot submits a proper bid to the auctioneer according to the auction vertexes' relationships with the spanning tree of the robot and the estimated length of its trajectory. The estimated length is calculated based on vertexes and edges in the spanning tree. The bidder with the highest bid is selected as a winner to reduce the makespan of the coverage task. After auction processes, acceptable coverage trajectories can be planned rapidly. Computational experiments validate the effectiveness of the proposed MCMP algorithm and the method for estimating trajectory lengths. The proposed algorithm is also compared with the state-of-the-art algorithms. The comparative results show that the A-STC algorithm has apparent advantages in terms of the running time and the makespan for large crowded configuration spaces.展开更多
In this paper, we present some modules over the rank-three quantized Weyl algebra, which are closely related to modules over some vertex algebras. The isomorphism classes among these modules are also determined.
The sparrow search algorithm(SSA) is a recent meta-heuristic optimization approach with the advantages of simplicity and flexibility. However, SSA still faces challenges of premature convergence and imbalance between ...The sparrow search algorithm(SSA) is a recent meta-heuristic optimization approach with the advantages of simplicity and flexibility. However, SSA still faces challenges of premature convergence and imbalance between exploration and exploitation, especially when tackling multimodal optimization problems. Aiming to deal with the above problems, we propose an enhanced variant of SSA called the multi-strategy enhanced sparrow search algorithm(MSSSA) in this paper. First, a chaotic map is introduced to obtain a high-quality initial population for SSA, and the opposition-based learning strategy is employed to increase the population diversity. Then, an adaptive parameter control strategy is designed to accommodate an adequate balance between exploration and exploitation. Finally, a hybrid disturbance mechanism is embedded in the individual update stage to avoid falling into local optima. To validate the effectiveness of the proposed MSSSA, a large number of experiments are implemented, including 40 complex functions from the IEEE CEC2014 and IEEE CEC2019 test suites and 10 classical functions with different dimensions. Experimental results show that the MSSSA achieves competitive performance compared with several state-of-the-art optimization algorithms. The proposed MSSSA is also successfully applied to solve two engineering optimization problems. The results demonstrate the superiority of the MSSSA in addressing practical problems.展开更多
This paper addresses an unmanned aerial vehicle (UAV) path planning problem for a team of cooperating heterogeneous vehicles composed of one UAV and multiple unmanned ground vehicles (UGVs). The UGVs are used as mobil...This paper addresses an unmanned aerial vehicle (UAV) path planning problem for a team of cooperating heterogeneous vehicles composed of one UAV and multiple unmanned ground vehicles (UGVs). The UGVs are used as mobile actuators and scattered in a large area. To achieve multi-UGV communication and collaboration, the UAV serves as a messenger to fly over all task points to collect the task information and then flies all UGVs to transmit the information about tasks and UGVs. The path planning of messenger UAV is formulated as a precedence-constrained dynamic Dubins traveling salesman problem with neighborhood (PDDTSPN). The goal of this problem is to find the shortest route enabling the UAV to fly over all task points and deliver information to all requested UGVs. When solving this path planning problem, a decoupling strategy is proposed to sequentially and rapidly determine the access sequence in which the UAV visits task points and UGVs as well as the access location of UAV in the com mu nication n eighborhood of each task point and each UGV. The effectiveness of the proposed approach is corroborated through computational experiments on randomly generated instances. The computational results on both small and large in stances dem on strate that the proposed approach can generate high-quality solutions in a reasonable time as compared with two other heuristic algorithms.展开更多
Because of their wide detection range and rich functions,autonomous underwater vehicles(AUVs)are widely used for observing the marine environment,for exploring natural resources,for security and defense purposes,and i...Because of their wide detection range and rich functions,autonomous underwater vehicles(AUVs)are widely used for observing the marine environment,for exploring natural resources,for security and defense purposes,and in many other fields of interest.Compared with a single AUV,a multi-AUV formation can better perform various tasks and adapt to complex underwater environments.With changes in the mission or environment,a change in the UAV formation may also be required.In the last decade,much progress has been made in the transformation of multi-AUV formations.In this paper,we aim to analyze the core concepts of multi-AUV formation transformation;summarize the effects of the AUV model,underwater environment,and communication between AUVs within formations on formation transformation;and elaborate on basic theories and implementation approaches for multi-AUV formation transformation.Moreover,this overview includes a bibliometric analysis of the related literature from multiple perspectives.Finally,some challenging issues and future research directions for multi-AUV formation transformation are highlighted.展开更多
In this note we classify the compatible left-symmetric superalgebra structures over a super Virasoro type algebra,whose even part is the centerless twisted Heisenberg–Virasoro algebra,with some natural grading condit...In this note we classify the compatible left-symmetric superalgebra structures over a super Virasoro type algebra,whose even part is the centerless twisted Heisenberg–Virasoro algebra,with some natural grading conditions.展开更多
基金supported by the National Outstanding Youth Science Foundation (60925011)the National Natural Science Foundation of China (61203181)
文摘With applying the information technology to the military field, the advantages and importance of the networked combat are more and more obvious. In order to make full use of limited battlefield resources and maximally destroy enemy targets from arbitrary angle in a limited time, the research on firepower nodes dynamic deployment becomes a key problem of command and control. Considering a variety of tactical indexes and actual constraints in air defense, a mathematical model is formulated to minimize the enemy target penetration probability. Based on characteristics of the mathematical model and demands of the deployment problems, an assistance-based algorithm is put forward which combines the artificial potential field （APF） method with a memetic algorithm. The APF method is employed to solve the constraint handling problem and generate feasible solutions. The constrained optimization problem transforms into an optimization problem of APF parameters adjustment, and the dimension of the problem is reduced greatly. The dynamic deployment is accomplished by generation and refinement of feasible solutions. The simulation results show that the proposed algorithm is effective and feasible in dynamic situation.
基金supported by the National Nalural Scicntilic Foundation of China(No.20035010 and 20l75033).
文摘Fourier transform ion cyclotron resonance mass spectrometry (FT-ICR-MS) was used to determine the structures of anhydroicaritin glycosides by the MS/MS experiments of anhydroicaritin glycosides and their methylated derivatives. With high accuracy FT-ICR-MS provides much information about the structures of compounds, FT-ICR-MS shows the great potential application in the structural characterization of unknown compounds.
基金supported in part by the National Outstanding Youth Talents Support Program(No.61822304)the Basic Science Center Program of the NSFC(No.62088101)+2 种基金the Project of Major International(Regional)Joint Research Program of NSFC(No.61720106011)the Shanghai Municipal Science and Technology Major Project(No.2021SHZDZX0100)the Shanghai Municipal Commission of Science and Technology Project(No.19511132101).
文摘The multi-point dynamic aggregation(MPDA)problem is a challenging real-world problem.In the MPDA problem,the demands of tasks keep changing with their inherent incremental rates,while a heterogeneous robot fleet is required to travel between these tasks to change the time-varying state of each task.The robots are allowed to collaborate on the same task or work separately until all tasks are completed.It is challenging to generate an effective task execution plan due to the tight coupling between robots abilities and tasks'incremental rates,and the complexity of robot collaboration.For effectiveness consideration,we use the variable length encoding to avoid redundancy in the solution space.We creatively use the adaptive large neighborhood search(ALNS)framework to solve the MPDA problem.In the proposed algorithm,high-quality initial solutions are generated through multiple problem-specific solution construction heuristics.These heuristics are also used to fix the broken solution in the novel integrated decoding-construction repair process of the ALNS framework.The results of statistical analysis by the Wilcoxon rank-sum test demonstrate that the proposed ALNS can obtain better task execution plans than some state-of-the-art algorithms in most MPDA instances.
基金supported by the National Natural Science Foundation of China (No.61304215)supported by the Beijing Education Committee Cooperation Building Foundation Project (CSYS100070417)
文摘Salvo attacking a surface target by multiple missiles is an effective tactic to enhance the lethality and penetrate the defense system. However, existing cooperative guidance laws in the midcourse or terminal course are not suitable for long-and medium-range missiles or stand-off attacking. Because the initial conditions of cooperative terminal guidance that are generally generated from the mid-course flight may not lead to a successful cooperative terminal guidance without proper mid-course flight adjustment. Meanwhile, cooperative guidance in the mid-course cannot solely guarantee the accuracy of a simultaneous arrival of multiple missiles. Therefore, a joint mid-course and terminal course cooperative guidance law is developed. By building a distinct leader-follower framework, this paper proposes an efficient coordinated Dubins path planning method to synchronize the arrival time of all engaged missiles in the mid-course flight. The planned flight can generate proper initial conditions for cooperative terminal guidance, and also benefit an earliest simultaneous arrival. In the terminal course, an existing cooperative proportional navigation guidance law guides all the engaged missiles to arrive at a target accurately and simultaneously.The integrated guidance law for an intuitive application is summarized. Simulations demonstrate that the proposed method can generate fast and accurate salvo attack.
基金Project supported by the National Natural Science Foundation of China(Nos.61822304,61673058,61621063,61720106011,and62088101)the NSFC-Zhejiang Joint Fund for the Integration of Industrialization and Informatization(No.U1609214)+1 种基金the Consulting Research Project of the Chinese Academy of Engineering(No.2019-XZ-7)the Beijing Advanced Innovation Center for Intelligent Robots and Systems,and the Peng Cheng Laboratory。
文摘As a cutting-edge branch of unmanned aerial vehicle(UAV)technology,the cooperation of a group of UAVs has attracted increasing attention from both civil and military sectors,due to its remarkable merits in functionality and flexibility for accomplishing complex extensive tasks,e.g.,search and rescue,fire-fighting,reconnaissance,and surveillance.Cooperative path planning(CPP)is a key problem for a UAV group in executing tasks collectively.In this paper,an attempt is made to perform a comprehensive review of the research on CPP for UAV groups.First,a generalized optimization framework of CPP problems is proposed from the viewpoint of three key elements,i.e.,task,UAV group,and environment,as a basis for a comprehensive classification of different types of CPP problems.By following the proposed framework,a taxonomy for the classification of existing CPP problems is proposed to describe different kinds of CPPs in a unified way.Then,a review and a statistical analysis are presented based on the taxonomy,emphasizing the coordinative elements in the existing CPP research.In addition,a collection of challenging CPP problems are provided to highlight future research directions.
基金Project supported by the National Natural Science Foundation of China(Nos.61822304,61673058,and 61621063)the Project of Major International(Regional)Joint Research Program NSFC(No.61720106011)the NSFC–Zhejiang Joint Fund for the Integration of Industrialization and Informationization(No.U1609214)
文摘The multi-robot coverage motion planning(MCMP) problem in which every reachable area must be covered is common in multi-robot systems. To deal with the MCMP problem, we propose an efficient, complete, and off-line algorithm, named the "auction-based spanning tree coverage(A-STC)" algorithm. First, the configuration space is divided into mega cells whose size is twice the minimum coverage range of a robot. Based on connection relationships among mega cells, a graph structure can be obtained. A robot that circumnavigates a spanning tree of the graph can generate a coverage trajectory. Then, the proposed algorithm adopts an auction mechanism to construct one spanning tree for each robot. In this mechanism, an auctioneer robot chooses a suitable vertex of the graph as an auction item from neighboring vertexes of its spanning tree by heuristic rules. A bidder robot submits a proper bid to the auctioneer according to the auction vertexes' relationships with the spanning tree of the robot and the estimated length of its trajectory. The estimated length is calculated based on vertexes and edges in the spanning tree. The bidder with the highest bid is selected as a winner to reduce the makespan of the coverage task. After auction processes, acceptable coverage trajectories can be planned rapidly. Computational experiments validate the effectiveness of the proposed MCMP algorithm and the method for estimating trajectory lengths. The proposed algorithm is also compared with the state-of-the-art algorithms. The comparative results show that the A-STC algorithm has apparent advantages in terms of the running time and the makespan for large crowded configuration spaces.
基金NSF Grant No.Z0511046 of Fujian and NSF Grant No.10471091 of China
文摘In this paper, we present some modules over the rank-three quantized Weyl algebra, which are closely related to modules over some vertex algebras. The isomorphism classes among these modules are also determined.
基金Project supported by the National Natural Science Foundation of China (Nos.62022015 and 62088101)the Shanghai Municipal Science and Technology Major Project,China(No.2021SHZDZX0100)the Shanghai Municipal Commission of Science and Technology Project,China (No.19511132101)。
文摘The sparrow search algorithm(SSA) is a recent meta-heuristic optimization approach with the advantages of simplicity and flexibility. However, SSA still faces challenges of premature convergence and imbalance between exploration and exploitation, especially when tackling multimodal optimization problems. Aiming to deal with the above problems, we propose an enhanced variant of SSA called the multi-strategy enhanced sparrow search algorithm(MSSSA) in this paper. First, a chaotic map is introduced to obtain a high-quality initial population for SSA, and the opposition-based learning strategy is employed to increase the population diversity. Then, an adaptive parameter control strategy is designed to accommodate an adequate balance between exploration and exploitation. Finally, a hybrid disturbance mechanism is embedded in the individual update stage to avoid falling into local optima. To validate the effectiveness of the proposed MSSSA, a large number of experiments are implemented, including 40 complex functions from the IEEE CEC2014 and IEEE CEC2019 test suites and 10 classical functions with different dimensions. Experimental results show that the MSSSA achieves competitive performance compared with several state-of-the-art optimization algorithms. The proposed MSSSA is also successfully applied to solve two engineering optimization problems. The results demonstrate the superiority of the MSSSA in addressing practical problems.
基金National Outstanding Youth Talents Support Program (No. 61822304)in part by the National Natural Science Foundation of China (No. 61673058)+3 种基金in part by NSFC-Zhejiang Joint Fund for the Integration of Industrialization and Informatization (No. U1609214)in part by the Foundation for Innovative Research Groups of the National Natural Science Foundation of China (No. 61621063)in part by the Projects of Major International (Regional) Joint Research Program NSFC (No. 61 720106011)in part by International Graduate Exchange Program of Beijing Institute of Technology.
文摘This paper addresses an unmanned aerial vehicle (UAV) path planning problem for a team of cooperating heterogeneous vehicles composed of one UAV and multiple unmanned ground vehicles (UGVs). The UGVs are used as mobile actuators and scattered in a large area. To achieve multi-UGV communication and collaboration, the UAV serves as a messenger to fly over all task points to collect the task information and then flies all UGVs to transmit the information about tasks and UGVs. The path planning of messenger UAV is formulated as a precedence-constrained dynamic Dubins traveling salesman problem with neighborhood (PDDTSPN). The goal of this problem is to find the shortest route enabling the UAV to fly over all task points and deliver information to all requested UGVs. When solving this path planning problem, a decoupling strategy is proposed to sequentially and rapidly determine the access sequence in which the UAV visits task points and UGVs as well as the access location of UAV in the com mu nication n eighborhood of each task point and each UGV. The effectiveness of the proposed approach is corroborated through computational experiments on randomly generated instances. The computational results on both small and large in stances dem on strate that the proposed approach can generate high-quality solutions in a reasonable time as compared with two other heuristic algorithms.
基金Support Program(No.61822304)the Basic Science Center Programs of NSFC(No.62088101)+2 种基金the Peng Cheng Laboratory,the Consulting Research Project of the Chinese Academy of Engineering(No.2019-XZ-7)the Foundation for Innovative Research Groups of the National Natural Science Foundation of China(No.61621063)the Projects of Major International(Regional)Joint Research Program of NSFC(No.61720106011).
文摘Because of their wide detection range and rich functions,autonomous underwater vehicles(AUVs)are widely used for observing the marine environment,for exploring natural resources,for security and defense purposes,and in many other fields of interest.Compared with a single AUV,a multi-AUV formation can better perform various tasks and adapt to complex underwater environments.With changes in the mission or environment,a change in the UAV formation may also be required.In the last decade,much progress has been made in the transformation of multi-AUV formations.In this paper,we aim to analyze the core concepts of multi-AUV formation transformation;summarize the effects of the AUV model,underwater environment,and communication between AUVs within formations on formation transformation;and elaborate on basic theories and implementation approaches for multi-AUV formation transformation.Moreover,this overview includes a bibliometric analysis of the related literature from multiple perspectives.Finally,some challenging issues and future research directions for multi-AUV formation transformation are highlighted.
基金the National Natural Science Foundation of China (Nos. 10471091, 10671027)the One Hundred Talents Program from University of Science and Technology of China
文摘Lie bialgebra structures on a family of Lie algebras of Block type are shown to be triangular coboundary.
基金Supported by the Doctoral Research Start-up Fund of Guizhou Normal University(No.GZNUD[2017]24)the National Natural Science Foundation of China(No.11431010,No.11801369)the Anhui Provincial Natural Science Research Program for Institutions of Higher Learning(No.KJ2018A0976).
文摘In this note we classify the compatible left-symmetric superalgebra structures over a super Virasoro type algebra,whose even part is the centerless twisted Heisenberg–Virasoro algebra,with some natural grading conditions.
