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

검색결과 535건 처리시간 0.027초

Non-destructive assessment of the three-point-bending strength of mortar beams using radial basis function neural networks

  • Alexandridis, Alex;Stavrakas, Ilias;Stergiopoulos, Charalampos;Hloupis, George;Ninos, Konstantinos;Triantis, Dimos
    • Computers and Concrete
    • /
    • 제16권6호
    • /
    • pp.919-932
    • /
    • 2015
  • This paper presents a new method for assessing the three-point-bending (3PB) strength of mortar beams in a non-destructive manner, based on neural network (NN) models. The models are based on the radial basis function (RBF) architecture and the fuzzy means algorithm is employed for training, in order to boost the prediction accuracy. Data for training the models were collected based on a series of experiments, where the cement mortar beams were subjected to various bending mechanical loads and the resulting pressure stimulated currents (PSCs) were recorded. The input variables to the NN models were then calculated by describing the PSC relaxation process through a generalization of Boltzmannn-Gibbs statistical physics, known as non-extensive statistical physics (NESP). The NN predictions were evaluated using k-fold cross-validation and new data that were kept independent from training; it can be seen that the proposed method can successfully form the basis of a non-destructive tool for assessing the bending strength. A comparison with a different NN architecture confirms the superiority of the proposed approach.

공구이동궤적 모델을 이용한 5축 페이스밀링 가공데이터 생성 (Five-axis CL Data Generation by Considering Tool Swept Surface Model in Face Milling of Sculptured Surface)

  • 이정근;박정환
    • 한국CDE학회논문집
    • /
    • 제9권1호
    • /
    • pp.35-43
    • /
    • 2004
  • It is well known that the five-axis machining has advantages of tool accessibility and machined surface quality when compared with conventional three-axis machining. Traditional researches on the five-axis tool-path generation have addressed interferences such as cutter gouging, collision, machine kinematics and optimization of a CL(cutter location) or a cutter position. In the paper it is presented that optimal CL data for a face-milling cutter moving on a tool-path are obtained by incorporating TSS(tool swept surface) model. The TSS model from current CL position to the next CL position is constructed based on machine kinematics as well as cutter geometry, with which the deviation from the design surface can be computed. Then the next CC(cutter-contact) point should be adjusted such that the deviation conforms to given machining tolerance value. The proposed algorithm was implemented and applied to a marine propeller machining, which proved effective from a quantitative point of view. In addition, the algorithm using the TSS can also be applied to avoid cutter convex interferences in general three-axis NC machining.

메쉬 그룹화를 이용한 충돌 검출 알고리즘 (Collision detection algorithm by using mesh grouping)

  • 박종섭;장태정
    • 디지털콘텐츠학회 논문지
    • /
    • 제19권1호
    • /
    • pp.199-204
    • /
    • 2018
  • 본 논문에서는 가상 공간에서 객체와의 상호 작용을 위한 빠른 충돌 감지 방법을 제안하였다. 먼저 메쉬 그룹화 단계에서는, 전체 공간을 일정한 크기의 소공간들로 분할하고, 각각의 소공간에 속하는 메쉬들에 대하여 이들을 모두 포함하는 최소의 기본 입체도형(육면체 혹은 구)의 위치와 크기를 정함으로써 그룹화한다. 충돌 검출 단계에서는, HIP(Haptic Interface Point)가 어떤 그룹을 대표하는 입체도형 내부에 들어 있는지를 검사하여 특정 입체도형과의 충돌이 확인되면 해당 그룹의 메쉬들만을 대상으로 실제 충돌이 일어난 메쉬를 찾는다. 본 논문에서 제안한 방법을 적용한 경우와 적용하지 않은 경우의 연산시간을 측정 및 비교함으로써 제안한 알고리즘의 효용성을 확인하였다.

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.

거리 형태 히스토그램을 이용한 이동로보트의 장애물 회피 주행 (Obstacle Avoidance Navigation Using Distance Profile Histogram)

  • 김현태;노흥식;조영완;박민용
    • 전자공학회논문지B
    • /
    • 제33B권12호
    • /
    • pp.1-12
    • /
    • 1996
  • A new local path planning algorithm using DPH (distance profile histogram) is suggested in this paper. The proposed method makes a grid type world map using distance values from multiple ultrasonic sensors and genrates local points through which the mobile robot can avoid obstcles safely. The DPH (distance profile historgram) represents geometrical arrangement of obstacles around the robot in the local polar coordinate system which is assumed to be atached to the robot. To control robot's navigation, a three-layered control structure is adopted. The proposed local path planning algorithm is placed on the top level. And a point-to-point translation controller takes the middle level. The bottom level consists of a velcoity servo and sonar driver modules which take charge of driving physical hardwares. The validity of the propsoed method is demonstated through several experiments.

  • PDF

웹 카메라에서 블록정합기법을 이용한 헤어커팅 포인트 분석 및 개선 (Haircutting Point Analysis and Improvement the Block Matching Algorithm Using in Web Camera)

  • 강남순
    • 디지털산업정보학회논문지
    • /
    • 제5권4호
    • /
    • pp.189-197
    • /
    • 2009
  • This paper suggests the system for searching and application is to be in combination between existing hair art area and Image/Video processing area. This proposed system usually saves various hair types into a database, then, users send images of their face over the internet by using WebCam. Finally, they can find the hair types for users. Hair cutting is technology that form draft to make hair style. Man cut must decide how in image of sinciput, image of side bean curd, after lower image must operate. Silhouette is produced as is different by change of this three places. Customer increases in the beauty salon and beauty salon chain being changed, research about beauty art is necessary point of time. In this treatise, our country of when swim and operate haircut about problem that happen sample survey and analysis.

