The integrated information network is a large capacity information network that integrates various communication platforms on the ground, at sea, in the air and in the deep air through the inter-satellite and satellit...The integrated information network is a large capacity information network that integrates various communication platforms on the ground, at sea, in the air and in the deep air through the inter-satellite and satellite-ground links to acquire information accurately, process it quickly, and transmit it efficiently. The satellite communication, as an important part of integrated information networks, is one of main approaches to acquire, process and distribute communication information and resources. In this paper, based on current researches of the satellite communication network, we put forward a 3-layer satellite communication network model based on the Software Defined Network (SDN). Meanwhile, to improve current routing policies of the Low Earth Orbit (LEO) satellite communication network, we put forward an Adaptive Routing Algorithm (ARA) to sustain the shortest satellite communication link. Experiment results show that the proposed method can effectively reduce link distance and communication delay, and realize adaptive path planning.展开更多
As the market competition among enterprises grows intensively and the demand for high quality products increases rapidly, product quality inspection and control has become one of the most important issues of manufactu...As the market competition among enterprises grows intensively and the demand for high quality products increases rapidly, product quality inspection and control has become one of the most important issues of manufacturing, and improving the efficiency and accuracy of inspection is also one of problems which enterprises must solve. It is particularly important to establish rational inspection planning for parts before inspecting product quality correctly. The traditional inspection methods have been difficult to satisfy the requirements on the speed and accuracy of modern manufacturing, so CAD-based computer-aided inspection planning （CAIP） system with the coordinate measuring machines （CMM） came into being. In this paper, an algorithm for adaptive sampling and collision-free inspection path generation is proposed, aiming at the CAD model-based inspection planning for coordinate measuring machines （CMM）. Firstly, using the method of step adaptive subdivision and iteration , the sampling points for the specified number with even distribution will be generated automatically. Then, it generates the initial path by planning the inspection sequence of measurement points according to the values of each point＇s weight sum of parameters, and detects collision by constructing section lines between the probe swept-volume surfaces and the part surfaces, with axis-aligned bounding box （AABB） filtering to improve the detection efficiency. For collided path segments, it implements collision avoidance firstly aiming at the possible outer-circle features, and then at other collisions, for which the obstacle-avoiding movements are planned with the heuristic rules, and combined with a designed expanded AABB to set the obstacle-avoiding points. The computer experimental results show that the presented algorithm can plan sampling points＇ locations with strong adaptability for different complexity of general surfaces, and generate efficient optimum path in a short time and avoid collision effectively.展开更多
Assembly path planning is a crucial problem in assembly related design and manufacturing processes. Sampling based motion planning algorithms are used for computational assembly path planning. However, the performance...Assembly path planning is a crucial problem in assembly related design and manufacturing processes. Sampling based motion planning algorithms are used for computational assembly path planning. However, the performance of such algorithms may degrade much in environments with complex product structure, narrow passages or other challenging scenarios. A computational path planner for automatic assembly path planning in complex 3D environments is presented. The global planning process is divided into three phases based on the environment and specific algorithms are proposed and utilized in each phase to solve the challenging issues. A novel ray test based stochastic collision detection method is proposed to evaluate the intersection between two polyhedral objects. This method avoids fake collisions in conventional methods and degrades the geometric constraint when a part has to be removed with surface contact with other parts. A refined history based rapidly-exploring random tree （RRT） algorithm which bias the growth of the tree based on its planning history is proposed and employed in the planning phase where the path is simple but the space is highly constrained. A novel adaptive RRT algorithm is developed for the path planning problem with challenging scenarios and uncertain environment. With extending values assigned on each tree node and extending schemes applied, the tree can adapts its growth to explore complex environments more efficiently. Experiments on the key algorithms are carried out and comparisons are made between the conventional path planning algorithms and the presented ones. The comparing results show that based on the proposed algorithms, the path planner can compute assembly path in challenging complex environments more efficiently and with higher success. This research provides the references to the study of computational assembly path planning under complex environments.展开更多
The burgeoning robotics industry has catalyzed significant strides in the development and deployment of industrial and service robotic arms, positioning path planning as a pivotal facet for augmenting their operationa...The burgeoning robotics industry has catalyzed significant strides in the development and deployment of industrial and service robotic arms, positioning path planning as a pivotal facet for augmenting their operational safety and efficiency. Existing path planning algorithms, while capable of delineating feasible trajectories, often fall short of achieving optimality, particularly concerning path length, search duration, and success likelihood. This study introduces an enhanced Rapidly-Exploring Random Tree (RRT) algorithm, meticulously designed to rectify the issues of node redundancy and the compromised path quality endemic to conventional RRT approaches. Through the integration of an adaptive pruning mechanism and a dynamic elliptical search strategy within the Informed RRT* framework, our algorithm efficiently refines the search tree by discarding branches that surpass the cost of the optimal path, thereby refining the search space and significantly boosting efficiency. Extensive comparative analysis across both two-dimensional and three-dimensional simulation settings underscores the algorithm’s proficiency in markedly improving path precision and search velocity, signifying a breakthrough in the domain of robotic arm path planning.展开更多
基金supported in part by the National Natural Science Foundation of China (No. 61571104)the Sichuan Science and Technology Program (No. 2018JY0539)+2 种基金the Key projects of the Sichuan Provincial Education Department (No. 18ZA0219)the Fundamental Research Funds for the Central Universities (No. ZYGX2017KYQD170)the Innovation Funding (No. 2018510007000134)
文摘The integrated information network is a large capacity information network that integrates various communication platforms on the ground, at sea, in the air and in the deep air through the inter-satellite and satellite-ground links to acquire information accurately, process it quickly, and transmit it efficiently. The satellite communication, as an important part of integrated information networks, is one of main approaches to acquire, process and distribute communication information and resources. In this paper, based on current researches of the satellite communication network, we put forward a 3-layer satellite communication network model based on the Software Defined Network (SDN). Meanwhile, to improve current routing policies of the Low Earth Orbit (LEO) satellite communication network, we put forward an Adaptive Routing Algorithm (ARA) to sustain the shortest satellite communication link. Experiment results show that the proposed method can effectively reduce link distance and communication delay, and realize adaptive path planning.
基金Tsupported by Innovation Fund of Ministry of Science andTechnology of China for Small Technology-Based Firms (Grant No.04C26223400148)
文摘As the market competition among enterprises grows intensively and the demand for high quality products increases rapidly, product quality inspection and control has become one of the most important issues of manufacturing, and improving the efficiency and accuracy of inspection is also one of problems which enterprises must solve. It is particularly important to establish rational inspection planning for parts before inspecting product quality correctly. The traditional inspection methods have been difficult to satisfy the requirements on the speed and accuracy of modern manufacturing, so CAD-based computer-aided inspection planning （CAIP） system with the coordinate measuring machines （CMM） came into being. In this paper, an algorithm for adaptive sampling and collision-free inspection path generation is proposed, aiming at the CAD model-based inspection planning for coordinate measuring machines （CMM）. Firstly, using the method of step adaptive subdivision and iteration , the sampling points for the specified number with even distribution will be generated automatically. Then, it generates the initial path by planning the inspection sequence of measurement points according to the values of each point＇s weight sum of parameters, and detects collision by constructing section lines between the probe swept-volume surfaces and the part surfaces, with axis-aligned bounding box （AABB） filtering to improve the detection efficiency. For collided path segments, it implements collision avoidance firstly aiming at the possible outer-circle features, and then at other collisions, for which the obstacle-avoiding movements are planned with the heuristic rules, and combined with a designed expanded AABB to set the obstacle-avoiding points. The computer experimental results show that the presented algorithm can plan sampling points＇ locations with strong adaptability for different complexity of general surfaces, and generate efficient optimum path in a short time and avoid collision effectively.
基金supported by National Natural Science Foundation of China(Grant No. 51275047)Fund of National Engineering and Research Center for Commercial Aircraft Manufacturing of China(Grant No. 07205)Specialized Research Fund for the Doctoral Program of Higher Education of China(Grant No. 20091101110010)
文摘Assembly path planning is a crucial problem in assembly related design and manufacturing processes. Sampling based motion planning algorithms are used for computational assembly path planning. However, the performance of such algorithms may degrade much in environments with complex product structure, narrow passages or other challenging scenarios. A computational path planner for automatic assembly path planning in complex 3D environments is presented. The global planning process is divided into three phases based on the environment and specific algorithms are proposed and utilized in each phase to solve the challenging issues. A novel ray test based stochastic collision detection method is proposed to evaluate the intersection between two polyhedral objects. This method avoids fake collisions in conventional methods and degrades the geometric constraint when a part has to be removed with surface contact with other parts. A refined history based rapidly-exploring random tree （RRT） algorithm which bias the growth of the tree based on its planning history is proposed and employed in the planning phase where the path is simple but the space is highly constrained. A novel adaptive RRT algorithm is developed for the path planning problem with challenging scenarios and uncertain environment. With extending values assigned on each tree node and extending schemes applied, the tree can adapts its growth to explore complex environments more efficiently. Experiments on the key algorithms are carried out and comparisons are made between the conventional path planning algorithms and the presented ones. The comparing results show that based on the proposed algorithms, the path planner can compute assembly path in challenging complex environments more efficiently and with higher success. This research provides the references to the study of computational assembly path planning under complex environments.
文摘The burgeoning robotics industry has catalyzed significant strides in the development and deployment of industrial and service robotic arms, positioning path planning as a pivotal facet for augmenting their operational safety and efficiency. Existing path planning algorithms, while capable of delineating feasible trajectories, often fall short of achieving optimality, particularly concerning path length, search duration, and success likelihood. This study introduces an enhanced Rapidly-Exploring Random Tree (RRT) algorithm, meticulously designed to rectify the issues of node redundancy and the compromised path quality endemic to conventional RRT approaches. Through the integration of an adaptive pruning mechanism and a dynamic elliptical search strategy within the Informed RRT* framework, our algorithm efficiently refines the search tree by discarding branches that surpass the cost of the optimal path, thereby refining the search space and significantly boosting efficiency. Extensive comparative analysis across both two-dimensional and three-dimensional simulation settings underscores the algorithm’s proficiency in markedly improving path precision and search velocity, signifying a breakthrough in the domain of robotic arm path planning.
