• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1988년도 한국자동제어학술회의논문집(국제학술편); 한국전력공사연수원, 서울; 21-22 Oct. 1988
• /
• pp.987-992
• /
• 1988

In recent years there has been much interest in using light-weight, higher performance arms for both commercial and space-based applications, leading to the research of flexible robot manipulator. This paper is concerned with the trajectory control of a flexible arm using inverse dynamics. Inverse problems are important to robot control and programming, since they allow one to find the appropriate inputs necessary for producing the desired outputs. The input is obtained by the numerical inversion of Laplace transformation in the time domain. And we attempt the trajectory control experiment of a flexible arm using this calculated input. In this article we compare the numerical results with experimental results and can find good agreement. The results make clear that this technique has the good potential for the control of tip trajectory of flexible robot arms.

• 한국생산제조학회지
• /
• 제8권3호
• /
• pp.66-75
• /
• 1999

This paper is concerned with a analysis of noise by inverse problem available for analyzing the two and three-dimensional acoustic field problems. The noise of analysis considered in this study can be reduced to an optimum problem to find the optimal set of parameters defining the vibrating state of noise source surfaces. The optimal set of parameters are searched by the standard optimization procedure minimizing the square sum of the residuals between the measured and computed quantities of sound pressure at some points in the acoustic field. Computation is carried out for typical examples in which the noise sources are located on the infinite plane. It is demonstrated that the noise of analysis can be effectively made by using the sensitive reference data.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1995년도 Proceedings of the Korea Automation Control Conference, 10th (KACC); Seoul, Korea; 23-25 Oct. 1995
• /
• pp.65-68
• /
• 1995

This paper describes trajectory generation of a riobot arm by self-organizing neural networks. These neural networks are based on competitive learning without a teacher and this algorithm which is suitable for problems in which solutions as teaching signal cannot be defined-e.g. inverse dynamics analysis-is adopted to the trajectory generation problem of a robot arm. Utility of unsupervised learning algorithm is confirmed by applying the approximated solution of each joint calculated through learning to an actual robot arm in giving the experiment of tracking for reference trajectory.

• 대한전자공학회논문지
• /
• 제25권10호
• /
• pp.1141-1149
• /
• 1988

공간영역에서 모멘트방법을 써서 2차원 유전체의 복소 유전율 분포를 재구성 하기 위해 개발된 역산란 방법을 파수영역에서 사용할 수 있도록 개선하였다. 이 역산란 방법은 개념적으로 간단하고, 역산란 문제에 내재한 ill-posedness을 해결할 수 있는 여러 가지 적절한 방안을 강구할 수 있도록 한다.

• 한국인구학
• /
• 제12권2호
• /
• pp.56-68
• /
• 1989

The methodology in historical demography comprises the three core areas the family reconstitution method at the Institut National d' Ftudes Demographiques(I.N.E.D), the back projection at the Cambridge Group for the History of PopuJation and Social Struc-ture(HPSS). and the household-pattern analysis at the Cambridge Group and at the California Institute of Technology. The paper presents an outline of the family reconstitu-tion method and discusses the problems, both theoretical and methodological, arising from the problematic back projection vis-a-vis the usual inverse projection developed by Ronald D. Lee at Berkeley. Recent developments in the tield of the generalized inverse projection method designed 10 supplement the defects in the back projection and the inverse projection are presented. and for ease of explanation of the parish register data for the family reconstitution form (FRE). pre-modern Korean household register data are presented along with the parish register data of England and Wales that constitute the backbone of historical demography in pre-modern Europe. Possibilities of exploring the household pattern analysis method based on the Laslett-Hammel classification scheme for the mid-eighteenth-century Korean household register data are suggested.

• 한국항공우주학회지
• /
• 제30권7호
• /
• pp.98-104
• /
• 2002

본 연구에서는 역섭동법을 이용한 손상탐지의 효율을 개선하는 목적으로 시스템 축소기법을 사용하였다. 이 방법은 손상탐지의 미측정 자유도를 측정된 자유도로 변환하여 역섭동법의 계산효율이 향상되는 장점이 있으나, 부정확한 자유도의 변환으로 수치적인 안정성이 저하될 수 있다. 따라서 자유도 변환식을 수치해법 과정에서 반복적으로 개선하는 방법과, 매우 정확한 accelerated improved reduced system (AIRS) 축소법의 사용으로 역섭동법의 수치적 불안정성을 해결하였다.

• 대한기계학회논문집B
• /
• 제37권6호
• /
• pp.539-544
• /
• 2013

본 연구는 공개 해석프로그램과 상용 최적화 프로그램을 연계하여 역열전도 문제를 해결하는 방법론을 제시하고 구현하였다. 이 해석 방법은 구동이 간단하며, 내부 코딩 없이도 구동이 가능하기 때문에 다른 연구자들도 쉽게 역열전도 문제를 재현할 수 있다.

• 한국항공운항학회지
• /
• 제16권2호
• /
• pp.21-27
• /
• 2008

An inverse method is introduced to construct the problem for the error analysis of the numerical solution of initial value problem. These problems constructed through this method have a known exact solution, even though analytical solutions are generally not obtainable. The process leading to the exact solution makes use of an initially available approximate numerical solution. A smooth interpolation of the approximate solution is forced to exactly satisfy the differential equation by analytically deriving a small forcing function to absorb all of the errors in the interpolated approximate solution. Using this special case exact solution, it is possible to investigate the relationship between global errors of a candidate numerical solution process and the associated tuning parameters for a given problem. Under the assumption that the original differential equation is well-posed with respect to the small perturbations, we thereby obtain valuable information about the optimal choice of the tuning parameters and the achievable accuracy of the numerical solution.

• 자연과학논문집
• /
• 제8권2호
• /
• pp.9-11
• /
• 1996

Dirichlet 경계조건을 갖는 Laplace 고유치방정식의 고유치를 구하는 데 복합마디방법을 이용하였다. 유한차분법을 적용하여 행렬 고유치방정식을 만들고 이 방정식의 고유치를 구하기 위하여 역거듭제곱방법과 전체복합마디법을 사용하였다. 그 결과 고유치를 기존의 방법보다 더욱 빠르게 구할 수 있었다.

• Management Science and Financial Engineering
• /
• 제18권2호
• /
• pp.19-22
• /
• 2012

In the bin-packing problem, we deal with how to pack the items by using a minimum number of bins. In the inverse bin-packing number problem, IBPN for short, we are given a list of items and a fixed number of bins. The objective is to perturb at the minimum cost the item-size vector so that all items can be packed into the prescribed number of bins. We show that IBPN is NP-hard and provide an approximation algorithm. We also consider a variant of IBPN where the prescribed solution value should be returned by a pre-selected specific approximation algorithm.