According to the characteristic and the requirement of multipath planning, a new multipath planning method is proposed based on network. This method includes two steps： the construction of network and multipath searc...According to the characteristic and the requirement of multipath planning, a new multipath planning method is proposed based on network. This method includes two steps： the construction of network and multipath searching. The construction of network proceeds in three phases： the skeleton extraction of the configuration space, the judgment of the cross points in the skeleton and how to link the cross points to form a network. Multipath searching makes use of the network and iterative penalty method （IPM） to plan multi-paths, and adjusts the planar paths to satisfy the requirement of maneuverability of unmanned aerial vehicle （UAV）. In addition, a new height planning method is proposed to deal with the height planning of 3D route. The proposed algorithm can find multiple paths automatically according to distribution of terrain and threat areas with high efficiency. The height planning can make 3D route following the terrain. The simulation experiment illustrates the feasibility of the proposed method.展开更多
An integrated approach to generation of precedence relations and precedencegraphs for assembly sequence planning is presented, which contains more assembly flexibility. Theapproach involves two stages. Based on the as...An integrated approach to generation of precedence relations and precedencegraphs for assembly sequence planning is presented, which contains more assembly flexibility. Theapproach involves two stages. Based on the assembly model, the components in the assembly can bedivided into partially constrained components and completely con-strained components in the firststage, and then geometric precedence relation for every component is generated automatically.According to the result of the first stage, the second stage determines and constructs allprecedence graphs. The algorithms of these two stages proposed are verified by two assemblyexamples.展开更多
Disassembly sequence planning is an important step of mechanical maintenance. This article presents an integrated study about the generation and optimizing algorithm of the disassembly sequence. Mechanical products ar...Disassembly sequence planning is an important step of mechanical maintenance. This article presents an integrated study about the generation and optimizing algorithm of the disassembly sequence. Mechanical products are divided into two categories of components and connectors. The article uses component-joint graph to represent assembly constraints, including the incidence constraints are represented by incidence matrix and the interference constraints are represented by interference constraints. The inspiring factor and pheromone matrix are calculated according to assembly constraints. Then the ant generates its own disassembly sequences one by one and updates the inspiring factor and pheromone matrix. After all iterations, the best disassembly sequence planning of components and connectors are given. Finally, an application instance of the disassembly sequence of the jack is presented to illustrate the validity of this method.展开更多
Disassembly sequence planning （DSP） plays a significant role in maintenance planning of the aircraft. It is used during the design stage for the analysis of maintainability of the aircraft. To solve product disassem...Disassembly sequence planning （DSP） plays a significant role in maintenance planning of the aircraft. It is used during the design stage for the analysis of maintainability of the aircraft. To solve product disassembly sequence planning problems efficiently, a product disassembly hybrid graph model, which describes the connection, non-connection and precedence relationships between the product parts, is established based on the characteristic of disassembly. Farther, the optimization model is provided to optimize disassembly sequence. And the solution methodology based on the genetic/simulated annealing algorithm with binaxy-tree algorithm is given. Finally, an example is analyzed in detail, and the result shows that the model is correct and efficient.展开更多
The EPNSim Graph was used to establish simulation models for an integrated steelmaking-casting-rolling production system.The simulation software was developed on the basis of the EPNSim Graph models and some productio...The EPNSim Graph was used to establish simulation models for an integrated steelmaking-casting-rolling production system.The simulation software was developed on the basis of the EPNSim Graph models and some production plans have been simulated with the software.The simulation results proved that the model established by EPNSim Graph is reliable.展开更多
In multi-layer satellite-terrestrial network, Contact Graph Routing(CGR) uses the contact information among satellites to compute routes. However, due to the resource constraints in satellites, it is extravagant to co...In multi-layer satellite-terrestrial network, Contact Graph Routing(CGR) uses the contact information among satellites to compute routes. However, due to the resource constraints in satellites, it is extravagant to configure lots of the potential contacts into contact plans. What's more, a huge contact plan makes the computing more complex, which further increases computing time. As a result, how to design an efficient contact plan becomes crucial for multi-layer satellite network, which usually has a large scaled topology. In this paper, we propose a distributed contact plan design scheme for multi-layer satellite network by dividing a large contact plan into several partial parts. Meanwhile, a duration based inter-layer contact selection algorithm is proposed to handle contacts disruption problem. The performance of the proposed design was evaluated on our Identifier/Locator split based satellite-terrestrial network testbed with 79 simulation nodes. Experiments showed that the proposed design is able to reduce the data delivery delay.展开更多
The specificities of collision-free path planning of space manipulators are analyzed. Path planning strategies are presented in consideration of these specificities, and an implementation procedure is also described i...The specificities of collision-free path planning of space manipulators are analyzed. Path planning strategies are presented in consideration of these specificities, and an implementation procedure is also described in detail according to these strategies.展开更多
基金supported by the National High Technology Research and Development Program of China(2007AA12Z166)
文摘According to the characteristic and the requirement of multipath planning, a new multipath planning method is proposed based on network. This method includes two steps： the construction of network and multipath searching. The construction of network proceeds in three phases： the skeleton extraction of the configuration space, the judgment of the cross points in the skeleton and how to link the cross points to form a network. Multipath searching makes use of the network and iterative penalty method （IPM） to plan multi-paths, and adjusts the planar paths to satisfy the requirement of maneuverability of unmanned aerial vehicle （UAV）. In addition, a new height planning method is proposed to deal with the height planning of 3D route. The proposed algorithm can find multiple paths automatically according to distribution of terrain and threat areas with high efficiency. The height planning can make 3D route following the terrain. The simulation experiment illustrates the feasibility of the proposed method.
基金This project is supported by National Natural Science Foundation of China(No.59990470,No.59725514,No.59985004)and Robotics Laboratory,Chinese Academy of Sciences Foundation(No.RL200006)
文摘An integrated approach to generation of precedence relations and precedencegraphs for assembly sequence planning is presented, which contains more assembly flexibility. Theapproach involves two stages. Based on the assembly model, the components in the assembly can bedivided into partially constrained components and completely con-strained components in the firststage, and then geometric precedence relation for every component is generated automatically.According to the result of the first stage, the second stage determines and constructs allprecedence graphs. The algorithms of these two stages proposed are verified by two assemblyexamples.
文摘Disassembly sequence planning is an important step of mechanical maintenance. This article presents an integrated study about the generation and optimizing algorithm of the disassembly sequence. Mechanical products are divided into two categories of components and connectors. The article uses component-joint graph to represent assembly constraints, including the incidence constraints are represented by incidence matrix and the interference constraints are represented by interference constraints. The inspiring factor and pheromone matrix are calculated according to assembly constraints. Then the ant generates its own disassembly sequences one by one and updates the inspiring factor and pheromone matrix. After all iterations, the best disassembly sequence planning of components and connectors are given. Finally, an application instance of the disassembly sequence of the jack is presented to illustrate the validity of this method.
基金Supported by National Natural Science Foundation of P.R.China(50275150)National Research Foundation for the Doctoral Program of Higher Education of P.R.China(20040533035)
基金supported by the National High Technology Research and Development Program of China(2006AA04Z427).
文摘Disassembly sequence planning （DSP） plays a significant role in maintenance planning of the aircraft. It is used during the design stage for the analysis of maintainability of the aircraft. To solve product disassembly sequence planning problems efficiently, a product disassembly hybrid graph model, which describes the connection, non-connection and precedence relationships between the product parts, is established based on the characteristic of disassembly. Farther, the optimization model is provided to optimize disassembly sequence. And the solution methodology based on the genetic/simulated annealing algorithm with binaxy-tree algorithm is given. Finally, an example is analyzed in detail, and the result shows that the model is correct and efficient.
文摘The EPNSim Graph was used to establish simulation models for an integrated steelmaking-casting-rolling production system.The simulation software was developed on the basis of the EPNSim Graph models and some production plans have been simulated with the software.The simulation results proved that the model established by EPNSim Graph is reliable.
基金supported by National High Technology of China ("863 program") under Grant No. 2015AA015702NSAF under Grant No. U1530118+1 种基金NSFC under Grant No. 61602030National Basic Research Program of China ("973 program") under Grant No. 2013CB329101
文摘In multi-layer satellite-terrestrial network, Contact Graph Routing(CGR) uses the contact information among satellites to compute routes. However, due to the resource constraints in satellites, it is extravagant to configure lots of the potential contacts into contact plans. What's more, a huge contact plan makes the computing more complex, which further increases computing time. As a result, how to design an efficient contact plan becomes crucial for multi-layer satellite network, which usually has a large scaled topology. In this paper, we propose a distributed contact plan design scheme for multi-layer satellite network by dividing a large contact plan into several partial parts. Meanwhile, a duration based inter-layer contact selection algorithm is proposed to handle contacts disruption problem. The performance of the proposed design was evaluated on our Identifier/Locator split based satellite-terrestrial network testbed with 79 simulation nodes. Experiments showed that the proposed design is able to reduce the data delivery delay.
文摘The specificities of collision-free path planning of space manipulators are analyzed. Path planning strategies are presented in consideration of these specificities, and an implementation procedure is also described in detail according to these strategies.
