• Title/Summary/Keyword: trajectories of vehicles

Search Result 53, Processing Time 0.022 seconds

An Efficient Clustering Algorithm for Massive GPS Trajectory Data (대용량 GPS 궤적 데이터를 위한 효율적인 클러스터링)

  • Kim, Taeyong;Park, Bokuk;Park, Jinkwan;Cho, Hwan-Gue
    • Journal of KIISE
    • /
    • v.43 no.1
    • /
    • pp.40-46
    • /
    • 2016
  • Digital road map generation is primarily based on artificial satellite photographing or in-site manual survey work. Therefore, these map generation procedures require a lot of time and a large budget to create and update road maps. Consequently, people have tried to develop automated map generation systems using GPS trajectory data sets obtained by public vehicles. A fundamental problem in this road generation procedure involves the extraction of representative trajectory such as main roads. Extracting a representative trajectory requires the base data set of piecewise line segments(GPS-trajectories), which have close starting and ending points. So, geometrically similar trajectories are selected for clustering before extracting one representative trajectory from among them. This paper proposes a new divide- and-conquer approach by partitioning the whole map region into regular grid sub-spaces. We then try to find similar trajectories by sweeping. Also, we applied the $Fr{\acute{e}}chet$ distance measure to compute the similarity between a pair of trajectories. We conducted experiments using a set of real GPS data with more than 500 vehicle trajectories obtained from Gangnam-gu, Seoul. The experiment shows that our grid partitioning approach is fast and stable and can be used in real applications for vehicle trajectory clustering.

Trajectory Distance Algorithm Based on Segment Transformation Distance

  • Wang, Longbao;Lv, Xin;An, Jicun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.4
    • /
    • pp.1095-1109
    • /
    • 2022
  • Along with the popularity of GPS system and smart cell phone, trajectories of pedestrians or vehicles are recorded at any time. The great amount of works had been carried out in order to discover traffic paradigms or other regular patterns buried in the huge trajectory dataset. The core of the mining algorithm is how to evaluate the similarity, that is, the "distance", between trajectories appropriately, then the mining results will be accordance to the reality. Euclidean distance is commonly used in the lots of existed algorithms to measure the similarity, however, the trend of trajectories is usually ignored during the measurement. In this paper, a novel segment transform distance (STD) algorithm is proposed, in which a rule system of line segment transformation is established. The similarity of two-line segments is quantified by the cost of line segment transformation. Further, an improvement of STD, named ST-DTW, is advanced with the use of the traditional method dynamic time warping algorithm (DTW), accelerating the speed of calculating STD. The experimental results show that the error rate of ST-DTW algorithm is 53.97%, which is lower than that of the LCSS algorithm. Besides, all the weights of factors could be adjusted dynamically, making the algorithm suitable for various kinds of applications.

Methodology for Vehicle Trajectory Detection Using Long Distance Image Tracking (원거리 차량 추적 감지 방법)

  • Oh, Ju-Taek;Min, Joon-Young;Heo, Byung-Do
    • International Journal of Highway Engineering
    • /
    • v.10 no.2
    • /
    • pp.159-166
    • /
    • 2008
  • Video image processing systems (VIPS) offer numerous benefits to transportation models and applications, due to their ability to monitor traffic in real time. VIPS based on a wide-area detection algorithm provide traffic parameters such as flow and velocity as well as occupancy and density. However, most current commercial VIPS utilize a tripwire detection algorithm that examines image intensity changes in the detection regions to indicate vehicle presence and passage, i.e., they do not identify individual vehicles as unique targets. If VIPS are developed to track individual vehicles and thus trace vehicle trajectories, many existing transportation models will benefit from more detailed information of individual vehicles. Furthermore, additional information obtained from the vehicle trajectories will improve incident detection by identifying lane change maneuvers and acceleration/deceleration patterns. However, unlike human vision, VIPS cameras have difficulty in recognizing vehicle movements over a detection zone longer than 100 meters. Over such a distance, the camera operators need to zoom in to recognize objects. As a result, vehicle tracking with a single camera is limited to detection zones under 100m. This paper develops a methodology capable of monitoring individual vehicle trajectories based on image processing. To improve traffic flow surveillance, a long distance tracking algorithm for use over 200m is developed with multi-closed circuit television (CCTV) cameras. The algorithm is capable of recognizing individual vehicle maneuvers and increasing the effectiveness of incident detection.

  • PDF

