• ETRI Journal
• /
• 제42권5호
• /
• pp.700-711
• /
• 2020

Because of the rapid increase of mobile traffic, flexible broadband supportive unmanned aerial vehicle (UAV)-based 6G mobile networks using free space optical (FSO) links have been recently proposed. Considering the advancements made in UAVs, big data processing, and artificial intelligence precision control technologies, the formation of an additional wireless network based on UAV aerial platforms to assist the existing fixed base stations of the mobile radio access network is considered a highly viable option in the near future. In this paper, a combined time bound optimization scheme is proposed that can adaptively satisfy the control and communication time constraints as well as the processing time constraints in FSO-based 6G UAV aerial networks. The proposed scheme controls the relation between the number of data flows, input data rate, number of worker nodes considering the time bounds, and the errors that occur during communication and data processing. The simulation results show that the proposed scheme is very effective in satisfying the time constraints for UAV control and radio access network services, even when errors in communication and data processing may occur.

• 대한기계학회논문집A
• /
• 제34권2호
• /
• pp.191-201
• /
• 2010

본 연구는 비스플라인 근사기법을 사용한 분지한계법 기반의 새로운 전역 최적화 알고리즘에 관한 것이다. 본 연구에서는 알고리즘 구성 요소 및 이들의 구현 내용에 관한 상세히 설명한다. 핵심 요소로서, 상호분리되는 부공간으로의 설계 공간의 분할 작업이 있고, 이들 분할 부공간의 한계값 계산 작업이 있는데, 이들 모두는 실수형 비스플라인 볼륨모델에 의해 구현된다. 본 연구 알고리즘은 다양한 테스트 문제들을 가지고 해의 정확성, 함수호출 회수, 알고리즘 수행시간, 메모리 사용량, 알고리즘 수렴성 등 그 계산 성능들을 평가한다. 이러한 평가 결과는 제안 알고리즘이 직관에 의존하지 않는 완전 알고리즘이며, 대용량의 최적화 문제에도 높은 가능성이 있음을 보여주는 것이다.

• Journal of Information Technology Applications and Management
• /
• 제22권2호
• /
• pp.1-17
• /
• 2015

In this research, we develop and suggest branch and bound algorithms for a two-machine permutation flowshop scheduling problem with the objective of minimizing makespan. In this scheduling problem, after each job is operated on the machine 1 (first machine), the job has to start its second operation on machine 2 (second machine) within its corresponding limited waiting time. In addition, each job has its corresponding ready time at the machine 1. For this scheduling problem, we develop various dominance properties and three lower bounding schemes, which are used for the suggested branch and bound algorithm. In the results of computational tests, the branch and bound algorithms with dominance properties and lower bounding schemes, which are suggested in this paper, can give optimal solution within shorter CPU times than the branch and bound algorithms without those. Therefore, we can say that the suggested dominance properties and lower bounding schemes are efficient.

• Advances in Computational Design
• /
• 제1권2호
• /
• pp.119-138
• /
• 2016

In this article, hybridization of enhanced colliding bodies optimization (ECBO) with upper bound strategy (UBS) that is called UECBO is proposed for optimum design of truss structures with frequency constraints. The distinct feature of the proposed algorithm is that it requires less computational time while preserving the good accuracy of the ECBO. Four truss structures with frequency limitations selected from the literature are studied to verify the viability of the algorithm. This type of problems is highly non-linear and non-convex. The numerical results show the successful performance of the UECBO algorithm in comparison to the CBO, ECBO and some other metaheuristic optimization methods.

• 제어로봇시스템학회논문지
• /
• 제3권1호
• /
• pp.17-22
• /
• 1997

