Multiple UAVs are usually deployed to provide robustness through redundancy and to accomplish surveillance,search,attack and rescue missions.Formation reconfiguration was inevitable during the flight when the mission ...Multiple UAVs are usually deployed to provide robustness through redundancy and to accomplish surveillance,search,attack and rescue missions.Formation reconfiguration was inevitable during the flight when the mission was adjusted or the environment varied.Taking the typical formation reconfiguration from a triangular penetrating formation to a circular tracking formation for example,a path planning method based on Dubins trajectory and particle swarm optimization(PSO)algorithm is presented in this paper.The mathematic model of multiple UAVs formation reconfiguration was built firstly.According to the kinematic model of aerial vehicles,a process of dimensionality reduction was carried out to simplify the model based on Dubins trajectory.The PSO algorithm was adopted to resolve the optimization problem of formation reconfiguration path planning.Finally,the simulation and vehicles flight experiment are executed.Results show that the path planning method based on the Dubins trajectory and the PSO algorithm can generate feasible paths for vehicles on time,to guarantee the rapidity and effectiveness of formation reconfigurations.Furthermore,from the simulation results,the method is universal and could be extended easily to the path planning problem for different kinds of formation reconfigurations.展开更多
This paper presents a genetic programming based reconfiguration planner for metamorphic modular robots. Initially used for evolving computer programs that can solve simple problems, genetic programming (GP) has been...This paper presents a genetic programming based reconfiguration planner for metamorphic modular robots. Initially used for evolving computer programs that can solve simple problems, genetic programming (GP) has been recently used to handle various kinds of problems in the area of complex systems. This paper details how genetic programming can be used as an automatic programming tool for handling reconfiguration-planning problem. To do so, the GP evolves sequences of basic operations which are required for transforming the robot's geometric structure from its initial configuration into the target one while the total number of modules and their connectedness are preserved. The proposed planner is intended for both Crystalline and TeleCube modules which are achieved by cubical compressible units. The target pattern of the modular robot is expressed in quantitative terms of morphogens diffused on the environment. Our work presents a solution for self recontlguration problem with restricted and unrestricted free space available to the robot during reconfiguration, The planner outputs a near optimal explicit sequence of low-level actions that allows modules to move relative to each other in order to form the desired shape.展开更多
Reconfiguration planning is recognized as an important factor for reducing the cost of manufacturing reconfigurable products, and the associated main task is to generate a set of optimal or near-optimal reconfiguratio...Reconfiguration planning is recognized as an important factor for reducing the cost of manufacturing reconfigurable products, and the associated main task is to generate a set of optimal or near-optimal reconfiguration sequences using some effect algorithms. A method is developed to generate a Petri net as the reconfiguration tree to represent two-state-transit of product, which solved the representation problem of reconfiguring interfaces replacement. Relating with this method, two heuristic algorithms are proposed to generate task sequences which considering economics to search reconfiguration paths effectively. At last, an objective evaluation is applied to compare these two heuristic algorithms to other ones. The developed reconfiguration task planning heuristic algorithms can generate better strategies and plans for reconfiguration. The research finds are exemplified with struts reconfiguration of reconfigurable parallel kinematics machine (RPKM).展开更多
基金Project (61703414) supported by the National Natural Science Foundation of ChinaProject (3101047) supported by the Defense Science and Technology Foundation of China+1 种基金Project (2017JJ3366) supported by the Natural Science Foundation of Hunan ChinaProject (2015M582881) supported by the China Postdoctoral Science Foundation
文摘Multiple UAVs are usually deployed to provide robustness through redundancy and to accomplish surveillance,search,attack and rescue missions.Formation reconfiguration was inevitable during the flight when the mission was adjusted or the environment varied.Taking the typical formation reconfiguration from a triangular penetrating formation to a circular tracking formation for example,a path planning method based on Dubins trajectory and particle swarm optimization(PSO)algorithm is presented in this paper.The mathematic model of multiple UAVs formation reconfiguration was built firstly.According to the kinematic model of aerial vehicles,a process of dimensionality reduction was carried out to simplify the model based on Dubins trajectory.The PSO algorithm was adopted to resolve the optimization problem of formation reconfiguration path planning.Finally,the simulation and vehicles flight experiment are executed.Results show that the path planning method based on the Dubins trajectory and the PSO algorithm can generate feasible paths for vehicles on time,to guarantee the rapidity and effectiveness of formation reconfigurations.Furthermore,from the simulation results,the method is universal and could be extended easily to the path planning problem for different kinds of formation reconfigurations.
文摘This paper presents a genetic programming based reconfiguration planner for metamorphic modular robots. Initially used for evolving computer programs that can solve simple problems, genetic programming (GP) has been recently used to handle various kinds of problems in the area of complex systems. This paper details how genetic programming can be used as an automatic programming tool for handling reconfiguration-planning problem. To do so, the GP evolves sequences of basic operations which are required for transforming the robot's geometric structure from its initial configuration into the target one while the total number of modules and their connectedness are preserved. The proposed planner is intended for both Crystalline and TeleCube modules which are achieved by cubical compressible units. The target pattern of the modular robot is expressed in quantitative terms of morphogens diffused on the environment. Our work presents a solution for self recontlguration problem with restricted and unrestricted free space available to the robot during reconfiguration, The planner outputs a near optimal explicit sequence of low-level actions that allows modules to move relative to each other in order to form the desired shape.
基金Supported by the High Technology Research and Development Programme of China (No. 2006AA04Z133) and the National Natural Science Foundation of China (No. 50605035, 50510488).
文摘Reconfiguration planning is recognized as an important factor for reducing the cost of manufacturing reconfigurable products, and the associated main task is to generate a set of optimal or near-optimal reconfiguration sequences using some effect algorithms. A method is developed to generate a Petri net as the reconfiguration tree to represent two-state-transit of product, which solved the representation problem of reconfiguring interfaces replacement. Relating with this method, two heuristic algorithms are proposed to generate task sequences which considering economics to search reconfiguration paths effectively. At last, an objective evaluation is applied to compare these two heuristic algorithms to other ones. The developed reconfiguration task planning heuristic algorithms can generate better strategies and plans for reconfiguration. The research finds are exemplified with struts reconfiguration of reconfigurable parallel kinematics machine (RPKM).