A Network-based Indexing Method for Trajectories of Moving Objects on Roads (도로 위에 존재하는 이동객체의 궤적에 대한 네트워크 기반의 색인 방법)

  • Kim, Kyoung-Sook;Li, Ki-Joune
    • The KIPS Transactions:PartD
    • /
    • v.13D no.7 s.110
    • /
    • pp.879-888
    • /
    • 2006
  • Recently many researchers have focused on management of Historical trajectories of moving objects in Euclidean spaces due to numerous sizes of accumulated data over time. However, the movement of moving objects in real applications generally has some constraints, for example vehicles on roads can only travel along connected road networks. In this paper, we propose an indexing method for trajectories of moving objects on road networks in order to process the network-based spatiotemporal range query. Our method contains the connect information of road networks to use the network distance for query processing, deals with trajectories which are represented by road segments in road networks, and manages them using multiple R-trees assigned per each road segment. Furthermore, it has a structure to be able to share R-tree among several road segments in large road networks. Consequently, we show that our method takes about 30% less in node accesses for the network-based spatiotemporal range query processing than other methods based on the Euclidean distance by experiments.

Building a mathematics model for lane-change technology of autonomous vehicles

  • Phuong, Pham Anh;Phap, Huynh Cong;Tho, Quach Hai
    • ETRI Journal
    • /
    • v.44 no.4
    • /
    • pp.641-653
    • /
    • 2022
  • In the process of autonomous vehicle motion planning and to create comfort for vehicle occupants, factors that must be considered are the vehicle's safety features and the road's slipperiness and smoothness. In this paper, we build a mathematical model based on the combination of a genetic algorithm and a neural network to offer lane-change solutions of autonomous vehicles, focusing on human vehicle control skills. Traditional moving planning methods often use vehicle kinematic and dynamic constraints when creating lane-change trajectories for autonomous vehicles. When comparing this generated trajectory with a man-generated moving trajectory, however, there is in fact a significant difference. Therefore, to draw the optimal factors from the actual driver's lane-change operations, the solution in this paper builds the training data set for the moving planning process with lane change operation by humans with optimal elements. The simulation results are performed in a MATLAB simulation environment to demonstrate that the proposed solution operates effectively with optimal points such as operator maneuvers and improved comfort for passengers as well as creating a smooth and slippery lane-change trajectory.

A Study on Synthetic Flight Vehicle Trajectory Data Generation Using Time-series Generative Adversarial Network and Its Application to Trajectory Prediction of Flight Vehicles (시계열 생성적 적대 신경망을 이용한 비행체 궤적 합성 데이터 생성 및 비행체 궤적 예측에서의 활용에 관한 연구)

  • Park, In Hee;Lee, Chang Jin;Jung, Chanho
    • Journal of IKEEE
    • /
    • v.25 no.4
    • /
    • pp.766-769
    • /
    • 2021
  • In order to perform tasks such as design, control, optimization, and prediction of flight vehicle trajectories based on machine learning techniques including deep learning, a certain amount of flight vehicle trajectory data is required. However, there are cases in which it is difficult to secure more than a certain amount of flight vehicle trajectory data for various reasons. In such cases, synthetic data generation could be one way to make machine learning possible. In this paper, to explore this possibility, we generated and evaluated synthetic flight vehicle trajectory data using time-series generative adversarial neural network. In addition, various ablation studies (comparative experiments) were performed to explore the possibility of using synthetic data in the aircraft trajectory prediction task. The experimental results presented in this paper are expected to be of practical help to researchers who want to conduct research on the possibility of using synthetic data in the generation of synthetic flight vehicle trajectory data and the work related to flight vehicle trajectories.

Assessment of Livestock Infectious Diseases Exposure by Analyzing the Livestock Transport Vehicle's Trajectory Using Big Data (빅데이터 기반 가축관련 운송차량 이동경로 분석을 통한 가축전염병 노출수준 평가)

  • Jeong, Heehyeon;Hong, Jungyeol;Park, Dongjoo
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.19 no.6
    • /
    • pp.134-143
    • /
    • 2020
  • With the worldwide spread of African swine fever, interest in livestock epidemics is growing. Livestock transport vehicles are the main cause of the spread of livestock epidemics, but no empirical quarantine procedures and standards related to the mobility of livestock transport vehicles in South Korea. This study extracted livestock-related vehicles' trajectory by utilizing the facility visit history data from the Korea Animal Health Integrated System and the DTG (Digital Tachograph) data from the Korea Transportation Safety Authority and presented them as exposure indexes aggregating the link-time occupancy of each vehicle. As a result, a total of 274,519 livestock-related vehicle trajectories were extracted, and exposure values by link and zone were quantitatively derived. Through this study, it is expected that prior monitoring of livestock transport vehicles and the establishment of post-disaster prevention policies would be provided.

