• Title/Summary/Keyword: Three-Point Algorithm

Search Result 535, Processing Time 0.023 seconds

APPROXIMATING COMMON FIXED POINT OF THREE MULTIVALUED MAPPINGS SATISFYING CONDITION (E) IN HYPERBOLIC SPACES

  • Austine Efut Ofem;Godwin Chidi Ugwunnadi;Ojen Kumar Narain;Jong Kyu Kim
    • Nonlinear Functional Analysis and Applications
    • /
    • v.28 no.3
    • /
    • pp.623-646
    • /
    • 2023
  • In this article, we introduce the hyperbolic space version of a faster iterative algorithm. The proposed iterative algorithm is used to approximate the common fixed point of three multi-valued almost contraction mappings and three multi-valued mappings satisfying condition (E) in hyperbolic spaces. The concepts weak w2-stability involving three multi-valued almost contraction mappings are considered. Several strong and △-convergence theorems of the suggested algorithm are proved in hyperbolic spaces. We provide an example to compare the performance of the proposed method with some well-known methods in the literature.

A Comparison of the Algorithm between Korea and Japan in Maritime Boundary Delimitation (해양경계획선 알고리즘에 관한 연구)

  • Kim Byung-Guk;Jin Hai-Ming;Kim Hyung-Su
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.23 no.2
    • /
    • pp.211-217
    • /
    • 2005
  • The general rule of boundary delimitation is the principle of equidistance. The principle of equidistance is a method that determine boundary delimitation from the fixed distant of baseline or basepoint. But there is no artificial and natural object in the sea to determine boundary. And the principle of equidistant can't be applied in every cases, because of the local characteristic of ground. In this paper, we suggest Three-Point Algorithm which is effective algorithm for maritime boundary delimitation. And the main objective of this study is to get capability of maritime boundary delimitation technique.

GENERAL ITERATIVE ALGORITHMS FOR MONOTONE INCLUSION, VARIATIONAL INEQUALITY AND FIXED POINT PROBLEMS

  • Jung, Jong Soo
    • Journal of the Korean Mathematical Society
    • /
    • v.58 no.3
    • /
    • pp.525-552
    • /
    • 2021
  • In this paper, we introduce two general iterative algorithms (one implicit algorithm and one explicit algorithm) for finding a common element of the solution set of the variational inequality problems for a continuous monotone mapping, the zero point set of a set-valued maximal monotone operator, and the fixed point set of a continuous pseudocontractive mapping in a Hilbert space. Then we establish strong convergence of the proposed iterative algorithms to a common point of three sets, which is a solution of a certain variational inequality. Further, we find the minimum-norm element in common set of three sets.

LiDAR Measurement Analysis in Range Domain

  • Sooyong Lee
    • Journal of Sensor Science and Technology
    • /
    • v.33 no.4
    • /
    • pp.187-195
    • /
    • 2024
  • Light detection and ranging (LiDAR), a widely used sensor in mobile robots and autonomous vehicles, has its most important function as measuring the range of objects in three-dimensional space and generating point clouds. These point clouds consist of the coordinates of each reflection point and can be used for various tasks, such as obstacle detection and environment recognition. However, several processing steps are required, such as three-dimensional modeling, mesh generation, and rendering. Efficient data processing is crucial because LiDAR provides a large number of real-time measurements with high sampling frequencies. Despite the rapid development of controller computational power, simplifying the computational algorithm is still necessary. This paper presents a method for estimating the presence of curbs, humps, and ground tilt using range measurements from a single horizontal or vertical scan instead of point clouds. These features can be obtained by data segmentation based on linearization. The effectiveness of the proposed algorithm was verified by experiments in various environments.

An Optimal Maximum Power Point Tracking Algorithm for Wind Energy System in Microgrid

  • Nguyen, Thanh-Van;Kim, Kyeong-Hwa
    • Proceedings of the KIPE Conference
    • /
    • 2018.07a
    • /
    • pp.382-383
    • /
    • 2018
  • To increase the efficiency of a wind energy conversion system (WECS), the maximum power point tracking (MPPT) algorithm is usually employed. This paper proposes an optimal MPPT algorithm which tracks a sudden wind speed change condition fast. The proposed method can be implemented without the prior information on the wind turbine parameters, generator parameters, air density or wind speed. By investigating the directions of changes of the mechanical output power in wind turbine and rotor speed of the generator, the proposed MPPT algorithm is able to determine an optimal speed to achieve the maximum power point. Then, this optimal speed is set to the reference of the speed control loop. As a result, the proposed MPPT algorithm forces the system to operate at the maximum power point by using a three-phase converter. The simulation results based on the PSIM are given to prove the effectiveness of the proposed method.

  • PDF

