• Journal of Korean Institute of Industrial Engineers
• /
• v.17 no.2
• /
• pp.51-61
• /
• 1991

This paper presents a heuristic method for the Assembly Line Balancing(ALB) of the large-sized product. In the ALB problem of the large-sized product such as bus and truck, the assignments of the Related Task Groups(RTG), the same side tasks, and team tasks should be considered. In this paper, a new concept of the RTG and two kinds of assignment rules are proposed to resolve the above considerations. The first assignment rule allots the RTG with the constraint of the same side tasks to the station while the second allots the RTG to the station, relaxing the above constraint to increase the applicability of the method. An assignment rule for team tasks is also presented. The benefits of the method are to improve work methods, to give more job satisfaction to workers, and to allow greater flexibility in the design of assembly lines.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.999-1004
• /
• 1989

This paper discusses a new method of recognizing patterns employing consistent labeling. A consistent labeling problem is a generalized expression of constraint satisfaction problems. When a pattern is recognized by pattern matching, the matching between a reference pattern and an acquired pattern resolves itself into finding correspondence between the pixels on the former and those on the latter. This can be expressed as a consistent labeling problem. Pattern association, a variation of pattern recognition, is also described employing consistent labeling. The proposed technique is supported by experimental results, yet further studies need to be done before its practical use.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.3
• /
• pp.81-87
• /
• 2016

This paper analysis the AM-SCS-MMA (Adaptive Modulus-Soft Constraint Satisfaction-MMA) based on the adaptive modulus and minimus-disturbance technique in order to improve the stability and robustness in low signal to noise power of current MMA adaptive equalization algorithm. In AM-SCS-MMA, it updates the filter coefficient applying the adaptive modulus and minimum-disturbance technique of deterministic optimization problem instead of LMS or gradient descend algorithm for obtain the minimize the cost function of adaptive equalization. It is possible to improve the equalizer filter stability, robustness to the various noise characteristic and simultaneous reducing the intersymbol interference due to the amplitude and phase distortion occurred at channel. The computer simulation were performed for confirming the improved performance of SCS-MMA. For these, the output signal constellation of equalizer, residual isi, MSE, EMSE (Excess MSE) which means the channel traking capability and SER which means the robustness were applied. As a result of computer simulation, the AM-SCS-MMA have slow convergence time and less residual quantities after steady state, more good robustness in the poor signal to noise ratio, but poor in channel tracking capabilities was confirmed than MMA.

• Journal of Intelligence and Information Systems
• /
• v.14 no.3
• /
• pp.109-131
• /
• 2008

Ubiquitous Smart Space(USS) like u-City has been expected to create a high added value. However, developing USS has a high risk because it should use future technologies and development methodologies that have been never tried in the past. Hence, it has to be considered thoroughly in the very first stage of development. Moreover, USS usually uses several ubiquitous computing technologies combinationally because of the nature of USS. Despite of this, existing technology selection methodologies or technology evaluation methodologies only focus on a single technology. This leads us to develop a methodology of optimal technology combination for developing a specific USS. The purpose of this paper is to propose the methodology and to apply it to develop a real USS. We use portfolio theory and constraint satisfaction problem to determine an optimal technology combination. We also apply our methodology to the national ubiquitous computing project which carries out at present to validate it.

• Journal of Positioning, Navigation, and Timing
• /
• v.11 no.1
• /
• pp.29-34
• /
• 2022

In this paper, we analyze the Non-Holonomic Constraint (NHC) satisfaction of Inertial Navigation System (INS) for vehicular navigation according to Inertial Measurement Unit (IMU) location. In INS-based vehicle navigation, NHC information is widely used to improve INS performance. That is, the error of the INS can be compensated under the condition that the velocity in the body coordinate system of the vehicle occurs only in the forward direction. In this case, the condition that the vehicle's wheels do not slip and the vehicle rotates with the center of the IMU must be satisfied. However, the rotation of the vehicle is rotated by the steering wheel which is controlled based on the Ackermann geometry, where the center of rotation of the vehicle exists outside the vehicle. Due to this, a phenomenon occurs that the NHC is not satisfied depending on the mounting position of the IMU. In this paper, we analyze this problem based on Ackermann geometry and prove the analysis result based on simulation.

• IE interfaces
• /
• v.14 no.3
• /
• pp.218-226
• /
• 2001

Scheduling for shipbuilding processes has many alternative solutions since it has long time horizon and handles many jobs. This requests the scheduling system to generate and search feasible alternative solutions in short period of time. Among shipbuilding schedules, the ship erection schedule in a dock is the most important since the dock is the most critical resource in shipyard. In this research, we model the erection scheduling problem for shipbuilding and develop a new problem solving method using CST(Constraint Satisfaction Technique) and ILOG Scheduler. Experimental results show that the proposed scheduling method outperforms the existing manual scheduling methods in terms of schedule performance and required time.

• IE interfaces
• /
• v.6 no.2
• /
• pp.117-131
• /
• 1993

