Search

The ability to quickly introduce new quality products is a decisive factor in capturing market share. Because of pressing demands to reduce lead time, analyzing the manufacturability of the proposed design has become an ...

Decisions made during the design of a machined part can significantly affect the product's cost, quality, and lead time. Thus, in order to address the goals of concurrent engineering, it is important to evaluate the ...

For machining purposes, a part is often considered to be a feature-based model (FBM), i.e., a collection of machining features. However, often there can be several different FBM's of the same part. These models correspond ...

Chapman's paper, "Planning for Conjunctive Goals", has been widely acknowledged as a major step towards understanding the nature of nonlinear planning, and it has been one of the bases of later work by others -- but it is ...

In research on concurrent engineering and engineering design, the increasing use of design for manufacturability(DFM) is expanding the scope of traditional design activities in order to identify and eliminate manufacturing ...

In performing regularized set operations on two solids, the most difficult step is boundary classification, in which the boundaries of each solid are split into portions that are inside, outside, or on the surface of the ...

Most practical work on AI planning systems during the last fifteen years has been based on hierarchical task network decomposition, but until now, there has been very little analytical work on the properties of HTN planners. ...

In this paper, we examine how the complexity of domain- independent planning with STRIPS-like operators depends on the nature of the planning operators.<P>We show conditions under which planning is decidable and undecidable. ...

Several early game-playing computer programs used forward pruning (i.e., the practice of deliberately ignoring nodes that are believed unlikely to affect a game tree's minimax value), but this technique did not seem to ...

In previous work, Korf showed that by introducing one problem- reduction step into a state- space search, one could reduce the number of node generations from 0 ((2b)2d ) to 0 (bd ), where b and d are the branching factor ...