• 제목/요약/키워드: Park Path

검색결과 2,294건 처리시간 0.031초

On Finding a Convenient Path in the Hierarchical Road Network

  • Sung, Ki-Seok;Park, Chan-Kyoo;Lee, Sang-Wook;Doh, Seung-Yong;Park, Soon-Dal
    • Management Science and Financial Engineering
    • /
    • 제12권2호
    • /
    • pp.87-110
    • /
    • 2006
  • In a hierarchical road network, all roads can be classified according to their attributes such as speed limit, number of lanes, etc. By splitting the whole road network into the subnetworks of the highlevel and low-level roads, we can reduce the size of the network to be calculated at once, and find a path in the way that drivers usually adopt when searching out a travel route. To exploit the hierarchical property of road networks, we define a convenient path and propose an algorithm for finding convenient paths. We introduce a parameter indicating the driver's tolerance to the difference between the length of a convenient path and that of a shortest convenient path. From this parameter, we can determine how far we have to search for the entering and exiting gateway. We also propose some techniques for reducing the number of pairs of entries and exits to be searched in a road network. A result of the computational experiment on a real road network is given to show the efficiency of the proposed algorithm.

경로 서명 : XML문서 검색을 위한 경로-지향 질의처리 시스템 (Path Signatures : Path-oriented Query Processing System for XML document Retrieval)

  • 박희숙;박주현;조우현
    • 한국정보통신학회논문지
    • /
    • 제11권7호
    • /
    • pp.1311-1317
    • /
    • 2007
  • 최근 인터넷의 폭발적인 성장과 인기로 인하여, 인터넷상에서 정보의 교환이 매우 빠르게 증가하고 있다. 또한 XML은 인터넷상에서 정보교환의 수단인 동시에 표준으로서 자리를 잡아 가고 있다. 따라서 본 논문에서는 경로-지향 질의어를 평가하기 위한 새로운 인덱싱 기법과 사용자들에게 편리한 XML문서 검색 결과를 제공하기 위한 경로-지향 질의 처리 시스템의 설계 및 구현을 제공한다. 제안된 인덱싱 기법은 XML문서의 검색 성능을 향상시키기 위하여 이진 트라이 구조와 경로서명 파일을 결합하였다.

과수원 스피드스프레이어의 작업 경로 최적화를 위한 오더 피킹 알고리즘 (Order-picking Algorithm for Optimizing Operation Path of Orchard Speed Sprayer)

  • 박두산;황규영;조성인
    • Journal of Biosystems Engineering
    • /
    • 제33권1호
    • /
    • pp.51-57
    • /
    • 2008
  • The purpose of this study was to develop an optimal path planning program for autonomous speed sprayer in orchard. A digital map which contained coordinate information and entity information including height, width, radius of main stem, and disease of a trees was developed to build an optimal path. The digital map, dynamic programming and order-picking algorithm were used for planning an optimal path for autonomous speed sprayers. When this algorithm applied to rectangular-shaped orchards to travel whole trees, the developed program planned the same working path and same traveling distance as those of created by conventional method. But for irregular-shaped orchards, developed program planned differently and 5.06% shorter path than conventional method. When applied to create path for multi-selected trees, irregular-shaped orchards showed 13.9% shorter path and also rectangular-shaped orchards showed 9.1% shorter path. The developed program always planned shorter path than the path created by conventional method despite of variation of shape of orchards.

레이저 패턴 가공용 스캔 공구경로 생성 (Scan Tool-Path Generation for Laser Pattern Machining)

  • 이창호;박상철
    • 한국CDE학회논문집
    • /
    • 제16권4호
    • /
    • pp.300-304
    • /
    • 2011
  • This paper proposes an approach to generate tool-path for laser pattern machining. Considering the mechanical structure of a laser pattern machine, it is quite similar to that of a 2D milling machine. Based on the observation, one may try to utilize the tool-path generation methodologies of 2D milling for the laser pattern machining. However, it is not possible to generate tool-path without considering the technological requirements of laser pattern machining which are different from those of 2D milling. In this paper, we identify the technological requirement of laser pattern machining, and propose a proper tool-path generation methodology to satisfy the technological requirements. For the efficient generation of tool-path, this paper proposes a tool-path element computation method, which is based on the concept of a monotone chain.

카디널스플라인을 이용한 자율이동로봇의 곡선경로 생성방법 (Smooth Path Planning Method for Autonomous Mobile Robots Using Cardinal Spline)

  • 윤희상;박태형
    • 전기학회논문지
    • /
    • 제59권4호
    • /
    • pp.803-808
    • /
    • 2010
  • We propose a smooth path planning method for autonomous mobile robots. Due to nonholonomic constraints by obstacle avoidance, the smooth path planning is a complicated one. We generate smooth path that is considered orientation of robot under nonholonomic constraints. The proposed smooth planning method consists of two steps. Firstly, the initial path composed of straight lines is obtained from V-graph by Dijkstra's algorithm. Then the initial path is transformed by changing the curve. We apply the cardinal spline into the stage of curve generation. Simulation results show a performance of proposed smooth path planning method.

