• Title/Summary/Keyword: Coordination Algorithm

Search Result 218, Processing Time 0.025 seconds

Coordination of Generator Maintenance Schedule in Two-Way Bidding Pools (TWBP 시장에서 계통운용자의 발전설비 예방정비계획 조정 알고리즘에 관한 연구)

  • Han Seok-Man;Chung Koo-Hyung;Kim Balho H.;Park Jong-Bae;Cha Jun-Min
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.53 no.12
    • /
    • pp.685-688
    • /
    • 2004
  • In competitive electricity markets, the System Operator (SO) coordinates the overall maintenance schedules whenever the collective maintenance schedule reported to SO by Gencos in the pool does not satisfy the specified operating criteria, such as system reliability or supply adequacy. The SO's coordination usually involves sorts of financial conflict among Genco's. This paper proposes a coordination algorithm which minimizes the total financial loss of Genco's while satisfying the required operating criteria.

Performance Analysis on DCF Considering the Number of Consecutive Successful Transmission in Wireless LAN (무선랜에서 연속적인 전송성공 횟수를 고려한 DCF 성능분석)

  • Lim, Seog-Ku
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.9 no.2
    • /
    • pp.388-394
    • /
    • 2008
  • In this paper, MAC(Medium Access Control) algorithm for the IEEE 802.11 DCF(Distributed Coordination Function) improving the performance is proposed and analyzed by simulation. The MAC of IEEE 802.11 WLAN to control data transmission uses two control methods called DCF and PCF(Point Coordination function). The DCF controls the transmission based on CSMA/CA(Carrier Sense Multiple Access With Collision Avoidance). The DCF shows excellent performance relatively in situation that competition station is less but has a problem that performance is fallen from throughput and delay viewpoint in situation that competition station is increased. This paper proposes an enhanced DCF algorithm that increases the CW to maximal CW after collision and decreases the CW smoothly after successful transmission in order to reduce the collision probability by utilizing the current status information of WLAN. To prove efficiency of proposed algorithm, a lots of simulations are conducted and analyzed.

Washout Algorithm with Fuzzy-Based Tuning for a Motion Simulator

  • Song, Jae-Bok;Jung, Ui-Jung;Ko, Hee-Dong
    • Journal of Mechanical Science and Technology
    • /
    • v.17 no.2
    • /
    • pp.221-229
    • /
    • 2003
  • In the virtual environment, reality can be enhanced by offering the motion based on a motion simulator in harmony with visual and auditory modalities. In this research the Stewart-Gough-platform-based motion simulator has been developed. Implementation of vehicle dynamics is necessary in the motion simulator for realistic sense of motion, so bicycle dynamics is adopted in this research. In order to compensate for the limited range of the motion simulator compared with the real vehicle motion, washout algorithm composed of high-pass filter, low-pass filter and tilt coordination is usually employed. Generally, the washout algorithm is used with fixed parameters. In this research a new approach is proposed to tune the filter parameters based on fuzzy logic in real-time. The cutoff frequencies of the filters are adjusted according to the workspace margins and driving conditions. It is shown that the washout filter with the fuzzy-based parameters presents better performance than that with the fixed ones.

Variable Backoff Stage(VBS) Algorithm to Reduce Collisions in IEEE 802.11 DCF (IEEE 802.11 DCF 에서의 충돌 감소를 위한 가변 백오프 스테이지(VBS) 알고리즘)

  • Kang, Seongho;Choo, Young-yeol
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.6
    • /
    • pp.1333-1340
    • /
    • 2015
  • IEEE 802.11 MAC(Media Access Control) defines DCF(Distributed Coordination Function) for data transmission control. BEB(Binary Exponential Backoff) algorithm of DCF has a problem that if the number of stations connected are over a certain threshold, it degrades network performance because of packet collisions caused from the minimum contention window size. To cope with this problem, we proposed a novel algorithm, named as VBS(Variable Backoff Stage) algorithm, which adjusts the rate of backoff stage increment depending on the number of stations associated with an AP(Access Point). Analytic model of proposed algorithm was derived and simulations on the BEB and the VBS algorithms have been conducted on the OFDM (Orthogonal Frequency Division Multiplexing) method. Simulation results showed that when the rate of backoff state increment was 5 and 10, the number of retransmission were reduced to 1/5 and 1/10 comparing to that of BEB, respectively. Our algorithm showed improvement of 19% and 18% in network utilization, respectively. Packet delay was reduced into 1/12.

Gray Wolf Optimizer for the Optimal Coordination of Directional Overcurrent Relay

  • Kim, Chang-Hwan;Khurshaid, Tahir;Wadood, Abdul;Farkoush, Saeid Gholami;Rhee, Sang-Bong
    • Journal of Electrical Engineering and Technology
    • /
    • v.13 no.3
    • /
    • pp.1043-1051
    • /
    • 2018
  • The coordination of directional overcurrent relay (DOCR) is employed in this work, considering gray wolf optimizer (GWO), a recently designed optimizer that employs the hunting and leadership attitude of gray wolves for searching a global optimum. In power system protection coordination problem, the objective function to be optimized is the sum of operating time of all the main relays. The coordination of directional overcurrent relays is formulated as a linear programming problem. The proposed optimization technique aims to minimize the time dial settings (TDS) of the relays. The calculation of the Time Dial Setting (TDS) setting of the relays is the core of the coordination study. In this article two case studies of IEEE 6-bus system and IEEE 30-bus system are utilized to see the efficiency of this algorithm and the results had been compared with the other algorithms available in the reference and it was observed that the proposed scheme is quite competent for dealing with such problems. From analyzing the obtained results, it has been found that the GWO approach provides the most globally optimum solution at a faster convergence speed. GWO has achieved a lot of relaxation due to its easy implementation, modesty and robustness. MATLAB computer programming has been applied to see the effectiveness of this algorithm.

