Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/55084
Title: Optimal connection of loops in laminated object manufacturing
Authors: Tang, K
Pang, A 
Keywords: Maximum linear intersection
Path planning
Layered manufacturing
Issue Date: 2003
Publisher: Elsevier
Source: CAD computer aided design, 2003, v. 35, no. 11, p. 1011-1022 How to cite?
Journal: CAD computer aided design 
Abstract: There are manufacturing applications where a tool needs to move along a prescribed path performing machining operations. An excellent application of this problem is found in the increasingly popular layered manufacturing (LM) methods, where the laser traces the profile of a layer by moving along the path while the laser turns on. The path is typically described by a sequence of curves. For the entire process, the tool must move along each curve exactly once. For typical paths, significant time may be wasted in the movement between the end point of one curve to the start point of the next one along which the laser is turned off. Normally, this non-cutting motion is a straight-line motion so to minimize the distance. A good process plan would minimize the time wasted on such motion. A maximum linear intersection (MLI) algorithm is proposed to solve this problem. Next, we present a variation of the GA based method to solve it. We compare the performance of these two techniques, both in terms of jumping distance and the computing time requirement, with a view to their application to real-time path planning in LM applications.
URI: http://hdl.handle.net/10397/55084
ISSN: 0010-4485
DOI: 10.1016/S0010-4485(02)00162-8
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

18
Citations as of Feb 25, 2017

WEB OF SCIENCETM
Citations

15
Last Week
0
Last month
Citations as of Aug 15, 2017

Page view(s)

30
Last Week
4
Last month
Checked on Aug 21, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.