Yanyan Sun
ABSTRACT
Precise bus stops and trajectories are crucial for public transport. However, acquiring accurate information on bus trajectories and stop locations faces the situation of point drift of the global positioning system (GPS), low sampling frequency, and the absence of the latest bus information. Thus, this study developed a method, based on Dumpster Shafer evidence theory and K-Shortest Paths, to update the latest bus stops and routes and automatically remove abandoned bus stops by taking advantage of historical GPS data. To speed up computation, we divided the road network into meshes, dynamically generating a local road network. The effectiveness of the method is validated on Qingdao bus data, and the experiment demonstrates that the method is robust in pinpointing the bus stops and the trajectories of different bus routes.
- Azalden A Alsger, Mahmoud Mesbah, Luis Ferreira, and Hamid Safi. 2015. Use of smart card fare data to estimate public transport origin–destination matrix. Transportation Research Record 2535, 1 (2015), 88–96.Google Scholar
Cross Ref
- David Bernstein, Alain Kornhauser, 1996. An introduction to map matching for personal navigation assistants. (1996).Google Scholar
- Michel Bierlaire, Jingmin Chen, and Jeffrey Newman. 2013. A probabilistic map matching method for smartphone GPS data. Transportation Research Part C: Emerging Technologies 26 (2013), 78–98.Google ScholarCross Ref
- Alon Efrat, Quanfu Fan, and Suresh Venkatasubramanian. 2007. Curve matching, time warping, and light fields: New algorithms for computing similarity between curves. Journal of Mathematical Imaging and Vision 27, 3 (2007), 203–216.Google ScholarDigital Library
- Thomas Eiter and Heikki Mannila. 1994. Computing discrete Fréchet distance. (1994).Google Scholar
- Nandani Garg, Gitakrishnan Ramadurai, and Sayan Ranu. 2018. Mining bus stops from raw GPS data of bus trajectories. In 2018 10th International Conference on Communication Systems & Networks (COMSNETS). IEEE, 583–588.Google ScholarCross Ref
- Walter Hoffman and Richard Pavley. 1959. A method for the solution of the n th best path problem. Journal of the ACM (JACM) 6, 4 (1959), 506–514.Google ScholarDigital Library
- Etikaf Hussain, Ashish Bhaskar, and Edward Chung. 2021. Transit OD matrix estimation using smartcard data: Recent developments and future research challenges. Transportation Research Part C: Emerging Technologies 125 (2021), 103044.Google ScholarCross Ref
- Ranhee Jeong and Laurence R Rilett. 2005. Prediction model of bus arrival time for real-time applications. Transportation Research Record 1927, 1 (2005), 195–204.Google ScholarCross Ref
- Wenfeng Li, Wenwen Zhang, and Cong Gao. 2022. A Historical-Trajectories-Based Map Matching Algorithm for Container Positioning and Tracking. Sensors 22, 8 (2022), 3057.Google ScholarCross Ref
- Wei-Hua Lin and Jian Zeng. 1999. Experimental study of real-time bus arrival time prediction with GPS data. Transportation Research Record 1666, 1 (1999), 101–109.Google ScholarCross Ref
- Parthasarathy Nadarajan, Michael Botsch, and Sebastian Sardiña. 2018. Machine Learning Architectures for the Estimation of Predicted Occupancy Grids in Road Traffic. Journal of Advances in Information Technology 9 (2018), 1–9. https://api.semanticscholar.org/CorpusID:68207454Google ScholarCross Ref
- Ming Ren and Hassan A Karimi. 2012. A fuzzy logic map matching for wheelchair navigation. GPS solutions 16, 3 (2012), 273–282.Google Scholar
- Kari Sentz and Scott Ferson. 2002. Combination of evidence in Dempster-Shafer theory. (2002).Google Scholar
- Christopher E White, David Bernstein, and Alain L Kornhauser. 2000. Some map matching algorithms for personal navigation assistants. Transportation research part c: emerging technologies 8, 1-6 (2000), 91–108.Google Scholar
- Ning Xiong and Per Svensson. 2002. Multi-sensor management for information fusion: issues and approaches. Information fusion 3, 2 (2002), 163–186.Google Scholar
- Jin Y Yen. 1971. Finding the k shortest loopless paths in a network. management Science 17, 11 (1971), 712–716.Google Scholar
Index Terms
- A real-time update method for bus stops and routes based on historical bus data
Recommendations
A real time budgeting method for module-level-pipelined bus based system using bus scenarios
DAC '06: Proceedings of the 43rd annual Design Automation ConferenceIn designing bus based systems with parallel and pipelined architecture, it is important to derive a real time budget (a specified execution time limit) for each task of a bus based system while satisfying given end-to-end real-time constraints of the ...
Multistage bus network (MBN): an interconnection network for cache coherent multiprocessors
SPDP '91: Proceedings of the 1991 Third IEEE Symposium on Parallel and Distributed ProcessingSingle bus multiprocessor systems do not scale well due to the limited bandwidth of the bus. Hierarchical bus interconnections are scalable, but unfortunately the top level bus becomes a bottleneck for larger systems. The authors present a novel ...
SAMBA-bus: A high performance bus architecture for system-on-chips
A high performance communication architecture, SAMBA-bus, is proposed in this paper. In SAMBA-bus architecture, multiple compatible bus transactions can be performed simultaneously with only a single bus access grant from the bus arbiter. Experimental ...
Comments