Modification of path-finding algorithms introducing time and distance limitations
Article Sidebar
Open full text
Published:
Mar 30, 2019
Issue Vol. 10 (2019)
Articles
-
Comparison of tools for creating SPA applications using the examples of Angular2 and React
Jadwiga Kalinowska, Beata Pańczyk1-4
-
Recording using a motion capture system and a mobile device with synchronization of the recording triggering
Karol Walczyna, Bartosz Jasiński, Jakub Smołka, Mateusz Miziołek5-11
-
Angle measurement accuracy assessment using inertial sensors in threedimensional coordinate system
Mateusz Miziołek12-17
-
Modification of path-finding algorithms introducing time and distance limitations
Mateusz Wolanin, Klaudia Korniszuk, Jakub Smołka18-23
-
Performance analysis of methods for building applications on the Salesforce platform
Damian Miącz24-27
-
Analysis of the possibilities of testing SPA applications on the example of Selenium and Protractor tools
Mateusz Szpinda, Małgorzata Plechawska-Wójcik28-31
-
The use of CPU and GPU for calculations in Matlab
Jarosław Woźniak32-35
-
Comparative analysis of VR goggles
Łukasz Pełka, Łukasz Podstawka, Tomasz Szymczyk36-43
-
Evaluation of methods for computing athlete’s energy expenditure implemented on Android devices
Sylwester Muzyka, Piotr Wójcik, Jakub Smołka44-48
-
Multithreaded programming in structural and object-oriented languages
Mateusz Wiśniewski49-53
-
The use of postprocessing and its impact on rendering performance in the Unreal Engine 4
Eryk Puławski, Marcin Tokarski54-61
-
Analysis of the quality of web application interface using eye-tracking – a case study
Marcin Jusiak, Marek Miłosz62-66
-
Comparison of the effectiveness of selected face recognition algorithms for poor quality photos
Jakub Gozdur, Bartosz Wiśniewski, Piotr Kopniak67-70
-
Comparison of new ways of creating PHP applications using Laravel and CodeIgniter example
Daniel Drabik71-76
-
Implementation of management support tools projects in IT companies
Radosław Albiniak, Elżbieta Miłosz77-81
Main Article Content
DOI
Authors
Mateusz Wolanin
Lublin University of Technology, Poland
Klaudia Korniszuk
Lublin University of Technology, Poland
Jakub Smołka
Lublin University of Technology, Poland
Abstract
This paper describes modifications of path-finding algorithms. The modifications add time and distance constraints to generated paths. A* and BFS algorithms are modified. Additionally, A* algorithm modification which combines the advantages (generating the shortest routes with the smallest number of vertices) of A* and BFS is presented.. This allows for creating a route planning app that enables users of bike sharing services to travel more easily and economically.
Keywords:
route planning; bike sharing system; algorithm A*; algorithm BFS
References
[1] L GZhi Li, Jianhui Zhang, Jiayu Gan, Pengqian Lu, Fei Lin, Large-Scale Trip Planning for Bike-Sharing Systems, IEEE 14th International Conference on Mobile Ad Hoc and Sensor Systems, 2017
[2] Leonardo Caggiani, Rosalia Camporeale, Michele Ottomanelli, A real time multi-objective cyclists route choice model for a bike-sharing mobile application, Politecnico di Bari, 2017
[3] Wen Ouyang, Chang Wu Yu, Pei-Ju Huang, Huai-Tse Chang, Non-commutative path planning for tours with diversified attractions, Chung Hua University, 2017.
[4] Jing Luan, Zhong Yao, Futao Zhao, XinSong, A novel method to solve supplier selection problem: Hybrid algorithm of genetic algorithm and ant colony optimization, Mathematics and Computers in Simulation, Elsevier, 2019
[5] Haifeng Wang, Jiawei Zhou, Guifeng Zheng, Yun Liang, HAS:Hierarchical A-Star algorithm for big map navigation in special areas, 2014 International Conference on Digital Home, IEEE, 2014
[6] K. Khantanapoka, K. Chinnasarn: Pathfinding of 2D & 3D Game Real-Time Strategy with Depth Direction A*Algorithm for Multi-Layer, Eighth International Symposium on Natural Language Processing, IEEE, 2009
[7] W. Lu: Beginning Robotics Programming in Java with LEGO Mindstorms, Rozdział 9, 2016
[8] A. Chaudhari, M. Apsangi, A. Kudale: Improved A-star Algorithm with Least Turn for Robotic Rescue Operations, Computational Intelligence, Communications, and Business Analytics, Springer Nature, 2017
[9] Mapy Google, https://www.google.pl/maps/dir/ [dostęp 10.10.2018]
[10] dr inż. Tadeusz Kopta, mgr Aleksander Buczyński, Marcin Hyła, mgr inż. Bartłomiej Lustofin, Konkurencyjność roweru w zakresie czasu podróży, Warszawa-Kraków, czerwiec 2012
[2] Leonardo Caggiani, Rosalia Camporeale, Michele Ottomanelli, A real time multi-objective cyclists route choice model for a bike-sharing mobile application, Politecnico di Bari, 2017
[3] Wen Ouyang, Chang Wu Yu, Pei-Ju Huang, Huai-Tse Chang, Non-commutative path planning for tours with diversified attractions, Chung Hua University, 2017.
[4] Jing Luan, Zhong Yao, Futao Zhao, XinSong, A novel method to solve supplier selection problem: Hybrid algorithm of genetic algorithm and ant colony optimization, Mathematics and Computers in Simulation, Elsevier, 2019
[5] Haifeng Wang, Jiawei Zhou, Guifeng Zheng, Yun Liang, HAS:Hierarchical A-Star algorithm for big map navigation in special areas, 2014 International Conference on Digital Home, IEEE, 2014
[6] K. Khantanapoka, K. Chinnasarn: Pathfinding of 2D & 3D Game Real-Time Strategy with Depth Direction A*Algorithm for Multi-Layer, Eighth International Symposium on Natural Language Processing, IEEE, 2009
[7] W. Lu: Beginning Robotics Programming in Java with LEGO Mindstorms, Rozdział 9, 2016
[8] A. Chaudhari, M. Apsangi, A. Kudale: Improved A-star Algorithm with Least Turn for Robotic Rescue Operations, Computational Intelligence, Communications, and Business Analytics, Springer Nature, 2017
[9] Mapy Google, https://www.google.pl/maps/dir/ [dostęp 10.10.2018]
[10] dr inż. Tadeusz Kopta, mgr Aleksander Buczyński, Marcin Hyła, mgr inż. Bartłomiej Lustofin, Konkurencyjność roweru w zakresie czasu podróży, Warszawa-Kraków, czerwiec 2012
Article Details
Wolanin, M., Korniszuk, K., & Smołka, J. (2019). Modification of path-finding algorithms introducing time and distance limitations . Journal of Computer Sciences Institute, 10, 18–23. https://doi.org/10.35784/jcsi.188
Abstract views: 303
License

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
