• Title/Summary/Keyword: Path Travel Time

Search Result 164, Processing Time 0.028 seconds

An Adaptive Extrusion Control Technique for Faster FDM 3D Printing of Lithophanes (투명조각자기의 고속 FDM 3D 프린팅을 위한 가변 압출 기법)

  • Jang, Seung-Ho;Hong, Jeong-Mo
    • Korean Journal of Computational Design and Engineering
    • /
    • v.22 no.2
    • /
    • pp.190-201
    • /
    • 2017
  • This paper proposes how to solve a problem of FDM 3D printer's irregular output when changing volume of extrusion, adjusting movement speed of the printer's head and a way to fill new inner part. Existing slicers adjust directly to change the rotation speed of the stepper. In this method, the change of the extrusion area is delayed due to the gap between the stepper and the nozzle, so that precise control is difficult. We control the extrusion area adjusting the moving speed of the print head and making constantly the rotation speed of the stepper. Thus, the output time can be shortened by generating an efficient path having a short travel distance. For evaluation, we applied our method to lithophanes with detailed variation. Comparing existing methods, our method reduced output time at least 30%.

Development of path travel time forecasting model using wavelet transformation and RBF neural network (웨이브렛 변환과 RBF 신경망을 이용한 경로통행시간 예측모형 개발 -시내버스 노선운행시간을 중심으로-)

  • 신승원;노정현
    • Journal of Korean Society of Transportation
    • /
    • v.16 no.4
    • /
    • pp.153-166
    • /
    • 1998
  • 본 연구에서는 도시 가로망에서의 구간 통행시간을 예측하기 위하여 time-frequency 분석의 일종인 웨이브렛변환과 RBF신경망 모형을 이용한 예측모형을 개발하였다. 웨이브렛 변환을 이용한 시계열 자료 분석을 통해서 통행시간에 내재되어 있는 다양한 패턴의 특징을 추출함으로써 오전/오후의 첨두현상, 신호교차로의 현시주기 등 주기적으로 발생되는 요인들에 의해서 통행시간 시계열 자료의 패턴에 나타나는 규칙성을 분석해 내었다. 분석된 패턴정보에 대한 규명은 카오스 이론을 근간으로한 시간지연좌표를 이용하여 시계열 자료의 규칙성을 시각적으로 판별하여 예측모형 구축에 활용하도록 하였다. 또, RBF신경망을 이용하여 예측범위의 공간적/시간적 확대에 따른 모형 구축에 소요되는 시간을 최소화하도록 하였으며, 시내버스 노선의 정류장간 운행시간 예측을 통해서 기존 연구에서 제기되었던 현실세계의 단순화, 다단계 예측시 정확성 등의 문제를 해결하였다. 예측실험결과 웨이브렛 변환을 데이터의 전처리 과정에 삽입하여 링크 통행시간의 패턴정보 예측에 활용할 경우, 기존의 예측모형에 비해서 훨씬 정확한 예측이 가능한 것으로 나타났으며, RBF 신경망은 짧은 학습시간에도 불구하고 역전파 신경망보다 우수한 예측력을 갖고 있는 것으로 밝혀졌다.

  • PDF

Personalized Itinerary Recommendation System based on Stay Time (체류시간을 고려한 여행 일정 추천 시스템)

  • Park, Sehwa;Park, Seog
    • KIISE Transactions on Computing Practices
    • /
    • v.22 no.1
    • /
    • pp.38-43
    • /
    • 2016
  • Recent developments regarding transportation technology have positioned travel as a major leisure activity; however, trip-itinerary planning remains a challenging task for tourists due to the need to select Points of Interest (POI) for visits to unfamiliar cities. Meanwhile, due to the GPS functions on mobile devices such as smartphones and tablet PCs, it is now possible to collect a user's position in real time. Based on these circumstances, our research on an automatic itinerary-planning system to simplify the trip-planning process was conducted briskly. The existing studies that include research on itinerary schedules focus on an identification of the shortest path in consideration of cost and time constraints, or a recommendation of the most-popular travel route in the destination area; therefore, we propose a personalized itinerary-recommendation system for which the stay-time preference of the individual user is considered as part of the personalized service.

