• Title/Summary/Keyword: decision algorithm

Search Result 2,348, Processing Time 0.026 seconds

A Markov Decision Process (MDP) based Load Balancing Algorithm for Multi-cell Networks with Multi-carriers

  • Yang, Janghoon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.10
    • /
    • pp.3394-3408
    • /
    • 2014
  • Conventional mobile state (MS) and base station (BS) association based on average signal strength often results in imbalance of cell load which may require more powerful processor at BSs and degrades the perceived transmission rate of MSs. To deal with this problem, a Markov decision process (MDP) for load balancing in a multi-cell system with multi-carriers is formulated. To solve the problem, exploiting Sarsa algorithm of on-line learning type [12], ${\alpha}$-controllable load balancing algorithm is proposed. It is designed to control tradeoff between the cell load deviation of BSs and the perceived transmission rates of MSs. We also propose an ${\varepsilon}$-differential soft greedy policy for on-line learning which is proven to be asymptotically convergent to the optimal greedy policy under some condition. Simulation results verify that the ${\alpha}$-controllable load balancing algorithm controls the behavior of the algorithm depending on the choice of ${\alpha}$. It is shown to be very efficient in balancing cell loads of BSs with low ${\alpha}$.

Rough Set-based Incremental Inductive Learning Algorithm Theory and Applications

  • Bang, Won-Chul;Z. Zenn Bien
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.11 no.7
    • /
    • pp.666-674
    • /
    • 2001
  • Classical methods to find a minimal set of rules based on the rough set theory are known to be ineffective in dealing with new instances added to the universe. This paper introduces an inductive learning algorithm for incrementally retrieving a minimal set of rules from a given decision table. Then, the algorithm is validated via simulations with two sets of data, in comparison with a classical non-incremental algorithm. The simulation results show that the proposed algorithm is effective in dealing with new instances, especially in practical use.

  • PDF

A simple computational algorithm of ML optimum multiuser detector for synchronous code division multiple access channels (동기화된 부호 분할 다원 접속 채널을 위한 ML 최적 다중 사용자 검출기의 간단한 계산 알고리즘)

  • 권형욱;최태영;오성근
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.33A no.5
    • /
    • pp.1-9
    • /
    • 1996
  • In this paper, we propose an efficient computational algorithm that can reduce significantly the computational complexity of the ML optimum multiuser detector known as the most excellent detector in synchronous code division multiple access channels. The proposed detector uses the sequential detection algorithm based on the alternating maximization appraoch to obtain the ML estimates. As initial estimates for this sequential algorithm, we can use the estimated values obtained by the conventional single-user detector, the linear decorrelating multiuser detector, or the decorrelating decision-feedback muliuser detector, the linear decorrelating multiuser detector, or the decorrelating decision-feedback multiuser detector. We have performed computer simulations in order to see the convergence behaviors and the detection performance of the propsoed algorithm in terms of initial algorithms and the number of users, and then to compare the computational complexity with that of the ML optimum multiuser detector. From the results, we have seen that the proposed alternating maximization detector has nearly equal detction performance with that of the ML optimum multiuser detctor in only a few iteration.

  • PDF

A Fuzzy Dispatching Algorithm with Adaptive Control Rule for Automated Guided Vehicle System in Job Shop Environment (AGV시스템에서 적응 규칙을 갖는 퍼지 급송알고리듬에 관한 연구)

  • 김대범
    • Journal of the Korea Society for Simulation
    • /
    • v.9 no.1
    • /
    • pp.21-38
    • /
    • 2000
  • A fuzzy dispatching algorithm with adaptable control scheme is proposed for more flexible and adaptable operation of AGV system. The basic idea of the algorithm is prioritization of all move requests based on the fuzzy urgency. The fuzzy urgency is measured by the fuzzy multi-criteria decision-making method, utilizing the relevant information such as incoming and outgoing buffer status, elapsed time of move request, and AGV traveling distance. At every dispatching decision point, the algorithm prioritizes all move requests based on the fuzzy urgency. The performance of the proposed algorithm is compared with several dispatching algorithms in terms of system throughput in a hypothetical job shop environment. Simulation experiments are carried out varying the level of criticality ratio of AGVs , the numbers of AGVs, and the buffer capacities. The rule presented in this study appears to be more effective for dispatching AGVs than the other rules.

  • PDF

New channel estimation algorithm for W-CDMA reverse link using pilot symbols over fast Rayleigh-fading multipath channels

  • Koo, Je-Gil;Park, Hyung-Jin
    • Proceedings of the IEEK Conference
    • /
    • 2000.07b
    • /
    • pp.982-985
    • /
    • 2000
  • This paper presents channel estimation of an asynchronous W-CDMA reverse link using the interpolation and moving average algorithm in frequency-selective Rayleigh fading channel. The proposed algorithm is an interpolated decision-directed (IDD) block-wise moving average (BWMA) algorithm. The IDD-BWMA algorithm performs two- stage processes. The first stage performs data decision to make a virtual pilot channel by using linear interpolation channel estimation scheme. Then, the second stage performs the channel estimation of the “block-wise moving average” type by using a virtual pilot channel obtained in the first stage. By using Monte-Carlo computer simulations, we show that the proposed channel estimator is superior to other estimation schemes such as the WMSA(K=1) and DD-RAKE at higher Doppler frequencies, especially.

  • PDF

