• 제목/요약/키워드: Balancing Simulation

검색결과 467건 처리시간 0.027초

자동평형장치가 부착된 로보트 매니퓰레이터에 관한 연구 (A Study on a Robot Manipulator with an Auto-Balancing Mechnism)

  • 남광희
    • 대한전자공학회논문지
    • /
    • 제26권4호
    • /
    • pp.45-52
    • /
    • 1989
  • 로보트는 일반적으로 성능에 비해 링크 및 구동기가 심히 과도설계(overdesign) 되어 있다. 로보트의 링크를 평형화(balancing) 시키면 역학이 간단해 질 뿐 아니라 지배적으로 큰 중력항을 제거시킬 수 있다는 점이 최근에 보여졌다. 본 연구에서는 평형화에 의한 중력항의 제거가 과도설계를 피하는 한 방법으로 보고 페이드로에 따라 변하는 평형조건을 적극적으로 만족시켜주는 자동평형장치(auto-balancing mechanism)을 제안하고 그 성능을 컴퓨터 시뮬레이션으로 예시하였다.

  • PDF

부하 조절을 지원하는 이동환자 상시 모니터링 시스템 시뮬레이션 (Simulation of a Mobile Patient Monitoring System with Load-balancing)

  • 최은정;김명주
    • 디지털산업정보학회논문지
    • /
    • 제6권4호
    • /
    • pp.67-73
    • /
    • 2010
  • A Wireless Sensor Network(WSN) is a promising infrastructure for the future U-healthcare system. In a WSN for the U-healthcare system, both biometric data and location data are transferred hierarchically from lots of mobile patients to the base station server and some countermeasures are made in real time if necessary. In this process, we encounter the load-balancing problem when many patients gather in a specific area. We also encounter the data duplication problem when each patient moves into an area monitored by several supervisors. The second problem is closely related to the first one. In this paper, we propose a mobile patient monitoring system with priority-based policy in load-balancing to solve the previous two problems and perform a DEVS Java-based system simulation to verify the system efficiency.

Bio-inspired Load Balancing Routing for Delay-Guaranteed Services in Ever-Changing Networks

  • Kim, Young-Min;Kim, Hak Suh;Jung, Boo-Geum;Park, Hea-Sook;Park, Hong-Shik
    • ETRI Journal
    • /
    • 제35권3호
    • /
    • pp.414-424
    • /
    • 2013
  • We consider a new load balancing routing for delay-guaranteed services in the network in which the traffic is dynamic and network topologies frequently change. For such an ever-changing network, we propose a new online load balancing routing called AntLBR, which exploits the ant colony optimization method. Generally, to achieve load balancing, researchers have tried to calculate the traffic split ratio by solving a complicated linear programming (LP) problem under the static network environment. In contrast, the proposed AntLBR does not make any attempt to solve this complicated LP problem. So as to achieve load balancing, AntLBR simply forwards incoming flows by referring to the amount of pheromone trails. Simulation results indicate that the AntLBR algorithm achieves a more load-balanced network under the changing network environment than techniques used in previous research while guaranteeing the requirements of delay-guaranteed services.

Dynamic Clustering for Load-Balancing Routing In Wireless Mesh Network

  • Thai, Pham Ngoc;Hwang, Min-Tae;Hwang, Won-Joo
    • 한국멀티미디어학회논문지
    • /
    • 제10권12호
    • /
    • pp.1645-1654
    • /
    • 2007
  • In this paper, we study the problem of load balancing routing in clustered-based wireless mesh network in order to enhance the overall network throughput. We first address the problems of cluster allocation in wireless mesh network to achieve load-balancing state. Due to the complexity of the problem, we proposed a simplified algorithm using gradient load-balancing model. This method searches for a localized optimal solution of cluster allocation instead of solving the optimal solution for overall network. To support for load-balancing algorithm and reduce complexity of topology control, we also introduce limited broadcasting between two clusters. This mechanism maintain shortest path between two nodes in adjacent clusters while minimizing the topology broadcasting complexity. The simulation experiments demonstrate that our proposed model achieve performance improvement in terms of network throughput in comparison with other clustering methods.

  • PDF

A Multi-Class Task Scheduling Strategy for Heterogeneous Distributed Computing Systems

  • El-Zoghdy, S.F.;Ghoneim, Ahmed
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권1호
    • /
    • pp.117-135
    • /
    • 2016
  • Performance enhancement is one of the most important issues in high performance distributed computing systems. In such computing systems, online users submit their jobs anytime and anywhere to a set of dynamic resources. Jobs arrival and processes execution times are stochastic. The performance of a distributed computing system can be improved by using an effective load balancing strategy to redistribute the user tasks among computing resources for efficient utilization. This paper presents a multi-class load balancing strategy that balances different classes of user tasks on multiple heterogeneous computing nodes to minimize the per-class mean response time. For a wide range of system parameters, the performance of the proposed multi-class load balancing strategy is compared with that of the random distribution load balancing, and uniform distribution load balancing strategies using simulation. The results show that, the proposed strategy outperforms the other two studied strategies in terms of average task response time, and average computing nodes utilization.

