• Title/Summary/Keyword: Dynamic Control Algorithm

Search Result 1,625, Processing Time 0.03 seconds

VEHICLE DYNAMIC CONTROL ALGORITHM AND ITS IMPLEMENTATION ON CONTROL PROTOTYPING SYSTEM

  • Zhang, Y.;Yin, C.;Zhang, J.
    • International Journal of Automotive Technology
    • /
    • v.7 no.2
    • /
    • pp.167-172
    • /
    • 2006
  • A design of controller for vehicle dynamic control(VDC) and its implementation on the real vehicle were introduced. The controller has been designed using a three-degrees-of-freedom(3DOF) yaw plane vehicle, and the control algorithm was implemented on the vehicle by control prototyping system dSPACE. A hybrid control algorithm, which makes full use of the advantages of robust and fuzzy control, was adopted in the control system. Field test results show that the performance of the vehicle handling dynamics with hybrid controller is improved obviously compared to that without VDC and with simple robust controller on skiddy roads(friction coefficients lower than 0.3).

A Dynamic Signalling Period Allocation Algorithm in Wireless ATM MAC Protocols (무선 ATM MAC 프로토콜에서 동적 신호 주기 할당 알고리즘)

  • 강상욱;신요안;최승철
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.6B
    • /
    • pp.1004-1014
    • /
    • 1999
  • MAC protocols in wireless ATM has to increase and maintain the system throughput performance. To achieve these purposes, this paper proposes a dynamic control algorithm called DSPA (Dynamic Signalling Period Allocation) for wireless ATM MAC protocol. The proposed DSPA algorithm consists of the following three algorithms. First, a control slot generation algorithm which generates the control slots by utilizing static and dynamic parameters from the terminals, is proposed. Second, a dynamic signalling period allocation algorithm is proposed for a base station to dynamically determine each signalling period according to current terminal states, and thus allocates the optimal signalling periods. Finally, a dynamic slot allocation algorithm is proposed to dynamically determine priorities of the terminals whenever a slot is allocated. Simulation results indicates that DSPA algorithm decreases average packet delay of the terminals by dynamic allocation of signal periods based on the system utilization, and thus increases the limitation of allowable loads that quarantee quality of services. Also the proposed algorithm is shown to maintain stable throughput even in the case of traffic variations.

  • PDF

A New Dynamic Routing Algorithm for Multiple AGV Systems : Nonstop Preferential Detour Algorithm (다중무인운반차 시스템의 새로운 동적경로계획 알고리즘 : 비정지우선 우회 알고리즘)

  • Sin, Seong-Yeong;Jo, Gwang-Hyeon
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.8 no.9
    • /
    • pp.795-802
    • /
    • 2002
  • We present a new dynamic routing scheme for multiple autonomous guided vehicles (AGVs) systems. There have been so many results concerned with scheduling and routing of multiple AGV systems; however, most of them are only applicable to systems with a small number of AGVs under a low degree of concurrency. With an increased number of AGVs in recent applications, these AGV systems are faced with another problem that has never been occurred in a system with a small number AGVs. This is the stop propagation problem. That is, if a leading AGV stops then all the following AGVs must stop to avoid any collision. In order to resolve this problem, we propose a nonstop preferential detour (NPD) algorithm which is a new dynamic routing scheme employing an election algorithm. For real time computation, we introduce two stage control scheme and propose a new path searching scheme, k-via shortest path scheme for an efficient dynamic routing algorithm. Finally, the proposed new dynamic routing scheme is illustrated by an example.

