• 제목/요약/키워드: Global Updating

검색결과 71건 처리시간 0.025초

적응제어에서 직접 및 간접 방식의 결합에 관한 연구 (A study on the combined direct and indirect approach to adaptive system)

  • 송호석;이기서
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1989년도 한국자동제어학술회의논문집; Seoul, Korea; 27-28 Oct. 1989
    • /
    • pp.489-493
    • /
    • 1989
  • In this paper a new approach to adaptive control using a combination of both direct and indirect methods has been proposed. Based on the estimates of the plant parameters and the current values of the control parameters, closed-loop estimation errors .epsilon.$_{\theta}$(t) and .epsilon.$_{k}$(t) are defined. These in turn are used in the adaptive laws for updating both identification as well as control parameters. The global uniform stability of the overall system is shown by constructing a Lyapunov function.n.

  • PDF

A Hybrid Method Based on Genetic Algorithm and Ant Colony System for Traffic Routing Optimization

  • Thi-Hau Nguyen;Ha-Nam Nguyen;Dang-Nhac Lu;Duc-Nhan Nguyen
    • International Journal of Computer Science & Network Security
    • /
    • 제23권8호
    • /
    • pp.85-90
    • /
    • 2023
  • The Ant Colony System (ACS) is a variant of Ant colony optimization algorithm which is well-known in Traveling Salesman Problem. This paper proposed a hybrid method based on genetic algorithm (GA) and ant colony system (ACS), called GACS, to solve traffic routing problem. In the GACS, we use genetic algorithm to optimize the ACS parameters that aims to attain the shortest trips and time through new functions to help the ants to update global and local pheromones. Our experiments are performed by the GACS framework which is developed from VANETsim with the ability of real map loading from open street map project, and updating traffic light in real-time. The obtained results show that our framework acquired higher performance than A-Star and classical ACS algorithms in terms of length of the best global tour and the time for trip.

변형 유전 알고리즘을 이용한 건물 철골 보 구조물의 시스템 식별에 관한 해석적 연구 (An Analytical Study on System Identification of Steel Beam Structure for Buildings based on Modified Genetic Algorithm)

  • 오병관;최세운;김유석;조동준;박효선
    • 한국전산구조공학회논문집
    • /
    • 제27권4호
    • /
    • pp.231-238
    • /
    • 2014
  • 건물의 경우, 용도 변경에 따른 중력하중 변화, 시공 단계에 따라 중력하중 변화 등이 구조물 시스템에 영향을 미친다. 따라서, 본 연구에서는 시스템 식별 변수 설정에 있어 기존에 강성만을 변수로 설정한 방법에 추가적으로 질량을 변수로 설정하여 시스템을 식별하는 기법을 제안한다. 계측한 동특성과 FE모델에서 추출한 동특성 간의 차이를 최소화하여 변수를 탐색하게 된다. 최소화 기법으로 변형 유전 알고리즘을 적용하였다. 보다 전역적 해탐색을 위해 변형 유전 알고리즘은 더 넓은 해 탐색 공간에서 해를 찾는다. 철골 보 구조물의 시뮬레이션을 통해 본 연구가 제시한 기법을 검증하였고 변형 유전 알고리즘과 기존의 단순 유전 알고리즘의 성능을 비교하였다. 또한, 강성 식별만을 수행한 기존 연구의 방법과 본 연구가 제시한 기법간의 차이를 비교하였다.

A new multi-stage SPSO algorithm for vibration-based structural damage detection

  • Sanjideh, Bahador Adel;Hamzehkolaei, Azadeh Ghadimi;Hosseinzadeh, Ali Zare;Amiri, Gholamreza Ghodrati
    • Structural Engineering and Mechanics
    • /
    • 제84권4호
    • /
    • pp.489-502
    • /
    • 2022
  • This paper is aimed at developing an optimization-based Finite Element model updating approach for structural damage identification and quantification. A modal flexibility-based error function is introduced, which uses modal assurance criterion to formulate the updating problem as an optimization problem. Because of the inexplicit input/output relationship between the candidate solutions and the error function's output, a robust and efficient optimization algorithm should be employed to evaluate the solution domain and find the global extremum with high speed and accuracy. This paper proposes a new multi-stage Selective Particle Swarm Optimization (SPSO) algorithm to solve the optimization problem. The proposed multi-stage strategy not only fixes the premature convergence of the original Particle Swarm Optimization (PSO) algorithm, but also increases the speed of the search stage and reduces the corresponding computational costs, without changing or adding extra terms to the algorithm's formulation. Solving the introduced objective function with the proposed multi-stage SPSO leads to a smart feedback-wise and self-adjusting damage detection method, which can effectively assess the health of the structural systems. The performance and precision of the proposed method are verified and benchmarked against the original PSO and some of its most popular variants, including SPSO, DPSO, APSO, and MSPSO. For this purpose, two numerical examples of complex civil engineering structures under different damage patterns are studied. Comparative studies are also carried out to evaluate the performance of the proposed method in the presence of measurement errors. Moreover, the robustness and accuracy of the method are validated by assessing the health of a six-story shear-type building structure tested on a shake table. The obtained results introduced the proposed method as an effective and robust damage detection method even if the first few vibration modes are utilized to form the objective function.

