{"id":"https://openalex.org/W4382204171","doi":"https://doi.org/10.1109/saci58269.2023.10158636","title":"Random and shortest path generation for running or walking purposes","display_name":"Random and shortest path generation for running or walking purposes","publication_year":2023,"publication_date":"2023-05-23","ids":{"openalex":"https://openalex.org/W4382204171","doi":"https://doi.org/10.1109/saci58269.2023.10158636"},"language":"en","primary_location":{"id":"doi:10.1109/saci58269.2023.10158636","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/saci58269.2023.10158636","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE 17th International Symposium on Applied Computational Intelligence and Informatics (SACI)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5092276400","display_name":"Krisztofer Szebaszti\u00e1n Moln\u00e1r","orcid":null},"institutions":[{"id":"https://openalex.org/I2801419141","display_name":"Buda Health Center","ror":"https://ror.org/00yx04352","country_code":"HU","type":"healthcare","lineage":["https://openalex.org/I2801419141"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"Krisztofer Szebaszti\u00e1n Moln\u00e1r","raw_affiliation_strings":["John von Neumann Faculty of Informatics Óbuda Univeryity,Budapest,Hungary"],"affiliations":[{"raw_affiliation_string":"John von Neumann Faculty of Informatics Óbuda Univeryity,Budapest,Hungary","institution_ids":["https://openalex.org/I2801419141"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089551028","display_name":"Szabolcs Sergy\u00e1n","orcid":"https://orcid.org/0000-0002-7722-5238"},"institutions":[{"id":"https://openalex.org/I2801419141","display_name":"Buda Health Center","ror":"https://ror.org/00yx04352","country_code":"HU","type":"healthcare","lineage":["https://openalex.org/I2801419141"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Szabolcs Sergy\u00e1n","raw_affiliation_strings":["John von Neumann Faculty of Informatics Óbuda Univeryity,Budapest,Hungary"],"affiliations":[{"raw_affiliation_string":"John von Neumann Faculty of Informatics Óbuda Univeryity,Budapest,Hungary","institution_ids":["https://openalex.org/I2801419141"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5092276400"],"corresponding_institution_ids":["https://openalex.org/I2801419141"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0776528,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"000761","last_page":"000766"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12698","display_name":"3D Modeling in Geospatial Applications","score":0.9825000166893005,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12698","display_name":"3D Modeling in Geospatial Applications","score":0.9825000166893005,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9815999865531921,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10757","display_name":"Geographic Information Systems Studies","score":0.9309999942779541,"subfield":{"id":"https://openalex.org/subfields/3305","display_name":"Geography, Planning and Development"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.8493591547012329},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.828271210193634},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7856860160827637},{"id":"https://openalex.org/keywords/planner","display_name":"Planner","score":0.7576446533203125},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.6366593837738037},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5843323469161987},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.54914790391922},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5133997201919556},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.48146286606788635},{"id":"https://openalex.org/keywords/route-planning","display_name":"Route planning","score":0.439431369304657},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33343032002449036},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3230154812335968},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.24358147382736206},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2256283164024353},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.14894157648086548},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08116576075553894}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.8493591547012329},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.828271210193634},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7856860160827637},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.7576446533203125},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.6366593837738037},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5843323469161987},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.54914790391922},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5133997201919556},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.48146286606788635},{"id":"https://openalex.org/C2989549987","wikidata":"https://www.wikidata.org/wiki/Q350882","display_name":"Route planning","level":2,"score":0.439431369304657},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33343032002449036},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3230154812335968},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.24358147382736206},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2256283164024353},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.14894157648086548},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08116576075553894},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/saci58269.2023.10158636","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/saci58269.2023.10158636","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE 17th International Symposium on Applied Computational Intelligence and Informatics (SACI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.75,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1969472392","https://openalex.org/W1969483458","https://openalex.org/W2169528473","https://openalex.org/W2605215687","https://openalex.org/W2944050950","https://openalex.org/W3212149345","https://openalex.org/W4366539460"],"related_works":["https://openalex.org/W4285687848","https://openalex.org/W223921116","https://openalex.org/W4402599120","https://openalex.org/W2982088850","https://openalex.org/W3216780016","https://openalex.org/W2912253819","https://openalex.org/W2906354749","https://openalex.org/W2766846319","https://openalex.org/W4293157163","https://openalex.org/W2376328589"],"abstract_inverted_index":{"The":[0],"paper":[1],"discribes":[2],"a":[3,7],"method":[4],"which":[5],"builds":[6],"graph":[8],"of":[9],"Budapest,":[10],"based":[11],"on":[12,27],"the":[13,28,49,63,68,71],"OpenStreetMap":[14],"database,":[15],"and":[16,24,37,70],"implements":[17],"route":[18],"planning":[19,32],"algorithms":[20],"that":[21,43],"can":[22],"traverse":[23],"generate":[25],"routes":[26],"mentioned":[29],"graph.":[30],"Route":[31],"is":[33],"implemented":[34,56,77],"using":[35,80],"Dijkstra":[36],"A*":[38],"algorithm,":[39],"to":[40,57,65],"prefer":[41],"paths":[42],"are":[44],"not":[45],"sidewalks":[46],"when":[47],"generating":[48],"route.":[50],"A":[51],"random":[52],"path":[53],"generation":[54],"was":[55,76],"create":[58],"round":[59],"trip":[60],"routes.":[61],"For":[62],"communication":[64],"happen":[66],"between":[67],"planner":[69],"user,":[72],"an":[73],"interactive":[74],"map,":[75],"with":[78],"React,":[79],"mapbox":[81],"display":[82],"services.":[83]},"counts_by_year":[],"updated_date":"2025-12-24T23:09:58.560324","created_date":"2025-10-10T00:00:00"}