Efficient MAC Protocol for Achieving Fairness in Wireless Ad-hoc Networks under the DCF (Wireless Ad-hoc 망의 DCF환경에서 Fairness 구현을 위한 효과적인 MAC 프로토콜)

  • 임희선;박승권
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.8A
    • /
    • pp.928-936
    • /
    • 2004
  • This paper proposes simple and effective Contention Window (CW) adjusting algorithm to solve the fairness problem of the IEEE 802.11 under the Distributed Coordination Function (DCF). This adjusting algorithm can support variable packet length as well as both RTS/CTS access method and hidden nodes. Simulation results show that fairness problem can be very severe in the original MAC protocol of the wireless network. In case of implement our algorithm, fair sharing was enlarged prominently and the fairness sharing was improved about maximum 30%.

Development of Protection Coordination Algorithm for Smart Distribution Management System using Communication Method based on IEC61850 (IEC61850 기반의 통신방식을 이용한 스마트 배전운영시스템용 보호협조 알고리즘 개발)

  • Chu, Cheol-Min;Yun, Sang-Yun;Kwan, Seung-Chul;Chu, Kyung-Yong;Jin, Young-Kyu;Choi, Myeon-Song
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.61 no.10
    • /
    • pp.1412-1419
    • /
    • 2012
  • In this paper, we propose the protection coordination algorithm using communication methode based on IEC 61850. The communication protocol in power distribution management system has been issued by IEC standard, IEC61850 of them, which was made for substation automation system, has researched to apply into power distribution system, even though the standard is not a suitable for the system. In smart distribution management system' launched in 2009, the communication network based on the ethernet network for IEC 61850 has been designed to apply the self-healing concept, which is to perform the system protection through the communication between remote terminal units(RTU) according to the standard. However, it is first time to apply the scheme in the real. Thus, this paper proposed the protection algorithm and consideration for applying communication method and introduced the result of demonstration.

Search for Adsorption Coordination of SiH4 or Al(CH3)3 on Si (001) Surface Using Genetic Algorithm and Density Functional theory (유전 알고리즘과 밀도 범함수 이론을 이용한 Si (001) 표면에서의 SiH4 또는 Al(CH3)3 전구체의 흡착 배위 탐색)

  • Kim, Hyun-Kyu;Kim, Jason;Kim, Yeong-Cheol
    • Journal of the Semiconductor & Display Technology
    • /
    • v.20 no.4
    • /
    • pp.16-22
    • /
    • 2021
  • We search for an appropriate initial adsorption coordination of precursor on surface by using genetic algorithm (GA) and density functional theory. SiH4 and Al(CH3)3 as precursor, and OH-terminated Si (001) as surface are used for this study. Selection, crossover, and mutation as hyperparameters of GA are applied to search for the adsorption coordination of the precursors on the surface as a function of generation. Bond distances between precursors and the surface are used to explain the adsorption behavior of the precursors.

A method of minimum-time trajectory planning ensuring collision-free motion for two robot arms

  • Lee, Jihong;Bien, Zeungnam
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1990.10b
    • /
    • pp.990-995
    • /
    • 1990
  • A minimum-time trajectory planning for two robot arms with designated paths and coordination is proposed. The problem considered in this paper is a subproblem of hierarchically decomposed trajectory planning approach for multiple robots : i) path planning, ii) coordination planning, iii) velocity planning. In coordination planning stage, coordination space, a specific form of configuration space, is constructed to determine collision region and collision-free region, and a collision-free coordination curve (CFCC) passing collision-free region is selected. In velocity planning stage, normal dynamic equations of the robots, described by joint angles, velocities and accelerations, are converted into simpler forms which are described by traveling distance along collision-free coordination curve. By utilizing maximum allowable torques and joint velocity limits, admissible range of velocity and acceleration along CFCC is derived, and a minimum-time velocity planning is calculated in phase plane. Also the planning algorithm itself is converted to simple numerical iterative calculation form based on the concept of neural optimization network, which gives a feasible approximate solution to this planning problem. To show the usefulness of proposed method, an example of trajectory planning for 2 SCARA type robots in common workspace is illustrated.

  • PDF

Design and Performance Analysis of an Enhanced MAC Algorithm for the IEEE 802.11 DCF (IEEE 802.11 DCF 성능 개선을 위한 매체접근제어 알고리즘의 설계 및 성능 분석)

  • Hwang, An-Kyu;Lee, Jae-Yong;Kim, Byung-Chul
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.42 no.10 s.340
    • /
    • pp.39-50
    • /
    • 2005
  • In this paper, we propose a performance improving MAC algerian for the IEEE 802.11 DCF. WLAN based IEEE 802.11 uses two control methods called 'Distributed Coordination Function(UF)' and 'Point Coordination Function(PCF)'. The nF controls the Urnsmission based on carrier sense multiple access with collision detection(CSMA/CA), that decides a random backoff time with the range of contention window for each terminal. Normally, each terminal the CW double after collision, and reduces the CW to the minimum after successful transmission. This paper proposes an enhanced DCF algorithm that decreases the CW smoothly after successful transmission in order to reduce the collision Probability by utilizing the current status information of WLAN. We also analyze the throughput and delay performance for the unsaturated case mathematically. Simulation results show that our algorithm enhances the saturation throughput of WLAN. They also coincide well with the analytical results.