• 제목/요약/키워드: Fixed Point Algorithm

검색결과 362건 처리시간 0.029초

Performance Evaluation of Location Estimation System Using a Non Fixed Single Receiver

  • Myagmar, Enkhzaya;Kwon, Soon-Ryang
    • International Journal of Contents
    • /
    • 제10권4호
    • /
    • pp.69-74
    • /
    • 2014
  • General location aware systems are only applied to indoor and outdoor environments using more than three transmitters to estimate a fixed object location. Those kinds of systems have environmental restrictions that require an already established infrastructure. To solve this problem, an Object Location Estimation (OLE) algorithm based on PTP (Point To Point) communication has been proposed. However, the problem with this method is that deduction of performance parameters is not enough and location estimation is very difficult because of unknown restriction conditions. From experimental tests in this research, we determined that the performance parameters for restriction conditions are a maximum transmission distance of CSS communication and an optimum moving distance interval between personal locations. In this paper, a system applied OLE algorithm based on PTP communication is implemented using a CSS (Chirp Spread Spectrum) communication module. A maximum transmission distance for CSS communication and an optimum moving distance interval between personal locations are then deducted and studied to estimate a fixed object location for generalization.

CONVERGENCE THEOREMS FOR TWO FAMILIES OF WEAK RELATIVELY NONEXPANSIVE MAPPINGS AND A FAMILY OF EQUILIBRIUM PROBLEMS

  • Zhang, Xin;Su, Yongfu
    • 대한수학회논문집
    • /
    • 제25권4호
    • /
    • pp.583-607
    • /
    • 2010
  • The purpose of this paper is to prove strong convergence theorems for common fixed points of two families of weak relatively nonexpansive mappings and a family of equilibrium problems by a new monotone hybrid method in Banach spaces. Because the hybrid method presented in this paper is monotone, so that the method of the proof is different from the original one. We shall give an example which is weak relatively nonexpansive mapping but not relatively nonexpansive mapping in Banach space $l^2$. Our results improve and extend the corresponding results announced in [W. Takahashi and K. Zembayashi, Strong convergence theorem by a new hybrid method for equilibrium problems and relatively nonexpansive mappings, Fixed Point Theory Appl. (2008), Article ID 528476, 11 pages; doi:10.1155/2008/528476] and [Y. Su, Z. Wang, and H. Xu, Strong convergence theorems for a common fixed point of two hemi-relatively nonexpansive mappings, Nonlinear Anal. 71 (2009), no. 11, 5616?5628] and some other papers.

Convergence Theorem for Finding Common Fixed Points of N-generalized Bregman Nonspreading Mapping and Solutions of Equilibrium Problems in Banach Spaces

  • Jolaoso, Lateef Olakunle;Mewomo, Oluwatosin Temitope
    • Kyungpook Mathematical Journal
    • /
    • 제61권3호
    • /
    • pp.523-558
    • /
    • 2021
  • In this paper, we study some fixed point properties of n-generalized Bregman nonspreading mappings in reflexive Banach space. We introduce a hybrid iterative scheme for finding a common solution for a countable family of equilibrium problems and fixed point problems in reflexive Banach space. Further, we give some applications and numerical example to show the importance and demonstrate the performance of our algorithm. The results in this paper extend and generalize many related results in the literature.

EGML 이동 객체 검출 알고리듬의 고정소수점 구현 및 성능 분석 (A fixed-point implementation and performance analysis of EGML moving object detection algorithm)

  • 안효식;김경훈;신경욱
    • 한국정보통신학회논문지
    • /
    • 제19권9호
    • /
    • pp.2153-2160
    • /
    • 2015
  • EGML (effective Gaussian mixture learning) 기반 이동 객체 검출 (moving object detection; MOD) 알고리듬의 하드웨어 구현을 위한 설계조건을 분석하였다. EGML 알고리듬을 OpenCV 소프트웨어로 구현하고 다양한 영상들에 대한 시뮬레이션을 통해 배경학습 시간과 이동 객체 검출에 영향을 미치는 파라미터 조건을 분석하였다. 또한, 고정소수점 시뮬레이션을 통해 파라미터들의 비트 길이가 이동 객체 검출 성능에 미치는 영향을 평가하고, 최적 하드웨어 설계 조건을 도출하였다. 본 논문의 파라미터 비트 길이를 적용한 고정소수점 이동 객체 검출 모델은 부동소수점 연산 대비 약 절반의 비트 길이를 사용하면서 MOD 성능의 차이는 0.5% 이하이다.