Control of pH Neutralization Process using Simulation Based Dynamic Programming in Simulation and Experiment (ICCAS 2004)

  • Kim, Dong-Kyu;Lee, Kwang-Soon;Yang, Dae-Ryook
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.620-626
    • /
    • 2004
  • For general nonlinear processes, it is difficult to control with a linear model-based control method and nonlinear controls are considered. Among the numerous approaches suggested, the most rigorous approach is to use dynamic optimization. Many general engineering problems like control, scheduling, planning etc. are expressed by functional optimization problem and most of them can be changed into dynamic programming (DP) problems. However the DP problems are used in just few cases because as the size of the problem grows, the dynamic programming approach is suffered from the burden of calculation which is called as 'curse of dimensionality'. In order to avoid this problem, the Neuro-Dynamic Programming (NDP) approach is proposed by Bertsekas and Tsitsiklis (1996). To get the solution of seriously nonlinear process control, the interest in NDP approach is enlarged and NDP algorithm is applied to diverse areas such as retailing, finance, inventory management, communication networks, etc. and it has been extended to chemical engineering parts. In the NDP approach, we select the optimal control input policy to minimize the value of cost which is calculated by the sum of current stage cost and future stages cost starting from the next state. The cost value is related with a weight square sum of error and input movement. During the calculation of optimal input policy, if the approximate cost function by using simulation data is utilized with Bellman iteration, the burden of calculation can be relieved and the curse of dimensionality problem of DP can be overcome. It is very important issue how to construct the cost-to-go function which has a good approximate performance. The neural network is one of the eager learning methods and it works as a global approximator to cost-to-go function. In this algorithm, the training of neural network is important and difficult part, and it gives significant effect on the performance of control. To avoid the difficulty in neural network training, the lazy learning method like k-nearest neighbor method can be exploited. The training is unnecessary for this method but requires more computation time and greater data storage. The pH neutralization process has long been taken as a representative benchmark problem of nonlin ar chemical process control due to its nonlinearity and time-varying nature. In this study, the NDP algorithm was applied to pH neutralization process. At first, the pH neutralization process control to use NDP algorithm was performed through simulations with various approximators. The global and local approximators are used for NDP calculation. After that, the verification of NDP in real system was made by pH neutralization experiment. The control results by NDP algorithm was compared with those by the PI controller which is traditionally used, in both simulations and experiments. From the comparison of results, the control by NDP algorithm showed faster and better control performance than PI controller. In addition to that, the control by NDP algorithm showed the good results when it applied to the cases with disturbances and multiple set point changes.

  • PDF

Control of an stochastic nonlinear system by the method of dynamic programming

  • Choi, Wan-Sik
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1994.10a
    • /
    • pp.156-161
    • /
    • 1994
  • In this paper, we consider an optimal control problem of a nonlinear stochastic system. Dynamic programming approach is employed for the formulation of a stochastic optimal control problem. As an optimality condition, dynamic programming equation so called the Bellman equation is obtained, which seldom yields an analytical solution, even very difficult to solve numerically. We obtain the numerical solution of the Bellman equation using an algorithm based on the finite difference approximation and the contraction mapping method. Optimal controls are constructed through the solution process of the Bellman equation. We also construct a test case in order to investigate the actual performance of the algorithm.

  • PDF

Characteristics Modeling of Dynamic Systems Using Adaptive Neural Computation (적응 뉴럴 컴퓨팅 방법을 이용한 동적 시스템의 특성 모델링)

  • Kim, Byoung-Ho
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.13 no.4
    • /
    • pp.309-314
    • /
    • 2007
  • This paper presents an adaptive neural computation algorithm for multi-layered neural networks which are applied to identify the characteristic function of dynamic systems. The main feature of the proposed algorithm is that the initial learning rate for the employed neural network is assigned systematically, and also the assigned learning rate can be adjusted empirically for effective neural leaning. By employing the approach, enhanced modeling of dynamic systems is possible. The effectiveness of this approach is veri tied by simulations.