Automated Driving Lane Change Algorithm Based on Robust Model Predictive Control for Merge Situations on Highway Intersections (고속도로 합류점 주행을 위한 강건 모델 예측 기법 기반 자율주행 차선 변경 알고리즘 개발)

  • Chae, Heongseok;Jeong, Yonghwan;Min, Kyongchan;Lee, Myungsu;Yi, Kyongsu
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.41 no.7
    • /
    • pp.575-583
    • /
    • 2017
  • This paper describes the design and evaluation of a driving mode decision algorithm for automated driving for merge situations on highways. For the development of a highly automated driving control algorithm for merge situations, the driving mode decision is crucial for merging appropriately. There are two driving modes: lane keeping and lane changing (merging). The merge mode decision is determined based on the state of the surrounding vehicles and the remaining length of the merge lane. In the merge mode decision algorithm, merge possibility and the desired merge position are decided to change the lane safely and quickly. A safety driving envelope is defined based on the desired driving mode using the information on the surrounding vehicles' behaviors. To obtain the desired steering angle and longitudinal acceleration for maintaining the subject vehicle in the safe driving envelope, a motion planning controller is designed using model predictive control (MPC), with constraints that are decided considering the vehicle dynamics, safe driving envelope, and actuator limit. The proposed control algorithm has been evaluated via computer simulation studies.

Does Artificial Intelligence Algorithm Discriminate Certain Groups of Humans? (인공지능 알고리즘은 사람을 차별하는가?)

  • Oh, Yoehan;Hong, Sungook
    • Journal of Science and Technology Studies
    • /
    • v.18 no.3
    • /
    • pp.153-216
    • /
    • 2018
  • The contemporary practices of Big-Data based automated decision making algorithms are widely deployed not just because we expect algorithmic decision making might distribute social resources in a more efficient way but also because we hope algorithms might make fairer decisions than the ones humans make with their prejudice, bias, and arbitrary judgment. However, there are increasingly more claims that algorithmic decision making does not do justice to those who are affected by the outcome. These unfair examples bring about new important questions such as how decision making was translated into processes and which factors should be considered to constitute to fair decision making. This paper attempts to delve into a bunch of research which addressed three areas of algorithmic application: criminal justice, law enforcement, and national security. By doing so, it will address some questions about whether artificial intelligence algorithm discriminates certain groups of humans and what are the criteria of a fair decision making process. Prior to the review, factors in each stage of data mining that could, either deliberately or unintentionally, lead to discriminatory results will be discussed. This paper will conclude with implications of this theoretical and practical analysis for the contemporary Korean society.

Meteorological Information Analysis Algorithm based on Weight for Outdoor Activity Decision-Making (야외활동 의사결정을 위한 가중치 기반 기상정보 분석 알고리즘)

  • Lee, Moo-Hun;Kim, Min-Gyu
    • Journal of Digital Convergence
    • /
    • v.14 no.3
    • /
    • pp.209-217
    • /
    • 2016
  • Recently, the outdoor activities were increased in accordance with economic growth and improved quality of life. In addition, weather and outdoor activities are closely related. Currently, Outdoor Activities decisions are determined by the Korea Meteorological Administrator's forecasts and subjective experience. Therefore, we need the analysis method that can provide a basis for the decision on outdoor activities based on meteorological information. In this paper, we propose an algorithm that can analyze meteorological information to support decision-making outdoor activities. And the algorithm is based on the data mining. In addition, we have constructed a baseball game schedule with automatic weather system's observation data in the training data. We verified the improved performance of the proposed algorithm.

A Fast CU Size Decision Optimal Algorithm Based on Neighborhood Prediction for HEVC

  • Wang, Jianhua;Wang, Haozhan;Xu, Fujian;Liu, Jun;Cheng, Lianglun
    • Journal of Information Processing Systems
    • /
    • v.16 no.4
    • /
    • pp.959-974
    • /
    • 2020
  • High efficiency video coding (HEVC) employs quadtree coding tree unit (CTU) structure to improve its coding efficiency, but at the same time, it also requires a very high computational complexity due to its exhaustive search processes for an optimal coding unit (CU) partition. With the aim of solving the problem, a fast CU size decision optimal algorithm based on neighborhood prediction is presented for HEVC in this paper. The contribution of this paper lies in the fact that we successfully use the partition information of neighborhood CUs in different depth to quickly determine the optimal partition mode for the current CU by neighborhood prediction technology, which can save much computational complexity for HEVC with negligible RD-rate (rate-distortion rate) performance loss. Specifically, in our scheme, we use the partition information of left, up, and left-up CUs to quickly predict the optimal partition mode for the current CU by neighborhood prediction technology, as a result, our proposed algorithm can effectively solve the problem above by reducing many unnecessary prediction and partition operations for HEVC. The simulation results show that our proposed fast CU size decision algorithm based on neighborhood prediction in this paper can reduce about 19.0% coding time, and only increase 0.102% BD-rate (Bjontegaard delta rate) compared with the standard reference software of HM16.1, thus improving the coding performance of HEVC.

A Handover Algorithm Using Fuzzy Set Theory (퍼지 이론을 이용한 핸드오버 알고리즘)

  • 정한호;김준철;이준환
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.18 no.6
    • /
    • pp.824-834
    • /
    • 1993
  • In cellular mobile communication systems, if the size of a cell is decreasing for economic utilization of frequency resources, frequent handovers may be requested because the time a mobile stays in a cell is decreasing. In general the measured parameters to decide handover including RSSI, BER, and the distance between mobile station and base station, are usually incorrect and handover decision using single parameter insufficient. Therefore, the better handover algorithm should take over the problems of this uncertain measurements, and make the decision more robust and flexible by the consideration of all those decision parameters at the same time. We propose a novel handover algorithm based the multicriteria decision making, in which those parameters are participated in the decision process using aggregation function in fuzzy set theory. As a simulation results, the overall decision making is more reliable and flexible than the conventional method using only one parameter, RSSI in terms of call force ratio, and handover request ratio.

  • PDF