• 제목/요약/키워드: Path Travel Time

Search Result 164, Processing Time 0.023 seconds

안정동력학에 의한 가변수요 통행배정모형 (A Variable Demand Traffic Assignment Model Based on Stable Dynamics)

  • 박구현
    • 한국경영과학회지
    • /
    • 제34권1호
    • /
    • pp.61-83
    • /
    • 2009
  • This study developed a variable demand traffic assignment model by stable dynamics. Stable dynamics, suggested by Nesterov and do Palma[19], is a new model which describes and provides a stable state of congestion in urban transportation networks. In comparison with the user equilibrium model, which is based on the arc travel time function in analyzing transportation networks, stable dynamics requires few parameters and is coincident with intuitions and observations on congestion. It is therefore expected to be a useful analysis tool for transportation planners. In this study, we generalize the stable dynamics into the model with variable demands. We suggest a three stage optimization model. In the first stage, we introduce critical travel times and dummy links and determine variable demands and link flows by applying an optimization problem to an extended network with the dummy links. Then we determine link travel times and path flows in the following stages. We present a numerical example of the application of the model to a given network.

Path planning for autonomous lawn mower tractor

  • Song, Mingzhang;Kabir, Md. Shaha Nur;Chung, Sun-Ok;Kim, Yong-Joo;Ha, Jong-Kyou;Lee, Kyeong-Hwan
    • 농업과학연구
    • /
    • 제42권1호
    • /
    • pp.63-71
    • /
    • 2015
  • Path planning is an essential part for traveling and mowing of autonomous lawn mower tractors. Objectives of the paper were to analyze operation patterns by a skilled farmer, to extract and optimize waypoints, and to demonstrate generation of formatted planned path for autonomous lawn mower tractors. A 27-HP mower tractor was operated by a skilled farmer on grass fields. To measure tractor travel and operation characteristics, an RTK-GPS antenna with a 6-cm RMS error, an inertia motion sensing unit, a gyro compass, a wheel angle sensor, and a mower on/off sensor were mounted on the mower tractor, and all the data were collected at a 10-Hz rate. All the sensor data were transferred through a software program to show the status immediately on the notebook. Planned path was generated using the program parameter settings, mileage and time calculations, and the travel path was plotted using developed software. Based on the human operation patterns, path planning algorithm was suggested for autonomous mower tractor. Finally path generation was demonstrated in a formatted file and graphic display. After optimizing the path planning, a decrease in distance about 13% and saving of the working time about 30% was achieved. Field test data showed some overlap, especially in the turning areas. Results of the study would be useful to implement an autonomous mower tractor, but further research needs to improve the performance.

유전자 알고리즘을 이용한 도시도로망에서의 첨단 여행자 정보시스템(ATIS) 운영계획 (Minimum Travel Time Paths for ATIS in Urban Road Networks Using Genetic Algorithms)

  • 장인성;문형수
    • 대한교통학회지
    • /
    • 제19권4호
    • /
    • pp.85-96
    • /
    • 2001
  • 본 연구에서는 좌회전 금지 및 U-turn과 같이 회전제한이 있는 기하구조적 특성과 통행을 위한 시간창과 같이 특정 시간대에만 통행이 허용되는 가변적 특성이 부여된 도시도로망에서 기종점을 잇는 합리적인 최단경로를 탐색하는 문제를 다룬다. 본 연구의 동기는 지능형 교통시스템(ITS)의 응용분야인 첨단 여행자 정보시스템(ATIS)의 운영을 위해 필수적으로 요구되는 최단여행시간 경로를 탐색하고자 하는 문제에 의해서 유발되었다. 기하구조적 특성과 가변적 특성이 부여된 교통망은 도시도로망의 현실성을 보다 더 사실적으로 표현하지만 전통적인 알고리즘과 지금까지 개발된 알고리즘들은 가변적 특성이 반영된 최단경로를 탐색하는데 실패한다. 본 논문은 ATIS를 도시도로망에서 운영하는데 필요한 합리적인 최단경로 정보를 실시간으로 탐색할 수 있는 최단경로 알고리즘을 제안한다. 최단경로 알고리즘은 유전자 알고리즘 접근법을 이용하여 개발되었으며 모의실험에 의해 제안된 알고리즘의 우수성을 입증하였다.

  • PDF

