• 전기학회논문지
• /
• 제58권11호
• /
• pp.2136-2141
• /
• 2009

Transmission planning is an important part of power system planning to meet an increasing demand for electricity. The objective of transmission expansion is to minimize operational and construction costs subject to system constraints. There is inherent uncertainty in transmission planning due to errors in forecasted demand and fuel costs. Therefore, transmission planning process is not reliable if the uncertainty is not taken into account. The paper presents a systematic method to find the optimal location and amount of transmission expansion using Cross-Entropy (CE) incorporating uncertainties about future power system conditions. Numerical results are presented to demonstrate the performance of the proposed method.

• International Journal of Computer Science & Network Security
• /
• 제22권3호
• /
• pp.1-8
• /
• 2022

Supporting real-time flows with delay and throughput constraints is an important challenge for future wireless networks. In this paper, we develop an optimal scheduling scheme to optimally choose the packets to transmit. The optimal transmission strategy is based on an observable Markov decision process. The novelty of the work focuses on a priority-based probabilistic packet scheduling strategy for efficient packet transmission. This helps in providing guaranteed services to real time traffic in Heterogeneous Wireless Networks. The proposed scheduling mechanism is able to optimize the desired performance. The proposed scheduler improves the overall end-to-end delay, decreases the packet loss ratio, and reduces blocking probability even in the case of congested network.

• 정보과학회 논문지
• /
• 제42권10호
• /
• pp.1222-1230
• /
• 2015

무릎 자기공명영상에서 전방십자인대의 분할은 밝기값의 불균일성 및 주변 조직들과의 유사 밝기값 특성으로 인해 기존 분할기법의 적용에 한계가 있다. 본 논문에서는 지역적 정렬을 통한 확률아틀라스 생성 및 반복적 그래프 컷을 통한 다중아틀라스 기반 전방십자인대 분할기법을 제안한다. 첫째, 전역 및 지역적 다중아틀라스 강체정합을 통해 전방십자인대의 확률아틀라스를 생성한다. 둘째, 생성된 확률아틀라스를 이용하여 최대사후추정 및 그래프 컷을 통하여 전방십자인대 초기 분할을 수행한다. 셋째, 마스크 기반 강체정합을 통한 형상정보 개선 및 반복적 그래프 컷을 통해 전방십자인대 분할 개선을 수행한다. 제안방법의 성능평가를 위하여 육안평가 및 정확성평가를 수행하였으며, 평가 결과 제안방법의 Dice 유사도는 75.0%, 평균표면거리는 1.7화소, 제곱근표면거리는 2.7화소로서 기존 그래프 컷 방법에 비하여 전방 십자인대의 분할정확도가 각각 12.8%, 22.7%, 및 22.9% 향상된 것으로 나타났다.

• 제어로봇시스템학회논문지
• /
• 제21권3호
• /
• pp.199-209
• /
• 2015

This paper presents a model predictive control (MPC) approach to control the steering angle in an autonomous vehicle. In designing a highly automated driving control algorithm, one of the research issues is to cope with probable risky situations for enhancement of safety. While human drivers maneuver the vehicle, they determine the appropriate steering angle and acceleration based on the predictable trajectories of surrounding vehicles. Likewise, it is required that the automated driving control algorithm should determine the desired steering angle and acceleration with the consideration of not only the current states of surrounding vehicles but also their predictable behaviors. Then, in order to guarantee safety to the possible change of traffic situation surrounding the subject vehicle during a finite time-horizon, we define a safe driving envelope with the consideration of probable risky behaviors among the predicted probable behaviors of surrounding vehicles over a finite prediction horizon. For the control of the vehicle while satisfying the safe driving envelope and system constraints over a finite prediction horizon, a MPC approach is used in this research. At each time step, MPC based controller computes the desired steering angle to keep the subject vehicle in the safe driving envelope over a finite prediction horizon. Simulation and experimental tests show the effectiveness of the proposed algorithm.

• 에너지공학
• /
• 제14권1호
• /
• pp.46-53
• /
• 2005

본 논문은 확률적 기법을 적용하여 직접부하제어의 적정한 지원금을 산정하는 새로운 방법론을 제안한다. 직접부하제어의 경제성 분석은 발전기의 고장정지 특성, 직접부하제어 자원의 차단용량 및 차단시간 등을 모두 고려해야 하기 때문에 현실적으로 불가능한 것으로 인식되었다. 따라서 기존의 연구에서는 시나리오 접근법을 사용하여 직접부하제어의 경제성 평가를 수행하였다. 본 논문에서는 몬테카를로 시뮬레이션을 적용하여 직접부하제어의 제어전력량을 확률적으로 추정하고 이를 기반으로 직접부하제어의 지원금을 산정하는 새로운 접근법을 개발하였다. 또한 시뮬레이션의 효율을 향상시키기 위하여 분산감소 기법을 적용하였다. 본 논문에서 제안한 방법론의 유용성을 보이기 위해 IEEE 24-모선 신뢰도 계통에 적용하여 사례연구를 수행하였다.

