• Title/Summary/Keyword: Coordination Algorithm

Search Result 218, Processing Time 0.025 seconds

Scheduling and Feedback Reduction in Coordinated Networks

  • Bang, Hans Jorgen;Orten, Pal
    • Journal of Communications and Networks
    • /
    • v.13 no.4
    • /
    • pp.339-344
    • /
    • 2011
  • Base station coordination has received much attention as a means to reduce the inter-cell interference in cellular networks. However, this interference reducing ability comes at the expense of increased feedback, backhaul load and computational complexity. The degree of coordination is therefore limited in practice. In this paper, we explore the trade-off between capacity and feedback load in a cellular network with coordination clusters. Our main interest lies in a scenario with multiple fading users in each cell. The results indicate that a large fraction of the total gain can be achieved by a significant reduction in feedback. We also find an approximate expression for the distribution of the instantaneous signal to interference-plus-noise ratio (SINR) and propose a new effective scheduling algorithm.

Statistical analysis for RMSE of 3D space calibration using the DLT (DLT를 이용한 3차원 공간검증시 RMSE에 대한 통계학적 분석)

  • Lee, Hyun-Seob;Kim, Ky-Hyeung
    • Korean Journal of Applied Biomechanics
    • /
    • v.13 no.1
    • /
    • pp.1-12
    • /
    • 2003
  • The purpose of this study was to design the method of 3D space calibration to reduce RMSE by statistical analysis when using the DLT algorithm and control frame. Control frame for 3D space calibration was consist of $1{\times}3{\times}2m$ and 162 contort points adhere to it. For calculate of 3D coordination used two methods about 2D coordination on image frame, 2D coordinate on each image frame and mean coordination. The methods of statistical analysis used one-way ANOVA and T-test. Significant level was ${\alpha}=.05$. The compose of methods for reduce RMSE were as follow. 1. Use the control frame composed of 24-44 control points arranged equally. 2. When photographing, locate control frame to center of image plane(image frame) o. use the lens of a few distortion. 3. When calculate of 3D coordination, use mean of 2D coordinate obtainable from all image frames.

An Algorithm for Generator Maintenance Scheduling Considering Transmission System (송전계통을 고려한 계통운용자의 발전기 예방정비계획 알고리즘에 관한 연구)

  • Han Seok-Man;Shin Young-Gyun;Kim Balho
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.54 no.7
    • /
    • pp.352-357
    • /
    • 2005
  • In competitive electricity markets, the System Operator (SO) coordinates the overall maintenance schedules when the collective maintenance schedule reported to 50 by Gencos not satisfy the specified operating criteria, such as system reliability or supply adequacy. This paper presented a method that divides generator maintenance scheduling of the 50 into a master-problem and a sub-problem. Master-problem is schedule coordination and sub-problem is DC-optimal power flow. If sub-problem is infeasible, we use the algorithm of modifying operating criteria of master-problem. And, the 50 should use the open information only, because the information such as cost function of a generator and bidding Price is highly crucial for the strategies of profit maximization.

Optimization of Transient Stability Control Part-II: For Cases with Different Unstable Modes

  • Xue Yusheng;Li Wei;Hill David John
    • International Journal of Control, Automation, and Systems
    • /
    • v.3 no.spc2
    • /
    • pp.341-345
    • /
    • 2005
  • Part-I of this two-part paper develops an optimal algorithm for transient stability control to coordinate the preventive actions and emergency actions for a subset of contingencies with an identical unstable mode. In this portion, several subsets of contingencies having dissimilar unstable modes are dealt with. Preventive actions benefiting a subset of contingencies may go against the stability of others, thus coordination among the optimal schemes for individual subsets is necessary. The coordination can be achieved by replacing some preventive actions with contingency-specified emergency actions. It is formulated as a classical model of economic dispatch with stability constraints and stability control costs. Such an optimal algorithm is proposed based on the algorithm in Part-I of the paper and is verified by simulations on a Chinese power system.

A distributed algorithm for the coordination of dynamic barricades composed of autonomous mobile robots

  • Lee, Geun-Ho;Defago, Xavier;Chong, Nak-Young
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.2030-2035
    • /
    • 2005
  • In this paper, we study the distributed coordination of a set of synchronous, anonymous, memoryless mobile robots that can freely move on a two-dimensional plane but are unable to communicate directly. Based on this model, we analyze the application problem that consists in having a group of robots form a barricade line to protect from car traffic a crowd of demonstrators parading on the street. For the sake of robustness, we privilege fully decentralized solutions to the problem. In particular, we give a self-stabilizing distributed algorithm to address the problem, in this presentation

  • PDF

