Complex multi-area collaborative coverage path planning in dynamic environments poses a significant challenge for multi-fixed-wing UAVs(multi-UAV).This study establishes a comprehensive framework that incorporates UAV...Complex multi-area collaborative coverage path planning in dynamic environments poses a significant challenge for multi-fixed-wing UAVs(multi-UAV).This study establishes a comprehensive framework that incorporates UAV capabilities,terrain,complex areas,and mission dynamics.A novel dynamic collaborative path planning algorithm is introduced,designed to ensure complete coverage of designated areas.This algorithm meticulously optimizes the operation,entry,and transition paths for each UAV,while also establishing evaluation metrics to refine coverage sequences for each area.Additionally,a three-dimensional path is computed utilizing an altitude descent method,effectively integrating twodimensional coverage paths with altitude constraints.The efficacy of the proposed approach is validated through digital simulations and mixed-reality semi-physical experiments across a variety of dynamic scenarios,including both single-area and multi-area coverage by multi-UAV.Results show that the coverage paths generated by this method significantly reduce both computation time and path length,providing a reliable solution for dynamic multi-UAV mission planning in semi-physical environments.展开更多
Collaborative coverage path planning(CCPP) refers to obtaining the shortest paths passing over all places except obstacles in a certain area or space. A multi-unmanned aerial vehicle(UAV) collaborative CCPP algorithm ...Collaborative coverage path planning(CCPP) refers to obtaining the shortest paths passing over all places except obstacles in a certain area or space. A multi-unmanned aerial vehicle(UAV) collaborative CCPP algorithm is proposed for the urban rescue search or military search in outdoor environment.Due to flexible control of small UAVs, it can be considered that all UAVs fly at the same altitude, that is, they perform search tasks on a two-dimensional plane. Based on the agents’ motion characteristics and environmental information, a mathematical model of CCPP problem is established. The minimum time for UAVs to complete the CCPP is the objective function, and complete coverage constraint, no-fly constraint, collision avoidance constraint, and communication constraint are considered. Four motion strategies and two communication strategies are designed. Then a distributed CCPP algorithm is designed based on hybrid strategies. Simulation results compared with patternbased genetic algorithm(PBGA) and random search method show that the proposed method has stronger real-time performance and better scalability and can complete the complete CCPP task more efficiently and stably.展开更多
This study aims to reflect the information coverage grey number and the interaction between attributes in grey relational decision making. Therefore, a multi-attribute decision method based on the grey information cov...This study aims to reflect the information coverage grey number and the interaction between attributes in grey relational decision making. Therefore, a multi-attribute decision method based on the grey information coverage interaction relational degree(GIRD) is proposed. Firstly, this paper defines the information coverage grey number, and establishes the GIRD model by using the Choquet fuzzy integral and grey relational principle. It proves that the proposed model not only is the general and unified form of the point relational degree, interval relational degree, mixed relational degree and grey fuzzy integral relational degree, but also can effectively deal with the interaction between attributes. Further,a decision making example of evaluating the industrial operation quality for 14 cities in Hunan province of China is provided to highlight the implementation, availability, and feasibility of the proposed decision model.展开更多
To address the problem of building linear barrier coverage with the location restriction, an optimization method for deploying multistatic radars is proposed, where the location restriction splits the deployment line ...To address the problem of building linear barrier coverage with the location restriction, an optimization method for deploying multistatic radars is proposed, where the location restriction splits the deployment line into two segments. By proving the characteristics of deployment patterns, an optimal deployment sequence consisting of multiple deployment patterns is proposed and exploited to cover each segment. The types and numbers of deployment patterns are determined by an algorithm that combines the integer linear programming(ILP)and exhaustive method(EM). In addition, to reduce the computation amount, a formula is introduced to calculate the upper threshold of receivers’ number in a deployment pattern. Furthermore, since the objective function is non-convex and non-analytic, the overall model is divided into two layers concerning two suboptimization problems. Subsequently, another algorithm that integrates the segments and layers is proposed to determine the deployment parameters, such as the minimum cost, parameters of the optimal deployment sequence, and the location of the split point. Simulation results demonstrate that the proposed method can effectively determine the optimal deployment parameters under the location restriction.展开更多
A novel immune-swarm intelligence (ISI) based algorithm for solving the deterministic coverage problems of wireless sensor networks was presented.It makes full use of information sharing and retains diversity from the...A novel immune-swarm intelligence (ISI) based algorithm for solving the deterministic coverage problems of wireless sensor networks was presented.It makes full use of information sharing and retains diversity from the principle of particle swarm optimization (PSO) and artificial immune system (AIS).The algorithm was analyzed in detail and proper swarm size,evolving generations,gene-exchange individual order,and gene-exchange proportion in molecule were obtained for better algorithm performances.According to the test results,the appropriate parameters are about 50 swarm individuals,over 3 000 evolving generations,20%-25% gene-exchange proportion in molecule with gene-exchange taking place between better fitness affinity individuals.The algorithm is practical and effective in maximizing the coverage probability with given number of sensors and minimizing sensor numbers with required coverage probability in sensor placement.It can reach a better result quickly,especially with the proper calculation parameters.展开更多
The region coverage control problem of multiple stratospheric airships system is firstly addressed in this paper.Towards it,we propose a two-layer control framework with the artificial potential field(APF)-based regio...The region coverage control problem of multiple stratospheric airships system is firstly addressed in this paper.Towards it,we propose a two-layer control framework with the artificial potential field(APF)-based region coverage control law and the adaptive tracking control law.The APF-based region coverage control law ensures the coverage task is achieved until every single stratospheric airship ends up performing station keeping where near the respective global minimum point,in which an innovative solution to the local minimum problem is put forward.The adaptive tracking control law is designed to realize motion control using tracking the desired velocity and angular velocity given by coverage control law,with the consideration of several practical control problems as unknown individual differences and external disturbances.To save resources,the combined self-/event-triggered mechanism designed therein significantly reduces the times of state information transmission and control law calculation.The effectiveness of the proposed control framework is verified through simulations.展开更多
This paper proposes an optimal deployment method of heterogeneous multistatic radars to construct arc barrier coverage with location restrictions.This method analyzes and proves the properties of different deployment ...This paper proposes an optimal deployment method of heterogeneous multistatic radars to construct arc barrier coverage with location restrictions.This method analyzes and proves the properties of different deployment patterns in the optimal deployment sequence.Based on these properties and considering location restrictions,it introduces an optimization model of arc barrier coverage and aims to minimize the total deployment cost of heterogeneous multistatic radars.To overcome the non-convexity of the model and the non-analytical nature of the objective function,an algorithm combining integer line programming and the cuckoo search algorithm(CSA)is proposed.The proposed algorithm can determine the number of receivers and transmitters in each optimal deployment squence to minimize the total placement cost.Simulations are conducted in different conditions to verify the effectiveness of the proposed method.展开更多
The control problem of a class of parabolic distributed parameter systems (DPSs) is investigated by using mobile agents with capabilities of sensing and actuating. The guidance strategies of mobile agents based on cov...The control problem of a class of parabolic distributed parameter systems (DPSs) is investigated by using mobile agents with capabilities of sensing and actuating. The guidance strategies of mobile agents based on coverage optimization methods are proposed to improve the control performance of the system and make the state norm of the system converge to zero faster. The coverage optimization problems are constructed based on the measurement of each agent. By solving the coverage optimization problems, the local optimal moving direction of each agent can be obtained. Then the gradient-based agent motion control laws are established. With the indicator function and the surface delta function, this method is generalized to n-dimensional space, and suitable for any sensing region with piecewise smooth boundaries. The stability and control performance of the system are analyzed. Numerical simulations show the effectiveness of the proposed methods.展开更多
基金National Natural Science Foundation of China(Grant No.52472417)to provide fund for conducting experiments.
文摘Complex multi-area collaborative coverage path planning in dynamic environments poses a significant challenge for multi-fixed-wing UAVs(multi-UAV).This study establishes a comprehensive framework that incorporates UAV capabilities,terrain,complex areas,and mission dynamics.A novel dynamic collaborative path planning algorithm is introduced,designed to ensure complete coverage of designated areas.This algorithm meticulously optimizes the operation,entry,and transition paths for each UAV,while also establishing evaluation metrics to refine coverage sequences for each area.Additionally,a three-dimensional path is computed utilizing an altitude descent method,effectively integrating twodimensional coverage paths with altitude constraints.The efficacy of the proposed approach is validated through digital simulations and mixed-reality semi-physical experiments across a variety of dynamic scenarios,including both single-area and multi-area coverage by multi-UAV.Results show that the coverage paths generated by this method significantly reduce both computation time and path length,providing a reliable solution for dynamic multi-UAV mission planning in semi-physical environments.
基金supported by the National Natural Science Foundation of China (61903036, 61822304)Shanghai Municipal Science and Technology Major Project (2021SHZDZX0100)。
文摘Collaborative coverage path planning(CCPP) refers to obtaining the shortest paths passing over all places except obstacles in a certain area or space. A multi-unmanned aerial vehicle(UAV) collaborative CCPP algorithm is proposed for the urban rescue search or military search in outdoor environment.Due to flexible control of small UAVs, it can be considered that all UAVs fly at the same altitude, that is, they perform search tasks on a two-dimensional plane. Based on the agents’ motion characteristics and environmental information, a mathematical model of CCPP problem is established. The minimum time for UAVs to complete the CCPP is the objective function, and complete coverage constraint, no-fly constraint, collision avoidance constraint, and communication constraint are considered. Four motion strategies and two communication strategies are designed. Then a distributed CCPP algorithm is designed based on hybrid strategies. Simulation results compared with patternbased genetic algorithm(PBGA) and random search method show that the proposed method has stronger real-time performance and better scalability and can complete the complete CCPP task more efficiently and stably.
基金supported by the National Natural Science Foundation of China(71871174,71571065,71671135)the National Social Science Fund of China(13FGL005)。
文摘This study aims to reflect the information coverage grey number and the interaction between attributes in grey relational decision making. Therefore, a multi-attribute decision method based on the grey information coverage interaction relational degree(GIRD) is proposed. Firstly, this paper defines the information coverage grey number, and establishes the GIRD model by using the Choquet fuzzy integral and grey relational principle. It proves that the proposed model not only is the general and unified form of the point relational degree, interval relational degree, mixed relational degree and grey fuzzy integral relational degree, but also can effectively deal with the interaction between attributes. Further,a decision making example of evaluating the industrial operation quality for 14 cities in Hunan province of China is provided to highlight the implementation, availability, and feasibility of the proposed decision model.
基金supported by the National Natural Science Foundation of China (61971470)。
文摘To address the problem of building linear barrier coverage with the location restriction, an optimization method for deploying multistatic radars is proposed, where the location restriction splits the deployment line into two segments. By proving the characteristics of deployment patterns, an optimal deployment sequence consisting of multiple deployment patterns is proposed and exploited to cover each segment. The types and numbers of deployment patterns are determined by an algorithm that combines the integer linear programming(ILP)and exhaustive method(EM). In addition, to reduce the computation amount, a formula is introduced to calculate the upper threshold of receivers’ number in a deployment pattern. Furthermore, since the objective function is non-convex and non-analytic, the overall model is divided into two layers concerning two suboptimization problems. Subsequently, another algorithm that integrates the segments and layers is proposed to determine the deployment parameters, such as the minimum cost, parameters of the optimal deployment sequence, and the location of the split point. Simulation results demonstrate that the proposed method can effectively determine the optimal deployment parameters under the location restriction.
基金Project(2008BA00400)supported by the Foundation of Department of Science and Technology of Jiangxi Province,China
文摘A novel immune-swarm intelligence (ISI) based algorithm for solving the deterministic coverage problems of wireless sensor networks was presented.It makes full use of information sharing and retains diversity from the principle of particle swarm optimization (PSO) and artificial immune system (AIS).The algorithm was analyzed in detail and proper swarm size,evolving generations,gene-exchange individual order,and gene-exchange proportion in molecule were obtained for better algorithm performances.According to the test results,the appropriate parameters are about 50 swarm individuals,over 3 000 evolving generations,20%-25% gene-exchange proportion in molecule with gene-exchange taking place between better fitness affinity individuals.The algorithm is practical and effective in maximizing the coverage probability with given number of sensors and minimizing sensor numbers with required coverage probability in sensor placement.It can reach a better result quickly,especially with the proper calculation parameters.
基金supported by the Postdoctoral Science Foundation of China(Grant No.2020TQ0028)the National Natural Science Foundation of China(No.62173016)Beijing Natural Science Foundation,PRChina(No.4202038)。
文摘The region coverage control problem of multiple stratospheric airships system is firstly addressed in this paper.Towards it,we propose a two-layer control framework with the artificial potential field(APF)-based region coverage control law and the adaptive tracking control law.The APF-based region coverage control law ensures the coverage task is achieved until every single stratospheric airship ends up performing station keeping where near the respective global minimum point,in which an innovative solution to the local minimum problem is put forward.The adaptive tracking control law is designed to realize motion control using tracking the desired velocity and angular velocity given by coverage control law,with the consideration of several practical control problems as unknown individual differences and external disturbances.To save resources,the combined self-/event-triggered mechanism designed therein significantly reduces the times of state information transmission and control law calculation.The effectiveness of the proposed control framework is verified through simulations.
基金supported by the National Natural Science Foundation of China(61971470).
文摘This paper proposes an optimal deployment method of heterogeneous multistatic radars to construct arc barrier coverage with location restrictions.This method analyzes and proves the properties of different deployment patterns in the optimal deployment sequence.Based on these properties and considering location restrictions,it introduces an optimization model of arc barrier coverage and aims to minimize the total deployment cost of heterogeneous multistatic radars.To overcome the non-convexity of the model and the non-analytical nature of the objective function,an algorithm combining integer line programming and the cuckoo search algorithm(CSA)is proposed.The proposed algorithm can determine the number of receivers and transmitters in each optimal deployment squence to minimize the total placement cost.Simulations are conducted in different conditions to verify the effectiveness of the proposed method.
基金supported by the National Natural Science Foundation of China(61807016 61174021)+3 种基金the Fundamental Research Funds for the Central Universities(JUSRP115A28 JUSRP51733B)the 111 Projeet(B12018)the Postgraduate Innovation Project of Jiangsu Province(KYLX151170)
文摘The control problem of a class of parabolic distributed parameter systems (DPSs) is investigated by using mobile agents with capabilities of sensing and actuating. The guidance strategies of mobile agents based on coverage optimization methods are proposed to improve the control performance of the system and make the state norm of the system converge to zero faster. The coverage optimization problems are constructed based on the measurement of each agent. By solving the coverage optimization problems, the local optimal moving direction of each agent can be obtained. Then the gradient-based agent motion control laws are established. With the indicator function and the surface delta function, this method is generalized to n-dimensional space, and suitable for any sensing region with piecewise smooth boundaries. The stability and control performance of the system are analyzed. Numerical simulations show the effectiveness of the proposed methods.
