• 제목/요약/키워드: Least Squares Algorithm

검색결과 564건 처리시간 0.03초

최소자승법을 이용한 수직다관절 Manipulator의 원호보간에 관한 효과적인 방법 (An Efficient Approach to Circular Curve Fitting of Articulated Manipulators Using Least Squares)

  • 김대영;최은재;정원지;서영교;홍형표
    • 한국정밀공학회:학술대회논문집
    • /
    • 한국정밀공학회 2002년도 추계학술대회 논문집
    • /
    • pp.570-575
    • /
    • 2002
  • This paper presents a new circular curve fitting approach of articulated manipulators, based on pseudoinverses. The paper aims at gaining the interpolation of circle from n data points, under the condition that the fitted circle should pass both a start point and an end point. In this paper, two algorithms of circular interpolation are presented. Prior to circular interpolation, are a spherical fitting should be performed, using least squares. In the first algorithm, the relationship between point data and normal vector on the sphere is used. In the second algorithm. the equation of plane which can be obtained from 3 points, i.e., a start point, an end point, and center of a sphere. The proposed algorithms are show to be efficient by using MATLAB-based simulation.

  • PDF

연속시간 하중최소자승 식별기의 최소고우치 결정 (Determination of Minimum Eigenvalue in a Continuous-time Weighted Least Squares Estimator)

  • Kim, Sung-Duck
    • 대한전기학회논문지
    • /
    • 제41권9호
    • /
    • pp.1021-1030
    • /
    • 1992
  • When using a least squares estimator with exponential forgetting factor to identify continuous-time deterministic system, the problem of determining minimum eigenvalue is described in this paper. It is well known fact that the convergence rate of parameter estimates relies on various factors consisting of the estimator and especially, theirproperties can be directly affected by all eigenvalues in the parameter error differential equation. Fortunately, there exists only one adjusting eigenvalue in the given estimator and then, the parameter convergence rates depend on this minimum eigenvalue. In this note, a new result to determine the minimum eigenvalue is proposed. Under the assumption that the input has as many spectral lines as the number of parameter estimates, it can be proven that the minimum eigenvalue converges to a constant value, which is a function of the forgetting factor and the parameter estimates number.

  • PDF

Kernel-based actor-critic approach with applications

  • Chu, Baek-Suk;Jung, Keun-Woo;Park, Joo-Young
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • 제11권4호
    • /
    • pp.267-274
    • /
    • 2011
  • Recently, actor-critic methods have drawn significant interests in the area of reinforcement learning, and several algorithms have been studied along the line of the actor-critic strategy. In this paper, we consider a new type of actor-critic algorithms employing the kernel methods, which have recently shown to be very effective tools in the various fields of machine learning, and have performed investigations on combining the actor-critic strategy together with kernel methods. More specifically, this paper studies actor-critic algorithms utilizing the kernel-based least-squares estimation and policy gradient, and in its critic's part, the study uses a sliding-window-based kernel least-squares method, which leads to a fast and efficient value-function-estimation in a nonparametric setting. The applicability of the considered algorithms is illustrated via a robot locomotion problem and a tunnel ventilation control problem.

A FAST KACZMARZ-KOVARIK ALGORITHM FOR CONSISTENT LEAST-SQUARES PROBLEMS

  • Popa, Constantin
    • Journal of applied mathematics & informatics
    • /
    • 제8권1호
    • /
    • pp.9-26
    • /
    • 2001
  • In some previous papers the author extended two algorithms proposed by Z. Kovarik for approximate orthogonalization of a finite set of linearly independent vectors from a Hibert space, to the case when the vectors are rows (not necessary linearly independent) of an arbitrary rectangular matrix. In this paper we describe combinations between these two methods and the classical Kaczmarz’s iteration. We prove that, in the case of a consistent least-squares problem, the new algorithms so obtained converge ti any of its solutions (depending on the initial approximation). The numerical experiments described in the last section of the paper on a problem obtained after the discretization of a first kind integral equation ilustrate the fast convergence of the new algorithms. AMS Mathematics Subject Classification : 65F10, 65F20.

비선형 최소 자승법을 이용한 이동 로봇의 비주얼 서보 네비게이션 (Visual Servo Navigation of a Mobile Robot Using Nonlinear Least Squares Optimization for Large Residual)

  • 김곤우;남경태;이상무;손웅희
    • 로봇학회논문지
    • /
    • 제2권4호
    • /
    • pp.327-333
    • /
    • 2007
  • We propose a navigation algorithm using image-based visual servoing utilizing a fixed camera. We define the mobile robot navigation problem as an unconstrained optimization problem to minimize the image error between the goal position and the position of a mobile robot. The residual function which is the image error between the position of a mobile robot and the goal position is generally large for this navigation problem. So, this navigation problem can be considered as the nonlinear least squares problem for the large residual case. For large residual, we propose a method to find the second-order term using the secant approximation method. The performance was evaluated using the simulation.

  • PDF

