• Advances in Energy Research
• /
• v.4 no.2
• /
• pp.163-176
• /
• 2016

Rapid depletion of fossil based oil, coal and gas reserves and its greater demand day by day necessitates the search for other alternatives. Severe environmental impacts caused by the fossil fire based power plants and the escalating fuel costs are the major challenges faced by the electricity supply industry. Integration of Distributed Generators (DG) especially, wind and solar systems to the grid has been steadily increasing due to the concern of clean environment. This paper focuses on a new simple and fast load flow algorithm named Backward Forward Sweep Algorithm (BFSA) for finding the voltage profile and power losses with the integration of various sizes of DG at different locations. Genetic Algorithm (GA) based BFSA is adopted in finding the optimal location and sizing of DG to attain an improved voltage profile and considerable reduced power loss. Simulation results show that the proposed algorithm is more efficient in finding the optimal location and sizing of DG in 15-bus radial distribution system (RDS).The authenticity of the placement of optimized DG is assured with other DG placement techniques.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.7 no.3
• /
• pp.329-337
• /
• 2017

This paper proposes a search method that explores parameters C and σ values of support vector machines (SVM) to improve performance while maintaining search accuracy. A traditional grid search method requires tremendous computational times because it searches all available combinations of C and σ values to find optimal combinations which provide the best performance of SVM. To address this issue, this paper proposes a deep search method that reduces computational time. In the first stage, it divides C-σ- accurate metrics into four regions, searches a median value of each region, and then selects a point of the highest accurate value as a start point. In the second stage, the selected start points are re-divided into four regions, and then the highest accurate point is assigned as a new search point. In the third stage, after eight points near the search point. are explored and the highest accurate value is assigned as a new search point, corresponding points are divided into four parts and it calculates an accurate value. In the last stage, it is continued until an accurate metric value is the highest compared to the neighborhood point values. If it is not satisfied, it is repeated from the second stage with the input level value. Experimental results using normal and defect bearings show that the proposed deep search algorithm outperforms the conventional algorithms in terms of performance and search time.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2001.01a
• /
• pp.37-44
• /
• 2001

This paper describes the modeling of work environment for the extraction of abstract operation rules for cooperative work with multiple agent. We propose the modeling method using a potential field. In the method, it is applied to a box pushing problem, which is to move a box from a start to a goal b multiple agent. The agents follow the potential value when they move and work in the work environment. The work environment is represented as the grid space. The potential field is generated by Genetic Algorithm(GA) for each agent. GA explores the positions of a potential peak value in the grid space, and then the potential value stretching in the grid space is spread by a potential diffusion function in each grid. However it is difficult to explore suitable setting using hand coding of the position of peak potential value. Thus, we use an evlolutionary computation way because it is possible to explore the large search space. So we make experiments the environment modeling using the proposed method and verify the performance of the exploration by GA. And we classify some types from acquired the environment model and extract the abstract operation rule, As results, we find out some types of the environment models and operation rules by the observation, and the performance of GA exploration is almost same as the hand coding set because these are nearly same performance on the evaluation of the consumption of agent's energy and the work step from point to the goal point.

• The KIPS Transactions:PartA
• /
• v.18A no.2
• /
• pp.75-80
• /
• 2011

Recently, many cleaning robots have been made with various algorithms for efficient cleaning. One of them is a DmaxCoverage algorithm which efficiently clean for the situation when the robot has a time limit. This algorithm uses Rectangle Tiling method for finding the biggest rectangle that doesn't have any obstacle. When the robot uses grid map, Rectangle Tiling method can find the optimal value. Rectangle Tiling method is to find all of the rectangles in the grid map. But when the grid map is big, it has a problem that spends a lot of times because of the large numbers of rectangles. In this paper, we propose Four Direction Rectangle Scanning(FDRS) method that has similar accuracy but faster than Rectangle Tiling method. FDRS method is not to find all of the rectangle, but to search the obstacle's all directions. We will show the FDRS method's performance by comparing of FDRS and Rectangle Tiling methods.

• Convergence Security Journal
• /
• v.22 no.2
• /
• pp.105-114
• /
• 2022

This paper is presents an intelligent control system that visualizes the direction of arrival for hearing impaired using personal mobility, and aims to recognize and prevent dangerous situations caused by sound such as alarm sounds and crack sounds on roads. The position estimation method of sound source uses a machine learning classification model characterized by generalized correlated phase transformation based on time difference of arrival. In the experimental environment reproducing the road situations, four classification models learned after extracting learning data according to wind speeds 0km/h, 5.8km/h, 14.2km/h, and 26.4km/h were compared with grid search cross validation, and the Muti-Layer Perceptron(MLP) model with the best performance was applied as the optimal algorithm. When wind occurred, the proposed algorithm showed an average performance improvement of 7.6-11.5% compared to the previous studies.

