• Title/Summary/Keyword: Distributed Control Algorithm

Search Result 466, Processing Time 0.026 seconds

Optimal Voltage Control Algorithm of Small Hydro Generators for Voltage Stabilization in Distribution system with large scaled PV systems (대용량 태양광전원이 연계된 배전계통의 전압안정화를 위한 소수력발전기의 최적전압제어 알고리즘)

  • Choi, Hong-Yeol;Choi, Sung-Sik;Kang, Min-Kwan;Rho, Dae-Seok
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.67 no.7
    • /
    • pp.824-832
    • /
    • 2018
  • According to the government's policy to demonstrate and expand the renewable energy sources, distributed generators such as PV and WP are installed and operated in distribution systems. However, there are many issues related to power quality problems including over voltage and under voltage of customers. In order to overcome these problems, the electric power company have installed a step voltage regulator (SVR) in primary feeders interconnected with distributed generators, and also have established the technical guidelines for the distributed generators to stabilize the customer voltages in distribution systems. However, it is difficult to maintain the customer voltages within allowable limit. Therefore, this paper reviews the problems of voltage control by SVR in a distribution systems interconnected with a large amount of PV systems, and proposes characteristics of operating range and voltage control limit of the small hydropower generators. Also, with the estimation of the influence to the power system voltages from the voltage control mode of generators, this paper proposes the optimal voltage control algorithm of the small hydropower generators. By programming the proposed algorithm into control simulator of exciter, it is confirmed that the proposed algorithm can contribute the voltage stabilization in distribution systems interconnected with large scaled PV systems.

Obstacle Avoidance and Planning using Optimization of Cost Fuction based Distributed Control Command (분산제어명령 기반의 비용함수 최소화를 이용한 장애물회피와 주행기법)

  • Bae, Dongseog;Jin, Taeseok
    • Journal of the Korean Society of Industry Convergence
    • /
    • v.21 no.3
    • /
    • pp.125-131
    • /
    • 2018
  • In this paper, we propose a homogeneous multisensor-based navigation algorithm for a mobile robot, which is intelligently searching the goal location in unknown dynamic environments with moving obstacles using multi-ultrasonic sensor. Instead of using "sensor fusion" method which generates the trajectory of a robot based upon the environment model and sensory data, "command fusion" method by fuzzy inference is used to govern the robot motions. The major factors for robot navigation are represented as a cost function. Using the data of the robot states and the environment, the weight value of each factor using fuzzy inference is determined for an optimal trajectory in dynamic environments. For the evaluation of the proposed algorithm, we performed simulations in PC as well as real experiments with mobile robot, AmigoBot. The results show that the proposed algorithm is apt to identify obstacles in unknown environments to guide the robot to the goal location safely.

Scheduling of Sporadic and Periodic Tasks and Messages with End-to-End Constraints (양극단 제약을 갖는 비주기, 주기 태스크와 메시지 스케줄링)

  • Oh Hoon;Park Hong Seong;Kim Hyoung Yuk
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.11 no.2
    • /
    • pp.175-185
    • /
    • 2005
  • The scheduling methods of the distributed real-time systems have been proposed. However, they have some weak points. They did not schedule both sporadic and periodic tasks and messages at the same time or did not consider the end-to-end constraints such as precedence relations between sporadic tasks. This means that system scheduling must guarantee the constraints of practical systems and be applicable to them. This paper proposes a new scheduling method that can be applied to more practical model of distributed real-time systems. System model consists of sporadic and periodic tasks with precedence relations and sporadic and periodic messages and has end-to-end constraints. The proposed method is based on a binary search-based period assignment algorithm, an end-to-end laxity-based priority assignment algorithm, and three kinds of schedulability analysis, node, network, and end-to-end schedulability analysis. In addition, this paper describes the application model of sporadic tasks with precedence constraints in a distributed real-time system, shows that existing scheduling methods such as Rate Monotonic scheduling are not proper to be applied to the system having sporadic tasks with precedence constraints, and proposes an end-to-end laxity-based priority assignment algorithm.

A Study on Optimal Control of Heat Exchange of Thin Metal Moving at Constant Velocity Via the Paley Order of Walsh Functions (팰리배열 월쉬함수를 이용한 정속 이동 금속판의 열교환 최적제어에 관한 연구)

  • Kim, Tai-Hoon;Lee, Myung-Kyu;Ahn, Doo-Soo
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.50 no.11
    • /
    • pp.514-521
    • /
    • 2001
  • This paper uses the distributed heating thin metal moving at constant velocity which are modeled as distributed parameter systems, and applies the Paley order of Walsh functions to high order partial differential equations and matrix partial differential equations. This thesis presents a new algorithm which usefully exercises the optimal control in the distributed parameter systems. In this paper, the excellent consequences are found without using the existing decentralized control or hierarchical control method.

  • PDF