다중 GPS 수신기에 의한 농업용 차량의 정밀 위치 계측(I) - 오차추정 시뮬레이션 및 고정위치계측 - (Precise Positioning of Farm Vehicle Using Plural GPS Receivers - Error Estimation Simulation and Positioning Fixed Point -)

  • 김상철;조성인;이승기;이운용;홍영기;김국환;조희제;강지원
    • Journal of Biosystems Engineering
    • /
    • 제36권2호
    • /
    • pp.116-121
    • /
    • 2011
  • This study was conducted to develop a robust navigator which could be in positioning for precision farming through developing a plural GPS receiver with 4 sets of GPS antenna. In order to improve positioning accuracy by integrating GPS signals received simultaneously, the algorithm for processing plural GPS signal effectively was designed. Performance of the algorithm was tested using a simulation program and a fixed point on WGS 84 coordinates. Results of this study are aummarized as followings. 1. 4 sets of lower grade GPS receiver and signals were integrated by kalman filter algorithm and geometric algorithm to increase positioning accuracy of the data. 2. Prototype was composed of 4 sets of GPS receiver and INS components. All Star which manufactured by CMC, gyro compass made by KVH, ground speed sensor and integration S/W based on RTOS(Real Time Operating System)were used. 3. Integration algorithm was simulated by developed program which could generate random position error less then 10 m and tested with the prototype at a fixed position. 4. When navigation data was integrated by geometrical correction and kalman filter algorithm, estimated positioning erros were less then 0.6 m and 1.0 m respectively in simulation and fixed position tests.

Genetic Algorithm을 이용한 sweet spot search (Sweet spot search using Genetic Algorithm)

  • 임성진;정경권;엄기환
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2003년도 하계종합학술대회 논문집 I
    • /
    • pp.274-277
    • /
    • 2003
  • Millimeter-wave networking is composed of narrow beam link. High directivity of the beam provides either advantage or disadvantage in comparison with conventional wide-lobe microwave communications. In such networks, it is very substantial that beam connecting point to point is fixed in right direction. It is major requirement in the beam network to keep the beam in best direction. In this paper, We propose the method to find a best suited direction of the antenna's beam using the Genetic Algorithm in point-to-point link. Proposed method presume that each station knows his direction $\theta$$_1$,$\theta$$_2$ at every step of Genetic Algorithm, then it can be expected that GA is possible to search the ideal solution. Intensity of the received signal is evaluated by the multiplication of lengths to the point which the lobe meets with the horizontal line.

  • PDF

가변 IC 방법을 이용한 태양광 발전의 MPPT 제어 (MPPT Control of Photovoltaic using Variable IC Method)

  • 고재섭;정동화
    • 조명전기설비학회논문지
    • /
    • 제26권8호
    • /
    • pp.27-34
    • /
    • 2012
  • This paper proposes variable incremental conductance(IC) algorithm for maximum power point tracking(MPPT) control of photovoltaic. The conventional perturbation & observation(PO) and IC MPPT control algorithm generally uses fixed step size. A small step size reduces a tracking error in the steady state but slows a tracking speed in the transient state. Also, a large step size is fast a tracking speed but increases a tracking error. Therefore, this paper proposes variable IC MPPT algorithm that adjust automatically step size according to operating conditions. To improve a tracking speed and accuracy, when operating point is far from the maximum power point(MPP), the step size uses maximum value and when a operating point is near from the MPP, the step size uses variable step size that adjust according to slope of P-V curve. The validity of MPPT algorithm proposed in this paper prove through compare with conventional PO and IC MPPT algorithm.

A SYSTEM OF NONLINEAR PROJECTION EQUATIONS WITH PERTURBATION IN HILBERT SPACES

  • Zhou, Li-Wen;Cho, Yeol-Je;Huang, Nan-Jing
    • East Asian mathematical journal
    • /
    • 제24권2호
    • /
    • pp.191-199
    • /
    • 2008
  • In this paper, we introduce and studied a system of nonlinear projection equations with perturbation in Hilbert spaces. By using the fixed point theorem, we prove an existence of solution for this system of nonlinear projection equations. We construct an algorithm for approximating the solution of the system of nonlinear projection equations with perturbation and show that the iterative sequence generated by the algorithm converges to the solution of the system of nonlinear projection equations with perturbation under some suitable conditions.

  • PDF

STRONG CONVERGENCE OF STRICT PSEUDO-CONTRACTIONS IN Q-UNIFORMLY SMOOTH BANACH SPACES

  • Pei, Yonggang;Liu, Fujun;Gao, Qinghui
    • Journal of applied mathematics & informatics
    • /
    • 제33권1_2호
    • /
    • pp.13-31
    • /
    • 2015
  • In this paper, we introduce a general iterative algorithm for finding a common element of the common fixed point set of an infinite family of ${\lambda}_i$-strict pseudo-contractions and the solution set of a general system of variational inclusions for two inverse strongly accretive operators in q-uniformly smooth Banach spaces. Then, we analyze the strong convergence of the iterative sequence generated by the proposed iterative algorithm under mild conditions.

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
    • /
    • 제28권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.