{"id":"https://openalex.org/W4410204536","doi":"https://doi.org/10.1109/csit65290.2024.10982587","title":"Multiagent Path Finding using Dijkstra Algorithm","display_name":"Multiagent Path Finding using Dijkstra Algorithm","publication_year":2024,"publication_date":"2024-10-16","ids":{"openalex":"https://openalex.org/W4410204536","doi":"https://doi.org/10.1109/csit65290.2024.10982587"},"language":"en","primary_location":{"id":"doi:10.1109/csit65290.2024.10982587","is_oa":false,"landing_page_url":"https://doi.org/10.1109/csit65290.2024.10982587","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE 19th International Conference on Computer Science and Information Technologies (CSIT)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5092640495","display_name":"Oleksandr Penko","orcid":null},"institutions":[{"id":"https://openalex.org/I3130802236","display_name":"National University Odesa Law Academy","ror":"https://ror.org/0282prk66","country_code":"UA","type":"education","lineage":["https://openalex.org/I3130802236"]}],"countries":["UA"],"is_corresponding":false,"raw_author_name":"Oleksandr Penko","raw_affiliation_strings":["Odesa I.I. Mechnikov National University,Department of Mathematical Support of Computer Systems,Odesa,Ukraine"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Odesa I.I. Mechnikov National University,Department of Mathematical Support of Computer Systems,Odesa,Ukraine","institution_ids":["https://openalex.org/I3130802236"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5117480469","display_name":"Valerii Pienko","orcid":null},"institutions":[{"id":"https://openalex.org/I3130802236","display_name":"National University Odesa Law Academy","ror":"https://ror.org/0282prk66","country_code":"UA","type":"education","lineage":["https://openalex.org/I3130802236"]}],"countries":["UA"],"is_corresponding":false,"raw_author_name":"Valerii Pienko","raw_affiliation_strings":["Odesa I.I. Mechnikov National University,Department of Mathematical Support of Computer Systems,Odesa,Ukraine"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Odesa I.I. Mechnikov National University,Department of Mathematical Support of Computer Systems,Odesa,Ukraine","institution_ids":["https://openalex.org/I3130802236"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012133675","display_name":"Eugene V. Malakhov","orcid":"https://orcid.org/0000-0002-9314-6062"},"institutions":[{"id":"https://openalex.org/I3130802236","display_name":"National University Odesa Law Academy","ror":"https://ror.org/0282prk66","country_code":"UA","type":"education","lineage":["https://openalex.org/I3130802236"]}],"countries":["UA"],"is_corresponding":false,"raw_author_name":"Eugene Malakhov","raw_affiliation_strings":["Odesa I.I. Mechnikov National University,Department of Mathematical Support of Computer Systems,Odesa,Ukraine"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Odesa I.I. Mechnikov National University,Department of Mathematical Support of Computer Systems,Odesa,Ukraine","institution_ids":["https://openalex.org/I3130802236"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I3130802236"],"apc_list":null,"apc_paid":null,"fwci":0.2629,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.63018682,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10456","display_name":"Multi-Agent Systems and Negotiation","score":0.9771000146865845,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11574","display_name":"Artificial Intelligence in Games","score":0.974399983882904,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.9005355834960938},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6835651397705078},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5885086059570312},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4800361394882202},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.3080877959728241},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2619189918041229},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10915663838386536},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.06785780191421509}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.9005355834960938},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6835651397705078},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5885086059570312},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4800361394882202},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.3080877959728241},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2619189918041229},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10915663838386536},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.06785780191421509}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/csit65290.2024.10982587","is_oa":false,"landing_page_url":"https://doi.org/10.1109/csit65290.2024.10982587","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE 19th International Conference on Computer Science and Information Technologies (CSIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W3359552","https://openalex.org/W47957325","https://openalex.org/W2293119400","https://openalex.org/W2945477115","https://openalex.org/W2965747936","https://openalex.org/W3156295478","https://openalex.org/W3178423299","https://openalex.org/W3210147722","https://openalex.org/W4252284432","https://openalex.org/W4312397905","https://openalex.org/W4401881542"],"related_works":["https://openalex.org/W3209137076","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W4221129498","https://openalex.org/W2887026015","https://openalex.org/W2375280931","https://openalex.org/W2361442013","https://openalex.org/W2373384475","https://openalex.org/W4310124294","https://openalex.org/W143403600"],"abstract_inverted_index":{"The":[0,21,139,150],"problem":[1],"of":[2,5,8,32,35,40,47,54,64,70,92,112,124,146,163,167,174,194,202],"cooperative":[3],"behavior":[4,145],"a":[6,15,105,122,208],"set":[7],"agents":[9,36,43,60,197],"in":[10,44,67,103,160],"an":[11,164,182],"environment":[12],"given":[13],"by":[14,86],"directed":[16],"state":[17],"graph":[18,101],"is":[19,23,61,80,83,119],"considered.":[20],"task":[22],"to":[24,108,129,156],"achieve":[25],"the":[26,30,33,38,45,51,55,57,62,68,74,76,90,94,100,110,133,143,147,153,157,161,168,175,192,199,203],"required":[27],"balance":[28],"between":[29,42,59],"length":[31],"paths":[34,69],"and":[37,121],"number":[39,123],"conflicts":[41,113,193],"process":[46],"passing":[48],"paths.":[49],"In":[50,89,180],"basic":[52,176],"formulation":[53,166],"problem,":[56,75],"conflict":[58],"sharing":[63],"identical":[65],"arcs":[66],"agents.":[71,116],"To":[72],"solve":[73],"classical":[77],"Dijkstra":[78],"algorithm":[79],"used,":[81],"which":[82],"executed":[84],"sequentially":[85],"each":[87,97],"agent.":[88],"course":[91],"finding":[93,195],"shortest":[95],"path,":[96],"agent":[98],"modifies":[99],"space":[102],"such":[104],"way":[106],"as":[107,205,207],"reduce":[109],"likelihood":[111],"with":[114],"subsequent":[115],"This":[117],"approach":[118,159,177],"original,":[120],"computational":[125],"experiments":[126,141],"were":[127],"performed":[128],"verify":[130],"it":[131],"using":[132],"software":[134],"developed":[135],"for":[136,171],"this":[137],"purpose.":[138],"conducted":[140],"demonstrate":[142],"adequate":[144],"main":[148],"algorithm.":[149],"paper":[151],"analyzes":[152],"limitations":[154],"inherent":[155],"proposed":[158],"framework":[162],"abstract":[165],"problem.":[169],"Directions":[170],"further":[172],"development":[173],"are":[178],"determined.":[179],"particular,":[181],"important":[183],"modification":[184],"was":[185],"designed":[186],"that":[187],"allows":[188],"taking":[189],"into":[190],"account":[191],"several":[196],"at":[198],"same":[200],"nodes":[201],"graph,":[204],"well":[206],"hybrid":[209],"version.":[210]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}