Boiler Supply Water Temperature Setting by Outside Air Temperature and Return Water Temperature (외기온도와 환수온도를 이용한 보일러의 공급수온도설정)

  • Han, Do-Young;Yoo, Byeong-Kang
    • Proceedings of the SAREK Conference
    • /
    • 2009.06a
    • /
    • pp.161-166
    • /
    • 2009
  • Condensing gas boiler units may make a big role for the reduction of energy consumption in heating industries. In order to decrease the energy consumption of a boiler unit, the effective operation is necessary. In this study, the supply water temperature algorithm of a condensing gas boiler was developed. This includes the setpoint algorithm and the control algorithm of the supply water temperature. The setpoint algorithm was developed by the fuzzy logic and the control algorithm was developed by the proportional integral algorithm. In order to analyse the performance of the supply water temperature algorithm, the dynamic model of a condensing gas boiler system was used. Simulation results showed that the supply water temperature algorithm developed for this study may be practically applied for the control of the condensing gas boiler.

  • PDF

Integrated robot control system for off-line teaching (오프라인 교시작업을 위한 통합 로봇제어시스템의 구현)

  • 안철기;이민철;이장명;김성권
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1996.10b
    • /
    • pp.503-506
    • /
    • 1996
  • An integrated Robot control system for SCARA robot is developed. The system consists of an off-line programming(OLP), software and a robot controller using four digital signal processor(TMS32OC50). The OLP has functions of teaching task, dynamic simulator, three dimensional animation, and trajectory planning. To develop robust dynamic control algorithm, a new sliding mode control algorithm for the robot is proposed. The trajectory tracking performance of these algorithm is evaluated by implementing to SCARA robot(SM5 type) using DSP controller which has conventional PI-FF control algorithm. To make SCARA robot operate according to off-line teaching, an interface between OLP and robot controller in the integrated system is designed. To demonstrate performance of the integrated system, the proposed control algorithm is applied to the system.

  • PDF

Dynamic Bandwidth Allocation Algorithm for Multimedia Services over Ethernet PONs

  • Choi, Su-Il;Huh, Jae-Doo
    • ETRI Journal
    • /
    • v.24 no.6
    • /
    • pp.465-468
    • /
    • 2002
  • Ethernet passive optical networks (PONs) are an emerging access network technology that provides a low-cost method of deploying optical access lines between a carrier's central office and a customer site. In this paper, we propose a new algorithm of dynamic bandwidth allocation for multimedia services over Ethernet PONs. To implement the suggested dynamic bandwidth allocation algorithm, we present control message formats that handle classified bandwidths in a multi-point control protocol of Ethernet PONs.

  • PDF

Control of pH Neutralization Process using Simulation Based Dynamic Programming (ICCAS 2003)

  • Kim, Dong-Kyu;Yang, Dae-Ryook
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.2617-2622
    • /
    • 2003
  • The pH neutralization process has long been taken as a representative benchmark problem of nonlinear chemical process control due to its nonlinearity and time-varying nature. For general nonlinear processes, it is difficult to control with a linear model-based control method so nonlinear controls must be considered. Among the numerous approaches suggested, the most rigorous approach is the dynamic optimization. However, as the size of the problem grows, the dynamic programming approach is suffered from the curse of dimensionality. In order to avoid this problem, the Neuro-Dynamic Programming (NDP) approach was proposed by Bertsekas and Tsitsiklis (1996). The NDP approach is to utilize all the data collected to generate an approximation of optimal cost-to-go function which was used to find the optimal input movement in real time control. The approximation could be any type of function such as polynomials, neural networks and etc. In this study, an algorithm using NDP approach was applied to a pH neutralization process to investigate the feasibility of the NDP algorithm and to deepen the understanding of the basic characteristics of this algorithm. As the global approximator, the neural network which requires training and k-nearest neighbor method which requires querying instead of training are investigated. The global approximator requires optimal control strategy. If the optimal control strategy is not available, suboptimal control strategy can be used even though the laborious Bellman iterations are necessary. For pH neutralization process it is rather easy to devise an optimal control strategy. Thus, we used an optimal control strategy and did not perform the Bellman iteration. Also, the effects of constraints on control moves are studied. From the simulations, the NDP method outperforms the conventional PID control.

  • PDF