Share Email Print

Proceedings Paper

Path Planning For A Class Of Cutting Operations
Author(s): Jose Tavora
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 21 March 1989
PDF: 11 pages
Proc. SPIE 1095, Applications of Artificial Intelligence VII, (21 March 1989); doi: 10.1117/12.969290
Show Author Affiliations
Jose Tavora, Laboratorio Nacional Engenharia Tecnologia Industrial (Portugal)

Published in SPIE Proceedings Vol. 1095:
Applications of Artificial Intelligence VII
Mohan M. Trivedi, Editor(s)

© SPIE. Terms of Use
Back to Top