Details
| Originalsprache | Englisch |
|---|---|
| Aufsatznummer | 318 |
| Fachzeitschrift | Algorithms |
| Jahrgang | 15 |
| Ausgabenummer | 9 |
| Publikationsstatus | Veröffentlicht - 6 Sept. 2022 |
Abstract
In configuration design, the task is to compose a system out of a set of predefined, modu-lar building blocks assembled by defined interfaces. Product configuration systems, both with or without integration of geometric models, implement reasoning techniques to model and explore the resulting solution spaces. Among others, the formulation of constraint satisfaction problems (CSP) is state of the art and the informational background in many proprietary configuration engine software packages. Basically, configuration design tasks can also be implemented in modern computer aided design (CAD) systems as these contain different techniques for knowledge-based product modeling but literature reports only little about detailed application examples, best practices or training materials. This article aims at bridging this gap and presents a step-by-step implementation guide for CSP-based CAD configurators for combinatorial designs with the example of Autodesk Inventor.
ASJC Scopus Sachgebiete
- Mathematik (insg.)
- Theoretische Informatik
- Mathematik (insg.)
- Numerische Mathematik
- Informatik (insg.)
- Theoretische Informatik und Mathematik
- Mathematik (insg.)
- Computational Mathematics
Zitieren
- Standard
- Harvard
- Apa
- Vancouver
- BibTex
- RIS
in: Algorithms, Jahrgang 15, Nr. 9, 318, 06.09.2022.
Publikation: Beitrag in Fachzeitschrift › Artikel › Forschung › Peer-Review
}
TY - JOUR
T1 - Joining Constraint Satisfaction Problems and Configurable CAD Product Models
T2 - A Step-by-Step Implementation Guide
AU - Gembarski, Paul Christoph
PY - 2022/9/6
Y1 - 2022/9/6
N2 - In configuration design, the task is to compose a system out of a set of predefined, modu-lar building blocks assembled by defined interfaces. Product configuration systems, both with or without integration of geometric models, implement reasoning techniques to model and explore the resulting solution spaces. Among others, the formulation of constraint satisfaction problems (CSP) is state of the art and the informational background in many proprietary configuration engine software packages. Basically, configuration design tasks can also be implemented in modern computer aided design (CAD) systems as these contain different techniques for knowledge-based product modeling but literature reports only little about detailed application examples, best practices or training materials. This article aims at bridging this gap and presents a step-by-step implementation guide for CSP-based CAD configurators for combinatorial designs with the example of Autodesk Inventor.
AB - In configuration design, the task is to compose a system out of a set of predefined, modu-lar building blocks assembled by defined interfaces. Product configuration systems, both with or without integration of geometric models, implement reasoning techniques to model and explore the resulting solution spaces. Among others, the formulation of constraint satisfaction problems (CSP) is state of the art and the informational background in many proprietary configuration engine software packages. Basically, configuration design tasks can also be implemented in modern computer aided design (CAD) systems as these contain different techniques for knowledge-based product modeling but literature reports only little about detailed application examples, best practices or training materials. This article aims at bridging this gap and presents a step-by-step implementation guide for CSP-based CAD configurators for combinatorial designs with the example of Autodesk Inventor.
KW - computer aided design
KW - constraint satisfaction problems
KW - knowledge-based engineering
KW - product configurators
KW - solution space modeling
UR - http://www.scopus.com/inward/record.url?scp=85138461362&partnerID=8YFLogxK
U2 - 10.3390/a15090318
DO - 10.3390/a15090318
M3 - Article
AN - SCOPUS:85138461362
VL - 15
JO - Algorithms
JF - Algorithms
IS - 9
M1 - 318
ER -