확솔적 이용자 평형통행 배분에 관한 연구 (A Study on the Stochastic User Equilibrium Assignment)

  • 이승재;전경수;임강원
    • 대한교통학회지
    • /
    • 제8권1호
    • /
    • pp.55-71
    • /
    • 1990
  • The behavioral mechanism underlying the traffic assignment model is a choice, or decision-making process of traveling paths between origins and destinations. The deterministic approach to traffic assignment assumes that travelers choose shortest path from their origin-destination pair. Although this assumption seems reasonable, it presumes that all travelers have perfect information regarding travel time, that they make consistently correct decision, and that they all behave in identical fashion. Stochastic user equilibrium assignment relaxes these presumptions by including a random component in traveler's perception of travel time. The objective of this study is to compare "A Model of Deterministic User Equilibrium Assignment" with "Models of Stochastic User Equilibrium Assignment" in the theoretical and practical aspects. Specifically, SUE models are developed to logit and probit based models according to discrete choice functions. The models were applied to sioux Falls net ork consisting of 24 zones, 24 nodes and 76 links. The distribution of perceived travel time was obtained by using the relationship between speed and traffic flow.

  • PDF

An Optimal Guide Path Design of Bi-Directional Automated Guided Vehicle Systems AGVS

  • Lee, Seong-Beak;Kim, Young-Myung
    • 산업공학
    • /
    • 제2권1호
    • /
    • pp.37-45
    • /
    • 1989
  • Guide path design is the most important factor in planning automated guided vehicle systems(AGVS) in manufacturing shop environments. This paper studies a heuristic procedure to design an optimal bi-directional guide path with the objective of the minimum total travel time of the vehicles. An example is solved to validate the procedure developed.

  • PDF

단방향 이동 AGVS의 최적 경로선정에 관한 연구 (A Study on the Optimal Flow Path Design of Unidirectional AGV Systems)

  • 손권익;김진환
    • 대한산업공학회지
    • /
    • 제19권2호
    • /
    • pp.43-51
    • /
    • 1993
  • This paper describes the flow path design of unidirectional automated guided vehicle systems. The objective is to find the flow path which will minimize total travel time of unloaded as well as loaded vehicles. The allocation of unloaded vehicles is determined by applying the transportation simplex method. The problem is solved using a branch-and-bound technique. A simple illustrative example is discussed to demonstrate the procedure.

  • PDF

A Real Time Traffic Flow Model Based on Deep Learning

  • Zhang, Shuai;Pei, Cai Y.;Liu, Wen Y.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제16권8호
    • /
    • pp.2473-2489
    • /
    • 2022
  • Urban development has brought about the increasing saturation of urban traffic demand, and traffic congestion has become the primary problem in transportation. Roads are in a state of waiting in line or even congestion, which seriously affects people's enthusiasm and efficiency of travel. This paper mainly studies the discrete domain path planning method based on the flow data. Taking the traffic flow data based on the highway network structure as the research object, this paper uses the deep learning theory technology to complete the path weight determination process, optimizes the path planning algorithm, realizes the vehicle path planning application for the expressway, and carries on the deployment operation in the highway company. The path topology is constructed to transform the actual road information into abstract space that the machine can understand. An appropriate data structure is used for storage, and a path topology based on the modeling background of expressway is constructed to realize the mutual mapping between the two. Experiments show that the proposed method can further reduce the interpolation error, and the interpolation error in the case of random missing is smaller than that in the other two missing modes. In order to improve the real-time performance of vehicle path planning, the association features are selected, the path weights are calculated comprehensively, and the traditional path planning algorithm structure is optimized. It is of great significance for the sustainable development of cities.

