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.展开更多
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.展开更多
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.展开更多
A novel evolutionary route planner for aircraft is proposed in this paper. In the new planner, individual candidates are evaluated with respect to the workspace, thus the computation of the configuration space is not ...A novel evolutionary route planner for aircraft is proposed in this paper. In the new planner, individual candidates are evaluated with respect to the workspace, thus the computation of the configuration space is not required. By using problem-specific chromosome structure and genetic operators, the routes are generated in real time, with different mission constraints such as minimum route leg length and flying altitude, maximum turning angle, maximum climbing/diving angle and route distance constraint taken into account.展开更多
For low-speed underwater vehicles, the ocean currents has a great influence on them, and the changes in ocean currents is complex and continuous, thus whose impact must be taken into consideration in the path planning...For low-speed underwater vehicles, the ocean currents has a great influence on them, and the changes in ocean currents is complex and continuous, thus whose impact must be taken into consideration in the path planning. There are still lack of authoritative indicator and method for the cooperating path planning. The calculation of the voyage time is a difficult problem in the time-varying ocean, for the existing methods of the cooperating path planning, the computation time will increase exponentially as the autonomous underwater vehicle（AUV） counts increase, rendering them unfeasible. A collaborative path planning method is presehted for multi-AUV under the influence of time-varying ocean currents based on the dynamic programming algorithm. Each AUV cooperates with the one who has the longest estimated time of sailing, enabling the arrays of AUV to get their common goal in the shortest time with minimum timedifference. At the same time, they could avoid the obstacles along the way to the target. Simulation results show that the proposed method has a promising applicability.展开更多
Previously, researchers raised the accuracy for a robot′s hand to track a specified path in Car-tesian space mainly through increasing the number of knots on the path and the number of the path′s segments, which res...Previously, researchers raised the accuracy for a robot′s hand to track a specified path in Car-tesian space mainly through increasing the number of knots on the path and the number of the path′s segments, which results in the heavier online computational burden for the robot controller. Aiming at overcoming this drawback, the authors propose a new kind of real-time accurate hand path tracking and joint trajectory planning method. Through selecting some extra knots on the specified hand path by a certain rule and introducing a sinusoidal function to the joint displacement equation of each segment, this method can greatly raise the path tracking accuracy of robot′s hand and does not change the number of the path′s segments. It also does not increase markedly the computational burden of robot controller. The result of simulation indicates that this method is very effective, and has important value in increasing the application of industrial robots.展开更多
Previously, researchers raised the accuracy for a robot′s hand to track a specified path in Cartesian space mainly through increasing the number of knots on the path and the segments of the path. But, this method res...Previously, researchers raised the accuracy for a robot′s hand to track a specified path in Cartesian space mainly through increasing the number of knots on the path and the segments of the path. But, this method resulted in the heavier on line computational burden for the robot controller. In this paper, aiming at this drawback, the authors propose a new kind of real time accurate hand path tracking and joint trajectory planning method for robots. Through selecting some extra knots on the specified hand path by a certain rule, which enables the number of knots on each segment to increase from two to four, and through introducing a sinusoidal function and a cosinoidal function to the joint displacement equation of each segment, this method can raise the path tracking accuracy of robot′s hand greatly but does not increase the computational burden of robot controller markedly.展开更多
基金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(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(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.
文摘A novel evolutionary route planner for aircraft is proposed in this paper. In the new planner, individual candidates are evaluated with respect to the workspace, thus the computation of the configuration space is not required. By using problem-specific chromosome structure and genetic operators, the routes are generated in real time, with different mission constraints such as minimum route leg length and flying altitude, maximum turning angle, maximum climbing/diving angle and route distance constraint taken into account.
基金supported by the National Natural Science Foundation of China(5110917951179156+2 种基金5137917661473233)the Natural Science Basic Research Plan in Shaanxi Province of China(2014JQ8330)
文摘For low-speed underwater vehicles, the ocean currents has a great influence on them, and the changes in ocean currents is complex and continuous, thus whose impact must be taken into consideration in the path planning. There are still lack of authoritative indicator and method for the cooperating path planning. The calculation of the voyage time is a difficult problem in the time-varying ocean, for the existing methods of the cooperating path planning, the computation time will increase exponentially as the autonomous underwater vehicle（AUV） counts increase, rendering them unfeasible. A collaborative path planning method is presehted for multi-AUV under the influence of time-varying ocean currents based on the dynamic programming algorithm. Each AUV cooperates with the one who has the longest estimated time of sailing, enabling the arrays of AUV to get their common goal in the shortest time with minimum timedifference. At the same time, they could avoid the obstacles along the way to the target. Simulation results show that the proposed method has a promising applicability.
基金Foundation of the Robotics Laboratory, Chinese Academy of Sciences (No: RL200002)
文摘Previously, researchers raised the accuracy for a robot′s hand to track a specified path in Car-tesian space mainly through increasing the number of knots on the path and the number of the path′s segments, which results in the heavier online computational burden for the robot controller. Aiming at overcoming this drawback, the authors propose a new kind of real-time accurate hand path tracking and joint trajectory planning method. Through selecting some extra knots on the specified hand path by a certain rule and introducing a sinusoidal function to the joint displacement equation of each segment, this method can greatly raise the path tracking accuracy of robot′s hand and does not change the number of the path′s segments. It also does not increase markedly the computational burden of robot controller. The result of simulation indicates that this method is very effective, and has important value in increasing the application of industrial robots.
基金FoundationoftheRoboticsLaboratoryChineseAcademyofSciences (No :RL2 0 0 0 0 2 )
文摘Previously, researchers raised the accuracy for a robot′s hand to track a specified path in Cartesian space mainly through increasing the number of knots on the path and the segments of the path. But, this method resulted in the heavier on line computational burden for the robot controller. In this paper, aiming at this drawback, the authors propose a new kind of real time accurate hand path tracking and joint trajectory planning method for robots. Through selecting some extra knots on the specified hand path by a certain rule, which enables the number of knots on each segment to increase from two to four, and through introducing a sinusoidal function and a cosinoidal function to the joint displacement equation of each segment, this method can raise the path tracking accuracy of robot′s hand greatly but does not increase the computational burden of robot controller markedly.