A schedule-based Public Transit Routing Algorithm for Finding K-shortest Paths Considering Transfer Penalties (환승 저항을 고려한 운행시간표 기반 대중교통 다중 경로 탐색 알고리즘)

  • Jeon, Inwoo;Nam, Hyunwoo;Jun, Chulmin
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.17 no.3
    • /
    • pp.72-86
    • /
    • 2018
  • Schedule-based public transit routing algorithm computes a single route that calculated minimum travel time using the departure and arrival times for each stop according to vehicle operation plan. However, additional factors such as transfer resistance and alternative route choice are not reflected in the path finding process. Therefore, this paper proposes a improved RAPTOR that reflected transfer resistance and multi-path searching. Transfer resistance is applied at the time of transfer and different values can be set according to type of transit mode. In this study, we analyzed the algorithm's before and after results compared with actual route of passengers. It is confirmed that the proposed algorithm reflects the various route selection criteria of passengers.

Development of Optimized Headland Turning Mechanism on an Agricultural Robot for Korean Garlic Farms

  • Ha, JongWoo;Lee, ChangJoo;Pal, Abhishesh;Park, GunWoo;Kim, HakJin
    • Journal of Biosystems Engineering
    • /
    • v.43 no.4
    • /
    • pp.273-284
    • /
    • 2018
  • Purpose: Conventional headland turning typically requires repeated forward and backward movements to move the farming equipment to the next row. This research focuses on developing an upland agricultural robot with an optimized headland turning mechanism that enables a $180^{\circ}$ turning positioning to the next row in one steering motion designed for a two-wheel steering, four-wheel drive agricultural robot named the HADA-bot. The proposed steering mechanism allows for faster turnings at each headland compared to those of the conventional steering system. Methods: The HADA-bot was designed with 1.7-m wide wheel tracks to travel along the furrows of a garlic bed, and a look-ahead path following algorithm was applied using a real-time kinematic global positioning system signal. Pivot turning tests focused primarily on accuracy regarding the turning radius for the next path matching, saving headland turning time, area, and effort. Results: Several test cases were performed by evaluating right and left turns on two different surfaces: concrete and soil, at three speeds: 1, 2, and 3 km/h. From the left and right side pivot turning results, the percentage of lateral deviation is within the acceptable range of 10% even on the soil surface. This U-turn scheme reduces 67% and 54% of the headland turning time, and 36% and 32% of the required headland area compared to a 50 hp tractor (ISEKI, TA5240, Ehime, Japan) and a riding-type cultivator (CFM-1200, Asia Technology, Deagu, Rep. Korea), respectively. Conclusion: The pivot turning trajectory on both soil and concrete surfaces achieved similar results within the typical operating speed range. Overall, these results prove that the pivot turning mechanism is suitable for improving conventional headland turning by reducing both turning radius and turning time.

A Study on Effectiveness and Warrant Analysis for Two-Way Left-Turn Lanes (양방향 좌회전차로(TWLTLs) 적용효과 분석 및 설치준거 연구)

  • Bae, Gwang-Su;Sim, Gwan-Bo;Song, Chang-Yong
    • Journal of Korean Society of Transportation
    • /
    • v.25 no.6
    • /
    • pp.65-77
    • /
    • 2007
  • A two-way left-turn lane is a continuous center left-turn lane that could be used as a deceleration and refuge area for both directions of left-turning vehicles. TWLTL's have been used effectively for access management treatment when applied to a highway that has wide-spread left turning traffic demand and a high-density of side streets. In this study, an effective analysis was carried out using a computer-based simulation tool, VISSIM, in order to evaluate performance and safety effects of TWLTLs and develop a warrant. In conclusion, the results indicated that there was a remarkable decrease of through and left-turning vehicle travel time delay on the main road and improvement of traffic safety.

Implementations of Path-Finding Algorithm using Variable Turn Heuristic (가변적인 턴 휴리스틱을 이용한 경로탐색 알고리즘의 구현)

  • Lee, Ji-Wan;Moon, Dae-Jin;Cho, Dae-Soo
    • Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
    • /
    • 2008.10a
    • /
    • pp.182-187
    • /
    • 2008
  • It needs to consider of turns during a path-finding on real road network. traveling on real road network, it generally takes less travel time in a more straight path than a zig-zaged path with same source and destination. In this paper, we propose $VTA^*$ algorithm that can reduce the cost of exploring despite increasing the number of turn in comparing with $TA^*$ algorithm. We have implement the proposed $VTA^*$, $TA^*$ which consider the number of turn and a traditional $A^*$ algorithm which dosen't consider the number of turn. The experimental result shows that the cost of exploring is reduced by 7.31 % comparing with $TA^*$ and the number of turn is reduced by 27.95% comparing with $A^*$ approximately.

  • PDF

