• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.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
• /
• v.22 no.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.

• Journal of KIISE
• /
• v.42 no.10
• /
• pp.1222-1230
• /
• 2015

Segmentation of the anterior cruciate ligament (ACL) in knee MRI remains a challenging task due to its inhomogeneous signal intensity and low contrast with surrounding soft tissues. In this paper, we propose a multi-atlas-based segmentation of the ACL in knee MRI with locally-aligned probabilistic atlas (PA) in an iterative graph cuts framework. First, a novel PA generation method is proposed with global and local multi-atlas alignment by means of rigid registration. Second, with the generated PA, segmentation of the ACL is performed by maximum-aposteriori (MAP) estimation and then by graph cuts. Third, refinement of ACL segmentation is performed by improving shape prior through mask-based PA generation and iterative graph cuts. Experiments were performed with a Dice similarity coefficients of 75.0%, an average surface distance of 1.7 pixels, and a root mean squared distance of 2.7 pixels, which increased accuracy by 12.8%, 22.7%, and 22.9%, respectively, from the graph cuts with patient-specific shape constraints.

• Journal of Institute of Control, Robotics and Systems
• /
• v.21 no.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.

• Journal of Energy Engineering
• /
• v.14 no.1
• /
• pp.46-53
• /
• 2005

This paper presents a new approach for determining an accurate incentive levels of Direct Load Control (DLC) program using probabilistic techniques. The economic analysis of DLC resources needs to identify the hourly-by-hourly expected energy-not-served resulting from the random outage characteristics of generators as well as to reflect the availability and duration of DLC resources, which results the computational explosion. Therefore, the conventional methods are based on the scenario approaches to reduce the computation time as well as to avoid the complexity of economic studies. In this paper, we have developed a new technique based on the sequential Monte Carlo simulation to evaluate the required expected load control amount in each hour and to decide the incentive level satisfying the economic constraints. In addition, we have applied the variance reduction technique to enhance the efficiency of the simulation. To show the efficiency and effectiveness of the suggested method, the numerical studies have been performed for the modified IEEE 24-bus reliability test system.

• Korean Journal of Cognitive Science
• /
• v.23 no.2
• /
• pp.249-267
• /
• 2012

Individual differences in working memory predict qualitative differences in language processing. High span comprehenders are better able to integrate probabilistic information such as plausibility and animacy, the use of which requires the computation of real world knowledge in syntactic parsing (e.g.,[1]). However, it is unclear whether similar individual differences exist in the use of informative prosodic cues. This study examines whether working memory modulates the use of prosodic boundary information in attachment ambiguity resolution. Prosodic boundaries were manipulated in globally ambiguous relative clause sentences. The results show that high span listeners are more likely to be sensitive to the distinction between different types of prosodic boundaries than low span listeners. The findings suggest that like high-level constraints, the use of low-level prosodic information is resource demanding.

• Steel and Composite Structures
• /
• v.19 no.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.06a
• /
• 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
• /
• v.14 no.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.

• Journal of Auto-vehicle Safety Association
• /
• v.5 no.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.