• 제목/요약/키워드: LRF

검색결과 83건 처리시간 0.023초

MCMC 방법을 이용한 자율주행 차량의 보행자 탐지 및 추적방법 (Pedestrian Detection and Tracking Method for Autonomous Navigation Vehicle using Markov chain Monte Carlo Algorithm)

  • 황중원;김남훈;윤정연;김창환
    • 로봇학회논문지
    • /
    • 제7권2호
    • /
    • pp.113-119
    • /
    • 2012
  • In this paper we propose the method that detects moving objects in autonomous navigation vehicle using LRF sensor data. Object detection and tracking methods are widely used in research area like safe-driving, safe-navigation of the autonomous vehicle. The proposed method consists of three steps: data segmentation, mobility classification and object tracking. In order to make the raw LRF sensor data to be useful, Occupancy grid is generated and the raw data is segmented according to its appearance. For classifying whether the object is moving or static, trajectory patterns are analysed. As the last step, Markov chain Monte Carlo (MCMC) method is used for tracking the object. Experimental results indicate that the proposed method can accurately detect moving objects.

실외 자율주행 로봇을 위한 다수의 동적 장애물 탐지 및 선속도 기반 장애물 회피기법 개발 (Multiple Target Tracking and Forward Velocity Control for Collision Avoidance of Autonomous Mobile Robot)

  • 김선도;노치원;강연식;강성철;송재복
    • 제어로봇시스템학회논문지
    • /
    • 제14권7호
    • /
    • pp.635-641
    • /
    • 2008
  • In this paper, we used a laser range finder (LRF) to detect both the static and dynamic obstacles for the safe navigation of a mobile robot. LRF sensor measurements containing the information of obstacle's geometry are first processed to extract the characteristic points of the obstacle in the sensor field of view. Then the dynamic states of the characteristic points are approximated using kinematic model, which are tracked by associating the measurements with Probability Data Association Filter. Finally, the collision avoidance algorithm is developed by using fuzzy decision making algorithm depending on the states of the obstacles tracked by the proposed obstacle tracking algorithm. The performance of the proposed algorithm is evaluated through experiments with the experimental mobile robot.

펄스형 레이저 거리측정기를 위한 거리계산 카운터 개발

  • 유병헌;조성학;장원석;김재구;황경현
    • 한국정밀공학회:학술대회논문집
    • /
    • 한국정밀공학회 2004년도 춘계학술대회 논문요약집
    • /
    • pp.180-180
    • /
    • 2004
  • 정밀한 계측의 필요성이 높아지면서 레이저는 그 신뢰성과 사용 편의성으로 인해 거리측정에도 높은 활용을 보이고 있다. 레이저 거리측정기(laser range finder, LRF)의 원리는 20ns 미만의 짧은 레이저 펄스를 표적에 발사한 후 반사되어 돌아오는 신호의 시간과 빛의 속도를 곱하여 거리를 계산하는 방식이다. 이러한 반사펄스(pulse-echo techniques)법은 수m-수백만 km까지의 거리측정에 사용되는 방식으로서 정밀하고 빠른 측정이 가능할 뿐 아니라 단지 목표물을 확인하고 측정버튼을 누름으로써 결과를 얻을 수 있는 사용 편의성을 장점으로 한다.(중략)

  • PDF

SSA를 이용한 일 단위 물수요량 단기 예측에 관한 연구 (A Study of Short Term Forecasting of Daily Water Demand Using SSA)

  • 권현한;문영일
    • 상하수도학회지
    • /
    • 제18권6호
    • /
    • pp.758-769
    • /
    • 2004
  • The trends and seasonalities of most time series have a large variability. The result of the Singular Spectrum Analysis(SSA) processing is a decomposition of the time series into several components, which can often be identified as trends, seasonalities and other oscillatory series, or noise components. Generally, forecasting by the SSA method should be applied to time series governed (may be approximately) by linear recurrent formulae(LRF). This study examined forecasting ability of SSA-LRF model. These methods are applied to daily water demand data. These models indicate that most cases have good ability of forecasting to some extent by considering statistical and visual assessment, in particular forecasting validity shows good results during 15 days.

플로우 네트워크를 이용한 지능형 로봇의 경로계획 (Path Planning for an Intelligent Robot Using Flow Networks)

  • 김국환;김형;김병수;이순걸
    • 로봇학회논문지
    • /
    • 제6권3호
    • /
    • pp.255-262
    • /
    • 2011
  • Many intelligent robots have to be given environmental information to perform tasks. In this paper an intelligent robot, that is, a cleaning robot used a sensor fusing method of two sensors: LRF and StarGazer, and then was able to obtain the information. Throughout wall following using laser displacement sensor, LRF, the working area is built during the robot turn one cycle around the area. After the process of wall following, a path planning which is able to execute the work effectively is established using flow network algorithm. This paper describes an algorithm for minimal turning complete coverage path planning for intelligent robots. This algorithm divides the whole working area by cellular decomposition, and then provides the path planning among the cells employing flow networks. It also provides specific path planning inside each cell guaranteeing the minimal turning of the robots. The proposed algorithm is applied to two different working areas, and verified that it is an optimal path planning method.