Using Parameterized Pareto Sets to Model Design Concepts

被引:25
|
作者
Malak, Richard J., Jr. [1 ]
Paredis, Christiaan J. J. [2 ]
机构
[1] Texas A&M Univ, Dept Mech Engn, College Stn, TX 77843 USA
[2] Georgia Inst Technol, George W Woodruff Sch Mech Engn, Atlanta, GA 30332 USA
基金
美国国家科学基金会;
关键词
decision theory; design engineering; mechanical engineering; parameter estimation; Pareto analysis; CONCEPT EXPLORATION METHOD; CONCEPT SELECTION; DECISION;
D O I
10.1115/1.4001345
中图分类号
TH [机械、仪表工业];
学科分类号
0802 ;
摘要
The decisions designers make during conceptual design can have a large impact on the success of a project. Conceptual design decisions can be challenging because the imprecise nature of design concepts make them difficult to model. Prior literature exists on using Pareto sets to model design concepts abstractly in the space of decision attributes. However, this approach has limitations when the concept under consideration is a component of a larger system. The need to relate component-level decision attributes to system-level decision objectives can lead to a violation of the assumptions underlying classical Pareto dominance. The main contribution of this article is a new dominance criterion, called parameterized Pareto dominance, which is applicable in such situations. It is a generalization of the classical dominance rule and is found to be sound from a decision-theoretic perspective. A secondary contribution is the articulation of a generalized methodology for constructing concept models based on classical or parameterized Pareto sets using either observational or model-generated data. The modeling procedure, including the new dominance criterion, is demonstrated on observational data about hydraulic cylinders. The question of whether a parameterized Pareto set can be an adequate representation of a component-level design concept is evaluated on a gearbox conceptual design problem for which the component-level decision is subordinate to system-level vehicle design problem.
引用
收藏
页数:11
相关论文
共 50 条
  • [11] Dynamic programming with Pareto sets
    Struchenkov V.I.
    Journal of Applied and Industrial Mathematics, 2010, 4 (03) : 428 - 430
  • [12] DISTRIBUTED COMPUTATION OF PARETO SETS
    Dandurand, Brian
    Wiecek, Margaret M.
    SIAM JOURNAL ON OPTIMIZATION, 2015, 25 (02) : 1083 - 1109
  • [13] Representing Sampled Pareto Frontiers as Parameterized Continuous Manifolds Using Self-Organizing Maps
    Daskilewicz, Matthew J.
    German, Brian J.
    AIAA JOURNAL, 2014, 52 (11) : 2480 - 2490
  • [14] Parameterized Unified Modulation Model Design for Satellite Communications
    Yuan, Yabo
    Wang, Bo
    Wu, Bin
    PROCEEDINGS OF THE 28TH CONFERENCE OF SPACECRAFT TT&C TECHNOLOGY IN CHINA: OPENNESS, INTEGRATION AND INTELLIGENT INTERCONNECTION, 2018, 445 : 501 - 512
  • [15] A formal model for parameterized solids in a visual design language
    Cox, PT
    Smedley, TJ
    JOURNAL OF VISUAL LANGUAGES AND COMPUTING, 2000, 11 (06): : 687 - 710
  • [16] Parameterized BPEL processes: Concepts and implementation
    Karastoyanova, Dimka
    Leymann, Frank
    Nitzsche, Joerg
    Wetzstein, Branimir
    Wutke, Daniel
    BUSINESS PROCESS MANAGEMENT, PROCEEDINGS, 2006, 4102 : 471 - 476
  • [17] The complexity of irredundant sets parameterized by size
    Downey, RG
    Fellows, MR
    Raman, V
    DISCRETE APPLIED MATHEMATICS, 2000, 100 (03) : 155 - 167
  • [18] Parameterized complexity of perfectly matched sets *,**
    Agrawal, Akanksha
    Bhattacharjee, Sutanay
    Jana, Satyabrata
    Sahu, Abhishek
    THEORETICAL COMPUTER SCIENCE, 2023, 958
  • [19] Parameterized Complexity of Perfectly Matched Sets
    Indian Institute of Technology Madras, Chennai, India
    不详
    Leibniz Int. Proc. Informatics, LIPIcs, 1868,
  • [20] THE TOPOLOGICAL STRUCTURE IN PARAMETERIZED ROUGH SETS
    Tsang, Eric C. C.
    Zha, Suyun
    PROCEEDINGS OF 2013 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS (ICMLC), VOLS 1-4, 2013, : 687 - 692