New models and heuristics for component placement in printed circuit board assembly

Burke, Edmund K.; Cowling, Peter I.; Keuthen, R.

doi:10.1109/iciis.1999.810238

Cited by 22 publications

(10 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…An option is to use the iterative conjugate gradients [11], but due to its O(n 2 ) complexity, it is not suitable for large volumes [6]. Multigrid solvers are normally very fast, but require problemdependent design decisions [7]. An alternative is to use sparse direct Cholesky solvers [5].…”

Section: Methodsmentioning

confidence: 99%

Regularisation of 3D Signed Distance Fields

2009

View full text Add to dashboard Cite

Signed 3D distance fields are used a in a variety of domains. From shape modelling to surface registration. They are typically computed based on sampled point sets. If the input point set contains holes, the behaviour of the zero-level surface of the distance field is not well defined. In this paper, a novel regularisation approach is described. It is based on an energy formulation, where both local smoothness and data fidelity are included. The minimisation of the global energy is shown to be the solution of a large set of linear equations. The solution to the linear system is found by sparse Cholesky factorisation. It is demonstrated that the zero-level surface will act as a membrane after the proposed regularisation. This effectively closes holes in a predictable way. Finally, the performance of the method is tested with a set of synthetic point clouds of increasing complexity. DataThe data used is a set of synthetic shapes represented as point sets, where each point also has a normal. It is assumed that there are consistent normal directions

show abstract

Section: Methodsmentioning

confidence: 99%

Regularisation of 3D Signed Distance Fields

2009

View full text Add to dashboard Cite

show abstract

“…Several papers have focused on turret machines (e.g., Wilhelm et al 2003) and reviews (Nof et al 1997;Spieksma et al 2000;Ji and Wan 2001) but few report studies of DHPMs. The work that has been done has focused on related types of machines, including single-arm robotic systems (Nof et al 1997), the DYNAPERT MPS500 (Ahmadi et al 1988(Ahmadi et al , 1995(Ahmadi et al , 1990Ahmadi and Kouvelis 1994;Grotzinger 1992), a different type of dual-head machine (Chan and Mercer 1998), a machine that has a single head and three spindles (Crama et al 1990), the Quad 4000 series placement machine with a rotary head mounted on an arm (Altinkemer et al 2000 and machines that have a single head fitted with multiple spindles (Wang et al 1999;Burke et al 1999;Hong et al 2000). The most prevalent approach to achieving the flexibility needed to assemble a variety of circuit cards on an assembly line is to decompose the decisions required to prescribe a process plan into a set of related problems (Ahmadi et al 1988;Grotzinger 1992;McGinnis et al 1992).…”

Section: Literature Reviewmentioning

confidence: 98%

Enabling flexibility on a dual head placement machine by optimizing platform-tray-feeder picking operations

Wilhelm

Zhu

2009

Flex Serv Manuf J

View full text Add to dashboard Cite

The typical circuit card assembly line includes one or more dual head placement machines (DHPMs), which are capable of highly accurate placement and promise the flexibility to assemble a broad variety of circuit card types, each in minimal time. Each DHPM stages components for picking from feeder racks and platform tray feeders (PTFs), which are well suited for components that are large or odd-shaped, contributing to DHPM flexibility. The purpose of this paper is to present a model that can optimize operations that pick from a PTF and/or a feeder rack with the goal of enabling the flexibility needed to assemble a variety of circuit card types efficiently. The primary objective of this paper is a model to optimize operations that pick from a PTF and/or a feeder rack; a secondary objective is computational testing to evaluate the solvability of the model within reasonable run times.

show abstract

“…Its placement mechanism is mounted on a rotating turret (drum or carousel) and has multiple placement heads. The heads rotate between fixed pickup and fixed placement points (Burke et al, 1999;Bentzen, 2000;Gastel, 2002).…”

Section: Turret-type Placement Machinementioning

confidence: 99%