• Title/Summary/Keyword: Grid-Based Algorithm

Search Result 677, Processing Time 0.027 seconds

Short-Term Photovoltaic Power Generation Forecasting Based on Environmental Factors and GA-SVM

  • Wang, Jidong;Ran, Ran;Song, Zhilin;Sun, Jiawen
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.1
    • /
    • pp.64-71
    • /
    • 2017
  • Considering the volatility, intermittent and random of photovoltaic (PV) generation systems, accurate forecasting of PV power output is important for the grid scheduling and energy management. In order to improve the accuracy of short-term power forecasting of PV systems, this paper proposes a prediction model based on environmental factors and support vector machine optimized by genetic algorithm (GA-SVM). In order to improve the prediction accuracy of this model, weather conditions are divided into three types, and the gray correlation coefficient algorithm is used to find out a similar day of the predicted day. To avoid parameters optimization into local optima, this paper uses genetic algorithm to optimize SVM parameters. Example verification shows that the prediction accuracy in three types of weather will remain at between 10% -15% and the short-term PV power forecasting model proposed is effective and promising.

YOLOv4 Grid Cell Shift Algorithm for Detecting the Vehicle at Parking Lot (노상 주차 차량 탐지를 위한 YOLOv4 그리드 셀 조정 알고리즘)

  • Kim, Jinho
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.18 no.4
    • /
    • pp.31-40
    • /
    • 2022
  • YOLOv4 can be used for detecting parking vehicles in order to check a vehicle in out-door parking space. YOLOv4 has 9 anchor boxes in each of 13x13 grid cells for detecting a bounding box of object. Because anchor boxes are allocated based on each cell, there can be existed small observational error for detecting real objects due to the distance between neighboring cells. In this paper, we proposed YOLOv4 grid cell shift algorithm for improving the out-door parking vehicle detection accuracy. In order to get more chance for trying to object detection by reducing the errors between anchor boxes and real objects, grid cells over image can be shifted to vertical, horizontal or diagonal directions after YOLOv4 basic detection process. The experimental results show that a combined algorithm of a custom trained YOLOv4 and a cell shift algorithm has 96.6% detection accuracy compare to 94.6% of a custom trained YOLOv4 only for out door parking vehicle images.

A Study on the Synchronization Methodology for Grid-connection of Three Phase Inverter (3상 인버터의 계통 연계를 위한 동기화 방법론에 대한 연구)

  • Lim, Byeong-Seok;Lee, Joon-Seong;Nguyen, Hoang-Nhan;Tran, Van-Thanh;Ko, Yun-Seok
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.14 no.5
    • /
    • pp.951-958
    • /
    • 2019
  • For the power grid-connection of distributed generation, the output voltage of the distributed generation must be synchronized with the grid voltage before the grid-connection. In this paper, a vector control based synchronization algorithm was developed for grid linkage of three-phase inverters. A three-phase voltage inverter was designed and fabricated to verify the effectiveness of the developed algorithm. The main controller of the three-phase inverter was developed based on DSP, and the electrical level of the system was set to an electrical level that can be tested in the laboratory. Throughout the experiments, it was confirmed that the proposed algorithm could be used as a synchronization algorithm for grid-connection by showing that the output voltage of the three-phase inverter is synchronized with the grid voltage.

A New VOF-based Numerical Scheme for the Simulation of Fluid Flow with Free Surface(I)-New Free Surface Tracking Algorithm and Its Verification- (자유 표면이 존재하는 유체 유동 해석을 위한 VOF방법의 기반의 새로운 수치 기법(I)-새로운 자유 표면 추적 알고리즘 및 검증-)

  • Kim, Min-Su;Sin, Su-Ho;Lee, U-Il
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.24 no.12
    • /
    • pp.1555-1569
    • /
    • 2000
  • Numerical simulation of fluid flow with moving free surface has been carried out. For the free surface flow, a VOF(Volume of Fluid)-based algorithm utilizing a fixed grid system has been investigated. In order to reduce numerical smearing at the free surface represented on a fixed grid system, a new free surface tracking algorithm based on the donor-acceptor scheme has been presented. Novel features of the proposed algorithm are characterized as two numerical tools; the orientation vector to represent the free surface orientation in each cell and the baby-cell to determine the fluid volume flux at each cell boundary. The proposed algorithm can be easily implemented in any irregular non-uniform grid systems that are usual in finite element method (FEM). Moreover, the proposed algorithm can be extended and applied to the 3-D free surface flow problem without additional efforts. For computation of unsteady incompressible flow, a finite element approximation based on the explicit fractional step method has been adopted. In addition, the SUPG(streamline upwind/Petrov-Galerkin) method has been implemented to deal with convection dominated flows. Combination of the proposed free surface tracking scheme and explicit fractional step formulation resulted in an efficient solution algorithm. Validity of the present solution algorithm was demonstrated from its application to the broken dam and the solitary wave propagation problems.

Density Adaptive Grid-based k-Nearest Neighbor Regression Model for Large Dataset (대용량 자료에 대한 밀도 적응 격자 기반의 k-NN 회귀 모형)

  • Liu, Yiqi;Uk, Jung
    • Journal of Korean Society for Quality Management
    • /
    • v.49 no.2
    • /
    • pp.201-211
    • /
    • 2021
  • Purpose: This paper proposes a density adaptive grid algorithm for the k-NN regression model to reduce the computation time for large datasets without significant prediction accuracy loss. Methods: The proposed method utilizes the concept of the grid with centroid to reduce the number of reference data points so that the required computation time is much reduced. Since the grid generation process in this paper is based on quantiles of original variables, the proposed method can fully reflect the density information of the original reference data set. Results: Using five real-life datasets, the proposed k-NN regression model is compared with the original k-NN regression model. The results show that the proposed density adaptive grid-based k-NN regression model is superior to the original k-NN regression in terms of data reduction ratio and time efficiency ratio, and provides a similar prediction error if the appropriate number of grids is selected. Conclusion: The proposed density adaptive grid algorithm for the k-NN regression model is a simple and effective model which can help avoid a large loss of prediction accuracy with faster execution speed and fewer memory requirements during the testing phase.

