Path Planning For A Class Of Cutting Operations

Jose Tavora

doi:10.1117/12.969290

21 March 1989 Path Planning For A Class Of Cutting Operations

Jose Tavora

Proceedings Volume 1095, Applications of Artificial Intelligence VII; (1989) https://doi.org/10.1117/12.969290
Event: SPIE 1989 Technical Symposium on Aerospace Sensing, 1989, Orlando, FL, United States

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.

Citation Download Citation

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

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available