• Journal of Electrical Engineering and Technology
• /
• v.11 no.2
• /
• pp.329-337
• /
• 2016

With the increasing deployment of distributed generators in the distribution system, a very large search space is required when dynamic programming (DP) is applied for the optimized dispatch schedules of voltage and reactive power controllers such as on-load tap changers, distributed generators, and shunt capacitors. This study proposes a new optimal voltage and reactive power scheduling method based on dynamic programming with a heuristic searching space reduction approach to reduce the computational burden. This algorithm is designed to determine optimum dispatch schedules based on power system day-ahead scheduling, with new control objectives that consider the reduction of active power losses and maintain the receiving power factor. In this work, to reduce the computational burden, an advanced voltage sensitivity index (AVSI) is adopted to reduce the number of load-flow calculations by estimating bus voltages. Moreover, the accumulated switching operation number up to the current stage is applied prior to the load-flow calculation module. The computational burden can be greatly reduced by using dynamic programming. Case studies were conducted using the IEEE 30-bus test systems and the simulation results indicate that the proposed method is more effective in terms of saving electric charges and improving the voltage profile than loss minimization.

• Earthquakes and Structures
• /
• v.10 no.5
• /
• pp.1067-1087
• /
• 2016

In this paper, a decoupled proportional-integral-derivative (PID) control approach for seismic control of smart structures is presented. First, the state space equation of a structure is transformed into modal coordinates and parameters of the modal PID control are separately designed in a reduced modal space. Then, the feedback gain matrix of the controller is obtained based on the contribution of modal responses to the structural responses. The performance of the controller is investigated to adjust control force of piezoelectric friction dampers (PFDs) in a benchmark base isolated building. In order to tune the modal feedback gain of the controller, a suitable trade-off among the conflicting objectives, i.e., the reduction of maximum modal base displacement and the maximum modal floor acceleration of the smart base isolated structure, as well as the maximum modal control force, is created using a multi-objective cuckoo search (MOCS) algorithm. In terms of reduction of maximum base displacement and story acceleration, numerical simulations show that the proposed method performs better than other reported controllers in the literature. Moreover, simulation results show that the PFDs are able to efficiently dissipate the input excitation energy and reduce the damage energy of the structure. Overall, the proposed control strategy provides a simple strategy to tune the control forces and reduces the number of sensors of the control system to the number of controlled stories.

• Transactions of Materials Processing
• /
• v.9 no.5
• /
• pp.512-525
• /
• 2000

Designers are frequently faced with multiple quality issues in injection molded parts. These issues are usually In conflict with each other, and thus tradeoff needs to be made to reach a final compromised solutions. The objective of this study is to develop an automated injection molding design methodology, whereby part defects such as warpage and weld line are optimized. The features of the proposed methodology are as follows: first, Utility Function approach is applied to transform the original multiple objective problem into single objective problem. Second is an implementation of a direct search-based Injection molding optimization procedure with automated consideration of process variation. The Space Reduction Method based on Taguchi's DOE(Design Of Experiment) is used as a general optimization tool in this study. The computational experimental verification of the methodology was partially carried out for a can model of Cavallero Plastics Incorporation, U. S. A. Applied to production, this study will be of immense value to companies in reducing the product development time and enhancing the product quality.

• The Journal of Korea Robotics Society
• /
• v.18 no.1
• /
• pp.1-9
• /
• 2023

This paper presents an optimal path planning strategy for aerial searching and surveying of a user-designated area using multiple Unmanned Aerial Vehicles (UAVs). The method is designed to deal with a single unseparated polygonal area, regardless of polygonal convexity. By defining the search area into a set of grids, the algorithm enables UAVs to completely search without leaving unsearched space. The presented strategy consists of two main algorithmic steps: cellular decomposition and path planning stages. The cellular decomposition method divides the area to designate a conflict-free subsearch-space to an individual UAV, while accounting the assigned flight velocity, take-off and landing positions. Then, the path planning strategy forms paths based on every point located in end of each grid row. The first waypoint is chosen as the closest point from the vehicle-starting position, and it recursively updates the nearest endpoint set to generate the shortest path. The path planning policy produces four path candidates by alternating the starting point (left or right edge), and the travel direction (vertical or horizontal). The optimal-selection policy is enforced to maximize the search efficiency, which is time dependent; the policy imposes the total path-length and turning number criteria per candidate. The results demonstrate that the proposed cellular decomposition method improves the search-time efficiency. In addition, the candidate selection enhances the algorithmic efficacy toward further mission time-duration reduction. The method shows robustness against both convex and non-convex shaped search area.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.61
• /
• pp.105-114
• /
• 2000

Job Shop Problem which consists of the m different machines and n jobs is a NP-hard problem of the combinatorial optimization. Each job consists of a chain of operations, each of which needs to be processed during an uninterrupted time period of a given length on a given machine. Each machine can process at most one operation at a time. The purpose of this paper is to develop the heuristic method to solve large scale scheduling problem using Constraint Satisfaction Problem method and Simulated Annealing. The proposed heuristic method consists of the search algorithm and optimization algorithm. The search algorithm is to find the solution in the solution space using CSP concept such as backtracking and domain reduction. The optimization algorithm is to search the optimal solution using SA. This method is applied to MT06, MT10 and MT20 Job Shop Problem, and compared with other heuristic method.

