Translator Disclaimer
Paper
21 March 1989 Path Planning For A Class Of Cutting Operations
Author Affiliations +
Abstract
Optimizing processing time in some contour-cutting operations requires solving the so-called no-load path problem. This problem is formulated and an approximate resolution method (based on heuristic search techniques) is described. Results for real-life instances (clothing layouts in the apparel industry) are presented and evaluated.
© (1989) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jose Tavora "Path Planning For A Class Of Cutting Operations", Proc. SPIE 1095, Applications of Artificial Intelligence VII, (21 March 1989); https://doi.org/10.1117/12.969290
PROCEEDINGS
11 PAGES


SHARE
Advertisement
Advertisement
Back to Top