Multi-criteria dynamic route planning for scheduled autonomous vehicles
Abstract
The possibilities for using autonomous or highly automated vehicles are mainly the areas where certain predefined points need to be touched in a given order. Such examples are haulers or public transport vehicles. Typically, these vehicles reach their stations on a predetermined route based on certain criteria, such as the shortest distance, often regardless of the current traffic status on the road network. An illustrative example of this is the presentation of a route planning method – primarily for highly automated vehicles – that navigates the vehicle to its destination on the prevailing most favourable route between predefined stations. The methodology is presented through the
example of public transport vehicles, but can also be applied generally, for example in a factory or a warehouse.
References
Alonso-Mora, J., A. Wallar, and D. Rus. 2017. “Predictive Routing for Autonomous Mobility-on-Demand Systems with Ride-Sharing.” IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS): 3583-3590. DOI: http://doi.org/dvgf
Apáthy M., S. 2017. “Practical Route Planning Algorithm.” Periodica Polytechnica Transportation Engineering 45(3): 133-140. DOI: http://doi.org/dvgg
Collie, B., J. Rose, R. Choraria, and A.K. Wegscheider. 2017. “Reimagined Car: Shared, Autonomous, and Electric Vehicle.” BCG report, December 18. letöltve: 2020. január 4-én. https://www.bcg.com/publications/2017/reimagined-car-sharedautonomous-electric.aspx
Diakonikolas, I., and M. Yannakakis. 2009. “Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems.” SIAM Journal on Computing 39 (4): 1340–1371. DOI: http://doi.org/bdn676
Dijkstra, E.W. 1959. “A Note on Two Problems in Connexion with Graphs.” Numerische Mathematik 1(1): 269-271. DOI: http://doi.org/dpvk8c
Disser, Y., M. Müller-Hannemann, and M. Schnee. 2007. “Multi-Criteria Shortest Paths in Time-Dependent Train Networks.” In Proceedings of the 7th international conference on Experimental algorithms (WEA’08), C. C. McGeoch (Ed.). Springer-Verlag, Berlin, Heidelberg, pp. 347–361. DOI: http://doi.org/fb993d
Duckham, M., and L. Kulik. 2003. “‘Simplest’ Paths: Automated Route Selection for Navigation.” In Lecture Notes in Computer Science (2825):169-185, DOI: http://doi.org/fbm4pd
Eklund, P.W., S. Kirkby, and S. Pollitt. 1996. “A dynamic multi-source Dijkstra's algorithm for vehicle routing.” Australian New Zealand Conference on Intelligent Information Systems. Proceedings. ANZIIS 96 pp. 329-333. DOI: http://doi.org/dd45m8
Fu, L., D. Sun, and L. R. Rilett. 2006 “Heuristic shortest path algorithms for transportation applications: State of the art.” Computers & Operations Research 33(11): 3324–3343. DOI: http://doi.org/dbws2s
Hoang, V-D., and K-H. Jo. 2015. “Path planning for autonomous vehicle based on heuristic searching using online images.” Vietnam Journal of Computer Science 2(2): 109-120. DOI: http://doi.org/dvgn
Hawas, Y.E., and H. El-Shayed. 2015. “Autonomous real time route guidance in inter-vehicular communication urban networks.” Vehicular Communications 2(1): 36–46. DOI: http://doi.org/dvgp
Jadaan, K., H. Khreis, and Á Török. 2018. “Exposure to Traffic-related Air Pollution and the Onset of Childhood Asthma: A Review of the Literature and the Assement Methods Used.” Periodica Polytechnica Transportation Engineering, 46(1): 21-28. DOI: http://doi.org/dvgq
Oskarbski, J., K. Birr, M. Miszewski, and K. Zarski. 2015. “Estimating the Average Speed of Public Transport Vehicles Based on Traffic Control System Data.” Models and Technologies for Intelligent Transportation Systems (MT-ITS), Budapest. DOI: http://doi.org/dvgr
Pala, M., N. O. Eragi, F. López-Colino, A. Sanchez, A. de Casrto, and J. Garrido. 2013. “HCTNav: A Path Planning Algorithm for Low-Cost Autonomous Robot Navigation in Indoor Environments.” ISPRS International Journal of Geo-Information 2(3): 729-748. DOI: http://doi.org/gchs7q
Parulekar, M., V. Padte, T. Shah, K. Shroff, R. Shetty, 2013. “Automatic Vehicle Navigation using Dijkstra’s Algorithm.” International Conference on Advances in Technology and Engineering (ICATE), Mumbai. pp. 1-5. DOI: http://doi.org/dvgt
PostBus. “Project ‘SmartShuttle’: Shape the mobility of the future.” letöltve: 2020. január 4-én. https://www.postauto.ch/en/project-smartshuttle-0.
Speranza, M. G. 2018. “Trends in Transportation and Logistics.” European Journal of Operational Research 264 (3): 830–836. DOI: http://doi.org/gfgkmc
Storandt, S. 2012. “Algorithms for vehicle navigation.” PhD dissertation, Universität Stuttgart.
Szalay, Z., T. Tettamanti, D. Esztergár-Kiss, I. Varga, and C. Bartolini. 2018. “Development of a Test Track for Driverless Cars: Vehicle Design, Track Configuration, and Liability Considerations.” Periodica Polytechnica Transportation Engineering. 46(1): 29-35. DOI: http://doi.org/dktg
Tavasszy, L., K. Ruijgrok, and I. Davydenko. 2012. “Incorporating Logistics in Freight Transportation Models: State of the Art and Research Opportunities.” Transport Reviews 32 (2): 203–219. DOI: http://doi.org/fxzmms
Taxi trip data, New York. “NYC OpenData: Yellow Taxi Trip Data.” 2014. letöltve: 2020. január 4-én. https://data.cityofnewyork.us/view/gn7m-em8n.
Wien. “Selbstfahrender Bus in der Seestadt unterwegs”, letöltve: 2020. január 4-én. https://www.wien.gv.at/verkehr/oeffentlich/selbstfahrender-bus.html
Yen, J.Y. 1970. “An algorithm for finding shortest routes from all source nodes to a given destination in general networks.” Quarterly of applied mathematics 27(4): 526-530. DOI: http://doi.org/dvgw
Zhang, R., F. Rossi, and M. Pavone. 2016. “Routing Autonomous Vehicles in Congested Transportation Networks:
Structural Properties and Coordination Algorithms.” In: Proceedings of Robotics: Science and Systems, AnnArbor, Michigan, DOI: http://doi.org/dvgx
Articles published electronically are open access (OJS), freely available online and can be downloaded. Authors of articles are not charged any publication or publishing costs (APC). Users have the right to read, download, copy, print, and search the articles, or share the full text with a link.
Authors must declare that their submission has not been previously published in another journal, that financial support has been acknowledged, and that the list of references is complete and accurate, including specification of URLs and DOIs (if available). When submitting a draft article, each author approves the submitted version. Authors guarantee that the article is their original work. Authors are required to participate in the peer review process, follow the advice of reviewers, meet the prescribed deadlines, and, if any, withdraw the submission or correct errors.
All submitted articles are subject to peer review, where the editors request an independent evaluation from at least one expert, ensuring that the reviewer(s) have no conflicts of interest with the authors. The final decision is made by the Editor-in-Chief, who takes into account the evaluations and the suggestions of the editors. The editors and reviewers treat the submission confidentially.
The publisher and editors are committed to maintaining high ethical standards and to preventing publications that involve research misconduct. They follow the COPE guidelines on such ethical issues.
The authors retain copyright and grant the journal the right of first publication under the Creative Commons License (https://creativecommons.org/licenses/by-nc-nd/4.0), which allows others to share the work, while acknowledging the authorship of the work and the first publication in the journal.
The journal archives all published articles, and the journal's owner, the Hungarian Society of Transportation Sciences, will continue to operate the database even if the journal ceases to be published.
