• 제목/요약/키워드: Automatic Path Planning

검색결과 47건 처리시간 0.025초

이중 심층 Q 네트워크 기반 장애물 회피 경로 계획 (Path Planning with Obstacle Avoidance Based on Double Deep Q Networks)

  • 자오 용지앙;첸센폰;성승제;허정규;임창균
    • 한국전자통신학회논문지
    • /
    • 제18권2호
    • /
    • pp.231-240
    • /
    • 2023
  • 심층 강화 학습(Deep Reinforcement Learning)을 사용한 경로 계획에서 장애물을 자동으로 회피하기 위해 로봇을 학습시키는 일은 쉬운 일이 아니다. 많은 연구자가 DRL을 사용하여 주어진 환경에서 로봇 학습을 통해 장애물 회피하여 경로 계획을 수립하려는 가능성을 시도하였다. 그러나 다양한 환경에서 로봇과 장착된 센서의 오는 다양한 요인 때문에 주어진 시나리오에서 로봇이 모든 장애물을 완전히 회피하여 이동하는 것을 실현하는 일은 흔치 않다. 이러한 문제 해결의 가능성과 장애물을 회피 경로 계획 실험을 위해 테스트베드를 만들었고 로봇에 카메라를 장착하였다. 이 로봇의 목표는 가능한 한 빨리 벽과 장애물을 피해 시작점에서 끝점까지 도달하는 것이다. 본 논문에서는 벽과 장애물을 회피하기 위한 DRL의 가능성을 검증하기 위해 이중 심층 Q 네트워크(DDQN)를 제안하였다. 실험에 사용된 로봇은 Jetbot이며 자동화된 경로 계획에서 장애물 회피가 필요한 일부 로봇 작업 시나리오에 적용할 수 있을 것이다.

실내 환경에서의 경비로봇용 주행시스템 (A Navigation System for a Patrol Robot in Indoor Environments)

  • 최병욱;이영민;박정호;신동관
    • 로봇학회논문지
    • /
    • 제1권2호
    • /
    • pp.117-124
    • /
    • 2006
  • In this paper, we develope the navigation system for patrol robots in indoor environment. The proposed system consists of PDA map modelling, a localization algorithm based on a global position sensor and an automatic charging station. For the practical use in security system, the PDA is used to build object map on the given indoor map. And the builded map is downloaded to the mobile robot and used in path planning. The global path planning is performed with a localization sensor and the downloaded map. As a main controller, we use PXA270 based hardware platform in which embedded linux 2.6 is developed. Data handling for various sensors and the localization algorithm are performed in the linux platform. Also, we implemented a local path planning algorithm for object avoidance with ultra sonar sensors. Finally, for the automatic charging, we use an infrared ray system and develop a docking algorithm. The navigation system is experimented with the two-wheeled mobile robot using North-Star localization system.

  • PDF

다차원 경로격자지도를 이용한 주차 경로계획 알고리즘 (Path Planning for Parking using Multi-dimensional Path Grid Map)

  • 최종안;송재복
    • 로봇학회논문지
    • /
    • 제12권2호
    • /
    • pp.152-160
    • /
    • 2017
  • Recent studies on automatic parking have actively adopted the technology developed for mobile robots. Among them, the path planning scheme plans a route for a vehicle to reach a target parking position while satisfying the kinematic constraints of the vehicle. However, previous methods require a large amount of computation and/or cannot be easily applied to different environmental conditions. Therefore, there is a need for a path planning scheme that is fast, efficient, and versatile. In this study, we use a multi-dimensional path grid map to solve the above problem. This multi-dimensional path grid map contains a route which has taken a vehicle's kinematic constraints into account; it can be used with the $A^*$ algorithm to plan an efficient path. The proposed method was verified using Prescan which is a simulation program based on MATLAB. It is shown that the proposed scheme can successfully be applied to both parallel and vertical parking in an efficient manner.

자동 미장 로봇을 스위핑 경로 계획 (A planning of Sweeping Path for a Smearing Robot)

  • 현웅근;박상규
    • 제어로봇시스템학회논문지
    • /
    • 제7권1호
    • /
    • pp.1187-1195
    • /
    • 2001
  • This paper presents a sweeping path planning algorithm for an autonomous smearing robot. An automatic planner generates a sweeping path pattern by proposed five basic procedures. This algorithm rocog-nizes obstacle on the architectural CAD draft and generates subgoals as tracking points which executes the area filling task based on heuristic approach. A sweeping path is planned by sequentially connecting the track-ing points in such a way that(1) the connected line segments should not be crossed, (2) the total tracking points should be as short as possible, and (3) the tracking line should not pass through the obstacle, Feasibility of the developed techniques has been demonstrated on a real architectural CAD draft.

  • PDF

Z-Map 모델을 이용한 3차원 CNC 가공계획 및 절삭시뮬레이션에 관한 연구 (A Study on the 3-D CNC Cutting Planning and Simulation by Z-Map Model)

  • 송수용;김석일
    • 한국정밀공학회:학술대회논문집
    • /
    • 한국정밀공학회 1994년도 추계학술대회 논문집
    • /
    • pp.683-688
    • /
    • 1994
  • Recently, the Z-Map model has been used widely to represent the three dimensional geometric shape and to achieve the cross-section and point evaluation of the shape. In this paper, the CNC cutting planning and simulation modules for product with three dimensional geometric shape are realized based on the Z-Map model. The realized system has the various capabilities related to the automatic generation of tool path for the rough and finish cutting processes, the automatic elimination of overcut, the automatic generation of CNC program for a machining center and the cutting simulation. Especially, the overcut-free tool path is obtained by using the CL Z-Map models which are composed of the offset surfaces of the geometric shape of product.

  • PDF

