• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1991년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 22-24 Oct. 1991
• /
• pp.1939-1943
• /
• 1991

Path planning is an important task for optimal motion of a robot in structured or unstructured environment. The goal of this paper is to plan the shortest collision-free path in 3D, when a robot is navigated to pick up some tools or to repair some parts from various locations. To accomplish the goal of this paper, the Path Coordinator is proposed to have the capabilities of an obstacle avoidance strategy[3] and a traveling salesman problem strategy(TSP)[23]. The obstacle avoidance strategy is to plan the shortest collision-free path between each pair of n locations in 2D or in 3D. The TSP strategy is to compute a minimal system cost of a tour that is defined as a closed path navigating each location exactly once. The TSP strategy can be implemented by the Neural Network. The obstacle avoidance strategy in 2D can be implemented by the VGraph Algorithm. However, the VGraph Algorithm is not useful in 3D, because it can't compute the global optimality in 3D. Thus, the Path Coordinator is proposed to solve this problem, having the capabilities of selecting the optimal edges by the modified Genetic Algorithm[21] and computing the optimal nodes along the optimal edges by the Recursive Compensation Algorithm[5].

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1992년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 19-21 Oct. 1992
• /
• pp.79-84
• /
• 1992

Path planning is an important task for optimal motion of a robot in structured or unstructured environment. The goal of this paper is to plan the optimal collision-free path in 3D, when a robot is navigated to pick up some tools or to repair some parts from various locations. To accomplish the goal, the Path Coordinator is proposed to have the capabilities of an obstacle avoidance strategy and a traveling salesman problem strategy (TSP). The obstacle avoidance strategy is to plan the shortest collision-free path between each pair of n locations in 2D or in 3D. The TSP strategy is to compute a minimal system cost of a tour that is defined as a closed path navigating each location exactly once. The TSP strategy can be implemented by the Hopfield Network. The obstacle avoidance strategy in 2D can be implemented by the VGraph Algorithm. However, the VGraph Algorithm is not useful in 3D, because it can't compute the global optimality in 3D. Thus, the Path Coordinator is used to solve this problem, having the capabilities of selecting the optimal edges by the modified Genetic Algorithm and computing the optimal nodes along the optimal edges by the Recursive Compensation Algorithm.

• Journal of applied mathematics & informatics
• /
• 제40권5_6호
• /
• pp.857-871
• /
• 2022

In this work, we formulated a mathematical model for divorce in marriage and extended in to an optimal control model. Firstly, we qualitatively established the model positivity and boundedness. Also we saw sensitivity analysis of the model and identified the positive and negative indices parameters. An optimal control model were developed by incorporating three time dependent control strategies (couple relationship education, reducing getting married too young & consulting separators to renew their marriage) on the deterministic model. The Pontryagin's maximum principle were used for the derivation of necessary conditions of the optimal control problem. Finally, with Newton's forward and backward sweep method numerical simulation were performed on optimality system by considering four integrated strategies. So that we reached to a result that using all three strategies simultaneously (the strategy D) is an optimal control in order to effectively control marriage divorce over a specified period of time. From this we conclude that, policymakers and stakeholders should use the indicated control strategy at a time in order to fight against Divorce in a population.

• 한국정보처리학회논문지
• /
• 제7권2S호
• /
• pp.577-593
• /
• 2000

A distributed video-on-demand (VoD) system is one where collection of video data is located at dispersed sites across a computer network. In a single site environment, a local video server retrieves video data from its local storage device. However, in the setting of a distributed VoD system, when a customer requests a movie from the local server, the server may need to interact with other servers located across the network. In this paper, we present three types of presentation plans that a local server must construct in order to satisfy the customer request. Informally speaking, a presentation plan is a temporally synchronized detailed sequence of steps that the local server must perform for presenting the requested movie to the customer. This involves obtaining commitments from other video servers, obtaining commitments from the network service provider, as well as making commitments of local resources, within the limitations of available bandwidth, available buffer, and customer data consumption rates. Furthermore, for evaluating the goodness of a presentation plan, we introduce two measures of optimality for presentation plans: minimizing wait time for a customer, and minimizing access bandwidth is used. We develop algorithms to compute optimal presentation plans for all three types, and carry out extensive experiments to compare their performance. We have also mathematically proved certain results for the presentation plans that had previously been verified experimentally in the literature.

• Journal of the Korean Statistical Society
• /
• 제28권4호
• /
• pp.415-433
• /
• 1999

This paper considers the design of step-stress accelerated life tests for the Weibull distribution with a nonconstant shape parameter under Type I censoring. It is assumed that scale and shape parameters are log-linear functions of (possibly transformed) stress and that a cumulative exposure model holds for the effect of changing stress. The asymptotic variance of the maximum likelihood estimator of a stated quantile at design stress is used as an optimality criterion. The optimum three step-stress plans are presented for selected values of design parameters and the effects of errors in pre- estimates of the design parameters are investigated.

