• 제목/요약/키워드: Learning Automata

검색결과 24건 처리시간 0.026초

다목적을 고려한 전력 시스템의 최적운용을 위한 S 모델 Automata의 적용 연구 (A Study on the Application of S Model Automata for Multiple Objective Optimal Operation of Power Systems)

  • 이병하;박종근
    • 대한전기학회논문지:전력기술부문A
    • /
    • 제49권4호
    • /
    • pp.185-194
    • /
    • 2000
  • The learning automaton is an automaton to update systematically the strategy for enhancing the performance in response to the output results, and several schemes of learning automata have been presented. In this paper, S-model learning automata are applied in order to achieve the best compromise solution between an optimal solution for economic operation and an optimal solution for stable operation of the power system under the circumstance that the loads vary randomly. It is shown that learning automata are applied satisfactorily to the multiobjective optimization problem for obtaining the best tradeoff among the conflicting economy and stability objectives of power systems.

  • PDF

Priority-based learning automata in Q-learning random access scheme for cellular M2M communications

  • Shinkafi, Nasir A.;Bello, Lawal M.;Shu'aibu, Dahiru S.;Mitchell, Paul D.
    • ETRI Journal
    • /
    • 제43권5호
    • /
    • pp.787-798
    • /
    • 2021
  • This paper applies learning automata to improve the performance of a Q-learning based random access channel (QL-RACH) scheme in a cellular machine-to-machine (M2M) communication system. A prioritized learning automata QL-RACH (PLA-QL-RACH) access scheme is proposed. The scheme employs a prioritized learning automata technique to improve the throughput performance by minimizing the level of interaction and collision of M2M devices with human-to-human devices sharing the RACH of a cellular system. In addition, this scheme eliminates the excessive punishment suffered by the M2M devices by controlling the administration of a penalty. Simulation results show that the proposed PLA-QL-RACH scheme improves the RACH throughput by approximately 82% and reduces access delay by 79% with faster learning convergence when compared with QL-RACH.

다목적 전력 시스템 최적운용을 위한 S 모델 Automata의 적용 연구 (A study on the application of S model automata for multiple objective optimal operation of Power systems)

  • 이용선;이병하
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1999년도 하계학술대회 논문집 C
    • /
    • pp.1279-1281
    • /
    • 1999
  • The learning automaton is an automaton to update systematically the strategy for enhancing the performance in response to the output results, and several schemes of learning automata have been presented. In this paper, S-model learning automata are applied to achieving a best compromise solution between an optimal solution for economic operation and an optimal solution for stable operation of the power system under the circumstance that the loads vary randomly. It is shown that learning automata are applied satisfactorily to the multiobjective optimization problem for obtaining the best tradeoff among the conflicting economy and stability objectives of power systems.

  • PDF

Decentralized learning automata for control of unknown markov chains

  • Hara, Motoshi;Abe, Kenichi
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1990년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 26-27 Oct. 1990
    • /
    • pp.1234-1239
    • /
    • 1990
  • In this paper, we propose a new type of decentralized learning automata for the control finite state Markov chains with unknown transition probabilities and rewards. In our scheme a .betha.-type learning automaton is associated with each state in which two or more actions(desisions) are available. In this decentralized learning automata system, each learning automaton operates, requiring only local information, to improve its performance under local environment. From simulation results, it is shown that the decentralized learning automata will converge to the optimal policy that produces the most highly total expected reward with discounting in all initiall states.

  • PDF

초등학생을 위한 유한상태 오토마타 교육자료 개발 (Development of Finite State Automata Learning Materials for Elementary School Students)

  • 고형철;김종우
    • 정보교육학회논문지
    • /
    • 제20권4호
    • /
    • pp.401-408
    • /
    • 2016
  • 언플러그드교육은 초등학교에서 실시하려는 SW교육의 주된 요소로 제시되고 있다. 이 자료는 Timbell 외 2가 제작한 컴퓨터과학에 대한 여러 가지 주제별로 자료를 제시하고 있다. 이들 중에 유한상태 오토마타 교육은 우리의 실정에 적합한 교수법과 교육자료의 개발이 필요하다. 본 연구에서는 이 주제와 관련된 선행 연구를 바탕으로 초등 고학년의 발달단계에 적합한 자료를 개발하였다. 학습모형은 학습자의 자기주도적 활동중심학습으로 구성하였으며, 제시된 교육자료와 교수법은 전문가 집단의 검증과 실험집단의 분석을 통해 적절하다는 결론을 얻었다.