Crack identification based on Kriging surrogate model

  • Gao, Hai-Yang;Guo, Xing-Lin;Hu, Xiao-Fei
    • Structural Engineering and Mechanics
    • /
    • 제41권1호
    • /
    • pp.25-41
    • /
    • 2012
  • Kriging surrogate model provides explicit functions to represent the relationships between the inputs and outputs of a linear or nonlinear system, which is a desirable advantage for response estimation and parameter identification in structural design and model updating problem. However, little research has been carried out in applying Kriging model to crack identification. In this work, a scheme for crack identification based on a Kriging surrogate model is proposed. A modified rectangular grid (MRG) is introduced to move some sample points lying on the boundary into the internal design region, which will provide more useful information for the construction of Kriging model. The initial Kriging model is then constructed by samples of varying crack parameters (locations and sizes) and their corresponding modal frequencies. For identifying crack parameters, a robust stochastic particle swarm optimization (SPSO) algorithm is used to find the global optimal solution beyond the constructed Kriging model. To improve the accuracy of surrogate model, the finite element (FE) analysis soft ANSYS is employed to deal with the re-meshing problem during surrogate model updating. Specially, a simple method for crack number identification is proposed by finding the maximum probability factor. Finally, numerical simulations and experimental research are performed to assess the effectiveness and noise immunity of this proposed scheme.

Simulation of Regional Climate over East Asia using Dynamical Downscaling Method

  • Oh, Jai-Ho;Kim, Tae-Kook;Min, Young-Mi
    • 한국수자원학회:학술대회논문집
    • /
    • 한국수자원학회 2002년도 학술발표회 논문집(II)
    • /
    • pp.1187-1194
    • /
    • 2002
  • In this study, we have simulated regional climate over East Asia using dynamical downscaling For dynamic downscaling experiments for regional climate simulation, MM5method. with 27 km horizontal resolution and 18 layers of sigma-coordinate in vertical is nested within global-scale NCEP reanalysis data with 2.5。${\times}$2.5。 resolution in longitude and latitude. In regional simulation, January and July, 1979 monthly mean features have been obtained by both continuous integration and daily restart integration driven by updating the lateral boundary forcing at 6-hr intervals from the NCEP reanalysis data using a nudging scheme with the updating design of initial and boundary conditions in both continuous and restart integrations. In result, we may successfully generated regional detail features which might be forced by topography, lake, coastlines and land use distribution from a regional climate. There is no significant difference in monthly mean features either integrate continuously or integrate with daily restart. For climatologically long integration, the initial condition may not be significantly important. Accordingly, MM5 can be integrated for a long period without restart frequently, if a proper lateral boundary forcing is given.

  • PDF

템플릿 추적 문제를 위한 효율적인 슬라이딩 윈도우 기반 URV Decomposition 알고리즘 (A Fast and Efficient Sliding Window based URV Decomposition Algorithm for Template Tracking)

  • 이근섭
    • 한국멀티미디어학회논문지
    • /
    • 제22권1호
    • /
    • pp.35-43
    • /
    • 2019
  • Template tracking refers to the procedure of finding the most similar image patch corresponding to the given template through an image sequence. In order to obtain more accurate trajectory of the template, the template requires to be updated to reflect various appearance changes as it traverses through an image sequence. To do that, appearance images are used to model appearance variations and these are obtained by the computation of the principal components of the augmented image matrix at every iteration. Unfortunately, it is prohibitively expensive to compute the principal components at every iteration. Thus in this paper, we suggest a new Sliding Window based truncated URV Decomposition (TURVD) algorithm which enables updating their structure by recycling their previous decomposition instead of decomposing the image matrix from the beginning. Specifically, we show an efficient algorithm for updating and downdating the TURVD simultaneously, followed by the rank-one update to the TURVD while tracking the decomposition error accurately and adjusting the truncation level adaptively. Experiments show that the proposed algorithm produces no-meaningful differences but much faster execution speed compared to the typical algorithms in template tracking applications, thereby maintaining a good approximation for the principal components.