Distributed Grid Scheme using S-GRID for Location Information Management of a Large Number of Moving Objects (대용량 이동객체의 위치정보 관리를 위한 S-GRID를 이용한 분산 그리드 기법)

  • Kim, Young-Chang;Kim, Young-Jin;Chang, Jae-Woo
    • Journal of Korea Spatial Information System Society
    • /
    • v.10 no.4
    • /
    • pp.11-19
    • /
    • 2008
  • Recently, advances in mobile devices and wireless communication technologies require research on various location-based services. As a result, many studies on processing k-nearest neighbor query, which is most im portant one in location-based services, have been done. Most of existing studies use pre-computation technique to improve retrieval performance by computing network distance between POIs and nodes beforehand in spatial networks. However, they have a drawback that they can not deal with effectively the update of POIs to be searched. In this paper, we propose a distributed grid scheme using S-GRID to overcome the disadvantage of the existing work as well as to manage the location information of a large number of moving objects in efficient way. In addition, we describe a k-nearest neighbor(k-NN) query processing algorithm for the proposed distributed grid scheme. Finally, we show the efficiency of our distributed grid scheme by making a performance comparison between the k-NN query processing algorithm of our scheme and that of S-GRID.

  • PDF

Tetrahedral Mesh Generation Using a Mixed Method of a Grid and an Advancing Front Approach (격자법과 전진경계법을 흔합한 사면체 요소망의 자동생성)

  • 김영웅;전성재;채수원
    • Korean Journal of Computational Design and Engineering
    • /
    • v.8 no.1
    • /
    • pp.41-47
    • /
    • 2003
  • In this paper, a tetrahedral mesh generation algorithm which uses a grid based method for interior region and an advancing front method for outer surface region is proposed. In order to apply an advancing front method for outer region of an object, a new operator so called a hole operator has been developed to handle multiple shells. With this grid based approach in the interior region, more stable and uniform meshes can be constructed especially in the interior region.

Fast Path Planning Algorithm for Mobile Robot Navigation (모바일 로봇의 네비게이션을 위한 빠른 경로 생성 알고리즘)

  • Park, Jung Kyu;Jeon, Heung Seok;Noh, Sam H.
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.9 no.2
    • /
    • pp.101-107
    • /
    • 2014
  • Mobile robots use an environment map of its workspace to complete the surveillance task. However grid-based maps that are commonly used map format for mobile robot navigation use a large size of memory for accurate representation of environment. In this reason, grid-based maps are not suitable for path planning of mobile robots using embedded board. In this paper, we present the path planning algorithm that produce a secure path rapidly. The proposed approach utilizes a hybrid map that uses less memory than grid map and has same efficiency of a topological map. Experimental results show that the fast path planning uses only 1.5% of the time that a grid map based path planning requires. And the results show a secure path for mobile robot.

A Study on the PCB automatic routing by shape based method using the auction algorithm (Auction 알고리즘을 이용한 Shape Based 방식에 의한 PCB 자동 배선에 관한 연구)

  • Woo, Kyong-Hwan;Lee, Cheon-Hee
    • The KIPS Transactions:PartA
    • /
    • v.8A no.3
    • /
    • pp.269-278
    • /
    • 2001
  • Routing region modeling method of auto_routing systems are use the grid and the non-grid type. Though grid type has a few electrical and physical element on PCB, grid type has disadvantage which decrease the auto-routing speed dur to constraint with board and gird size. Thus it increase the memory capacity, Non-grid type(Shape baed type) use the region processing type, so it has 44.2% memory decrease effect than grid type in routing region. Thus, via number has 55% decrease effect, total routing time is increased 83.8% than conventional PCB system. In this paper we developed high speed PCB auto-routing system without memory waste by using shaped type applicant with auction algorithm which reaching the destination from one-point with best speed and solving the path problem. Also, this system developed by Visual C++ in IBM Pentium computer Window environment, and compatible with other PC.

  • PDF

Grid Angle Optimization and Grid Artifact Reduction in Digital Radiography Images Based on the Modulation Model (디지털 방사선 영상에서 그리드 각도의 최적화와 변조 모델에 기초한 그리드 왜곡의 제거)

  • Kim, Dong-Sik
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.48 no.3
    • /
    • pp.30-41
    • /
    • 2011
  • In order to obtain more clear x-ray images, an antiscatter grid, which can absorb the scattered rays, is employed. In the high-resolution direct digital radiography, however, the artifacts due to the grid are visible. In this paper, within the methods of obtaining x-ray digital images by employing the rotated grids for the facility of grid artifact reduction, the previous work, where the frequencies of the artifact components on the boundary, is further analyzed and extended, and a min-max optimization for a given grid density is proposed. For practical grid densities, appropriate grid angles are provided and a grid artifact reduction algorithm is proposed for the appropriate grid angles. The proposed algorithm is tested for real x-ray digital images with a comparison, and can remove the grid artifacts while maintaining the resolution of the original image.