بهينه سازي در مديريت برنامه نويسي ماشين هاي كنترل عددي با تعيين كوتاه ترين مسير حركت بدون برخورد با موانع

Optimizing Management Method for Programming Numerically Controlled Mashine Tools

This paper presents an algorithmic approach to solve the problem of excessive travel in C.N.C. machine tools by introducing an efficient management method to compute the shortest path between the given sets of points (origin and destination) in R2 (x, y) plane. When a work piece is located (as an obstacle) between sets of points, it is proved that the optimum path between these points would be formed by sequences of connected straight line segments whose intermediate end points are vertices of an appropriate polygonal (closed control barrier). The case of one origin, one destination, and a set of barriers is considered in this research. This method is computationally efficient.