• Journal of Korea Multimedia Society
• /
• v.3 no.4
• /
• pp.356-364
• /
• 2000

Block based fast motion estimation algorithm use the fixed search pattern to reduce the search point, and are based on the assumption that the error in the mean absolute error space monotonically decreases to the global minimum. Therefore, in case of many local minima in a search region we are likely to find local minima instead of the global minimum and highly rely on the initial search points. This situation is evident in the motion boundary. In this paper we define the candidate regions within the search region using the motion information of the neighbor blocks and we propose the multiple local search method (MLSM) which search for the solution throughout the candidate regions to reduce the possibilities of isolation to the local minima. In the MLSM we mark the candidate region in the search point map and we avoid to search the candidate regions already visited to reduce the calculation. In the simulation results the proposed method shows more excellent results than that of other gradient based method especially in the search of motion boundary. Especially, in PSNR the proposed method obtains similar estimate accuracy with the significant reduction of search points to that of full search.

• Journal of Information Processing Systems
• /
• v.17 no.5
• /
• pp.1020-1033
• /
• 2021

Nowadays, online or mobile social network services (SNS) are very popular and widely spread in our society and daily lives to instantly share, disseminate, and search information. In particular, SNS such as YouTube, Flickr, Facebook, and Amazon allow users to upload billions of images or videos and also provide a number of multimedia information to users. Information retrieval in multimedia-rich SNS is very useful but challenging task. Content-based media retrieval (CBMR) is the process of obtaining the relevant image or video objects for a given query from a collection of information sources. However, CBMR suffers from the dimensionality curse due to inherent high dimensionality features of media data. This paper investigates the effectiveness of the kernel trick in CBMR, specifically, the kernel principal component analysis (KPCA) for dimensionality reduction. KPCA is a nonlinear extension of linear principal component analysis (LPCA) to discovering nonlinear embeddings using the kernel trick. The fundamental idea of KPCA is mapping the input data into a highdimensional feature space through a nonlinear kernel function and then computing the principal components on that mapped space. This paper investigates the potential of KPCA in CBMR for feature extraction or dimensionality reduction. Using the Gaussian kernel in our experiments, we compute the principal components of an image dataset in the transformed space and then we use them as new feature dimensions for the image dataset. Moreover, KPCA can be applied to other many domains including CBMR, where LPCA has been used to extract features and where the nonlinear extension would be effective. Our results from extensive experiments demonstrate that the potential of KPCA is very encouraging compared with LPCA in CBMR.

• Journal of the Korean Institute of Rural Architecture
• /
• v.18 no.4
• /
• pp.17-24
• /
• 2016

Since the users have direct access to search and browse freely, the open access system has been employed to all the usual modern libraries. However, library space shortage problem created by the continuously increasing printed materials caused the degradation of usability and quality of the library space. Open Access system is superior in user convenience but is inferior in space efficiency. Keeping the open access system is considered as one of the reasons of the space shortage problem. Even though the closed access system does not provide free access or easy browsing for the uses, it's space efficiency is much higher than the open access system. The closed access system should be employed as a plan to relieve space shortage problem. Since the closed access system does not allow the public direct access to books, it is very economical. It also provides much better space efficiency with higher book shelving density. In this article, closed access library system models and their characteristics are examined as the reduction plans for the library space shortage problems.

• Journal of the Korea Society for Simulation
• /
• v.28 no.1
• /
• pp.23-39
• /
• 2019

The use of drone-bots is demanded in times regarding the reduction of military force, the spread of the life-oriented thought, and the use of innovative technology in the defense through the fourth industrial revolution. Especially, the drone's surveillance and reconnaissance are expected to play a big role in the future battlefield. However, there are not many cases in which the concept of operation is studied scientifically. In this study, We propose search algorithms for reconnaissance drone through simulation analysis. In the simulation, the drone and target move linearly in continuous space, and the target is moving adopting the Random-walk concept to reflect the uncertainty of the battlefield. The research investigates the effectiveness of existing search methods such as Parallel and Spiral Search. We analyze the probabilistic analysis for detector radius and the speed on the detection probability. In particular, the new detection algorithms those can be used when an enemy moves toward a specific goal, PS (Probability Search) and HS (Hamiltonian Search), are introduced. The results of this study will have applicability on planning the path for the reconnaissance operations using drone-bots.

• The Bulletin of The Korean Astronomical Society
• /
• v.38 no.1
• /
• pp.43.1-43.1
• /
• 2013

We present here the preliminary results of the fast variability of AGN radio light curves. The shortest time scale of minute in AGN light curves is needed to probe the AGN activity for a few reasons; First, to check if there is any kind of shortest time scale activity. Secondly, to find out what high frequency end of AGN spectra look like. For the last, to see the time delay at several wavelength bands and the change of the spectral index with time. The observation was conducted with three KVN(Korea VLBI Network) antennas with single dish cross scan mode. In order not to lose the target at any given time, whenever one station needs to observe the calibrator, the other station is on the target. Though the detailed data reduction is still going on, there might exist varying feature in the radio light curve. The more fine calibration will be done in near future and another good data set is ready for the reduction.