Analysis on accuracy of forging die sets by disassembly planning algorithm with multiple agents

2001 ◽  
Vol 119 (1-3) ◽  
pp. 140-145
Author(s):  
T Ohashi ◽  
A Nakata ◽  
Y Saotome ◽  
S Imamura
Keyword(s):  
Multiple Agents ◽  
Planning Algorithm ◽  
Forging Die ◽  
Disassembly Planning

Research on Module Partition Strategy of Optional Disassembly

2009 ◽  
Vol 419-420 ◽  
pp. 69-72
Author(s):  
Wei Lin Wang ◽  
Jia Tai Zhang
Keyword(s):  
Optimal Solutions ◽  
Huge Number ◽  
Analysis And Evaluation ◽  
Sequence Generation ◽  
Disassembly Sequence ◽  
Long Time ◽  
Planning Algorithm ◽  
Module Partition ◽  
Proper Analysis ◽  
Disassembly Planning

Optional disassembly could fulfill the process that parts remove from assembly, which is useful for product maintain, discarding and recycle. Total disassembly planning algorithm can be obtained through proper analysis and evaluation, however that is a difficult process. It is hard to obtain optimal solutions when a huge number of parts are to be removed from an assembly. Exponential explosion during the process of disassembly sequence generation has become a bottleneck for a long time due to over large number of parts included in the product. To solve this problem, an approach based on the modulization is proposed in the paper to generate the disassembly sequence. To partition modules of manufacture equipments, the module identifying method based on multi-rule decision can effectively solve the explosive problem. This method deals with the restrictions and limits of parts before disassembly, hence making disassembly more like the situation of the fact which is limiting the quantity of disassembly combinations, enhancing the efficiency of disassembly and making disassembly much easier.

Prodigy Planning Algorithm

1994 ◽  
Author(s):  
Eugene Fink ◽  
Manuela Veloso
Keyword(s):  
Planning Algorithm

scholarly journals A new method on motion planning for mobile robots using jump point search and Bezier curves

2021 ◽  
Vol 18 (4) ◽  
pp. 172988142110192
Author(s):  
Ben Zhang ◽  
Denglin Zhu
Keyword(s):  
Motion Planning ◽  
Initial Point ◽  
Target Point ◽  
Jump Point ◽  
Bezier Curves ◽  
Bézier Curves ◽  
Front End ◽  
Planning Algorithm ◽  
Point Search ◽  
Path Planning Algorithm

Innovative applications in rapidly evolving domains such as robotic navigation and autonomous (driverless) vehicles rely on motion planning systems that meet the shortest path and obstacle avoidance requirements. This article proposes a novel path planning algorithm based on jump point search and Bezier curves. The proposed algorithm consists of two main steps. In the front end, the improved heuristic function based on distance and direction is used to reduce the cost, and the redundant turning points are trimmed. In the back end, a novel trajectory generation method based on Bezier curves and a straight line is proposed. Our experimental results indicate that the proposed algorithm provides a complete motion planning solution from the front end to the back end, which can realize an optimal trajectory from the initial point to the target point used for robot navigation.

Sign in / Sign up

Export Citation Format

Share Document