How airplanes fly at power-off and full-power on rectilinear trajectories

  • Labonte, Gilles
    • Advances in aircraft and spacecraft science
    • /
    • v.7 no.1
    • /
    • pp.53-78
    • /
    • 2020
  • Automatic trajectory planning is an important task that will have to be performed by truly autonomous vehicles. The main method proposed, for unmanned airplanes to do this, consists in concatenating elementary segments of trajectories such as rectilinear, circular and helical segments. It is argued here that because these cannot be expected to all be flyable at a same constant speed, it is necessary to consider segments on which the airplane accelerates or decelerates. In order to preserve the planning advantages that result from having the speed constant, it is proposed to do all speed changes at maximum deceleration or acceleration, so that they are as brief as possible. The constraints on the load factor, the lift and the power required for the motion are derived. The equation of motion for such accelerated motions is solved numerically. New results are obtained concerning the value of the angle and the speed for which the longest distance and the longest duration glides happen, and then for which the steepest, the fastest and the most fuel economical climbs happen. The values obtained differ from those found in most airplane dynamics textbooks. Example of tables are produced that show how general speed changes can be effected efficiently; showing the time required for the changes, the horizontal distance traveled and the amount of fuel required. The results obtained apply to all internal combustion engine-propeller driven airplanes.

Optimal Surveillance Trajectory Planning for Illegal UAV Detection for Group UAV using Particle Swarm Optimization (불법드론 탐지를 위한 PSO 기반 군집드론 최적화 정찰궤적계획)

  • Lim, WonHo;Jeong, HyoungChan;Hu, Teng;Alamgir, Alamgir;Chang, KyungHi
    • Journal of Advanced Navigation Technology
    • /
    • v.24 no.5
    • /
    • pp.382-392
    • /
    • 2020
  • The use of unmanned aerial vehicle (UAV) have been regarded as a promising technique in both military and civilian applications. Nevertheless, due to the lack of relevant and regulations and laws, the misuse of illegal drones poses a serious threat to social security. In this paper, aiming at deriving the three-dimension optimal surveillance trajectories for group monitoring drones, we develop a group trajectory planner based on the particle swarm optimization and updating mechanism. Together, to evaluate the trajectories generated by proposed trajectory planner, we propose a group-objectives fitness function in accordance with energy consumption, flight risk. The simulation results validate that the group trajectories generated by proposed trajectory planner can preferentially visit important areas while obtaining low energy consumption and minimum flying risk value in various practical situations.

MPC based Steering Control using a Probabilistic Prediction of Surrounding Vehicles for Automated Driving (전방향 주변 차량의 확률적 거동 예측을 이용한 모델 예측 제어 기법 기반 자율주행자동차 조향 제어)

  • Lee, Jun-Yung;Yi, Kyong-Su
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.21 no.3
    • /
    • pp.199-209
    • /
    • 2015
  • This paper presents a model predictive control (MPC) approach to control the steering angle in an autonomous vehicle. In designing a highly automated driving control algorithm, one of the research issues is to cope with probable risky situations for enhancement of safety. While human drivers maneuver the vehicle, they determine the appropriate steering angle and acceleration based on the predictable trajectories of surrounding vehicles. Likewise, it is required that the automated driving control algorithm should determine the desired steering angle and acceleration with the consideration of not only the current states of surrounding vehicles but also their predictable behaviors. Then, in order to guarantee safety to the possible change of traffic situation surrounding the subject vehicle during a finite time-horizon, we define a safe driving envelope with the consideration of probable risky behaviors among the predicted probable behaviors of surrounding vehicles over a finite prediction horizon. For the control of the vehicle while satisfying the safe driving envelope and system constraints over a finite prediction horizon, a MPC approach is used in this research. At each time step, MPC based controller computes the desired steering angle to keep the subject vehicle in the safe driving envelope over a finite prediction horizon. Simulation and experimental tests show the effectiveness of the proposed algorithm.