Home / Issues / 15.2018 / Efficient Error-bounded Curvature Optimization for Smooth Machining Paths
Document Actions

VISIGRAPP 2018

Efficient Error-bounded Curvature Optimization for Smooth Machining Paths

  1. Evgenia Selinger Department of Computer Science and Electrical Engineering, Jacobs University, Bremen, Germany
  2. Lars Linsen Department of Mathematics and Computer Science, Westfälische Wilhelms-Universität Münster, Germany

Abstract

Automated machining with 3-axis robots requires the generation of tool paths in form of positions of the tool tip. For 5-axis robots, the orientations of the tool at each position needs to be provided, as well. Such a tool path can be described in form of two curves, one for the positional information (as for 3-axis machining) and one for the orientational information, where the orientation is given by the vector that points from a point on the orientation curve to the respective point on the position curve. As the robots need to slow down for sharp turns, i.e., high curvatures in the tool path lead to slow processing, our goal is to generate tool paths with minimized curvatures and a guaranteed error bound. Starting from an initial tool path, which is given in the form of polygonal representations of the position and orientation curves, we generate optimized versions of the curves in the form of B-spline curves that lie within some error bounds of the input path. Our approach first computes an optimized version of the position curve within a tolerance band of the input curve. The outcome of this first step can directly be applied to 3-axis machining. Based on this first step, for 5-axis machining the orientation curve needs to be updated to again fit the position curve. Then, the orientation curve is optimized using a similar approach as for the position curve, but the error bounds are given in the form of tolerance frustums that define the tolerance in lead and tilt. For an efficient optimization procedure, our approach analyzes the input path and splits it into small (partially overlapping) groups before optimizing the position curve. The groups are categorized according to their geometric complexity and handled accordingly using two different optimization procedures. The simpler, but faster algorithm uses a local spline approximation, while the slower, but better algorithm uses a local sleeve approach. These algorithms are adapted to both the position and orientation curve optimization. Subsequently, the groups are combined into a complete tool path in the form of G2- continuous B-spline curves, where we have one such curve for 3-axis machining and two such curves defined over the same knot vector for 5-axis machining.

  1. submitted: 2018-05-16,
  2. accepted: 2018-09-04,
  3. published: 2019-07-17

Keywords

Fulltext

License

Any party may pass on this Work by electronic means and make it available for download under the terms and conditions of the Digital Peer Publishing License. The text of the license may be accessed and retrieved at http://www.dipp.nrw.de/lizenzen/dppl/dppl/DPPL_v2_en_06-2004.html.

Number of citations

Visit Google Scholar to find out, how often this paper is cited.