STEP-NC compliant approach for setup planning problem on multiple fixture pallets

2013 ◽  
Vol 32 (4) ◽  
pp. 781-791 ◽  
Author(s):  
Stefano Borgia ◽  
Andrea Matta ◽  
Tullio Tolio
Keyword(s):  
Planning Problem ◽  
Setup Planning ◽  
Compliant Approach

Software Development for Setup Planning of Rotational Part

2015 ◽  
Vol 4 (1) ◽  
Author(s):  
Sumit Dwivedi ◽  
Shahnawaz Alam
Keyword(s):  
Tolerance Analysis ◽  
Control Technique ◽  
Planning Problem ◽  
Setup Planning ◽  
Tolerance Chart ◽  
Efficiency And Effectiveness ◽  
Planning Algorithm ◽  
Rotational Part ◽  
Sound Foundation ◽  
Tolerance Control

An innovative approach was developed to solve the problem of setup planning, which is the most critical problem in process planning for discrete metal parts. Setup planning is the act of preparing detailed work instructions for setting up a part. The major objective of this research is to improve the performance of CAPP systems by developing a systematic approach to generate practical setup plans based on tolerance analysis. A comprehensive literature review on tolerance control in CAPP was conducted. It was found that tolerance chart analysis, a traditional tolerance control technique, is reactive in nature and can be greatly improved by solving the problem of setup planning. In order to develop a theoretically sound foundation for tolerance analysis-based setup planning, the problem of tolerance stack up in NC machining was analyzed in terms of manufacturing error analysis. Guidelines for setup planning were then developed based on the analysis. To systematically solve the setup planning problem, a graph theoretical setup planning algorithm for rotational parts was then developed for automated and integrated setup planning and fixture design. Its efficiency and effectiveness evaluated. The result is promising. The algorithms were then computerized. A setup planning program was developed under the Microsoft Windows environment using C.

Multi-Part Setup Planning for Sheet Metal Bending Operations

1997 ◽  
Author(s):  
Satyandra K. Gupta ◽  
David Alan Bourne
Keyword(s):  
Process Planning ◽  
Planning Problem ◽  
Setup Planning ◽  
Planning Systems ◽  
Spatial Constraints ◽  
Part Family ◽  
Production Environments ◽  
Planning Algorithm ◽  
Planning Technique ◽  
Planning Problems

Abstract Most process planning systems solve process planning problem for individual parts. Quite often, many different parts can be produced on shared setups. However, plans generated by current process planning systems fail to exploit this commonality between setups and try to generate optimal setups for individual parts. In this paper, we present an algorithm for multi-part setup planning. This algorithm takes a family of parts and tries to find a composite setup plan that can work for every part in the part family. Our setup planning algorithm employs a new two-step approach to handle multi-part setup planning problems. First, we identify the setup constraints imposed by various bending operations in the part family. These setup constraints describe spatial constraints on sizes and locations of various tooling stages in the setup. After identifying setup constraints, we try to generate setup plans that can satisfy all setup constraints. Any setup plan that satisfies all setup constraints is capable of accommodating every part in the part family. Setup changes constitute a major portion of the production time in batch production environments. We believe that multipart setup planning technique can be used to significantly cut down the total number of setups and increase the overall throughput.

scholarly journals A hybrid optimization approach for setup planning with tolerance constraints

2018 ◽  
Vol 249 ◽  
pp. 03012 ◽  
Author(s):  
Wenbo Wu ◽  
Jiani Zeng ◽  
Zhengdong Huang
Keyword(s):  
Optimization Methods ◽  
Local Optimum ◽  
Planning Problem ◽  
Optimization Approach ◽  
Setup Planning ◽  
Computer Aided Process Planning ◽  
Hybrid Particle Swarm Optimization ◽  
Computer Aided ◽  
Constraint Problem