잔류진동 감소를 위한 탄성 로봇 매니퓨레이터 경로설계 및 섭동적응제어의 적용 (Flexible Robot Manipulator Path Design and Application of Perturbation Adaptive Control to Reduce Residual Vibration)

  • 박경조
    • 동력기계공학회지
    • /
    • 제7권1호
    • /
    • pp.34-41
    • /
    • 2003
  • A method is presented for generating the path which significantly reduces residual vibration of a flexible robot manipulator and applying control theory to track the desired path. The desired path is optimally designed so that the system completes the required move with minimum residual vibration. A closed loop control theory is applied to track the planned path in the case of load variation. Specifically, it is desired that the optimally designed path has a better trajectory tracking capabilities during the residual vibration over the cycloidal path, in various cases of load. Perturbation adaptive control is used as closed loop control scheme. A planar two link manipulator is used to evaluate this method.

  • PDF

An Efficient Method on Constructing $ extsc{k}$-Minimal Path Sets for Flow Network Reliability

  • Lee, Seung-Min;Park, Dong-Ho
    • Journal of the Korean Statistical Society
    • /
    • 제29권3호
    • /
    • pp.297-306
    • /
    • 2000
  • An efficient method of constructing $textsc{k}$-minimal path sets to evaluate the reliability of a flow network is presented. The network is considered to be in a functioning state if it can transmit a maximum flow which is greater than or equal to a specified amount of flow, $textsc{k}$say, and a $textsc{k}$-minimal path set is a minimal set of branches that satisfies the given flow constraint. In this paper, under the assumption that minimal path sets of the network are known, we generate composite paths by adding only a minimal set of branches at each iteration to get $textsc{k}$-minimal path sets after possibly the fewest composition, and compute maximum flow of composite paths using only minimal path sets. Thereby we greatly reduce the possible occurrence of redundant composite paths throughout the process and efficiently compute the maximum flow of composite paths generated. Numerical examples illustrate the method.

  • PDF

자율이동로봇을 위한 동적 경로 계획 방법 (Dynamic Path Planning for Autonomous Mobile Robots)

  • 윤희상;유진오;박태형
    • 제어로봇시스템학회논문지
    • /
    • 제14권4호
    • /
    • pp.392-398
    • /
    • 2008
  • We propose a new path planning method for autonomous mobile robots. To maximize the utility of mobile robots, the collision-free shortest path should be generated by on-line computation. In this paper, we develop an effective and practical method to generate a good solution by lower computation time. The initial path is obtained from skeleton graph by Dijkstra's algorithm. Then the path is improved by changing the graph and path dynamically. We apply the dynamic programming algorithm into the stage of improvement. Simulation results are presented to verify the performance of the proposed method.

모바일 로봇의 네비게이션을 위한 빠른 경로 생성 알고리즘 (Fast Path Planning Algorithm for Mobile Robot Navigation)

  • 박정규;전흥석;노삼혁
    • 대한임베디드공학회논문지
    • /
    • 제9권2호
    • /
    • pp.101-107
    • /
    • 2014
  • Mobile robots use an environment map of its workspace to complete the surveillance task. However grid-based maps that are commonly used map format for mobile robot navigation use a large size of memory for accurate representation of environment. In this reason, grid-based maps are not suitable for path planning of mobile robots using embedded board. In this paper, we present the path planning algorithm that produce a secure path rapidly. The proposed approach utilizes a hybrid map that uses less memory than grid map and has same efficiency of a topological map. Experimental results show that the fast path planning uses only 1.5% of the time that a grid map based path planning requires. And the results show a secure path for mobile robot.

Development of Steering Control System for Autonomous Vehicle Using Geometry-Based Path Tracking Algorithm

  • Park, Myungwook;Lee, Sangwoo;Han, Wooyong
    • ETRI Journal
    • /
    • 제37권3호
    • /
    • pp.617-625
    • /
    • 2015
  • In this paper, a steering control system for the path tracking of autonomous vehicles is described. The steering control system consists of a path tracker and primitive driver. The path tracker generates the desired steering angle by using the look-ahead distance, vehicle heading, and a lateral offset. A method for applying an autonomous vehicle to path tracking is an advanced pure pursuit method that can reduce cutting corners, which is a weakness of the pure pursuit method. The steering controller controls the steering actuator to follow the desired steering angle. A servo motor is installed to control the steering handle, and it can transmit the steering force using a belt and pulley. We designed a steering controller that is applied to a proportional integral differential controller. However, because of a dead band, the path tracking performance and stability of autonomous vehicles are reduced. To overcome the dead band, a dead band compensator was developed. As a result of the compensator, the path tracking performance and stability are improved.