The stability robustness problem of linear discrete-time systems with time-varying perturbations is considered. By using Lyapunov direct method, the perturbation bounds for guaranteeing the quadratic stability of the uncertain systems are derived. In the previous results, the perturbation bounds are derived by the quadratic equation stemmed from Lyapunov method. In this paper, the bounds are obtained by a numerical optimization technique. Linear matrix inequalities are proposed to compute the perturbation bounds. It is demonstrated that the suggested bound is less conservative for the uncertain systems with unstructured perturbations and seems to be maximal in many examples. Furthermore, the suggested bound is shown to be maximal for the special classes of structured perturbations.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2002년도 ICCAS
• /
• pp.44.1-44
• /
• 2002

This paper is concerned with the problem of designing a guaranteed cost state feedback controller for singular systems with time-varying delays. The sufficient condition for the existence of a guaranteed cost controller, the controller design method, and the optimization problem to get the upper bound of guaranteed cost function are proposed by LMI(linear matrix inequality), singular value decomposition, Schur complements, and change of variables. Since the obtained sufficient conditions can be changed to LMI form, all solutions including controller gain and upper bound of guaranteed cost function can be obtained simultaneously.

• 동력기계공학회지
• /
• 제4권3호
• /
• pp.72-80
• /
• 2000

In order to design a stable robust controller, nominal model, and the upper bound about the uncertainty which is the error of the model are needed. The problem to estimate the nominal model of controlled system and the upper bound of uncertainty at the same time is called robust identification. When the nominal model of controlled system and the upper bound of uncertainty in relation to robust identification are given, the evaluation of the validity of the model and the upper bound makes it possible to distinguish whether there is a model which explains observation data including disturbance among the model set. This paper suggests a method to identity the uncertainty which removes disturbance and expounds observation data by giving a probable postulation and plural data set to disturbance. It also examines the suggested method through a numerical computation simulation and validates its effectiveness.

• 한국컴퓨터정보학회논문지
• /
• 제21권2호
• /
• pp.97-103
• /
• 2016

This paper deals with the cycle time minimization problem that determines the productivity in printed circuit board (PCB) with n components using the m placement machines. This is known as production cycle time determination problem (PCTDP). The polynomial time algorithm to be obtain the optimal solution has been unknown yet, therefore this hard problem classified by NP-complete. This paper gets the initial assignment result with the machine has minimum unit placement time per each component firstly. Then, the balancing process with reallocation from overhead machine to underhead machine. Finally, we perform the swap optimization and get the optimal solution of cycle time $T^*$ within O(mn) computational complexity. For experimental data, the proposed algorithm can be obtain the same result as integer programming+branch-and-bound (IP+B&B) and B&B.

• Transactions on Control, Automation and Systems Engineering
• /
• 제2권3호
• /
• pp.163-168
• /
• 2000

The problems of mixed $H_2/H_{\infty}$ filtering design fer continuous and discrete time linear systems with time delay are investigated. The main purpose is to design a stable mixed $H_2/H_{\infty}$ filter which minimizes the H$_2$Performance measure satisfying a prescribed H$_{\infty}$ norm bound on the closed loop system in continuous-time case and discrete-time case, respectively. The sufficient conditions of existence of filter, the mixed $H_2/H_{\infty}$ filter design method, and the upper bound of performance measure are proposed by LMI(linear matrix inequality) techniques in terms of all finding variables. Also, we present optimization problems in order to get the optimal mixed $H_2/H_{\infty}$ filter in continuous and discrete time case, respectively.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.62.4-62
• /
• 2001

In this paper, we propose a delay-dependent guaranteed cost controller design method for uncertain linear systems with time delay. The uncertainty is norm bounded and time-varying. A quadratic cost function is considered as the performance measure for the given system. Based on the Lyapunov method, sufficient condition, which guarantees that the closed-loop system is asymptotically stable and the upper bound value of the closed-loop cost function is not more than a specied one, is derived in terms of Linear Matrix Inequalities(LMIs) that can be solved sufficiently. A convex optimization problem can be formulated to design a guaranteed cost controller, which minimizes the upper bound value of the cost function. Numerical examples show the activeness of the proposed method.