• 제목/요약/키워드: adaptive dynamic programming

검색결과 27건 처리시간 0.029초

선형계획 문제의 해를 구하는 신경회로 (Neural Networks for Solving Linear Programming Problems and Linear Systems)

  • 장석호;강성귀;남부희;이정문
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1993년도 하계학술대회 논문집 A
    • /
    • pp.221-223
    • /
    • 1993
  • The Hopfield model is defined as an adaptive dynamic system. In this paper we propose a modified neural network which is capable of solving linear programming problems and a set of linear equations. The model is directly implemented from the given system, and solves the problem without calculating the inverse of the matrices. We get the better stability results by the addition of scaling property and by using the nonlinearities in the linear programming neural networks.

  • PDF

ADSP-2101을 이용한 실시간 처리 적응 음향반향제거기의 구현 (Realization of a Real-Time Adaptive Acoustic Echo Canceller on ADSP-210l)

  • 김성훈;김기두;장수영;김진욱
    • 전자공학회논문지B
    • /
    • 제33B권2호
    • /
    • pp.95-102
    • /
    • 1996
  • This paper describes the realization of a rela-time adaptive acoustic echo canceller, which adopts a microprogramming method, for removing acoustical echoes in speakerphone systems using th eADSP-2101 microprocessor with a pipeline and modified harvard architecture. We apply the LMS (least mean square) algorithm to estimate the coefficients of a transversal FIR filter. For the acustic adaptive echo canceller, we propose a parallel operation programming to imrove algorithm execution speed and apply a nonlinear quantization to reduce the quantization error caused by large dynamic range of voice signal.

  • PDF

Effectual Method FOR 3D Rebuilding From Diverse Images

  • Leung, Carlos Wai Yin;Hons, B.E.
    • 한국정보컨버전스학회:학술대회논문집
    • /
    • 한국정보컨버전스학회 2008년도 International conference on information convergence
    • /
    • pp.145-150
    • /
    • 2008
  • This thesis explores the problem of reconstructing a three-dimensional(3D) scene given a set of images or image sequences of the scene. It describes efficient methods for the 3D reconstruction of static and dynamic scenes from stereo images, stereo image sequences, and images captured from multiple viewpoints. Novel methods for image-based and volumetric modelling approaches to 3D reconstruction are presented, with an emphasis on the development of efficient algorithm which produce high quality and accurate reconstructions. For image-based 3D reconstruction a novel energy minimisation scheme, Iterated Dynamic Programming, is presented for the efficient computation of strong local minima of discontinuity preserving energyy functions. Coupled with a novel morphological decomposition method and subregioning schemes for the efficient computation of a narrowband matching cost volume. the minimisation framework is applied to solve problems in stereo matching, stereo-temporal reconstruction, motion estimation, 2D image registration and 3D image registration. This thesis establishes Iterated Dynamic Programming as an efficient and effective energy minimisation scheme suitable for computer vision problems which involve finding correspondences across images. For 3D reconstruction from multiple view images with arbitrary camera placement, a novel volumetric modelling technique, Embedded Voxel Colouring, is presented that efficiently embeds all reconstructions of a 3D scene into a single output in a single scan of the volumetric space under exact visibility. An adaptive thresholding framework is also introduced for the computation of the optimal set of thresholds to obtain high quality 3D reconstructions. This thesis establishes the Embedded Voxel Colouring framework as a fast, efficient and effective method for 3D reconstruction from multiple view images.

  • PDF

화행별 템플릿 기반의 지식획득 기법과 유전자 프로그래밍을 이용한 문장 생성 기법을 통한 대화형 에이전트의 대화 학습 (Learning Conversation in Conversational Agent Using Knowledge Acquisition based on Speech-act Templates and Sentence Generation with Genetic Programming)

  • 임성수;홍진혁;조성배
    • 인지과학
    • /
    • 제16권4호
    • /
    • pp.351-368
    • /
    • 2005
  • 지능형 시스템에서 기존의 수작업 기반의 지식구조 구축은 많은 시간과 노력이 들어가며 환경의 변화에 적절히 적응하기가 어려운 한계가 있다 이러한 한계를 극복하기 위하여 최근 학습을 통한 동적 지식구조 구축방법이 연구되고 있다. 자율 자아 성장(AMD: Autonomous Mental Development)은 자율적 기계 학습의 새로운 패러다임으로 지능형 시스템이 변화하는 환경에 스스로 적응하도록 시도한다 대화형 에이전트에서의 대화 학습은 AMD와 동일한 맥락에서 해석할 수 있다. 본 논문에서는 화행별 템플릿과 유전자 프로그래밍을 이용한 대화형 에이전트의 대화 학습기법을 제안한다. 제안하는 에이전트는 화행별 템플릿을 기반으로 대화 지식을 획득하고 유전자 프로그래밍의 진화 방법을 통해 적절한 표현을 갖는 문장을 생성한다. 적용 사례와 사용자 평가를 통해서 제안하는 방법의 유용성을 확인하였다.

  • PDF

