• 한국컴퓨터정보학회논문지
• /
• 제26권12호
• /
• pp.29-43
• /
• 2021

본 연구에서 제약식프로그래밍을 이용하여 제약식 있는 동적계획법 모형을 푸는 한 방법을 제시한다. 현재 제약식 있는 동적계획법을 다루는 방법은 각 단계별 제약식들의 상태를 일반적인 동적계획법의 상태공간에 추가하여 마치 제약식이 없는 동적계획법 방식을 적용하는데 반해, 이 연구에서 제시하는 방식은 제약식의 상태가 제약식프로그래밍의 변수 도메인으로 표현되고 저장된다. 계산에 있어서도 일반적인 동적계획법의 벨만방정식의 해법과 함께 제약식을 다루기 위한 제약식프로그래밍의 확산-추론 방법을 사용하는 하이브리드 방식을 따른다. 이 두가지 방식의 비교를 위해 특별히 장기 자동차 렌탈 문제를 제시하고 이 문제의 단순화된 모형을 중심으로 다른 방식으로 해결하는 과정을 보고 그 장단점을 논한다.

• Journal of Electrical Engineering and Technology
• /
• 제6권6호
• /
• pp.874-882
• /
• 2011

The decoupling design for the one-degree-of-freedom controller system is treated within the $H_{\infty}$ framework. In the present study, we demonstrate that the $H_{\infty}$ performance problem in the decoupling design is reduced into interpolation problems on scalar functions. To guarantee the properness of decoupling controllers and the overall transfer matrix, the relative degree conditions on the interpolating scalar functions are derived. To find the interpolating functions with relative degree constraints, Nevanlinna-Pick algorithm with starting function constraint is utilized in the present study. An illustrative example is given to provide details regarding the solution.

• Journal of Mechanical Science and Technology
• /
• 제16권10호
• /
• pp.1239-1245
• /
• 2002

A formulation which seeks steady-state equilibrium positions of constrained multibody systems driven by constant generalized speeds is presented in this paper. Since the relative coordinates are employed, constraint equations at cut joints are incorporated into the formulation. To obtain the steady-state equilibrium position of a multibody system, nonlinear equations are derived and solved iteratively. The nonlinear equations consist of the force equilibrium equations and the kinematic constraint equations. To verify the effectiveness of the proposed formulation, two numerical examples are solved and the results are compared with those of a commercial program.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2007년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.322-324
• /
• 2007

In this paper, an eye-in-hand visual servoing strategy for keeping feature points within the FOV(field-of-view) is proposed. We first specify the FOV constraint which must be satisfied to keep the feature points within the FOV. It is expressed as the inequality relationship between (i) the LOS(jine-of-sight) angles of the center of the feature points from the optical axis of the camera and (ii) the distance between the object and the camera. We then design a nonlinear feedback controller which decouples linearly the translational and rotational control loops. Finally, we show that appropriate choice of the controller gains assures to satisfy the FOV constraint. The main advantage of our approach over the previous ones is that the trajectory of the camera is smooth and circular-like. Furthermore, ours can be applied to the large camera displacement problem.

• KIEE International Transaction on Systems and Control
• /
• 제2D권2호
• /
• pp.108-114
• /
• 2002

This paper describes the design of a robust adaptive controller for a nonlinear dynamical system with unknown nonlinearities. These unknown nonlinearities are approximated by multilayered neural networks (MNNs) whose parameters are adjusted on-line, according to some adaptive laws far controlling the output of the nonlinear system, to track a given trajectory. The main contribution of this paper is a method for considering input constraint with a rigorous stability proof. The Lyapunov synthesis approach is used to develop a state-feedback adaptive control algorithm based on the adaptive MNN model. An overall control system guarantees that the tracking error converges at about zero and that all signals involved are uniformly bounded even in the presence of input saturation. Theoretical results are illustrated through a simulation example.

• 한국정보과학회논문지:시스템및이론
• /
• 제26권10호
• /
• pp.1264-1274
• /
• 1999