• 품질경영학회지
• /
• 제24권4호
• /
• pp.156-167
• /
• 1996

D-optimality is used often in design augmentation of mixture experiments. Although such alphabetic criteria provide a valuable foundation for generating designs, they often fail to convey the true nature of the design's support of the fitted model in terms of prediction variance over a region of interest. Thus, a graphical method is proposed to evaluate augmented designs in mixture experiments. This method can be used to evaluate the effect of missing observation and outlier in mixture experiments.

• International Journal of Reliability and Applications
• /
• 제18권2호
• /
• pp.21-44
• /
• 2017

Accelerated life tests (ALTs) are frequently used in manufacturing industries to evaluate the reliability of products within a reasonable amount of time and cost. Test units are subjected to elevated stresses which yield quick failures. Most of the previous works on designing ALT plans are focused on tests that involve a single stress. Many times more than one stress factor influence the product's functioning. This paper deals with the design of optimum modified ramp-stress ALT plan for Burr type XII distribution with Type-I censoring under two stress factors, viz., voltage and switching rate each at two levels- low and high. It is assumed that usage time to failure is power law function of switching rate, and voltage increases linearly with time according to modified ramp-stress scheme. The cumulative exposure model is used to incorporate the effect of changing stresses. The optimum plan is devised using D-optimality criterion wherein the ${\log}_{10}$ of the determinant of Fisher information matrix is maximized. The method developed has been explained using a numerical example and sensitivity carried out.

• Communications for Statistical Applications and Methods
• /
• 제26권1호
• /
• pp.11-25
• /
• 2019

The present paper utilizes auxiliary information to neutralize the effect of non-response for estimating the population mean. Improved ratio type estimators for population mean have been proposed and their properties are studied. These estimators are suggested for both single phase sampling and two phase sampling in presence of non-response. Empirical studies are conducted to validate the theoretical results and demonstrate the performance of the proposed estimators. The proposed estimators are shown to perform better than those used by Cochran (Sampling Techniques (3rd ed), John Wiley & Sons, 1977), Khare and Srivastava (In Proceedings-National Academy Science, India, Section A, 65, 195-203, 1995), Rao (Randomization Approach in Incomplete Data in Sample Surveys, Academic Press, 1983; Survey Methodology 12, 217-230, 1986), and Singh and Kumar (Australian & New Zealand Journal of Statistics, 50, 395-408, 2008; Statistical Papers, 51, 559-582, 2010) under the derived optimality condition. Suitable recommendations are put forward for survey practitioners.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제2권3호
• /
• pp.167-173
• /
• 2002

In this paper, we propose an interactive genetic algorithm (IGA) to implement an automated 2D avatar synthesis. The IGA technique is capable of expressing user's personality in the avatar synthesis by using the user's response as a candidate for the fitness value. Our suggested IGA method is applied to creating avatars automatically. Unlike the previous works, we introduce the concepts of 'hidden population', as well as 'primitive avatar' and 'simplified genotype', which are used to overcome the shortcomings of IGA such as human fatigue or reliability, and reasonable rates of convergence with a less number of iterations. The procedure of designing avatar models consists of two steps. The first step is to detect the facial feature points and the second step is to create the subjectively optimal avatars with diversity by embedding user's preference, intuition, emotion, psychological aspects, or a more general term, KANSEI. Finally, the combined processes result in human-friendly avatars in terms of both genetic optimality and interactive GUI with reliability.

• 한국항해항만학회:학술대회논문집
• /
• 한국항해항만학회 2022년도 추계학술대회
• /
• pp.351-356
• /
• 2022

선박의 운항 경로를 생성하기 위해 사용되는 경로 계획 방법 중, 그래프 기반 탐색 방식은 간결하고 최적해를 보장한다는 장점이 있어 널리 사용되고 있다. 그래프 기반 탐색 방식을 접안 경로 계획에 적용하는 경우, 추종 적합성을 필수적으로 고려 해야 한다. 그 이유는 접안 시 경로 이탈은 접안 시설과의 충돌로 이어질 수 있으므로, 경로의 이탈이 최소화하는 결과를 생성하는 것이 필요하다. 하지만 그래프 탐색 기반 접안 경로 계획의 기존 연구는 접안 시설 직전의 변침이 많은 결과를 생성하기 때문에 실제 운항 환경에 적용하는데 위험이 존재한다. 따라서 본 논문에서는 경로 추종에 적합한 비용 함수를 개발하고, 이를 적용한 3D A* 알고리즘을 제안한다. 또, 실제 운항 환경에 대한 적합성을 평가하기 위해서 유인 운항으로 수집한 데이터의 항적과 알고리즘의 경로 생성 결과를 비교한다.