• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.1098-1100
• /
• 2005

The floorplanning problem is an essential design step in VLSI layout design and it is how to place rectangular modules as density as possible. And then, as the DSM advances, the VLSI chip becomes more congested even though more metal layers are used for routing. Usually, a VLSI chip includes several buses. As design increases in complexity, bus routing becomes a heavy task. To ease bus routing and avoid unnecessary iterations in physical design, we need to consider bus planning in early floorplanning stage. In this paper, we propose a floorplanning method for topological constraint consisting of bus constraint and memory constraint. The proposed algorithms based on Genetic Algorithm(GA) is adopted a sequence pair. For selection control, new objective functions are introduced for topological constraint. Studies on floor planning and cell placement have been reported as being applications of GA to the LSI layout problem. However, no studies have ever seen the effect of applying GA in consideration of topological constraint. Experimental results show improvement of bus and memory constraint.

• 한국CDE학회논문집
• /
• 제3권4호
• /
• pp.211-222
• /
• 1998

Parametric design is an important modeling paradigm in CAD/CAM applications, enabling efficient design modifications and variations. One of the major issues in parametric design is to develop a geometric constraint solver that can handle a large set of geometric configurations efficiently and robustly. In this appear, we propose a new approach to geometric constraint solving that employs a graph-based method to solve the ruler-and-compass constructible configurations and a numerical method to solve the ruler-and-compass non-constructible configurations, in a way that combines the advantages of both methods. The geometric constraint solving process consists of two phases: 1) planning phase and 2) execution phase. In the planning phase, a sequence of construction steps is generated by clustering the constrained geometric entities and reducing the constraint graph in sequence. in the execution phase, each construction step is evaluated to determine the geometric entities, using both approaches. By combining the advantages of the graph-based constructive approach with the universality of the numerical approach, the proposed approach can maximize the efficiency, robustness, and extensibility of geometric constraint solver.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1997년도 춘계학술대회 논문집
• /
• pp.589-594
• /
• 1997

We have already presented the constraint satisfaction algorithm which could solve the losed loop problem in constraint network by using local constraint propagation, variable elimination and constraint modularization. With this algorithm, we have implemented a knowledge-based system (intelligent CAD) for supporting machine design interactively. In this paper, we present newer constraint satisfaction algorithm which can solve inequalities or under-constrained problems in constraint network, interactively and efficiently. This algorithm is a hybrid type of using both declarative description (constraint represention) and optimization algorithm (Simulated Annealing), simultaneously. The under-constrained problems are represented by constraint networks and satisfied completely with this algorithm. The usefulness of our algorithm will be illustrated by the application to a gear design.

• 한국정밀공학회지
• /
• 제14권9호
• /
• pp.116-123
• /
• 1997

We have already presented the constraint satisfaction algorithm which could solve the closed loop porblem in constraint network by using local constraint propagation, variable elimination and constraint modularization. With this algorithm, we have implemented a knowledge-based system (intelligent CAD) for supporting machine design interactively. In this paper, we present newer constraint satisfaction algorithm which can solve inequalities or under-constrained problems in constraint network, interactively and effi- ciently. This algorithm is a hybrid type of using both declarative description (constraint representation) and optimization algorithm (Simulated Annealing), simultaneously. The under-constrained problems are represented by constraint networks and satisfied completely with this algorithm. The usefulness of our algorithm will be illustrated by the application to a gear design.

• Journal of Mechanical Science and Technology
• /
• 제18권1호
• /
• pp.122-131
• /
• 2004

A constraint equation-based control law design for large angle attitude maneuvers of flexible spacecraft is addressed in this paper The tip displacement of the flexible spacecraft model is prescribed in the form of a constraint equation. The controller design is attempted in the way that the constraint equation is satisfied throughout the maneuver. The constraint equation leads to a two-point boundary value problem which needs backward and forward solution techniques to satisfy terminal constraints. An observer-based tracking control law takes the constraint equation as the input to the dynamic observer. The observer state is used in conjunction with the state feedback control law to have the actual system follow the observer dynamics. The observer-based tracking control law eventually turns into a stabilized system with inherent nature of robustness and disturbance rejection in LQR type control laws.

• 한국CDE학회논문집
• /
• 제6권2호
• /
• pp.78-88
• /
• 2001