Multi-Robot Path Planning for Environmental Exploration/Monitoring (미지 환경 탐색 및 감시를 위한 다개체 로봇의 경로계획)

  • Lee, Soo-Yong
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.18 no.5
    • /
    • pp.413-418
    • /
    • 2012
  • This paper presents a multi-robot path planner for environment exploration and monitoring. Robotics systems are being widely used as data measurement tools, especially in dangerous environment. For large scale environment monitoring, multiple robots are required in order to save time. The path planner should not only consider the collision avoidance but efficient coordination of robots for optimal measurements. Nonlinear spring force based planning algorithm is integrated with the spatial gradient following path planner. Perturbation/Correlation based estimation of spatial gradient is applied. An algorithm of tuning the stiffness for robot coordination is presented. The performance of the proposed algorithm is discussed with simulation results.

Short-Term Hydro Scheduling for Hydrothermal Coordination Using Genetic Algorithm (유전 알고리즘에 의한 수화력 협조를 위한 단기 수력 스케줄링)

  • Lee, Yong-Han;Park, June-Ho
    • Proceedings of the KIEE Conference
    • /
    • 1998.11a
    • /
    • pp.289-291
    • /
    • 1998
  • This paper presents short-term hydro scheduling method for hydrothermal coordination by genetic algorithm. Hydro scheduling problem has many constraints with fixed final reservoir volume. In this paper, the difficult water balance constraints caused by hydraulic coupling satisfied throughout dynamic decoding method. Adaptive penalizing method was also proposed to handle the infeasible solutions that violate various constraints. The effectiveness of proposed method in this paper was examined through the case studies. Further studies for the validation of the hydro scheduling scheme obtained by genetic algorithm will be very appreciated.

  • PDF

A Low-Complexity Algorithm for Inter-Cell Interference Coordination and User Scheduling in Downlink Heterogeneous Networks (이종 네트워크 하향링크의 셀간 간섭 조정 및 사용자 스케줄링을 위한 저복잡도 알고리즘)

  • Park, Jinhyun;Lee, Jae Hong
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.6
    • /
    • pp.9-17
    • /
    • 2014
  • Heterogeneous network (HetNet) is a network consisting of macrocells overlaid with small cells. In HetNet, the interference from macrocell to small cell users is a major cause of performance degradation of small cell users and enhanced inter-cell interference coordination (eICIC) is needed to mitigate the interference. Previous works on eICIC gives limited performance gain because these works focus on maximizing long-term throughput and rarely consider varying channel conditions over frames. This paper proposes a new algorithm which dynamically coordinates interference and schedules users on each frame to maximize the total utility of the network with lower computational complexity than exhaustive search. Simulation results show that the proposed algorithm achieves higher total throughput than the throughput with the conventional algorithm, and has higher fairness index than the conventional algorithm when there large number of users.

A New Formulation for Coordination of Directional Overcurrent Relays in Interconnected Networks for Better Miscoordination Suppression

  • Yazdaninejadi, Amin;Jannati, Jamil;Farsadi, Murtaza
    • Transactions on Electrical and Electronic Materials
    • /
    • v.18 no.3
    • /
    • pp.169-175
    • /
    • 2017
  • A safe and reliable protection system in distribution networks, specifically, those hosting distribution generation units, needs a robust over-current protection scheme. To avoid unintentional DG disconnection during fault conditions, a protection system should operate quickly and selectively. Therefore, to achieve this aim, satisfying coordination constraints are important for any protection scheme in distribution networks; these pose a challenging task in interconnected and large-scale networks. In this paper, a new coordination strategy, based on the same non-standard time-current curve for all relays, in order to find optimal coordination of directional over-current relays, is proposed. The main aim is to reduce violations, especially miscoordination between pair relays. Besides this, the overall time of operation of relays during primary and backup operations should be minimized concurrently. This work is being tackled based on genetic algorithms and motivated by the heuristic algorithm. For the numerical analysis, to show the superiority of this coordination strategy, the IEEE 30-bus test system, with a mesh structure and supplemented with distributed generation, is put under extensive simulations, and the obtained results are discussed in depth.

Sensory Motor Coordination System for Robotic Grasping (로봇 손의 힘 조절을 위한 생물학적 감각-운동 협응)

  • 김태형;김태선;수동성;이종호
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.53 no.2
    • /
    • pp.127-134
    • /
    • 2004
  • In this paper, human motor behaving model based sensory motor coordination(SMC) algorithm is implemented on robotic grasping task. Compare to conventional SMC models which connect sensor to motor directly, the proposed method used biologically inspired human behaving system in conjunction with SMC algorithm for fast grasping force control of robot arm. To characterize various grasping objects, pressure sensors on hand gripper were used. Measured sensory data are simultaneously transferred to perceptual mechanism(PM) and long term memory(LTM), and then the sensory information is forwarded to the fastest channel among several information-processing flows in human motor system. In this model, two motor learning routes are proposed. One of the route uses PM and the other uses short term memory(STM) and LTM structure. Through motor learning procedure, successful information is transferred from STM to LTM. Also, LTM data are used for next moor plan as reference information. STM is designed to single layered perception neural network to generate fast motor plan and receive required data which comes from LTM. Experimental results showed that proposed method can control of the grasping force adaptable to various shapes and types of greasing objects, and also it showed quicker grasping-behavior lumining time compare to simple feedback system.