천장크레인의 무인운전 시스템을 위한 운동제어 알고리즘 개발 (Development of a Motion Control Algorithm for the Automatic Operation System of Overhead Cranes)

  • 이종규;박영조;이상룡
    • 대한기계학회논문집A
    • /
    • 제20권10호
    • /
    • pp.3160-3172
    • /
    • 1996
  • A search algorithm for the collision free, time optimal transport path of overhead cranes has been proposed in this paper. The map for the working environment of overhead cranes was constructed in the form of three dimensional grid. The obstacle occupied region and unoccupied region of the map has been represented using the octree model. The best-first search method with a suitable estimation function was applied to select the knot points on the collision free transport path to the octree model. The optimization technique, minimizing the travel time required for transporting objects to the goal while subjected to the dynamic constraints of the crane system, was developed to find the smooth time optimal path in the form of cubic spline functions which interpolate the selected knot points. Several simulation results showed that the selected estimation function worked effectively insearching the knot points on the collision free transport path and that the resulting transport path was time optimal path while satisfying the dynamic constraints of the crane system.

고객 쇼핑 동선 분석시스템의 개발 (Development of Shopping Path Analysis System(SPAS))

  • 정인철;권영식;이용한
    • 한국전자거래학회지
    • /
    • 제17권4호
    • /
    • pp.39-56
    • /
    • 2012
  • 최근의 RFID와 모바일 기술을 포함한 정보 기술의 진보로 인해 매장 내에서 고객 쇼핑 동선을 추적하는 것이 가능해지고 있다. 특히, 고객 쇼핑 동선은 매장 내에서 발생하는 고객 쇼핑 행동을 이해하는데 중요한 단서를 제공한다. 따라서 본 연구에서는 고객 동선 분석을 위하여 동선 정보를 획득하고 분석하는 고객 쇼핑 동선 분석 시스템을 개발한다. 시스템 개발을 위해 RFID를 사용하였고, 대형 유통 매장의 현업 전문가와 함께 다양한 매장 측정 변수를 정의하여 혼잡도, 방문비율등과 같은 매장 프로파일 분석과 고객 쇼핑 패턴 식별을 위해 동선 클러스터링 분석 기법을 개발하여 적용하였다. 최종적으로는 개발한 시스템의 실효성을 평가해보기 위하여 실제 서울의 대형 유통 매장에 적용하여 사례분석까지 실시해보았다.

(sLa-pRc)타입의 가장 빠른 경로 탐색과 결함 검사 (The Fastest Path Search and Defect Inspection of Type (sLa-pRc))

  • 김순호;이은서;김치수
    • 정보처리학회논문지:소프트웨어 및 데이터공학
    • /
    • 제10권10호
    • /
    • pp.385-390
    • /
    • 2021
  • 갠트리는 미소 칩을 피더에서 기판까지 이동하는 장비이다. 갠트리가 부품을 이동하는 중에 카메라는 부품의 상태를 검사한다. 본 논문의 목적은 갠트리의 이동시간이 가장 짧은 경로를 찾고 그 경로에 따른 이동시간을 계산한다. 현재 사용되고 있는 부품의 상태를 검사하는 방법은 stop_motion 방식이다. 본 논문은 moving_motion 방식과 카메라 앞에서 최대속도를 갖는 fly_motion 방식을 제시한다. 또한, 부품 상태의 검사는 시그니처 방법을 사용하였다. 3가지 방식의 갠트리가 이동하는 시간을 비교했을 때, stop_motion보다 moving_motion 방식은 9.42%, fly_motion 방식은 17.73% 향상되었다. 본 논문에서 제시한 fly_motion 방식을 갠트리 이동 경로에 사용할 경우 생산성이 향상될 것으로 생각한다.