| Sign In to gain access to subscriptions and/or personal tools. |
Representing and Aggregating Engineering Quantities with Preference Structure for Set-based Concurrent EngineeringDepartment of Mechanical Engineering and Intelligent Systems, The University of Electro-Communications, 1-5-1 Chofugaoka, Chofu-shi, 182-8585, Tokyo, Japan
Department of Mechanical Engineering and Intelligent Systems, The University of Electro-Communications, 1-5-1 Chofugaoka, Chofu-shi, 182-8585, Tokyo, Japan, ishikawa{at}mce.uec.ac.jp The early phase of design intrinsically contains multiple sources of uncertainties in describing the design, and nevertheless the decision-making process at this phase exerts a critical effect upon drawing a successful design. Recently, set-based concurrent engineering (SBCE) has been attracting public attention as an emerging CE paradigm. Representing and communicating set-valued information are useful in handling engineering uncertainties and efficient for the collaboration between designers in the CE environment. Even if we can readily know that SBCE is efficient and powerful enough for large-scale design and management, the existing literature does not give the details of methods to achieve SBCE principles. We have developed a computer-based framework, called preference set-based design (PSD), for implementing SBCE principles, which consists of set representation, propagation, modification, narrowing, and aggregation methods. This article focuses on the set representation and aggregation methods that play an important role in the CE environment. This article proposes new engineering quantities that can capture the designers preference structure on both the continuous and the discrete sets. A new aggregation method is presented to aggregate the proposed engineering quantities. A comparative analysis with the existing representation and aggregation techniques is also provided.
Key Words: set-based concurrent engineering set representation set aggregation preference measure of uncertainty
Concurrent Engineering, Vol. 13, No. 2,
123-133 (2005) |
|||