• 인지과학
• /
• 제23권2호
• /
• pp.249-267
• /
• 2012

본 연구에서는 구문 처리에서 운율 정보 활용이 작업 기억 용량의 영향을 받는지를 검증하였다. 구체적으로 작업 기억 용량이 운율 경계의 강도와 위치에 따른 관계절 부착 중의성 해소 방식 차이를 예측하는지를 알아보았다. 실험 결과, 작업 기억 폭이 큰 청자들의 중의성 해소 방식이 작업 기억 폭이 작은 청자들에 비해 운율 경계 강도의 영향을 더 받는 것으로 나타났다. 이는 다른 상위 수준 제약과 마찬가지로 운율 제약의 활용도 작업 기억과 같은 인지적 자원을 필요로 함을 시사한다.

• Steel and Composite Structures
• /
• 제19권1호
• /
• pp.191-208
• /
• 2015

The sensitivity-based finite element model updating method has received increasing attention in damage detection of structures based on measured modal parameters. Finding an optimization technique with high efficiency and fast convergence is one of the key issues for model updating-based damage detection. A new simple and computationally efficient optimization algorithm is proposed and applied to damage detection by using finite element model updating. The proposed method combines the Gauss-Newton method with region truncation of each iterative step, in which not only the constraints are introduced instead of penalty functions, but also the searching steps are restricted in a controlled region. The developed algorithm is illustrated by a numerically simulated 25-bar truss structure, and the results have been compared and verified with those obtained from the trust region method. In order to investigate the reliability of the proposed method in damage detection of structures, the influence of the uncertainties coming from measured modal parameters on the statistical characteristics of detection result is investigated by Monte-Carlo simulation, and the probability of damage detection is estimated using the probabilistic method.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.2237-2242
• /
• 2005

The original RRT is iteratively expanded by applying control inputs that drive the system slightly toward randomly-selected states, as opposed to requiring point-to-point convergence, as in the probabilistic roadmap approach. It is generally known that the performance of RRTs can be improved depending on the selection of the metrics in choosing the nearest vertex and bias techniques in choosing random states. We designed a path planning algorithm based on the RRT method for a remote-controlled mobile robot. First, we considered a bias technique that is goal-biased Gaussian random distribution along the command directions. Secondly, we selected the metric based on a weighted Euclidean distance of random states and a weighted distance from the goal region. It can save the effort to explore the unnecessary regions and help the mobile robot to find a feasible trajectory as fast as possible. Finally, the constraints of the actuator should be considered to apply the algorithm to physical mobile robots, so we select control inputs distributed with commanded inputs and constrained by the maximum rate of input change instead of random inputs. Simulation results demonstrate that the proposed algorithm is significantly more efficient for planning than a basic RRT planner. It reduces the computational time needed to find a feasible trajectory and can be practically implemented in a remote-controlled mobile robot.

• Management Science and Financial Engineering
• /
• 제14권1호
• /
• pp.23-34
• /
• 2008

In this study, we consider stationary waiting times in a Poisson driven single-server m-node queues in series. We assume that service times at nodes are independent, and are either deterministic or non-overlapped. Each node excluding the first node has a finite waiting line and every node is operated under a FIFO service discipline and a communication blocking policy (blocking before service). By applying (max, +)-algebra to a corresponding stochastic event graph, a special case of timed Petri nets, we derive the explicit expressions for stationary waiting times at all areas, which are functions of finite buffer capacities. These expressions allow us to compute the performance measures of interest such as mean, higher moments, or tail probability of waiting time. Moreover, as applications of these results, we introduce optimization problems which determine either the biggest arrival rate or the smallest buffer capacities satisfying probabilistic constraints on waiting times. These results can be also applied to bounds of waiting times in more general systems. Numerical examples are also provided.

• 자동차안전학회지
• /
• 제5권2호
• /
• pp.11-16
• /
• 2013

This paper presents a unified control algorithm of independent braking and steering for collision avoidance. The desired motion of the vehicle in the yaw plane is determined using the probabilistic risk assessment method based on target state estimation. For the purpose of coordinating the independent braking and steering, a non-linear vehicle model has been developed, which describes the vehicle dynamics in the yaw plane in both linear and extended non-linear ranges of handling. A control allocation algorithm determines the control inputs that minimize the difference between the desired and actual vehicle motions, while satisfying all actuator constraints. The performance of the proposed control algorithm has been investigated via computer simulations conducted using the vehicle dynamics software CARSIM and Matlab/Simulink.