Multi-Agent Rover System with Blackboard Architecture for Planetary Surface Soil Exploration (행성 표면탐사를 위한 블랙보드 구조를 가진 멀티에이전트 루버 시스템)

  • De Silva, K. Dilusha Malintha;Choi, SeokGyu;Kim, Heesook
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.19 no.2
    • /
    • pp.243-253
    • /
    • 2019
  • First steps of Planetary exploration are usually conducted with the use of autonomous rovers. These rovers are capable of finding its own path and perform experiments about the planet's surface. This paper makes a proposal for a multi-agent system which effectively take the advantage of a blackboard system for share knowledge and effort of each agent. Agents use Reactive Model with the combination of Belief Desire Intension (BDI) Model and also use a Path Finding Algorithm for calculate shortest distance and a path for travel on the planet's surface. This approach can perform a surface exploration on a given terrain within a short period of time. Information which are gathered on the blackboard are used to make an output with detailed surface soil variance results. The developed Multi-Agent system performed well with different terrain sizes.

A Dispatching and Routing Algorithm for Personal Rapid Transit by Considering Congestion (정체를 고려한 Personal Rapid Transit 배차 및 경로 계획 알고리즘)

  • Han, Chung-Kyun;Kim, Baek-Hyun;Jeong, Rag-Gyo;Ha, Byung-Hyun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.64 no.11
    • /
    • pp.1578-1586
    • /
    • 2015
  • Personal rapid transit (PRT) is getting attention as a new form of transportation. It is energy efficient and provides the high level of passenger service. In this study, the dynamic PRT dispatching and routing problem is dealt with. Passengers request transportation service on a complex network, and an operating system monitors passenger arrivals and coordinates vehicles in real time. A new online dispatching and routing algorithm is proposed, which minimizes the total travel distance of vehicles and the waiting time of passengers. The algorithm dispatches vehicles by considering multiple vehicles' state and multiple passengers at the same time. In particular, finding the shortest-time path is attempted by taking into account the future congestion on lanes. Discrete-event simulation is employed to validate the performance of the proposed algorithm. The results show the algorithm in this study outperforms others.

Feasibility of Ocean Survey by using Ocean Acoustic Tomography in southwestern part of the East Sea (동해 남서해역에서 해양음향 토모그래피 운용에 의한 해양탐사 가능성)

  • Han, Sang-Kyu;Na, Jung-Yul
    • The Journal of the Acoustical Society of Korea
    • /
    • v.13 no.6
    • /
    • pp.75-82
    • /
    • 1994
  • The ray paths and travel times of sound wave in the ocean depend on the physical properties of the propagating media. Ocean Acoustic Tomography(OAT), which is inversely estimate the travel time variations between fixed sources and receivers the physical properties of the corresponding media can he understood. To apply ocean survey technology by using the OAT, the tomographic procedure requires forward problem that variation of the travel times be identified with the variability of the medium. Also, received signals must be satisfied the necessary conditions of ray path stability, identification and resolution in order for OAT to work. The canonical ocean has been determined based on the historical data and its travel time and ray path are used as reference values. The sound speed of canonical ocean in the East Sea is about 1523 m/s at the surface and 1458 m/s at the sound channel axis(400m). Sound speeds in the East Sea are perturbed by warm eddy whose horizontal extension is more than 100 km with deeper than 200 m in depth scale. In this study, an acoustic source and receiver are placed at the depth above the sound channel axis, 350 m, and are separated by 200 km range. Ray paths are identified by the ray theory methed in a range dependent medium whose sound speeds are functions of a range and depth. The eigenray information obtained from interpolation between the rays bracketing the receiver are used to simulate the received signal by convolution of source signal with the eigenray informations. The source signal is taken as a 400 Hz rectangular pulse signal, bandwidth is 16 Hz and pulse length is 64 ms. According to the analysis of the received signal and identified ray path by using numerical model of underwater sound propagation, simulated signals satisfy the necessary conditions of OAT, applied in the East Sea.

  • PDF