• The Journal of Korea Robotics Society
• /
• v.8 no.4
• /
• pp.256-265
• /
• 2013

A local map-based exploration algorithm for mobile robots is presented. Segmented frontiers and their relative transformations constitute a tree structure. By the proposed efficient frontier segmentation and a local map management method, a robot can reduce the unknown area and update the local grid map which is assigned to each frontier node. Although this local map-based exploration method uses only local maps and their adjacent node information, mapping completion and efficiency can be greatly improved by merging and updating the frontier nodes. Also, we suggest appropriate graph search exploration methods for corridor and hall environments. The simulation demonstrates that the entire environment can be represented by well-distributed frontier nodes.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.10
• /
• pp.1-9
• /
• 1994

In this paper, we have studied optimal FCL(Frequently Called List) table sizes in a grid topology circuit-switched network including wireless subscribers. The FCL table gives the position information of a destination subscriber for a call. When the call is generated in a node, this call is routed by the referenced position information of the destination subscriber in FCL table. In this paper, we have proposed an efficient routing algorithm, mixed FSR(Flood Search Routing) and DAR(Dynamic Adaptive Routing), considering moving wireless subscribers. Also, we have simulated hit ratio and incorrect ratio as performance parameters, consequently proposed the object function composed of table search time, hit ratio, incorrect ratio, FSR time and DAR time, and derived the optimal FCL table size by using it.

• Journal of Electrical Engineering and Technology
• /
• v.13 no.5
• /
• pp.1821-1830
• /
• 2018

With the wide application of intelligent household appliances, the optimization of electricity behavior has become an important component of home-based intelligent electricity. In this study, a multi-objective optimization model in an intelligent electricity environment is proposed based on economy and comfort. Firstly, the domestic consumer's load characteristics are analyzed, and the operating constraints of interruptible and transferable electrical appliances are defined. Then, constraints such as household electrical load, electricity habits, the correlation minimization electricity expenditure model of household appliances, and the comfort model of electricity use are integrated into multi-objective optimization. Finally, a continuous search multi-objective particle swarm algorithm is proposed to solve the optimization problem. The analysis of the corresponding example shows that the multi-objective optimization model can effectively reduce electricity costs and improve electricity use comfort.

• Journal of the Korean Data and Information Science Society
• /
• v.27 no.4
• /
• pp.911-923
• /
• 2016

Machine learning becomes increasingly important in the big data era. Logistic regression is a type of classification in machine leaning, and has been widely used in various fields, including medicine, economics, marketing, and social sciences. Rhipe that integrates R and Hadoop environment, has not been discussed by many researchers owing to the difficulty of its installation and MapReduce implementation. In this paper, we present the MapReduce implementation of Gradient Descent algorithm and Newton-Raphson algorithm for logistic regression using Rhipe. The Newton-Raphson algorithm does not require a learning rate, while Gradient Descent algorithm needs to manually pick a learning rate. We choose the learning rate by performing the mixed procedure of grid search and binary search for processing big data efficiently. In the performance study, our Newton-Raphson algorithm outpeforms Gradient Descent algorithm in all the tested data.

• Journal of Korean Society of Transportation
• /
• v.30 no.5
• /
• pp.71-82
• /
• 2012

Some previous studies adopted a method statistically based on the observed traffic volumes and travel times to estimate the parameters. Others tried to find an optimal set of parameters to minimize the gap between the observed and estimated traffic volumes using, for instance, a combined optimization model with a traffic assignment model. The latter is frequently used in a large-scale network that has a capability to find a set of optimal parameter values, but its appropriateness has never been demonstrated. Thus, we developed a methodology to estimate a set of parameter values of BPR(Bureau of Public Road) function using Harmony Search (HS) method. HS was developed in early 2000, and is a global search method proven to be superior to other global search methods (e.g. Genetic Algorithm or Tabu search). However, it has rarely been adopted in transportation research arena yet. The HS based transportation network calibration algorithm developed in this study is tested using a grid network, and its outcomes are compared to those from incremental method (Incre) and Golden Section (GS) method. It is found that the HS algorithm outperforms Incre and GS for copying the given observed link traffic counts, and it is also pointed out that the popular optimal network calibration techniques based on an objective function of traffic volume replication are lacking the capability to find appropriate free flow travel speed and ${\alpha}$ value.