무작위 데이터 근사화를 위한 유계오차 B-스플라인 근사법 (An Error-Bounded B-spline Fitting Technique to Approximate Unorganized Data)

  • 박상근
    • 한국CDE학회논문집
    • /
    • 제17권4호
    • /
    • pp.282-293
    • /
    • 2012
  • This paper presents an error-bounded B-spline fitting technique to approximate unorganized data within a prescribed error tolerance. The proposed approach includes two main steps: leastsquares minimization and error-bounded approximation. A B-spline hypervolume is first described as a data representation model, which includes its mathematical definition and the data structure for implementation. Then we present the least-squares minimization technique for the generation of an approximate B-spline model from the given data set, which provides a unique solution to the problem: overdetermined, underdetermined, or ill-conditioned problem. We also explain an algorithm for the error-bounded approximation which recursively refines the initial base model obtained from the least-squares minimization until the Euclidean distance between the model and the given data is within the given error tolerance. The proposed approach is demonstrated with some examples to show its usefulness and a good possibility for various applications.

수정된 최소자승법을 이용한 간접 적응 극배치 제어기에 관한 연구 (A Study on Indirect Adaptive Pole Placement Controller using a Modified Least Squares Method)

  • 한영성;정영주;노태석;조규복
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1992년도 하계학술대회 논문집 A
    • /
    • pp.319-322
    • /
    • 1992
  • This paper proposes indirect adaptive pole placement adaptive controller using a modified least squares method. If an adaptive controller has good performance, it is necessary that an estimator have fast convergence. This paper presents a modified least squares method which guarantees the stability of estimator and has fast convergence. In this algorithm, information on signal level is obtained from the determinent of covariance matrix and according to it, weighting factor is tuned.

  • PDF

Road Centerline Tracking From High Resolution Satellite Imagery By Least Squares Templates Matching

  • Park, Seung-Ran;Kim, Tae-Jung;Jeong, Soo;Kim, Kyung-Ok
    • 대한원격탐사학회:학술대회논문집
    • /
    • 대한원격탐사학회 2002년도 Proceedings of International Symposium on Remote Sensing
    • /
    • pp.34-39
    • /
    • 2002
  • Road information is very important for topographic mapping, transportation application, urban planning and other related application fields. Therefore, automatic detection of road networks from spatial imagery, such as aerial photos and satellite imagery can play a central role in road information acquisition. In this paper, we use least squares correlation matching alone for road center tracking and show that it works. We assumed that (bright) road centerlines would be visible in the image. We further assumed that within a same road segment, there would be only small differences in brightness values. This algorithm works by defining a template around a user-given input point, which shall lie on a road centerline, and then by matching the template against the image along the orientation of the road under consideration. Once matching succeeds, new match proceeds by shifting a matched target window further along road orientation at the target window. By repeating the process above, we obtain a series of points, which lie on a road centerline successively. A 1m resolution IKONOS images over Seoul and Daejeon were used for tests. The results showed that this algorithm could extract road centerlines in any orientation and help in fast and exact he ad-up digitization/vectorization of cartographic images.

  • PDF

최소제곱 서포터벡터기계 형태의 준지도분류 (Semi-supervised classification with LS-SVM formulation)

  • 석경하
    • Journal of the Korean Data and Information Science Society
    • /
    • 제21권3호
    • /
    • pp.461-470
    • /
    • 2010
  • 라벨 있는 자료가 분류규칙을 만들 만큼 충분하지 않거나, 라벨 없는 자료가 분류규칙을 만드는데 도움을 줄 수 있는 경우에는 라벨 있는 자료와 라벨 없는 자료를 모두 사용하는 준지도분류가 더 효과적이다. 준지도분류 중 그래프기반 다양체정칙법이 개발되어 최근에 많은 연구가 이루어지고 있다. 본 연구에서는 통계적학습에서 좋은 성능을 보이는 최소제곱 서포터벡터기계를 준지도분류에 적용시키는 방법을 제안한다. 모의실험을 통해 제안된 방법이 라벨 없는 자료를 잘 활용하는 것을 볼 수 있었다.

최소자승법을 이용한 해저고정형 선배열 센서의 3차원 배열형상 추정기법 연구 (A Study on Three Dimensional Array Shape Calibration of the Bottom Mounted Array by Iterative Least Squares)

  • 최재용;손권
    • 한국음향학회지
    • /
    • 제23권5호
    • /
    • pp.370-375
    • /
    • 2004
  • 본 논문에서는, 미지 위치의 원거리 능동음원을 이용하여 해저고정형 선배열 센서에 대한 3차원 배열형상추정 기법을 제안하였다. 본 연구는 센서에 도달하는 음파가 평면파라는 가정 하에 기준센서와 나머지 센서간의 음파도달 시간지연, 센서위치 및 입사각과의 선형방정식의 해를 반복적 최소자승법에 의해 구함으로서 센서위치 추정이 가능하다. 제안된 기법의 타당성을 검증하기 위해 컴퓨터 시뮬레이션과 실제 해상실험을 수행하였으며, 이론적 분석을 통하여 음원 위치 분포에 따른 성능 및 시간지연 오차에 따른 센서위치 추정 성능을 분석하였다.