A Markov Decision Process (MDP) based Load Balancing Algorithm for Multi-cell Networks with Multi-carriers

  • Yang, Janghoon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권10호
    • /
    • pp.3394-3408
    • /
    • 2014
  • Conventional mobile state (MS) and base station (BS) association based on average signal strength often results in imbalance of cell load which may require more powerful processor at BSs and degrades the perceived transmission rate of MSs. To deal with this problem, a Markov decision process (MDP) for load balancing in a multi-cell system with multi-carriers is formulated. To solve the problem, exploiting Sarsa algorithm of on-line learning type [12], ${\alpha}$-controllable load balancing algorithm is proposed. It is designed to control tradeoff between the cell load deviation of BSs and the perceived transmission rates of MSs. We also propose an ${\varepsilon}$-differential soft greedy policy for on-line learning which is proven to be asymptotically convergent to the optimal greedy policy under some condition. Simulation results verify that the ${\alpha}$-controllable load balancing algorithm controls the behavior of the algorithm depending on the choice of ${\alpha}$. It is shown to be very efficient in balancing cell loads of BSs with low ${\alpha}$.

다중권선 변압기를 이용한 능동형 셀 밸런싱 회로에서 밸런싱 전류 전달 효율을 높이기 위한 변압기 설계 방안 (Transformer Design Methodology to Improve Transfer Efficiency of Balancing Current in Active Cell Balancing Circuit using Multi-Winding Transformer)

  • 이상중;김명호;백주원;정지훈
    • 전력전자학회논문지
    • /
    • 제23권4호
    • /
    • pp.247-255
    • /
    • 2018
  • This paper proposes a transformer design of a direct cell-to-cell active cell balancing circuit with a multi-winding transformer for battery management system (BMS) applications. The coupling coefficient of the multi-winding transformer and the output capacitance of MOSFETs significantly affect the balancing current transfer efficiency of the cell balancing operation. During the operation, the multi-winding transformer stores the energy charged in a specific source cell and subsequently transfers this energy to the target cell. However, the leakage inductance of the multi-winding transformer and the output capacitance of the MOSFET induce an abnormal energy transfer to the non-target cells, thereby degrading the transfer efficiency of the balancing current in each cell balancing operation. The impacts of the balancing current transfer efficiency deterioration are analyzed and a transformer design methodology that considers the coupling coefficient is proposed to enhance the transfer efficiency of the balancing current. The efficiency improvements resulting from the selection of an appropriate coupling coefficient are verified by conducting a simulation and experiment with a 1 W prototype cell balancing circuit.

부유금형을 가진 냉간단조 공정의 유한요소해석 (Finite Element Analysis of a Cold Forging Process Having a Floating Die)

  • 류찬호;전만수
    • 소성∙가공
    • /
    • 제9권2호
    • /
    • pp.159-164
    • /
    • 2000
  • In this paper, a computer simulation technique for the forging process having a floating die is presented. The penalty rigid-plastic finite element method is employed together with an iteratively force-balancing method, in which the convergence is achieved when the floating die part is in force equilibrium within the user-specified tolerance. The force balance is controled by adjusting the velocity of the floating die in an automatic manner. An application example of a three-stage cold forging process is given.

  • PDF

Efficient Load Balancing Algorithms for a Resilient Packet Ring

  • Cho, Kwang-Soo;Joo, Un-Gi;Lee, Heyung-Sub;Kim, Bong-Tae;Lee, Won-Don
    • ETRI Journal
    • /
    • 제27권1호
    • /
    • pp.110-113
    • /
    • 2005
  • The resilient packet ring (RPR) is a data optimized ring network, where one of the key issues is on load balancing for competing streams of elastic traffic. This paper suggests three efficient traffic loading algorithms on the RPR. For the algorithms, we evaluate their efficiency via analysis or simulation.

  • PDF

반작용 휠의 LQR 제어를 통한 Cubli 프레임의 균형유지 (Balancing the Cubli Frame with LQR-controlled Reaction Wheel)

  • 김용훈;박준모;한승오
    • 센서학회지
    • /
    • 제27권3호
    • /
    • pp.165-169
    • /
    • 2018
  • A single-axis Cubli frame realized simply with an IMU sensor and DC motor is presented herein. To maintain the balance on the Cubli frame, an LQR controller based on a Lagrangian derivation of the dynamics was designed, which utilized the state variables of the frame angle and its angular acceleration, as well as the wheel angle and its angular acceleration. The designed LQR controller showed a settling time balancing capability of approximately two seconds and 40% of the maximum overshoot in Matlab/Simulink simulations. Our experimental results of the fabricated Cubli frame matched with the simulation results. It maintained balancing at the reference position even though an initial offset as well as external disturbance during the balancing was applied.