Computer-aided process planning (CAPP) plays an important role in integrated manufacturing system and it can serve as a bridge between CAD and CAM. As a crucial part of CAPP, setup planning is a multi-constraint problem, in which the precision takes priority over efficiency. However, instead of precision constraints, traditional optimization methods have paid much more attention to efficiency requirements. This leads to the reduction in the precision of the final parts. This paper develops an optimization approach for solving computer-aided setup planning problem, which takes into account various constraints, especially the precision requirements specified by designers. First, objective function of the optimization model is formulated and a series of constraints, including feature precedence, tool approaching direction (TAD), and precision requirements are systematically created. Next, the model is solved by using a hybrid particle swarm optimization algorithm. In order to overcome the local optimum trap, mutation and exchange operations are adopted from the genetic algorithm. Finally, a part is tested in the case study and the validation of this method is proved.

Sheet Metal Bending: Generating Shared Setups

1999 ◽  
Vol 121 (4) ◽  
pp. 689-694 ◽  
Author(s):  
S. K. Gupta ◽  
D. A. Bourne
Keyword(s):  
Sheet Metal ◽  
Process Planning ◽  
Planning Problem ◽  
Setup Planning ◽  
Planning Systems ◽  
Batch Production ◽  
Planning Techniques ◽  
Production Environments ◽  
Sheet Metal Bending ◽  
Different Parts

Contemporary process planners for sheet metal bending solve the process planning problem for individual parts. Quite often, many different parts can be produced on shared setups. However, plans generated by current process planning systems fail to exploit this commonality between setups and try to generate optimal setups for individual parts. In this paper, we present an algorithm for multi-part setup planning for sheet metal bending. This algorithm takes a set of parts and operation sequences for these parts, and tries to find a shared setup plan that can work for every part in the set. Setup changes constitute a major portion of the production time in batch production environments. Therefore, multi-part setup planning techniques can be used to significantly cut down the total number of setups and increase the overall through-put.

Route planning of intelligent bridge cranes based on an improved artificial potential field method

2021 ◽  
pp. 1-8
Author(s):  
Zhengyan Chang ◽  
Zhengwei Zhang ◽  
Qiang Deng ◽  
Zheren Li
Keyword(s):  
Potential Field ◽  
Autonomous Navigation ◽  
Route Planning ◽  
Simple Algorithm ◽  
Field Method ◽  
Artificial Potential Field ◽  
Planning Problem ◽  
Operating Characteristics ◽  
Potential Field Method ◽  
Artificial Potential Field Method

The artificial potential field method is usually applied to the path planning problem of driverless cars or mobile robots. For example, it has been applied for the obstacle avoidance problem of intelligent cars and the autonomous navigation system of storage robots. However, there have been few studies on its application to intelligent bridge cranes. The artificial potential field method has the advantages of being a simple algorithm with short operation times. However, it is also prone to problems of unreachable targets and local minima. Based on the analysis of the operating characteristics of bridge cranes, a two-dimensional intelligent running environment model of a bridge crane was constructed in MATLAB. According to the basic theory of the artificial potential field method, the double-layer artificial potential field method was deduced, and the path and track fuzzy processing method was proposed. These two methods were implemented in MATLAB simulations. The results showed that the improved artificial potential field method could avoid static obstacles efficiently.

scholarly journals Normal form approach in the motion planning of space robots: a case study

2021 ◽  
Author(s):  
Krzysztof Tchoń ◽  
Katarzyna Zadarnowska
Keyword(s):  
Normal Form ◽  
Motion Planning ◽  
Normal Forms ◽  
Inverse Dynamics ◽  
Planning Problem ◽  
Inverse Dynamics Problem ◽  
Velocity Level ◽  
Form Approach ◽  
Space Approach

AbstractWe examine applicability of normal forms of non-holonomic robotic systems to the problem of motion planning. A case study is analyzed of a planar, free-floating space robot consisting of a mobile base equipped with an on-board manipulator. It is assumed that during the robot’s motion its conserved angular momentum is zero. The motion planning problem is first solved at velocity level, and then torques at the joints are found as a solution of an inverse dynamics problem. A novelty of this paper lies in using the chained normal form of the robot’s dynamics and corresponding feedback transformations for motion planning at the velocity level. Two basic cases are studied, depending on the position of mounting point of the on-board manipulator. Comprehensive computational results are presented, and compared with the results provided by the Endogenous Configuration Space Approach. Advantages and limitations of applying normal forms for robot motion planning are discussed.

Sign in / Sign up

Export Citation Format

Share Document