• 제목/요약/키워드: Real-Time Dynamic Programming

검색결과 95건 처리시간 0.028초

객체지향 프로그래밍 기법을 이용한 엔진제어시스템에 관한 연구 (A Study on an Engine Control System using an Object Oriented Programming Method)

  • 윤팔주;이상준;선우명호
    • 한국자동차공학회논문집
    • /
    • 제8권3호
    • /
    • pp.98-109
    • /
    • 2000
  • A new PC-based Engine Control system (ECS) is developed using an object oriented programming method. This system provides more convenient environment for engine tests, easier user interface and extended functions. A Windows-based ECS software is developed with class, and the class structure is built on encapsulation and abstraction. The closed-loop engine control scheme can be easily constructed by using dynamic link library and multitasking. This means that a user can perform desired experiments without clear knowledge of the hardware structure of the ECS. Also this system allows a user to individually control the ignition and fuel injection for each cylinder in a simple manner such as through a keyboard/mouse or in a real-time operation from a closed-loop control program.

  • PDF

도로 장애물의 실시간 인식을 위한 정보전파 신경회로망 (Information Propagation Neural Networks for Real-time Recognition of Load Vehicles)

  • 김종만;김형석;김성중;신동용
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1999년도 하계학술대회 논문집 B
    • /
    • pp.546-549
    • /
    • 1999
  • For the safty driving of an automobile which is become individual requisites, a new Neural Network algorithm which recognized the load vehicles in real time is proposed. The proposed neural network technique is the real time computation method through the inter-node diffusion. In the network, a node corresponds to a state in the quantized input space. Each node is composed of a processing unit and fixed weights from its neighbor nodes as well as its input terminal. The most reliable algorithm derived for real time recognition of vehicles, is a dynamic programming based algorithm based on sequence matching techniques that would process the data as it arrives and could therefore provide continuously updated neighbor information estimates. Through several simulation experiments, real time reconstruction of the nonlinear image information is processed 1-D LIPN hardware has been composed and various experiments with static and dynamic signals have been implmented.

  • PDF

원격지 자동차의 정보 전송을 위한 실시간 신경망 (Real-Time Neural Networks for Information Propagation of Load Vehicles in Remote)

  • 김종만;김원섭;신동용;김형석
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2003년도 하계학술대회 논문집 D
    • /
    • pp.2130-2133
    • /
    • 2003
  • For real-time recognizing of the load vehicles a new Neural Network algorithm is proposed. The proposed neural network technique is the real time computation method through the inter-node diffusion. In the network, a node corresponds to a state in the quantized input space. Each node is composed of a Processing unit and fixed weights from its neighbor nodes as well as its input terminal. The most reliable algorithm derived for real time recognition of vehicles, is a dynamic programming based algorithm based on sequence matching techniques that would process the data as it arrives and could therefore provide continuously updated neighbor information estimates. Through severa simulation experiments, real time reconstruction nonlinear image information is Processed. 1-D hardware has been composed and various experi with static and dynamic signals have implemented.

  • PDF

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

  • Kim, Dong-Kyu;Yang, Dae-Ryook
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2003년도 ICCAS
    • /
    • 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

서비스 시간대별 교통상황을 고려한 차량경로문제 (A Vehicle Routing Problem Which Considers Traffic Situation by Service Time Zones)

  • 김기태;전건욱
    • 산업공학
    • /
    • 제22권4호
    • /
    • pp.359-367
    • /
    • 2009
  • The vehicle travel time between the demand points in downtown area is greatly influenced by complex road condition and traffic situation that change real time to various external environments. Most of research in the vehicle routing problems compose vehicle routes only considering travel distance and average vehicle speed between the demand points, however did not consider dynamic external environments such as traffic situation by service time zones. A realistic vehicle routing problem which considers traffic situation of smooth, delaying, and stagnating by three service time zones such as going to work, afternoon, and going home was suggested in this study. A mathematical programming model was suggested and it gives an optimal solution when using ILOG CPLEX. A hybrid genetic algorithm was also suggested to chooses a vehicle route considering traffic situation to minimize the total travel time. By comparing the result considering the traffic situation, the suggested algorithm gives better solution than existing algorithms.

멀티밴드 해양통신망에서 전송주기를 보장하는 최소 비용의 망 선택 기법 (The Minimum-cost Network Selection Scheme to Guarantee the Periodic Transmission Opportunity in the Multi-band Maritime Communication System)

  • 조구민;윤창호;강충구
    • 한국통신학회논문지
    • /
    • 제36권2A호
    • /
    • pp.139-148
    • /
    • 2011
  • 본 논문은 멀티밴드 해양통신망에서 선적 정보를 주기적으로 전송할 때 발생하는 비용을 최소화하기 위해 가용한 네트워크의 전송 비용과 주어진 허용 가능한 최대 지연 범위 이내에서 예상되는 최소 평균 전송 비용을 비교하여 전송 시점을 결정하는 방안을 제시한다. 이때 전송 시점과 해당 네트워크의 선택 과정을 Markov Decision Process (MDP)로 모델링하며, 이에 따라 각 밴드에서의 채널 상태를 2-State Markov Chain으로 모델링하고 평균 전송 비용을 Stochastic Dynamic Programming을 통해 계산한다. 이를 통해 최소 비용의 망 선택 방식이 도출되었으며, 제안된 방식을 사용할 때 고정 주기를 사용하여 정보를 전송하는 방식에 비해 상당한 망 사용 비용을 절감할 수 있음을 컴퓨터 시뮬레이션을 통해 보인다.

