• 제목/요약/키워드: Optimal computation

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

퍼지 시스템과 진화연산을 이용한 DC 모터 속도제어 (A DC Motor Speed Control using Fuzzy System and Evolutionary Computation)

  • 황기현;문경준;이화석;김형수;박준호
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1995년도 하계학술대회 논문집 B
    • /
    • pp.652-654
    • /
    • 1995
  • This paper proposes a design of self-tuning fuzzy controller based on evolutionary computation. Optimal membership functions are round by using evolutionary computation. Genetic algorithms and evolution strategy are used for tuning of fuzzy membership function. A arbitrarily speed trajectories is selected to show the performance of the proposed methods. Simulation results show the good performance in the DC motor control system with the self-tuning fuzzy controller based on evolutionary computation.

  • PDF

A Design of Architecture for Federating between NRNs and Determination Optimal Path

  • Park, Jinhyung;Cho, Hyunhun;Lee, Wonhyuk;Kim, Seunghae;Yun, Byoung-Ju
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권2호
    • /
    • pp.678-690
    • /
    • 2014
  • The current networks do not disclose information about a management domain due to scalability, manageability and commercial reasons. Therefore, it is very hard to calculate an optimal path to the destination. Also, due to poor information sharing, if an error occurs in the intermediate path, it is very difficult to re-search the path and find the best path. Hence, to manage each domain more efficiently, an architecture with top-level path computation node which can obtain information of separate nodes are highly needed This study aims to investigate a federation of a united network around NRN(National Research Network) that could allow resource sharing between countries and also independent resource management for each country. Considering first the aspects that can be accessed from the perspective of a national research network, ICE(Information Control Element) and GFO(Global Federation Organizer)-based architecture is designed as a top-level path computation element to support traffic engineering and applied to the multi-domain network. Then, the federation for the independent management of resources and resource information sharing among national research networks have been examined.

다중 분산부하 전압강하산정 프로그램 연구 (A Study of the Voltage drops computation program on multi-distributed random loads)

  • 강차녕;권세혁;조성필
    • 한국조명전기설비학회:학술대회논문집
    • /
    • 한국조명전기설비학회 2006년도 춘계학술대회 논문집
    • /
    • pp.37-42
    • /
    • 2006
  • 전선에서 전압강하는 열 손실을 의미한다. 이 열은 절연체의 특성을 변화시켜 절연성능을 저하시키게 되고 나아가 누전, 감전, 정전 및 화재 등의 사고를 일으키는 원인이 되기도 한다. 그러므로 전압강하에 대한 최적화 설계는 전기설비의 안전성과 경제성을 보장하는 중요한 요소가 되고 있다. 이에 저압의 전기설비인 가로등, 빌딩, 지하철역사 등 공공의 안전확보가 요구되는 다중 분산부하계통에서의 전압강하가 전기배선에 미치는 영향을 분석하고, 안전성 및 경제성 확보를 위한 전압강하산정 프로그램 및 최적화 방안을 연구 제시하고자 한다.

  • PDF

Interior Point Method를 이용한 최적조류계산 알고리듬 개발에 관한 연구 (A Study on Optimal Power Flow Using Interior Point Method)

  • 김발호
    • 대한전기학회논문지:전력기술부문A
    • /
    • 제54권9호
    • /
    • pp.457-460
    • /
    • 2005
  • This paper proposes a new Interior Point Method algorithm to improve the computation speed and solution stability, which have been challenging problems for employing the nonlinear Optimal Power Flow. The proposed algorithm is different from the tradition Interior Point Methods in that it adopts the Predictor-Corrector Method. It also accommodates the five minute dispatch, which is highly recommenced in modern electricity market. Finally, the efficiency and applicability of the proposed algorithm is demonstrated with a case study.

유전알고리즘을 이용한 이동로봇의 경로계획 및 충돌회피에 관한 연구 (A study on path planning and avoidance of obstacle for mobile robot by using genetic algorithm)

  • 김진수;이영진;이권순
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
    • /
    • pp.1193-1196
    • /
    • 1996
  • Genetic algorithm(GA) is useful to find optimal solution without any special mathematical modeling. This study presents to search optimal path of Autonomous Mobile Robot(AMR) by using GA without encoding and decoding procedure. Therefore, this paper shows that the proposed algorithm using GA can reduce the computation time to search the optimal path.

  • PDF