In order to adopt feature-based parametric modeling, CAD/CAM applications must have a geometric constraint solver that can handle a large set of geometric configurations efficiently and robustly. In this paper, we describe a graph constructive approach to solving geometric constraint problems. Usually, a graph constructive approach is efficient, however it has its limitation in scope; it cannot handle ruler-and-compass non-constructible configurations and under-constrained problems. To overcome these limitations. we propose an algorithm that isolates ruler-and-compass non-constructible configurations from ruler-and-compass constructible configurations and applies numerical calculation methods to solve them separately. This separation can maximize the efficiency and robustness of a geometric constraint solver. Moreover, the solver can handle under-constrained problems by classifying under-constrained subgraphs to simplified cases by applying classification rules. Then, it decides the calculating sequence of geometric entities in each classified case and calculates geometric entities by adding appropriate assumptions or constraints. By extending the clustering types and defining several rules, the proposed approach can overcome limitations of previous graph constructive approaches which makes it possible to develop an efficient and robust geometric constraint solver.

• 디지털산업정보학회논문지
• /
• 제6권4호
• /
• pp.45-56
• /
• 2010

This paper suggests constraint data modeling based on constraint data presentation techniques to perform complex spatial database operation naturally. We were able to identify the limitation of extendibility of dimension and non-equal framework via relevant research for former schema of spatial database and query processing. Therefore we described generalized tuple of spatial data and the definition of suggested constraint data modeling. Also we selected MLPQ/PReSTO tool among constraint database prototype and compare standard functionality of ARC/VIEW. Then we design scenario for spatial operation using MLPQ/PReSTO and we suggested application effect after query processing. Based on above explanation, we were able to identify that we can process spatial data naturally and effectively using simple constraint routine on same framework via constraint data modeling.

• 한국CDE학회논문집
• /
• 제12권1호
• /
• pp.58-73
• /
• 2007

This paper described a method for the construction of a surface through a set of nonuniform scattered points. When the shift vectors of some points as constraints on the original surface are given, those of the other points should be computed to make the new surface. To keep up the look-see and smoothness with the original surfaces, the proper relationship should be formulated between the shifts of the constraint points and those of the other points. Vector fields for 3 dimensional shift of a point on the surface are made based in the constraint shifts. Vector fields for 3 dimensional shift of a point on the surface are made based on the constraint shifts. Multilevel B-spline approximation technique was used to construct the vector field. The technique uses coarse-to-fine hierarchy of control lattices. The developed method was applied to shoe sole design system especially for grading. Using this system, a shoe sole can be modified effectively.

• International Journal of CAD/CAM
• /
• 제6권1호
• /
• pp.173-181
• /
• 2006

In this paper, an integration framework of Geometric Constraint Solving Engine and AutoCAD is presented, and a dynamic geometric constraint system is introduced. According to inherent orientation features of geometric entities and various Object Snap results of AutoCAD, the' proposed system can automatically construct an under-constrained geometric constraint model during interactive drawing. And then the directed constraint graph in a geometric constraint model is realtime modified in order to produce an optimal constraint solving sequence. Due to the open object-oriented characteristics of AutoCAD, a set of user-defined entities including basic geometric elements and graphics constraint relations are defined through derivation. And the custom-made Object Reactor and Command Reactor are also constructed. Several powerful characteristics are achieved based on these user-defined entities and reactors, including synchronously processing geometric constraint information while saving and opening DWG files, visual constraint relations, and full adaptability to Undo/Redo operations. These characteristics of the proposed system can help the designers more easily manage geometric entities and constraint relations between them.

• Journal of Computing Science and Engineering
• /
• 제9권2호
• /
• pp.98-107
• /
• 2015

Hierarchical constraints and constraint satisfaction were analyzed in order to solve the problem of conflict detection in collaborative design. The constraints were divided into two sets: one set consisted of known constraints and the other of unknown constraints. The constraints of the two sets were detected with corresponding methods. The set of the known constraints was detected using an interval propagation algorithm, a back propagation (BP) neural network was proposed to detect the set with the unknown constraints. An immune algorithm (IA) was utilized to optimize the weights and the thresholds of the BP neural network, and the steps were designed for the optimization process. The results of the simulation indicated that the BP neural network that was optimized by IA has a better performance in terms of convergent speed and global searching ability than a genetic algorithm. The constraints were described using the eXtensible Markup Language (XML) for computers to be able to automatically recognize and establish the constraint network. The implementation of the conflict detection system was designed based on constraint satisfaction. A wind planetary gear train is taken as an example of collaborative design with a conflict detection system.