Multi-objective optimization of foundation using global-local gravitational search algorithm

  • Khajehzadeh, Mohammad;Taha, Mohd Raihan;Eslami, Mahdiyeh
    • Structural Engineering and Mechanics
    • /
    • 제50권3호
    • /
    • pp.257-273
    • /
    • 2014
  • This paper introduces a novel optimization technique based on gravitational search algorithm (GSA) for numerical optimization and multi-objective optimization of foundation. In the proposed method, a chaotic time varying system is applied into the position updating equation to increase the global exploration ability and accurate local exploitation of the original algorithm. The new algorithm called global-local GSA (GLGSA) is applied for optimization of some well-known mathematical benchmark functions as well as two design examples of spread foundation. In the foundation optimization, two objective functions include total cost and $CO_2$ emissions of the foundation subjected to geotechnical and structural requirements are considered. From environmental point of view, minimization of embedded $CO_2$ emissions that quantifies the total amount of carbon dioxide emissions resulting from the use of materials seems necessary to include in the design criteria. The experimental results demonstrate that, the proposed GLGSA remarkably improves the accuracy, stability and efficiency of the original algorithm.

자발적 공유 경제 방식의 개인 콘텐츠 관리 및 공유 시스템 (Private Contents Management and Sharing Service with Voluntary Sharing Economy System)

  • 류혜송;홍광진;정기철
    • 한국멀티미디어학회논문지
    • /
    • 제19권9호
    • /
    • pp.1698-1709
    • /
    • 2016
  • These days, anyone can easily product and share their own content through a web service such as blogs and SNS. However, contents are being operated separately because of the space limitation in individual SNS. Therefore, it is hard to search contents efficiently in individual SNS. To solve this problem, this paper propose a "Private Contents Management and Sharing Service with Voluntary Sharing Economy System." The system is in part [Input], [Save] and it provides a way to collect the content that are scattered on the Internet based on the creation of personal index. It also proposes a more systematic content management and sharing by creating and updating the website standard index by introducing an index Coordinator concept. Furthermore in [Use] section, by providing a portion of the index as the primary search results, it avoid unclassified content list which was simply collected by users. In conclusion, unlike previous studies, this system will contribute to the acquisition and management of interspersed content and ultimately contribute to the shared activation by preventing secondary processing and unauthorized processing to the original article.

An efficient approach for model updating of a large-scale cable-stayed bridge using ambient vibration measurements combined with a hybrid metaheuristic search algorithm

  • Hoa, Tran N.;Khatir, S.;De Roeck, G.;Long, Nguyen N.;Thanh, Bui T.;Wahab, M. Abdel
    • Smart Structures and Systems
    • /
    • 제25권4호
    • /
    • pp.487-499
    • /
    • 2020
  • This paper proposes a novel approach to model updating for a large-scale cable-stayed bridge based on ambient vibration tests coupled with a hybrid metaheuristic search algorithm. Vibration measurements are carried out under excitation sources of passing vehicles and wind. Based on the measured structural dynamic characteristics, a finite element (FE) model is updated. For long-span bridges, ambient vibration test (AVT) is the most effective vibration testing technique because ambient excitation is freely available, whereas a forced vibration test (FVT) requires considerable efforts to install actuators such as shakers to produce measurable responses. Particle swarm optimization (PSO) is a famous metaheuristic algorithm applied successfully in numerous fields over the last decades. However, PSO has big drawbacks that may decrease its efficiency in tackling the optimization problems. A possible drawback of PSO is premature convergence leading to low convergence level, particularly in complicated multi-peak search issues. On the other hand, PSO not only depends crucially on the quality of initial populations, but also it is impossible to improve the quality of new generations. If the positions of initial particles are far from the global best, it may be difficult to seek the best solution. To overcome the drawbacks of PSO, we propose a hybrid algorithm combining GA with an improved PSO (HGAIPSO). Two striking characteristics of HGAIPSO are briefly described as follows: (1) because of possessing crossover and mutation operators, GA is applied to generate the initial elite populations and (2) those populations are then employed to seek the best solution based on the global search capacity of IPSO that can tackle the problem of premature convergence of PSO. The results show that HGAIPSO not only identifies uncertain parameters of the considered bridge accurately, but also outperforms than PSO, improved PSO (IPSO), and a combination of GA and PSO (HGAPSO) in terms of convergence level and accuracy.