• Title/Summary/Keyword: Distributed Control Algorithm

Search Result 466, Processing Time 0.025 seconds

A Modified grid-based KIneMatic wave STOrm Runoff Model (ModKIMSTORM) (I) - Theory and Model - (격자기반 운동파 강우유출모형 KIMSTORM의 개선(I) - 이론 및 모형 -)

  • Jung, In Kyun;Lee, Mi Seon;Park, Jong Yoon;Kim, Seong Joon
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.28 no.6B
    • /
    • pp.697-707
    • /
    • 2008
  • The grid-based KIneMatic wave STOrm Runoff Model (KIMSTORM) by Kim (1998) predicts the temporal variation and spatial distribution of overland flow, subsurface flow and stream flow in a watershed. The model programmed with C++ language on Unix operating system adopts single flowpath algorithm for water balance simulation of flow at each grid element. In this study, we attempted to improve the model by converting the code into FORTRAN 90 on MS Windows operating system and named as ModKIMSTORM. The improved functions are the addition of GAML (Green-Ampt & Mein-Larson) infiltration model, control of paddy runoff rate by flow depth and Manning's roughness coefficient, addition of baseflow layer, treatment of both spatial and point rainfall data, development of the pre- and post-processor, and development of automatic model evaluation function using five evaluation criteria (Pearson's coefficient of determination, Nash and Sutcliffe model efficiency, the deviation of runoff volume, relative error of the peak runoff rate, and absolute error of the time to peak runoff). The modified model adopts Shell Sort algorithm to enhance the computational performance. Input data formats are accepted as raster and MS Excel, and model outputs viz. soil moisture, discharge, flow depth and velocity are generated as BSQ, ASCII grid, binary grid and raster formats.

A Study on the Dose Assessment Methodology Using the Probabilistic Characteristics of TL Element Response (확률분포 특성을 이용한 열형광선량계의 선량평가방법에 관한 연구)

  • Cho, Dae-Hyung;Oh, Jang-Jin;Han, Seung-Jae;Na, Seong-Ho;Hwang, Won-Guk;Lee, Won-Keun
    • Journal of Radiation Protection and Research
    • /
    • v.23 no.3
    • /
    • pp.123-138
    • /
    • 1998
  • Characteristics of element responses of Panasonic UD802 personnel dosimeters in the X, ${\beta}$, ${\gamma}$, ${\gamma}/X$, ${\gamma}/{\beta}$ and ${\gamma}$/neutron mixed fields were assessed. A dose-response algorithm has been developed to decide the high probability of a radiation type and energy by using the distribution in all six ratios of the multi-element TLD. To calculate the 4-element response factors and ratios between the elements of the Panasonic TLDs in the X, $\beta$, and $\gamma$ radiation fields, Panasonic’s UD802 TLDs were irradiated with KINS’s reference irradiation facility. In the photon radiation field, this study confirms that element-3 (E3) and element-4 (E4) of the Panasonic TLDs show energy dependent both in low- and intermediate-energy range, while element-1 (E1) and element-2 (E2) show little energy dependency in the entire whole range. The algorithm, which was developed in this study, was applied to the Panasonic personnel dosimetry system with UD716AGL reader and UD802 TLDs. Performance tests of the algorithm developed was conducted according to the standards and criteria recommended in the ANSI N13.11. The sum of biases and standard deviations was less than 0.232. The values of biases and standard deviations are distributed within a triangle of a lateral value of 0.3 in the ordinate and abscissa, With the above algorithm, Panasonic TLDs satisfactorily perform optimum dose assessment even under an abnormal response of the TLD elements to the energy imparted. This algorithm can be applied to a more rigorous dose assessment by distinguishing an unexpected dose from the planned dose for the most practical purposes, and is useful in conducting an effective personnel dose control program.

  • PDF