본 논문에서는 분산된 클록들을 주기적으로 동기화 시키는 분산 실시간 시스템에서 시간적 제약을 만족시키기 위한 정적/동적 시간 제약(timing constraint) 변환 기법을 제안한다. 전형적인 이산클록동기화(discrete clock synchronization) 알고리즘은 클록의 값을 순간적으로 조정하여 클록의 시간이 불연속적으로 진행한다. 이러한 시간상의 불연속성은 시간적 이벤트를 잃어버리거나 다시 발생시키는 오류를 범하게 한다.클록 시간의 불연속성을 피하기 위해 일반적으로 연속클록동기화(continuous clock synchronization) 기법이 제안되고 있지만 소프트웨어적으로 구현되면 많은 오버헤드를 유발시키는 문제점이 있다. 본 논문에서는 시간적 제약을 동적으로 변환시키는 DCT (Dynamic Constraint Transformation) 기법을 제안하였으며, 이를 통해 기존의 이산클록동기화 알고리즘을 수정하지 않고서도 클록 시간의 불연속성에 의한 문제점들을 해결할 수 있도록 하였다. 아울러 DCT에 의해 이산클록동기화 하에서 생성된 태스크 스케쥴이 연속클록동기화에 의해 생성된 스케쥴과 동일함을 증명하여 DCT의 동작이 이론적으로 정확함을 증명하였다.또한 분산 실시간 시스템에서 지역 클록(local clock)이 기준 클록과 완벽하게 일치하지 않아서 발생하는 스케쥴링상의 문제점을 다루었다. 이를 위해 먼저 두 가지의 스케쥴링 가능성, 지역적 스케쥴링 가능성(local schedulability)과 전역적 스케쥴링 가능성(global schedulability)을 정의하고, 이를 위해 시간적 제약을 정적으로 변환시키는 SCT (Static Constraint Transformation) 기법을 제안하였다. SCT를 통해 지역적으로 스케쥴링 가능한 태스크는 전역적으로 스케쥴링이 가능하므로, 단지 지역적 스케쥴링 가능성만을 검사하면 스케쥴링 문제를 해결할 수 있도록 하였고 이를 수학적으로 증명하였다.Abstract In this paper, we present static and dynamic constraint transformation techniques for ensuring timing requirements in a distributed real-time system possessing periodically synchronized distributed local clocks. Traditional discrete clock synchronization algorithms that adjust local clocks instantaneously yield time discontinuities. Such time discontinuities lead to the loss or the gain of events, thus raising serious run-time faults.While continuous clock synchronization is generally suggested to avoid the time discontinuity problem, it incurs too much run-time overhead to be implemented in software. We propose a dynamic constraint transformation (DCT) technique which can solve the problem without modifying discrete clock synchronization algorithms. We formally prove the correctness of the DCT by showing that the DCT with discrete clock synchronization generates the same task schedule as the continuous clock synchronization.We also investigate schedulability problems that arise when imperfect local clocks are used in distributed real-time systems. We first define two notions of schedulability, global schedulability and local schedulability, and then present a static constraint transformation (SCT) technique. The SCT ensures that it is sufficient to check the schedulability of a task locally in a node with a local clock, since the global schedulability of the task is derived from its local schedulability through SCT. We formally prove the correctness of SCT.

• 한국언어정보학회:학술대회논문집
• /
• 한국언어정보학회 1996년도 Language, Information and Computation = Selected Papers from the 11th Pacific Asia Conference on Language, Information and Computation, Seoul
• /
• pp.31-42
• /
• 1996

• 한국통신학회:학술대회논문집
• /
• 한국통신학회 1995년도 하계종합학술발표회 논문집
• /
• pp.381-384
• /
• 1995

• 방사선산업학회지
• /
• 제17권1호
• /
• pp.61-67
• /
• 2023

A Study on the Introduction of Dose Constraints for Occupational Exposures: Focusing on Experts' Opinions by Field of Radiation Industry. The International Commission on Radiological Protection suggests Justification, Optimization, and Dose Limits as the three principles of radiological protection, among which, as a means of protection optimization, ICRP 103 recommends to set dose constraints. In this study, opinions are collected from experts in each category of radiation industries for stakeholder participation to qualify dose constraints. A guidance and questionnaire for analyzing the dose constraints have been developed for their collection, and opinions were collected from radiation protection experts in selected categories. 20 out of 22 experts, consisted with 91%, have assessed the dose constraints setting is necessary, and 2 experts, consisted with 9%, assessed it is unnecessary. The average of dose constraint presented by experts for RI production institutions is to be the highest level of 15.3 mSv, and light-water reactors (14.6 mSv), non-destructive inspection (14.4 mSv), heavy-water reactor and medical institutes (13.9mSv) is to be above the overall average dose constraint. In case of public institutions, the average dose constraint is to be 8.6mSv, and research institutions (8.8mSv), educational institutions (9.6 mSv), waste disposal sites (9.7 mSv), and general industries (10.6 mSv) are resulted to below the overall average dose constraint. As for the means of setting dose constraints, 8 experts out of 22 suggested setting dose constraints for each specific industry or task. And, 5 experts especially suggest setting dose constraints for the specific groups with relatively high exposure, such as workers with above the record levels. As a countermeasure for workers who exceed the dose constraints, 15 experts out of 22 expressed that the cause analyses for them and preparation for a plan of reducing them are necessary.

• 대한산업공학회지
• /
• 제27권4호
• /
• pp.406-412
• /
• 2001

IP address lookup is to determine the next hop destination of an incoming packet in the router. The address lookup is a major bottleneck in high performance router due to the increased routing table sizes, increased traffic, higher speed links, and the migration to 128 bits IPv6 addresses. IP lookup time is dependent on data structure of lookup table and search scheme. In this paper, we propose a new approach to build a lookup table that satisfies the memory constraint. The design of lookup table is formulated as an optimization problem. The objective is to minimize average depth from the root node for lookup. We assume that the frequencies with which prefixes are accessed are known and the data structure is level compressed trie with branching factor $\kappa$ at the root and binary at all other nodes. Thus, the problem is to determine the branching factor k at the root node such that the average depth is minimized. A heuristic procedure is proposed to solve the problem. Experimental results show that the lookup table based on the proposed heuristic has better average and the worst-case depth for lookup.