An attribute-space representation and algorithm for concurrent engineering

1996 ◽  
Vol 10 (1) ◽  
pp. 21-36 ◽  
Author(s):  
Timothy P. Darr ◽  
William P. Birmingham
Keyword(s):  
Constraint Satisfaction ◽  
Concurrent Engineering ◽  
Design Space ◽  
Constraint Satisfaction Problem ◽  
Space Representation ◽  
Configuration Design ◽  
Design Cycle ◽  
Design Paradigm ◽  
Attribute Space ◽  
Interval Constraint

AbstractThis paper presents a novel formulation of the configuration-design problem that achieves the benefits of the concurrent engineering (CE) design paradigm. In CE, all design concerns (manufacturability, testability, etc.) are applied to an evolving design throughout the design cycle. CE identifies conflicts early on, avoids costly redesign, and leads to better products. Our formulation is based on a distributed dynamic interval constraint-satisfaction problem (DDICSP) model. Persistent catalog agents map onto DDICSP variables and constraint agents map onto DDICSP constraints. These agents use a set of operations and heuristics to navigate the design space to eliminate sets of designs until a solution is found. Experimental results show that an architecture where each catalog agent resides on a separate computer has performance advantages over nondistributed approaches.

scholarly journals System Sizing with a Model-Based Approach: Application to the Optimization of a Power Transmission System

2018 ◽  
Vol 2018 ◽  
pp. 1-14
Author(s):  
Pierre-Alain Yvars ◽  
Laurent Zimmer
Keyword(s):  
Constraint Satisfaction ◽  
Constraint Programming ◽  
Power Transmission ◽  
Constraint Satisfaction Problem ◽  
Transmission System ◽  
System Description ◽  
Model Based ◽  
Power Transmission System ◽  
Design Requirements ◽  
Interval Constraint

We test the relevance of a model-based approach for sizing and optimizing complex systems. Classically a model-based approach is characterized by a clear partition between the problem description and the solving process. In the case of a design problem, we show that the sizing task could be systematically characterized and therefore could lead to a declarative model combining both system description and design requirements. Once translated into a constraint satisfaction problem, the resulting model can be solved with interval constraint programming methods and algorithms. Our first contribution to this approach is to precisely characterize the sizing task in design. The resulting terminology enables us to easily and systematically express the problem as a constraint satisfaction problem (CSP) which combines in the same model the system description and the design requirements. We have tested the approach on the optimal sizing problem of a power transmission system. Previous authors have described this scalable case study. They provide a mathematical formulation of the problem and solve it with an evolutionary algorithm. Starting from their description, we apply our methodology to model the problem as a CSP and then solve it with interval constraint programming algorithms. Our solutions are more adequate both in computational time and in optimization results than those published in the literature on the same problem. Moreover the declarative nature of constraint programming makes modifications or extensions easier than with evolutionary programming. The explanation of these results is our second contribution to the approach. However some important modelling issues remain to address in order to capture more and more complex system specifications. Further research is presented at the end of this paper.

Searching Feasible Design Space by Solving Quantified Constraint Satisfaction Problems

2013 ◽  
Vol 136 (3) ◽  
Author(s):  
Jie Hu ◽  
Masoumeh Aminzadeh ◽  
Yan Wang
Keyword(s):  
Monte Carlo ◽  
Constraint Satisfaction ◽  
Design Space ◽  
Constraint Satisfaction Problem ◽  
Constraint Satisfaction Problems ◽  
Design Solution ◽  
New Approach ◽  
Solution Sets ◽  
Branch And Prune Algorithm ◽  
Branch And Prune

In complex systems design, multidisciplinary constraints are imposed by stakeholders. Engineers need to search feasible design space for a given problem before searching for the optimum design solution. Searching feasible design space can be modeled as a constraint satisfaction problem (CSP). By introducing logical quantifiers, CSP is extended to quantified constraint satisfaction problem (QCSP) so that more semantics and design intent can be captured. This paper presents a new approach to formulate searching design problems as QCSPs in a continuous design space based on generalized interval, and to numerically solve them for feasible solution sets, where the lower and upper bounds of design variables are specified. The approach includes two major components. One is a semantic analysis which evaluates the logic relationship of variables in generalized interval constraints based on Kaucher arithmetic, and the other is a branch-and-prune algorithm that takes advantage of the logic interpretation. The new approach is generic and can be applied to the case when variables occur multiple times, which is not available in other QCSP solving methods. A hybrid stratified Monte Carlo method that combines interval arithmetic with Monte Carlo sampling is also developed to verify the correctness of the QCSP solution sets obtained by the branch-and-prune algorithm.

scholarly journals Localization of a Vehicle: A Dynamic Interval Constraint Satisfaction Problem-Based Approach

2018 ◽  
Vol 2018 ◽  
pp. 1-12 ◽  
Author(s):  
Kangni Kueviakoe ◽  
Zhan Wang ◽  
Alain Lambert ◽  
Emmanuelle Frenoux ◽  
Philippe Tarroux
Keyword(s):  
Kalman Filter ◽  
Bayesian Methods ◽  
Constraint Satisfaction ◽  
Measurement Errors ◽  
Constraint Satisfaction Problem ◽  
Constraint Propagation ◽  
Gps Receiver ◽  
Localization Problem ◽  
Vehicle Localization ◽  
Interval Constraint

This paper introduces a new interval constraint propagation (ICP) approach dealing with the real-time vehicle localization problem. Bayesian methods like extended Kalman filter (EKF) are classically used to achieve vehicle localization. ICP is an alternative which provides guaranteed localization results rather than probabilities. Our approach assumes that all models and measurement errors are bounded within known limits without any other hypotheses on the probability distribution. The proposed algorithm uses a low-level consistency algorithm and has been validated with an outdoor vehicle equipped with a GPS receiver, a gyro, and odometers. Results have been compared to EKF and other ICP methods such as hull consistency (HC4) and 3-bound (3B) algorithms. Both consistencies of EKF and our algorithm have been experimentally studied.

scholarly journals Permutation groups with small orbit growth

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Manuel Bodirsky ◽  
Bertalan Bodor
Keyword(s):  
Automorphism Group ◽  
Constraint Satisfaction ◽  
Constraint Satisfaction Problem ◽  
Permutation Groups ◽  
First Order ◽  
Finite Covers

Abstract Let K exp + \mathcal{K}_{{\operatorname{exp}}{+}} be the class of all structures 𝔄 such that the automorphism group of 𝔄 has at most c ⁢ n d ⁢ n cn^{dn} orbits in its componentwise action on the set of 𝑛-tuples with pairwise distinct entries, for some constants c , d c,d with d < 1 d<1 . We show that K exp + \mathcal{K}_{{\operatorname{exp}}{+}} is precisely the class of finite covers of first-order reducts of unary structures, and also that K exp + \mathcal{K}_{{\operatorname{exp}}{+}} is precisely the class of first-order reducts of finite covers of unary structures. It follows that the class of first-order reducts of finite covers of unary structures is closed under taking model companions and model-complete cores, which is an important property when studying the constraint satisfaction problem for structures from K exp + \mathcal{K}_{{\operatorname{exp}}{+}} . We also show that Thomas’ conjecture holds for K exp + \mathcal{K}_{{\operatorname{exp}}{+}} : all structures in K exp + \mathcal{K}_{{\operatorname{exp}}{+}} have finitely many first-order reducts up to first-order interdefinability.

Sign in / Sign up

Export Citation Format

Share Document