Distributed Throughput-Maximization Using the Up- and Downlink Duality in Wireless Networks (무선망에서의 상하향 링크 쌍대성 성질을 활용한 분산적 수율 최대화 기법)

  • Park, Jung-Min;Kim, Seong-Lyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.11A
    • /
    • pp.878-891
    • /
    • 2011
  • We consider the throughput-maximization problem for both the up- and downlink in a wireless network with interference channels. For this purpose, we design an iterative and distributive uplink algorithm based on Lagrangian relaxation. Using the uplink power prices and network duality, we achieve throughput-maximization in the dual downlink that has a symmetric channel and an equal power budget compared to the uplink. The network duality we prove here is a generalized version of previous research [10], [11]. Computational tests show that the performance of the up- and downlink throughput for our algorithms is close to the optimal value for the channel orthogonality factor, ${\theta}{\in}$(0.5, 1]. On the other hand, when the channels are slightly orthogonal (${\theta}{\in}$(0, 0.5]), we observe some throughput degradation in the downlink. We have extended our analysis to the real downlink that has a nonsymmetric channel and an unequal power budget compared to the uplink. It is shown that the modified duality-based approach is thoroughly applied to the real downlink. Considering the complexity of the algorithms in [6] and [18], we conclude that these results are quite encouraging in terms of both performance and practical applicability of the generalized duality theorem.

Implementation of Agricultural Multi-UAV System with Distributed Swarm Control Algorithm into a Simulator (분산군집제어 알고리즘 기반 농업용 멀티 UAV 시스템의 시뮬레이터 구현)

  • Ju, Chanyoung;Park, Sungjun;Son, Hyoung Il
    • Proceedings of the Korean Society for Agricultural Machinery Conference
    • /
    • 2017.04a
    • /
    • pp.37-38
    • /
    • 2017
  • 최근 방제 및 예찰과 같은 농작업에 단일 UAV(Unmanned Aerial Vehicle)시스템이 적용되고 있지만, 가반하중과 체공시간 등 기존시스템의 문제가 점차 대두되면서 작업 시간을 보다 단축시키고 작업 효율을 극대화 할 수 있는 농업용 멀티 UAV시스템의 필요성이 증대되고 있다. 본 논문에서는 작업자가 다수의 농업용 UAV를 효과적으로 제어할 수 있는 분산군집제어 알고리즘을 제안하며 알고리즘 검증 및 평가를 위한 시뮬레이터를 소개한다. 분산군집제어는 UAV 제어 계층, VP(Virtual Point) 제어 계층, 원격제어 계층으로 이루어진 3계층 제어구조를 가진다. UAV 제어 계층에서 각 UAV는 point mass로 모델링 되는 VP의 이상적인 경로를 추종하도록 제어한다. VP 제어 계층에서 각 VP는 입력 $p_i(t)=u^c_i+u^o_i+u^{co}_i+u^h_i$-(1)을 받아 제어되는데 여기서, $u^c_i{\in}{\mathbb{R}}^3$는 VP 사이의 충돌방지제어, $u^o_i{\in}{\mathbb{R}}^3$는 장애물과의 충돌방지제어, $u^{co}_i{\in}{\mathbb{R}}^3$는 UAV 상호간의 협조제어, $u^h_i{\in}{\mathbb{R}}^3$는 작업자로부터의 원격제어명령이다. (1)의 제어입력에서 충돌방지제어는 각 $u^i_c:=-{\sum\limits_{j{\in}{\eta}_i}}{\frac {{\partial}{\phi}_{ij}^c({\parallel}p_i-p_j{\parallel})^T}{{\partial}p_i}}$-(2), $u^o_c:=-{\sum\limits_{r{\in}O_i}}{\frac {{\partial}{\phi}_{ir}^o({\parallel}p_i-p^o_r{\parallel})^T}{{\partial}p_i}}$-(3)로 정의되면 ${\phi}^c_{ij}$${\phi}^o_{ir}$는 포텐셜 함수를 나타낸다. 원격제어 계층에서 작업자는 햅틱 인터페이스를 통해 VP의 속도를 제어하게 된다. 이때 스케일변수 ${\lambda}$에 대하여 VP의 원격제어명령은 $u^t_i(t)={\lambda}q(t)$로 정의한다. UAV 시뮬레이터는 리눅스 환경에서 ROS(Robot Operating Systems)를 기반한 3차원 시뮬레이터인 Gazebo상에 구축하였으며, 마스터와 슬레이브 간의 제어 명령은 TCPROS를 통해 서로 주고받는다. UAV는 PX4 기반의 3DR Solo 모델을 사용하였으며 MAVROS를 통해 MAVLink 통신 프로토콜에 접속하여 UAV의 고도, 속도 및 가속도 등의 상태정보를 받을 수 있다. 현재 멀티 드론 시스템을 Gazebo 환경에 구축하였으며, 추후 시뮬레이터 상에 분산군집제어 알고리즘을 구현하여 검증 및 평가를 진행하고자 한다.

  • PDF