Energy-Efficient Scheduling with Delay Constraints in Time-Varying Uplink Channels

  • Kwon, Ho-Joong;Lee, Byeong-Gi
    • Journal of Communications and Networks
    • /
    • 제10권1호
    • /
    • pp.28-37
    • /
    • 2008
  • In this paper, we investigate the problem of minimizing the average transmission power of users while guaranteeing the average delay constraints in time-varying uplink channels. We design a scheduler that selects a user for transmission and determines the transmission rate of the selected user based on the channel and backlog information of users. Since it requires prohibitively high computation complexity to determine an optimal scheduler for multi-user systems, we propose a low-complexity scheduling scheme that can achieve near-optimal performance. In this scheme, we reduce the complexity by decomposing the multiuser problem into multiple individual user problems. We arrange the probability of selecting each user such that it can be determined only by the information of the corresponding user and then optimize the transmission rate of each user independently. We solve the user problem by using a dynamic programming approach and analyze the upper and lower bounds of average transmission power and average delay, respectively. In addition, we investigate the effects of the user selection algorithm on the performance for different channel models. We show that a channel-adaptive user selection algorithm can improve the energy efficiency under uncorrelated channels but the gain is obtainable only for loose delay requirements in the case of correlated channels. Based on this, we propose a user selection algorithm that adapts itself to both the channel condition and the backlog level, which turns out to be energy-efficient over wide range of delay requirement regardless of the channel model.

A traffic and interference adaptive DCA algorithm with rearrangement in microcellular systems

  • Kim, Seong-Lyun;Han, Youngnam
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 1995년도 춘계공동학술대회논문집; 전남대학교; 28-29 Apr. 1995
    • /
    • pp.724-728
    • /
    • 1995
  • A new dynamic channel assignment (DCA) algorithm with rearrangement for cellular mobile communication systems is suggested. Our DCA algorithm is both traffic and interference adaptive, which is based on the mathematical formulation of the maximum packing under a realistic propagation model. In developing the algorithm, we adopt the Lagrangean relaxation technique that has been successfully used in the area of mathematical programming. Computational experiments of the algorithm reveal quite encouraging results. Although our algorithm primarily focuses on microcellular systems, it can be effectively applied to conventional cellular systems under highly nonuniform traffic distributions and interference conditions.

  • PDF

다기 전력 시스템의 안정화를 위한 탐색화된 정책 반복법 기반 적응형 강인 제어기 설계 (Design of an Adaptive Robust Controller Based on Explorized Policy Iteration for the Stabilization of Multimachine Power Systems)

  • 전태윤;박진배
    • 제어로봇시스템학회논문지
    • /
    • 제20권11호
    • /
    • pp.1118-1124
    • /
    • 2014
  • This paper proposes a novel controller design scheme for multimachine power systems based on the explorized policy iteration. Power systems have several uncertainties on system dynamics due to the various effects of interconnections between generators. To solve this problem, the proposed method solves the LQR (Linear Quadratic Regulation) problem of isolated subsystems without the knowledge of a system matrix and the interconnection parameters of multimachine power systems. By selecting the proper performance indices, it guarantees the stability and convergence of the LQ optimal control. To implement the proposed scheme, the least squares based online method is also investigated in terms of PE (Persistency of Excitation), interconnection parameters and exploration signals. Finally, the performance and effectiveness of the proposed algorithm are demonstrated by numerical simulations of three-machine power systems with governor controllers.