A job sequencing model is developed and its computer system is tested for processing cold-rolled coils in Tandem Cold Mills(TCM) at the Pohang Iron and Steel Company. Given coils waiting to be processed, this system generates a sequence of jobs satisfying operational constraints for the TCM process. We formulate the problem as a constraint satisfaction problem and employ the backtracking technique combined with looking ahead features in order to generate a feasible solution within a reasonable time. Our system is implemented in C language on 80486-based IBM PC. Some tests based on the real data show that our system is adequate with respect to search time and that it consistantly generates a good feasible solution.

• The Journal of Engineering Research
• /
• v.6 no.2
• /
• pp.11-22
• /
• 2004

A distributed constraint satisfaction problem (distributed CSP) is a constraint satisfaction problem(CSP) in which variables and constraints are distributed among multiple automated agents. ACSP is a problem to find a consistent assignment of values to variables. Even though the definition of a CSP is very simple, a surprisingly wide variety of AI problems can be formalized as CSPs. Similarly, various application problems in DAI (Distributed AI) that are concerned with finding a consistent combination of agent actions can be formalized as distributed CAPs. In recent years, many new backtracking algorithms for solving distributed CSPs have been proposed. But most of all, they have common drawbacks that the algorithm assumes the priority of agents is static. In this thesis, we establish a basic algorithm for solving distributed CSPs called dynamic priority search algorithm that is more efficient than common backtracking algorithms in which the priority order is static. In this algorithm, agents act asynchronously and concurrently based on their local knowledge without any global control, and have a flexible organization, in which the hierarchical order is changed dynamically, while the completeness of the algorithm is guaranteed. And we showed that the dynamic priority search algorithm can solve various problems, such as the distributed 200-queens problem, the distributed graph-coloring problem that common backtracking algorithm fails to solve within a reasonable amount of time. The experimental results on example problems show that this algorithm is by far more efficient than the backtracking algorithm, in which the priority order is static. The priority order represents a hierarchy of agent authority, i.e., the priority of decision-making. Therefore, these results imply that a flexible agent organization, in which the hierarchical order is changed dynamically, actually performs better than an organization in which the hierarchical order is static and rigid. Furthermore, we describe that the agent can be available to hold multiple variables in the searching scheme.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 1999.10a
• /
• pp.151-157
• /
• 1999

선석계획 및 크레인 일정계획은 컨테이너 터미널에서 입항하는 선박들의 빈번한 변동상황에 능동적으로 대처하고 유연하면서도 신속한 의사결정이 가능하도록 여러 명의 전문가가 장기적인 계획을 바탕으로 지속적으로 수정 보완해 나가는 방법으로 이루어지고 있다. 본 논문에서는 선사 및 컨테이너 터미널에서 수시로 변경되는 다양한 요구조건을 수용하는 최적의 선석 및 크레인 일정계획 수립을 위하여 제약만족기법과 휴리스틱 교정(Heuristic Repair)기법을 이용하였다. 선석계획 및 크레인 일정 계획문제는 기본적으로 제약조건 만족문제로 정형화할 수 있지만 선박의 접안위치를 결정하는 문제는 목적함수를 가지는 최적화문제이다. 따라서 이 문제는 제약조건 만족문제와 최적화문제가 혼합된 문제(CSOP, Constraint Satisfaction and Optimization Problem)로 볼 수 있다. 이러한 문제를 해결하기 위해서 각 선박의 최적 전압위치를 찾고 최우선 순위 선박의 최적 접안위치로부터 주어진 모든 제약조건을 만족하는 해를 찾는 탐색기법을 활용했고 휴리스틱 교정기법을 사용해서 제약만족기법에서 찾은 해를 교정했다. 우선순위가 가장 높은 선박부터 탐색을 하기 위해 Variable Ordering 기법을 사용했고 그 선박의 최적 접안위치부터 탐색을 해 나가는 Value Ordering 기법을 사용하였다. 실제 부산 신선대 컨테이너 터미널의 선석계획자료를 사용해서 실험을 하였다.

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.4
• /
• pp.649-660
• /
• 1998

Steel making in Mini Mill consists of three major processing stages: molten steel making in an electric arc fuenace, slab casting in a continuous caster, and hot rolling in a finishing mill. Each processing stage has its own lot grouping criterion. However, these criteria in three stages are conflicting with each other. Therefore, delveloping on efficient lot grouping algorithm to enhance the overall productivity of the Mini Mill is an extremely difficult task. The algorithm proposed in this paper is divided into three steps hierarchically: change grouping, cast grouping, and roll grouping. An efficient charge grouping heuristic is developed by exploiting the characteristics of the orders, the processing constraints and the requirements for the downstream stages. In order to maximaize the productivity of the continuous casters, each cast must contain as many charges as possible. Based on the constraint satisfaction problem technique, an efficient cast grouping heuristic is developed. Each roll consists of two casts satisfying the constraints for rolling. The roll grouping problem is formulated as a weighted non-bipartite matching problem, and an optimal roll grouping algorithm is developed. The proposed algorithm is programmed with C language and tested on a SUN Workstation with real data obtained from the H steel works. Through the computational experiment, the algorithm is verified to yield quite satisfactory solutions within a few minutes.