A new method to detect attacks on the Internet of Things (IoT) using adaptive learning based on cellular learning automata

  • Dogani, Javad;Farahmand, Mahdieh;Daryanavard, Hassan
    • ETRI Journal
    • /
    • 제44권1호
    • /
    • pp.155-167
    • /
    • 2022
  • The Internet of Things (IoT) is a new paradigm that connects physical and virtual objects from various domains such as home automation, industrial processes, human health, and monitoring. IoT sensors receive information from their environment and forward it to their neighboring nodes. However, the large amounts of exchanged data are vulnerable to attacks that reduce the network performance. Most of the previous security methods for IoT have neglected the energy consumption of IoT, thereby affecting the performance and reducing the network lifetime. This paper presents a new multistep routing protocol based on cellular learning automata. The network lifetime is improved by a performance-based adaptive reward and fine parameters. Nodes can vote on the reliability of their neighbors, achieving network reliability and a reasonable level of security. Overall, the proposed method balances the security and reliability with the energy consumption of the network.

A Learning Automata-based Algorithm for Area Coverage Problem in Directional Sensor Networks

  • Liu, Zhimin;Ouyang, Zhangdong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권10호
    • /
    • pp.4804-4822
    • /
    • 2017
  • Coverage problem is a research hot spot in directional sensor networks (DSNs). However, the major problem affecting the performance of the current coverage-enhancing strategies is that they just optimize the coverage of networks, but ignore the maximum number of sleep sensors to save more energy. Aiming to find an approximate optimal method that can cover maximum area with minimum number of active sensors, in this paper, a new scheduling algorithm based on learning automata is proposed to enhance area coverage, and shut off redundant sensors as many as possible. To evaluate the performance of the proposed algorithm, several experiments are conducted. Simulation results indicate that the proposed algorithm have effective performance in terms of coverage enhancement and sleeping sensors compared to the existing algorithms.

무선 인지 센서 네트워크를 위한 퍼지 및 러닝 오토메타 기반의 채널 선택 기법 (A Channel Selection Algorithm Based on Fuzzy Logic and Learning Automata for Cognitive Radio Sensor Networks)

  • 퉁 안 투안;구인수
    • 한국인터넷방송통신학회논문지
    • /
    • 제11권1호
    • /
    • pp.23-28
    • /
    • 2011
  • 본 논문은 무선 인지 센서 네트워크에서 2차 사용자를 위한 효율적 채널 선택 알고리즘을 제안한다. 제안된 알고리즘은 러닝 오토메타와 퍼지 로직을 기반하고 있으며, 러닝 오토메타는 무선 전송 채널을 2차 사용자가 학습하여 그 결과를 채널 선택 확률값로 나타내며, 퍼지 로직은 최종 채널 선택을 위하여 다양한 입력 변수를 고려할 수 있도록 한다. 즉, 퍼지 로직은 러닝 오토메타의 결과인 채널 선택 학률값, 기사용자와 2차사용자 사이의 채널 SNR, 송수신 2차 사용자들 사이의 SNR값을 고려하여 다중의 가용 채널로부터 최적으로 전송 채널을 선택할 수 있도록 한다. 시뮬레이션 결과를 통해, 제안된 알고리즘이 기존 알고리즘들 보다 높은 처리율(throughput)을 제공할 수 있음을 보였다.

분산 시스템에서 파일 이전과 부하 균등을 위한 수학적 모델 (Mathematical Model for File Migration and Load Balancing in Distributed Systemsc)

  • 문원식
    • 디지털산업정보학회논문지
    • /
    • 제13권4호
    • /
    • pp.153-162
    • /
    • 2017
  • Advances in communication technologies and the decreasing cost of computers have made distributed computer systems an attractive alternative for satisfying the information needs of large organizations. This paper presents a distributed algorithm for performance improvement through load balancing and file migration in distributed systems. We employed a sender initiated strategy for task migration and used learning automata with several internal states for file migration. A task can be migrated according to the load information of a computer. A file is migrated to the destination processor when it is in the right boundary state. We also described an analytical model for load balancing with file migration to verify the proposed algorithm. Analytical and simulation results show that our algorithm is very well-suited for distributed system environments.