원자력 발전소의 최적 운행중지 시기 결정 방법 (Deciding the Optimal Shutdown time of a Nuclear Power Plant)

  • 양희중
    • 산업공학
    • /
    • 제13권2호
    • /
    • pp.211-216
    • /
    • 2000
  • A methodology that determines the optimal shutdown time of a nuclear power plant is suggested. The shutdown time is decided considering the trade off between the cost of accident and the loss of profit due to the early shutdown. We adopt the bayesian approach in manipulating the model parameter that predicts the accidents. We build decision tree models and apply dynamic programming approach to decide whether to shutdown immediately or operate one more period. The branch parameters in decision trees are updated by bayesian approach. We apply real data to this model and provide the cost of accidents that guarantees the immediate shutdown.

  • PDF

Reinforcement Learning Control using Self-Organizing Map and Multi-layer Feed-Forward Neural Network

  • Lee, Jae-Kang;Kim, Il-Hwan
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2003년도 ICCAS
    • /
    • pp.142-145
    • /
    • 2003
  • Many control applications using Neural Network need a priori information about the objective system. But it is impossible to get exact information about the objective system in real world. To solve this problem, several control methods were proposed. Reinforcement learning control using neural network is one of them. Basically reinforcement learning control doesn't need a priori information of objective system. This method uses reinforcement signal from interaction of objective system and environment and observable states of objective system as input data. But many methods take too much time to apply to real-world. So we focus on faster learning to apply reinforcement learning control to real-world. Two data types are used for reinforcement learning. One is reinforcement signal data. It has only two fixed scalar values that are assigned for each success and fail state. The other is observable state data. There are infinitive states in real-world system. So the number of observable state data is also infinitive. This requires too much learning time for applying to real-world. So we try to reduce the number of observable states by classification of states with Self-Organizing Map. We also use neural dynamic programming for controller design. An inverted pendulum on the cart system is simulated. Failure signal is used for reinforcement signal. The failure signal occurs when the pendulum angle or cart position deviate from the defined control range. The control objective is to maintain the balanced pole and centered cart. And four states that is, position and velocity of cart, angle and angular velocity of pole are used for state signal. Learning controller is composed of serial connection of Self-Organizing Map and two Multi-layer Feed-Forward Neural Networks.

  • PDF

직선 조합의 에너지 전파를 이용한 고속 물체인식 (Fast Object Recognition using Local Energy Propagation from Combination of Saline Line Groups)

  • 강동중
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2000년도 제15차 학술회의논문집
    • /
    • pp.311-311
    • /
    • 2000
  • We propose a DP-based formulation for matching line patterns by defining a robust and stable geometric representation that is based on the conceptual organizations. Usually, the endpoint proximity and collinearity of image lines, as two main conceptual organization groups, are useful cues to match the model shape in the scene. As the endpoint proximity, we detect junctions from image lines. We then search for junction groups by using geometric constraint between the junctions. A junction chain similar to the model chain is searched in the scene, based on a local comparison. A Dynamic Programming-based search algorithm reduces the time complexity for the search of the model chain in the scene. Our system can find a reasonable matching, although there exist severely distorted objects in the scene. We demonstrate the feasibility of the DP-based matching method using both synthetic and real images.

  • PDF

Min-Max DP에 의한 소양 및 충주호의 홍수조절운영 (Flood Control Operation of Soyang and Choongju Reservoirs by the Min-max DP)

  • 오영민;이길성
    • 물과 미래
    • /
    • 제19권4호
    • /
    • pp.339-346
    • /
    • 1986
  • 소양강댐 및 충\ulcorner댐의 실시간 홍수조절 모형을 개발하기 위한 방법으로 Min-Max Dynamic Programming에 의한 최적화 기법을 사용하였다. 최적화 모형의 목적 함수로서는 각 댐의 최대 방류량을 최소화하도록 하였으며, 각 저수지 및 하도의 특성에 따른 제약 조건을 고려하였다. 개발된 단일 저수지 운영 모형에 의한 홍수조절 효과를 평가하는 척도로서 조절율과 이용율을 사용하였다. Technical ROM, Rigid ROM 및 Linear Decision rule과 같은 simulation 모형에 의한 조절 효과와 비교한 결과 모든 빈도에 대하여 DP에 의한 최적화 방법이 더 좋은 것으로 나타났다.

  • PDF