Time-optimal multistage controllers from the theory of dynamical cell-to-cell mappings

  • Yoon, Joong-Sun
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1989년도 한국자동제어학술회의논문집; Seoul, Korea; 27-28 Oct. 1989
    • /
    • pp.118-123
    • /
    • 1989
  • This work deals with fast-to-compute global control laws for time-optimal motion of strongly nonlinear dynamic systems like resolute robots. the theory of cell-to-cell mappings for dynamical systems offer the possibility of doing the vast majority of the control law computation offline in case of time optimization with constrained inputs. These cells result from a coarse discretization of likely swaths of state space into a set of nonuniform, contiguous volumes of relatively simple shapes. Once the cells have been designed, the bang-bang schedules for the inputs are determined for all likely starting cells and terminating cells. the resulting control law is an open-loop optimal control law with feedback monitoring and correction.

  • PDF

통신지연이 있는 분산처리의 최적화 (Optimal Distributed Computation with Communication Delays)

  • 김형중;지규인;이장규
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1991년도 하계학술대회 논문집
    • /
    • pp.748-752
    • /
    • 1991
  • Tree network consisting of communicating processors is considered. The objective is to minimize the computation time by distributing the processing load to other nodes. The effect of the order of load distribution on the processing time is addressed. An algorithm which optimally determines the order of load distribution is developed. It is shown that the order depends only on the channel capacity between nodes but not on the computing capability of each node.

  • PDF

진화 시스템을 위한 유전자 알고리즘 프로세서의 구현 (Implementation of an Adaptive Genetic Algorithm Processor for Evolvable Hardware)

  • 정석우;김현식;김동순;정덕진
    • 대한전기학회논문지:시스템및제어부문D
    • /
    • 제53권4호
    • /
    • pp.265-276
    • /
    • 2004
  • Genetic Algorithm(GA), that is shown stable performance to find an optimal solution, has been used as a method of solving large-scaled optimization problems with complex constraints in various applications. Since it takes so much time to execute a long computation process for iterative evolution and adaptation. In this paper, a hardware-based adaptive GA was proposed to reduce the serious computation time of the evolutionary process and to improve the accuracy of convergence to optimal solution. The proposed GA, based on steady-state model among continuos generation model, performs an adaptive mutation process with consideration of the evolution flow and the population diversity. The drawback of the GA, premature convergence, was solved by the proposed adaptation. The Performance improvement of convergence accuracy for some kinds of problem and condition reached to 5-100% with equivalent convergence speed to high-speed algorithm. The proposed adaptive GAP(Genetic Algorithm Processor) was implemented on FPGA device Xilinx XCV2000E of EHW board for face recognition.

Enhanced Fractal Coding Method Using Candidate Transformations

  • Kang, Hyun-Soo;Yun, Byung-Ju;Kim, Seong-Dae
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2003년도 신호처리소사이어티 추계학술대회 논문집
    • /
    • pp.501-504
    • /
    • 2003
  • This paper presents a new fractal coding scheme to find more optimal transformation by estimation of the optimal attractor. The conventional fractal coding schemes based on the collage theorem obtain the transformation to minimize the distance between an original image and its collage image. Heavy computation is why the schemes widely adopt the theorem. In other words, the optimal transformation can be obtained after the attractors of all the possible transformations are generated and then compared with an original image. It is clear that this process is not practical. Therefore, we introduce a sub-optimal scheme that provides better transformation than the conventional scheme, relieving the complexity problem in the optimal transformation. In a simple case, the optimal transformation can be obtained considering all the attractors and then our scheme is compared with the optimal. In general cases not to be able to find the optimal, our scheme is also evaluated and compared with the conventional schemes.

  • PDF

퍼지최적 부하분배에 의한 다중협력 로보트 매니퓰레이터의 최적시간 제어 (Time-Optimal Control for Cooperative Multi-Robot Manipulators Based on Fuzzy Optimal Load Distributioin)

  • 조현찬;김용호;전홍태
    • 한국지능시스템학회논문지
    • /
    • 제6권2호
    • /
    • pp.111-119
    • /
    • 1996
  • In this paper, we propose time-optimal trajectory planning algorithms for cooperative multi-robot manipulators system considering optimal load distribution. Internal forces essentially effect on time optimal trajectory planning and if they are comitted, the time optimal scheme is not no longer true. Therefore, we try to find the internal force factors of cooperative robot manipulators system in a time-optimal aspect. In this approach, a specific generalized inverse is used and is fuzzified for the purpose. In this optimal method, the fuzzy logic concept is used and selected for diminishing computation time, for finding the load distribution factors.

  • PDF