검사지연시간을 고려한 SMT 검사기의 통합적 경로 계획 알고리즘 (Unified Approach to Path Planning Algorithm for SMT Inspection Machines Considering Inspection Delay Time)

  • 이철희;박태형
    • 제어로봇시스템학회논문지
    • /
    • 제21권8호
    • /
    • pp.788-793
    • /
    • 2015
  • This paper proposes a path planning algorithm to reduce the inspection time of AOI (Automatic Optical Inspection) machines for SMT (Surface Mount Technology) in-line system. Since the field-of-view of the camera attached at the machine is much less than the entire inspection region of board, the inspection region should be clustered to many groups. The image acquisition time depends on the number of groups, and camera moving time depends on the sequence of visiting the groups. The acquired image is processed while the camera moves to the next position, but it may be delayed if the group includes many components to be inspected. The inspection delay has influence on the overall job time of the machine. In this paper, we newly considers the inspection delay time for path planning of the inspection machine. The unified approach using genetic algorithm is applied to generates the groups and visiting sequence simultaneously. The chromosome, crossover operator, and mutation operator is proposed to develop the genetic algorithm. The experimental results are presented to verify the usefulness of the proposed method.

자동주차를 위한 차량형 자율주행 로봇에 적합한 경로계획법의 비교분석 (Comparisonal Analysis of Path Planning Methods for Automatic Parking Control of a Car-Like Mobile Robot)

  • 권현기;정우진
    • 제어로봇시스템학회논문지
    • /
    • 제18권3호
    • /
    • pp.267-274
    • /
    • 2012
  • We proposed the KPP (Korea university Path Planner) in our previous works. The KPP is the path planning scheme of a car-like mobile robot in parking environment. The objective of this paper is to investigate the advantage of the KPP through the quantitative and qualitative analysis compared with conventional RRT. For comparison, we proposed travel time for performance index. This paper shows that the KPP shows outstanding performances from the viewpoint of travel time and computational efficiency compared with RRT.

Obstacles modeling method in cluttered environments using satellite images and its application to path planning for USV

  • Shi, Binghua;Su, Yixin;Zhang, Huajun;Liu, Jiawen;Wan, Lili
    • International Journal of Naval Architecture and Ocean Engineering
    • /
    • 제11권1호
    • /
    • pp.202-210
    • /
    • 2019
  • The obstacles modeling is a fundamental and significant issue for path planning and automatic navigation of Unmanned Surface Vehicle (USV). In this study, we propose a novel obstacles modeling method based on high resolution satellite images. It involves two main steps: extraction of obstacle features and construction of convex hulls. To extract the obstacle features, a series of operations such as sea-land segmentation, obstacles details enhancement, and morphological transformations are applied. Furthermore, an efficient algorithm is proposed to mask the obstacles into convex hulls, which mainly includes the cluster analysis of obstacles area and the determination rules of edge points. Experimental results demonstrate that the models achieved by the proposed method and the manual have high similarity. As an application, the model is used to find the optimal path for USV. The study shows that the obstacles modeling method is feasible, and it can be applied to USV path planning.

자율 이동로봇의 경로추정을 위한 적응적 공간좌표 검출 기법 (Adaptive Spatial Coordinates Detection Scheme for Path-Planning of Autonomous Mobile Robot)

  • 이정석;고정환
    • 전기학회논문지P
    • /
    • 제55권2호
    • /
    • pp.103-109
    • /
    • 2006
  • In this paper, the detection scheme of the spatial coordinates based on stereo camera for a intelligent path planning of an automatic mobile robot is proposed. In the proposed system, face area of a moving person is detected from a left image among the stereo image pairs by using the YCbCr color model and its center coordinates are computed by using the centroid method and then using these data, the stereo camera embedded on the mobile robot can be controlled for tracking the moving target in real-time. Moreover, using the disparity mad obtained from the left and right images captured by the tracking-controlled stereo camera system and the perspective transformation between a 3-D scene. and an image plane, depth information can be detected. Finally, based-on the analysis of these calculated coordinates, a mobile robot system is derived as a intelligent path planning and a estimation.

Z-Map모델을 이용한 3차원 CNC가공계획 및 절삭시뮬레이션에 관한 연구 (A study on the 3-D CNC cutting planning and simulation by Z-Map model)

  • 송수용;김석일
    • 한국정밀공학회지
    • /
    • 제13권5호
    • /
    • pp.115-121
    • /
    • 1996
  • Recently, the Z-Map model has been used widely to represent the three dimensional geometric shape and to achieve the cross-section and point evaluation of the shape. In this paper, the CNC cutting planning and simulation modules for product with three dimensional geometric shape are realized based on the Z-Map model. The realized system has the various capabilities related to the automatic generation of tool path for the rough and finish cutting processes, the automatic elimination of overcut, the automatic generation of CNC program for a machining center and the cutting simulation. Especially, the overcut-free tool path is obtained by using the CL Z-Map models which are composed of the offset surfaces of the geometric shape of product.

  • PDF