Neutral Point Voltage Control for Grid-Connected Three-Phase Three-Level Photovoltaic Inverter (계통연계형 3상 3레벨 태양광 인버터의 중성점 전압제어)

  • Park, Woonho;Yang, Oh
    • Journal of the Semiconductor & Display Technology
    • /
    • v.14 no.4
    • /
    • pp.72-77
    • /
    • 2015
  • Three-level diode clamped multilevel inverter, generally known as neutral point clamped (NPC) inverter, has an inherent problem causing neutral point (NP) potential variation. Until now, the NP potential problem of variation has been investigated and lots of solutions have also been proposed. This paper presents a neutral point voltage control technology using the anti-windup PI controller and offset technology of PWM (Pulse Width Modulation) to control the variation of NPC 3-phase three-level inverter neutral point voltage. And the proposed algorithm is tested and verified using a PLL (Phase Locked Loop) in order to synchronize the phase voltage from the line voltage of grid. It significantly improves the voltage balancing under a solar fluctuation conditions of the inverter. Experimental results show the good performance and effectiveness of the proposed method.

The Development of Driving Algorithm for an Unmanned Vehicle with Multiple-GPS's (다중 GPS를 이용한 무인자동차의 주행 알고리즘 개발)

  • Moon, Hee-Chang;Son, Young-Jin;Kim, Jung-Ha
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.14 no.1
    • /
    • pp.27-35
    • /
    • 2008
  • A navigation system is one of the important components of an unmanned ground vehicle (UGV). A GPS receiver collects data signals transmitted by (Earth orbiting) satellites. However, these data signals may contain many errors resulting misinformation and depending on one's position (environment), reception may be impossible. The proposed self-driven algorithm uses three low-cost GPS in order to minimize errors of existing inexpensive single GPS's driving algorithm. By using reliable final data, which is analyzed and combined from each of three GPS's received data signals, gathering a vehicle's steering performance information and its current pin-point position is improved even with error containing signals or from a place where signal gathering is impossible. The purpose of this thesis is to explain navigation system algorithm using multiple GPS and compass sensor and prove the algorithm through experiments.

Point Cloud Slicing Based on 2D Delaunay Triangulation (2D Delaunay Triangulation을 이용한 점군 절단)

  • Park, Hyeong-Tae;Chang, Min-Ho;Park, Sang-Chul
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.24 no.5
    • /
    • pp.127-134
    • /
    • 2007
  • Presented in the paper is an algorithm to generate a section curve by slicing a point cloud including tens of thousands of points. Although, there have been previous research results on the slicing problem, they are quite sensitive on the density variations of the point cloud, as well as on the local noise in the point cloud. To relive the difficulties, three technological requirements are identified; 1) dominant point sampling, 2) avoiding local vibration, and 3) robustness on the density changes. To satisfy these requirements, we propose a new slicing algorithm which is based on a node-sphere diagram. The algorithm has been implemented and tested with various examples.

A Study on Localization System using 3D Triangulation Algorithm based on Dynamic Allocation of Beacon Node (비컨노드의 동적배치 기반 3차원 삼각측량 알고리즘을 적용한 위치인식 시스템에 대한 연구)

  • Lee, Ho-Cheol;Lee, Dong-Myung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.4B
    • /
    • pp.378-385
    • /
    • 2011
  • The three-dimensional triangulation algorithm that the beacon nodes can be allocated to dynamically in not the experimental region but the practical region is suggested, and the performance of the localization system adapting the suggested algorithm is analyzed. The suggested algorithm adapts the computation method of the three dimensional point that the surfaces of three spheres overlapped, while the traditional triangulation algorithm adapts the computation method of the two dimensional point that three circles are overlapped in order to compute the distance between beacon nodes and mobile node that means a radius. In addition to this, to analyze the performance of the localization system adapting the suggested algorithm, first of all, the allocation layout of beacon nodes is made, and the allocation layout is modeled by selection of ten random distance values between mobile node and beacon nodes for computer simulation of the practical model. Next, the two dimensional coordinator of mobile node that is calculated by the suggested algorithm and the traditional triangulation algorithm is compared with each other. The localization measuring performance about three dimensional coordinator(z axis) of the suggested algorithm is also obtained by comparing with that of the practical model.

Study on the Improvement of the Image Analysis Speed in the Digital Image Correlation Measurement System for the 3-Point Bend Test

  • Choi, In Young;Kang, Young June;Hong, Kyung Min;Kim, Seong Jong;Lee, Gil Dong
    • Journal of the Optical Society of Korea
    • /
    • v.18 no.5
    • /
    • pp.523-530
    • /
    • 2014
  • Machine material and structural strain are critical factors for appraising mechanical properties and safety. Particularly in three and four-point bending tests, which appraise the deflection and flexural strain of an object due to external force, measurements are made by the crosshead movement or deflection meter of a universal testing machine. The Digital Image Correlation (DIC) method is one of the non-contact measurement methods. It uses the image analyzing method that compares the reference image with the deformed image for measuring the displacement and strain of the objects caused by external force. Accordingly, the advantage of this method is that the object's surface roughness, shape, and temperature have little influence. However, its disadvantage is that it requires extensive time to compare the reference image with the deformed image for measuring the displacement and strain. In this study, an algorithm is developed for DIC that can improve the speed of image analysis for measuring the deflection and strain of an object caused by a three-point bending load. To implement this algorithm for improving the speed of image analysis, LabVIEW 2010 was used. Furthermore, to evaluate the accuracy of the developed fast correlation algorithm, the deflection of an aluminum specimen under a three-point bending load was measured by using the universal test machine and DIC measurement system.