The paper discribes a method which builds a graph of Budapest, based on the OpenStreetMap database, and implements route planning algorithms that can traverse and generate routes on the mentioned graph. Route planning is implemented using Dijkstra and A* algorithm, to prefer paths that are not sidewalks when generating the route. A random path generation was implemented to create round trip routes. For the communication to happen between the planner and the user, an interactive map, was implemented with React, using mapbox display services.
Support the authors with ResearchCoin