A Scheduling Algorithm using The Priority of Broker for Improving The Performance of Semantic Web-based Visual Media Retrieval Framework (분산시각 미디어 검색 프레임워크의 성능향상을 위한 브로커 서버 우선순위를 이용한 라운드 로빈 스케줄링 기법)

  • Shim, Jun-Yong;Won, Jae-Hoon;Kim, Se-Chang;Kim, Jung-Sun
    • Journal of KIISE:Software and Applications
    • /
    • v.35 no.1
    • /
    • pp.22-32
    • /
    • 2008
  • To overcome the weakness of the image retrieval system using the existing Ontology and the distributed image based on the database having a simple structure, HERMES was suggested to ensure the self-control of various image suppliers and support the image retrieval based on semantic, the mentioned framework could not solve the problems which are not considered the deterioration in the capacity and scalability when many users connect to broker server simultaneously. In this paper the tables are written which in the case numerous users connect at the same time to the supply analogous level of services without the deterioration in the capacity installs Broker servers and then measures the performance time of each inner Broker Component through Monitoring System and saved and decides the ranking in saved data. As many Query performances are dispersed into several Servers User inputted from the users Interface with reference to Broker Ranking Table, Load Balancing system improving reliability in capacity is proposed. Through the experiment, the scheduling technique has proved that this schedule is faster than existing techniques.

Fast Join Mechanism that considers the switching of the tree in Overlay Multicast (오버레이 멀티캐스팅에서 트리의 스위칭을 고려한 빠른 멤버 가입 방안에 관한 연구)

  • Cho, Sung-Yean;Rho, Kyung-Taeg;Park, Myong-Soon
    • The KIPS Transactions:PartC
    • /
    • v.10C no.5
    • /
    • pp.625-634
    • /
    • 2003
  • More than a decade after its initial proposal, deployment of IP Multicast has been limited due to the problem of traffic control in multicast routing, multicast address allocation in global internet, reliable multicast transport techniques etc. Lately, according to increase of multicast application service such as internet broadcast, real time security information service etc., overlay multicast is developed as a new internet multicast technology. In this paper, we describe an overlay multicast protocol and propose fast join mechanism that considers switching of the tree. To find a potential parent, an existing search algorithm descends the tree from the root by one level at a time, and it causes long joining latency. Also, it is try to select the nearest node as a potential parent. However, it can't select the nearest node by the degree limit of the node. As a result, the generated tree has low efficiency. To reduce long joining latency and improve the efficiency of the tree, we propose searching two levels of the tree at a time. This method forwards joining request message to own children node. So, at ordinary times, there is no overhead to keep the tree. But the joining request came, the increasing number of searching messages will reduce a long joining latency. Also searching more nodes will be helpful to construct more efficient trees. In order to evaluate the performance of our fast join mechanism, we measure the metrics such as the search latency and the number of searched node and the number of switching by the number of members and degree limit. The simulation results show that the performance of our mechanism is superior to that of the existing mechanism.