Distributed Secondary Voltage Control of Islanded Microgrids with Event-Triggered Scheme

  • Guo, Qian;Cai, Hui;Wang, Ying;Chen, Weimin
    • Journal of Power Electronics
    • /
    • v.17 no.6
    • /
    • pp.1650-1657
    • /
    • 2017
  • In this study, the distributed secondary voltage control of islanded microgrids with multi-agent consensus algorithm is investigated. As an alternative to a time-triggered approach, an event-triggered scheme is proposed to reduce the communication load among inverter-based distributed generators (DGs). The proposed aperiodic control scheme reduced unnecessary utilization of limited network bandwidth without degrading control performance. By properly establishing a distributed triggering condition in DG local controller, each inverter is only required to send voltage information when its own event occurs. The compensation of voltage amplitude deviation can be realized, and redundant data exchange related to fixed high sampling rate can be avoided. Therefore, an efficient use of communication infrastructure can be realized, particularly when the system is operating in steady state. The effectiveness of the proposed scheme is verified by simulations on a microgrid test system.

A Data Fusion Algorithm of the Nonlinear System Based on Filtering Step By Step

  • Wen Cheng-Lin;Ge Quan-Bo
    • International Journal of Control, Automation, and Systems
    • /
    • v.4 no.2
    • /
    • pp.165-171
    • /
    • 2006
  • This paper proposes a data fusion algorithm of nonlinear multi sensor dynamic systems of synchronous sampling based on filtering step by step. Firstly, the object state variable at the next time index can be predicted by the previous global information with the systems, then the predicted estimation can be updated in turn by use of the extended Kalman filter when all of the observations aiming at the target state variable arrive. Finally a fusion estimation of the object state variable is obtained based on the system global information. Synchronously, we formulate the new algorithm and compare its performances with those of the traditional nonlinear centralized and distributed data fusion algorithms by the indexes that include the computational complexity, data communicational burden, time delay and estimation accuracy, etc.. These compared results indicate that the performance from the new algorithm is superior to the performances from the two traditional nonlinear data fusion algorithms.

Central Control over Distributed Service Function Path

  • Li, Dan;Lan, Julong;Hu, Yuxiang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.2
    • /
    • pp.577-594
    • /
    • 2020
  • Service Function Chaining (SFC) supports services through linking an ordered list of functions. There may be multiple instances of the same function, which provides a challenge to select available instances for all the functions in an SFC and generate a specific Service Function Path (SFP). Aiming to solve the problem of SFP selection, we propose an architecture consisting of distributed SFP algorithm and central control mechanism. Nodes generate distributed routings based on the first function and destination node in each service request. Controller supervises all of the distributed routing tables and modifies paths as required. The architecture is scalable, robust and quickly reacts to failures because of distributed routings. Besides, it enables centralized and direct control of the forwarding behavior with the help of central control mechanism. Simulation results show that distributed routing tables can generate efficient SFP and the average cost is acceptable. Compared with other algorithms, our design has a good performance on average cost of paths and load balancing, and the response delay to service requests is much lower.

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.

Differential Game Theoretic Approach for Distributed Dynamic Cooperative Power Control in Cognitive Radio Ad Hoc Networks

  • Zhang, Long;Huang, Wei;Wu, Qiwu;Cao, Wenjing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.10
    • /
    • pp.3810-3830
    • /
    • 2015
  • In this paper, we investigate the differential game theoretic approach for distributed dynamic cooperative power control in cognitive radio ad hoc networks (CRANETs). First, a payoff function is defined by taking into consideration the tradeoff between the stock of accumulated power interference to the primary networks and the dynamic regulation of the transmit power of secondary users (SUs). Specifically, the payoff function not only reflects the tradeoff between the requirement for quickly finding the stable available spectrum opportunities and the need for better channel conditions, but also reveals the impact of the differentiated types of data traffic on the demand of transmission quality. Then the dynamic power control problem is modeled as a differential game model. Moreover, we convert the differential game model into a dynamic programming problem to obtain a set of optimal strategies of SUs under the condition of the grand coalition. A distributed dynamic cooperative power control algorithm is developed to dynamically adjust the transmit power of SUs under grand coalition. Finally, numerical results are presented to demonstrate the effectiveness of the proposed algorithm for efficient power control in CRANETs.

Observer-based Distributed Consensus Algorithm for Multi-agent Systems with Output Saturations

  • Lim, Young-Hun;Lee, Gwang-Seok
    • Journal of information and communication convergence engineering
    • /
    • v.17 no.3
    • /
    • pp.167-173
    • /
    • 2019
  • This study investigates the problem of leader-following consensus for multi-agent systems with output saturations. This study assumes that the agents are described as a neutrally stable system, and the leader agent generates the bounded trajectory within the saturation level. Then, the objective of the leader-following consensus is to track the trajectory of the leader by exchanging information with neighbors. To solve this problem, we propose an observer-based distributed consensus algorithm. Then, we provide a consensus analysis by applying the Lyapunov stability theorem and LaSalle's invariance principle. The result shows that the agents achieve the leader-following consensus in a global sense. Moreover, we can achieve the consensus by choosing any positive control gain. Finally, we perform a numerical simulation to demonstrate the validity of the proposed algorithm.