형상 공간을 이용한 다관절 로보트의 충돌 회피 경로 계획 (Collision-Free Path Planning of Articulated Robot using Configuration Space)

  • 김정훈;최진섭;강희용;김동원;양성모
    • 한국자동차공학회논문집
    • /
    • 제2권6호
    • /
    • pp.57-65
    • /
    • 1994
  • A collision-free path planning algorithm between an articulated robot and polyhedral obstacles using configuration space is presented. In configuration space, a robot is treated as a point and obstacles are treated as grown forbidden regions. Hence path planning problem is transformed into moving a point from start position to goal position without entering forbidden regions. For mapping to 3D joint space, slice projection method is used for first revolute joint and inverse kinematics is used for second and third revolute joint considering kinematic characteristics of industrial robot. Also, three projected 2D joint spaces are used in search of collision-free path. A proper example is provided to illustrate the proposed algorithm.

  • PDF

Finite motion analysis for multifingered robotic hand considering sliding effects

  • Chong, Nak-Young;Choi, Donghoon;Suh, Il-Hong
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1992년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 19-21 Oct. 1992
    • /
    • pp.370-375
    • /
    • 1992
  • An algorithm for the notion planning of the robotic hand is proposed to generate finite displacements and changes in orientation of objects by considering sliding effects between the fingertips and the object at contact points. Specifically, an optimization problem is firstly solved to find minimum contact forces and minimum joint velocities to impart a desired motion to the object at each time step. Then the instantaneous relative velocity at the contact point is found by determining velocities of the fingertip and the velocity of the object at the contact point. Finally time derivatives of the surface variables and contact angle of the fingertip and the object at the present time step is computed using the Montana's contact equation to find the contact parameters of the fingertip and the object at the next time step. To show the validity of the proposed algorithm, a numerical example is illustrated by employing the robotic hand manipulating a sphere with three fingers each of which has four joints.

  • PDF

태양광 시스템에서의 새로운 MPPT 알고리즘 제안 (A Suggestion of New MPPT Algorithm in the PV system)

  • 이경수;정영석;소정훈;유권종;최재호
    • 전력전자학회논문지
    • /
    • 제10권1호
    • /
    • pp.21-28
    • /
    • 2005
  • 일사량과 온도에 의해 태양광 어레이의 최대전력동작점(MPOP)이 결정되며 태양광발전시스템에서 중요하게 고려해야 할 사항 중 하나는 최대전력동작점을 정확하게 추종하도록 하는 것이다. 과거부터 여러 최대전력추종제어기법(MPPT)들이 사용되어 왔지만, 마이크로프로세서를 이용한 최대전력추종제어기법은 다른 태양광 어레이와의 호환성, 적응성 측면에서 유리하다. 이 논문에서는 기존의 P&O, IncCond 알고리즘에 대한 분석과 새로운 히스테리시스밴드 변동 기법을 제안한다. 새로 제안된 제어기법의 우수성을 나타내주기 위하여 저자는 3가지의 기준을 만들어서 각 기법을 비교 및 분석하였다. 첫째로, 정상상태에서의 각 기법의 파형을 살펴보았고, 다음으로 일사량을 급변하였을 경우의 파형을 나타내었고, 마지막으로 일사량에 따른 MPPT 추종효율을 보였다. MPPT 시뮬레이션과 실험은 부스트 컨버터에서 수행하였다.

3D 점 데이터 그리딩을 위한 고성능 병렬처리 기법 (A Parallel Approach for Accurate and High Performance Gridding of 3D Point Data)

  • 이창섭;;이희진;오상윤
    • 정보처리학회논문지:컴퓨터 및 통신 시스템
    • /
    • 제3권8호
    • /
    • pp.251-260
    • /
    • 2014
  • 3D 점 데이터는 높은 정확성을 가진 사물의 표면 정보 데이터로 다양한 분야에서 사용되고 있으며, 특히 지리학에서 지형 파악과 분석에 많이 사용되고 있다. 일반적으로 3D 점 데이터의 Gridding 과정을 거치게 되는데 이는 불연속적인 점 데이터를 일정한 좌표 값으로 만드는 과정으로 긴 실행 시간과 높은 비용이 필요하다. 특히 Gridding 과정 중 보간 작업을 위해서 Kriging이 높은 정확성으로 주목받고 있지만 처리과정이 복잡하고 연산이 많아 처리속도가 상대적으로 느리기 때문에 많이 사용되지 않고 있다. 본 논문에서는 Gridding을 고성능으로 처리하기위해 Kriging 연산 과정을 병렬화했으며 격자 자료구조를 MapReduce 패러다임에 맞게 변형하여 Kriging에 적용하였다. 실험은 항공 LiDAR 데이터 약 1.6백만 개와 4.3백만 개의 점 데이터를 이용해서 제안한 MapReduce 구조에 적용하였고, 그 결과 3대의 이기종 클러스터에서 전체 실행시간이 순차적 프로그램에 비해 최대 3.4배 단축하였다.