Trajectory Tracking Control of a Real Redundant Manipulator of the SCARA Type

  • Urrea, Claudio;Kern, John
    • Journal of Electrical Engineering and Technology
    • /
    • 제11권1호
    • /
    • pp.215-226
    • /
    • 2016
  • Modeling, control and implementation of a real redundant robot with five Degrees Freedom (DOF) of the SCARA (Selective Compliant Assembly Robot Arm) manipulator type is presented. Through geometric methods and structural and functional considerations, the inverse kinematics for redundant robot can be obtained. By means of a modification of the classical sliding mode control law through a hyperbolic function, we get a new algorithm which enables reducing the chattering effect of the real actuators, which together with the learning and adaptive controllers, is applied to the model and to the real robot. A simulation environment including the actuator dynamics is elaborated. A 5 DOF robot, a communication interface and a signal conditioning circuit are designed and implemented for feedback. Three control laws are executed in: a simulation structure (together with the dynamic model of the SCARA type redundant manipulator and the actuator dynamics) and a real redundant manipulator of the SCARA type carried out using MatLab/Simulink programming tools. The results, obtained through simulation and implementation, were represented by comparative curves and RMS indices of the joint errors, and they showed that the redundant manipulator, both in the simulation and the implementation, followed the test trajectory with less pronounced maximum errors using the adaptive controller than the other controllers, with more homogeneous motions of the manipulator.

적응 퍼지 제어기법을 이용한 저수지 운영 최적화 (Optimal Reservoir Operation using Adaptive Neuro-Fuzzy Inference System)

  • 김진호;정건희;이도훈;이은태
    • 한국수자원학회:학술대회논문집
    • /
    • 한국수자원학회 2010년도 학술발표회
    • /
    • pp.779-783
    • /
    • 2010
  • 최근 들어 그 심각성을 더하고 있는 이상기후 현상으로 가용 수자원의 변동이 커지고 있으며, 이에 따라 수자원의 효율적인 운영이 요구되고 있다. 그러나 효율적인 운영을 위해서는 미래 유입량의 불확실성의 고려하고, 홍수 조절용량의 확보하면서도, 용수공급을 위한 저수량을 확보하고, 수력 발전을 해야 하는 복잡한 상황을 모두 고려하여야한다. 이러한 복잡한 시스템에서 하나의 최적화 기법으로는 모든 고려사항들을 만족시키는 최적해를 찾는 것은 사실상 불가능에 가깝다. 그러므로 저수지 운영의 최적화를 위한 연구에서 한 가지 이상의 기법을 조합하는 기법을 사용하게 되었다. 이러한 기법은 각 기법의 장점을 취하고 각각의 한계를 극복하기 위해 주로 사용되었다. 본 연구에서는 저수지 운영 최적화를 모의하기 위하여 대청댐에서의 저수위, 유입량, 용수이용량 등을 고려하여 방류량의 예측을 동적 계획법(Dynamic Programming Model)으로부터 동적 신경망(Dynamic Neural Network Model)과 적응 퍼지 제어기법(Adaptive Neuro-Fuzzy Inference System)을 개발하여 실제 방류량과 세 가지 최적화 방법에 의한 결과를 비교 검정하였다. 본 연구의 수행으로 인해 얻어진 결과를 요약하면 다음과 같다. 첫째, 동적 신경망과 적응 퍼지 제어기법에 의한 최적화 모의가 동적 계획법에 비해 시스템의 구축이 쉽고 유연하다. 둘째, 퍼지추론의 Membership 함수의 구축에 따라 단시간에 많은 양의 강우가 발생하는 국지성 강우에 대해서도 최적 방류량을 예측할 수 있다. 셋째, 저수지 운영 과거자료의 부족과 불확실성을 해결하면, 보다 용이하고 양호한 예측결과를 얻을 수 있을 것이다.

  • PDF

Policy Iteration Algorithm Based Fault Tolerant Tracking Control: An Implementation on Reconfigurable Manipulators

  • Li, Yuanchun;Xia, Hongbing;Zhao, Bo
    • Journal of Electrical Engineering and Technology
    • /
    • 제13권4호
    • /
    • pp.1740-1751
    • /
    • 2018
  • This paper proposes a novel fault tolerant tracking control (FTTC) scheme for a class of nonlinear systems with actuator failures based on the policy iteration (PI) algorithm and the adaptive fault observer. The estimated actuator failure from an adaptive fault observer is utilized to construct an improved performance index function that reflects the failure, regulation and control simultaneously. With the help of the proper performance index function, the FTTC problem can be transformed into an optimal control problem. The fault tolerant tracking controller is composed of the desired controller and the approximated optimal feedback one. The desired controller is developed to maintain the desired tracking performance at the steady-state, and the approximated optimal feedback controller is designed to stabilize the tracking error dynamics in an optimal manner. By establishing a critic neural network, the PI algorithm is utilized to solve the Hamilton-Jacobi-Bellman equation, and then the approximated optimal feedback controller can be derived. Based on Lyapunov technique, the uniform ultimate boundedness of the closed-loop system is proven. The proposed FTTC scheme is applied to reconfigurable manipulators with two degree of freedoms in order to test the effectiveness via numerical simulation.