{"id":"https://openalex.org/W2605815729","doi":"https://doi.org/10.1109/blackseacom.2016.7901597","title":"Comparative analysis of algorithms to search for the shortest path in a maze","display_name":"Comparative analysis of algorithms to search for the shortest path in a maze","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2605815729","doi":"https://doi.org/10.1109/blackseacom.2016.7901597","mag":"2605815729"},"language":"en","primary_location":{"id":"doi:10.1109/blackseacom.2016.7901597","is_oa":false,"landing_page_url":"https://doi.org/10.1109/blackseacom.2016.7901597","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","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/A5076434622","display_name":"Milena Karova","orcid":null},"institutions":[{"id":"https://openalex.org/I147527907","display_name":"Technical University of Varna","ror":"https://ror.org/03zrwm897","country_code":"BG","type":"education","lineage":["https://openalex.org/I147527907"]}],"countries":["BG"],"is_corresponding":false,"raw_author_name":"Milena Karova","raw_affiliation_strings":["Department of Computing Engineering, Technical University of Varna, Varna, Bulgaria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing Engineering, Technical University of Varna, Varna, Bulgaria","institution_ids":["https://openalex.org/I147527907"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058209856","display_name":"Ivaylo Penev","orcid":"https://orcid.org/0000-0003-2556-3304"},"institutions":[{"id":"https://openalex.org/I147527907","display_name":"Technical University of Varna","ror":"https://ror.org/03zrwm897","country_code":"BG","type":"education","lineage":["https://openalex.org/I147527907"]}],"countries":["BG"],"is_corresponding":false,"raw_author_name":"Ivaylo Penev","raw_affiliation_strings":["Department of Computing Engineering, Technical University of Varna, Varna, Bulgaria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing Engineering, Technical University of Varna, Varna, Bulgaria","institution_ids":["https://openalex.org/I147527907"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055778031","display_name":"Neli Kalcheva","orcid":"https://orcid.org/0000-0002-9277-2803"},"institutions":[{"id":"https://openalex.org/I147527907","display_name":"Technical University of Varna","ror":"https://ror.org/03zrwm897","country_code":"BG","type":"education","lineage":["https://openalex.org/I147527907"]}],"countries":["BG"],"is_corresponding":false,"raw_author_name":"Neli Kalcheva","raw_affiliation_strings":["Department of Computing Engineering, Technical University of Varna, Varna, Bulgaria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing Engineering, Technical University of Varna, Varna, Bulgaria","institution_ids":["https://openalex.org/I147527907"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.507,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.75292917,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"4","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.9933000206947327,"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.9933000206947327,"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/T11106","display_name":"Data Management and Algorithms","score":0.9879000186920166,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9398999810218811,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6057329773902893},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.55755215883255},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5563995838165283},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4909873306751251},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4361386299133301},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.4217730164527893},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.33532005548477173},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2805470824241638},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.0757036805152893}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6057329773902893},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.55755215883255},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5563995838165283},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4909873306751251},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4361386299133301},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.4217730164527893},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.33532005548477173},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2805470824241638},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0757036805152893},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/blackseacom.2016.7901597","is_oa":false,"landing_page_url":"https://doi.org/10.1109/blackseacom.2016.7901597","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W137846029","https://openalex.org/W1418115906","https://openalex.org/W1951206964","https://openalex.org/W2418297847","https://openalex.org/W2548458395","https://openalex.org/W6628216855","https://openalex.org/W6640803351","https://openalex.org/W6717033634"],"related_works":["https://openalex.org/W3183360588","https://openalex.org/W2810620529","https://openalex.org/W2369403113","https://openalex.org/W2352589493","https://openalex.org/W2462581792","https://openalex.org/W2374583081","https://openalex.org/W2372473202","https://openalex.org/W2384089948","https://openalex.org/W2026630113","https://openalex.org/W2102755248"],"abstract_inverted_index":{"The":[0,25,43,61],"aim":[1],"of":[2,10,15,51,70,81],"the":[3,13,52,59,68,71],"paper":[4],"is":[5],"research":[6],"and":[7,34,55,65,79],"comparative":[8],"analysis":[9],"algorithms":[11,26,44,73],"from":[12],"field":[14],"artificial":[16],"intelligence":[17],"for":[18,57,74],"searching":[19],"shortest":[20],"path":[21,54],"in":[22],"a":[23],"maze.":[24],"studied":[27],"are":[28,45],"A*":[29],"(A":[30],"star),":[31],"backtracking":[32],"algorithm":[33,36],"genetic":[35],"(GAPP":[37],"-":[38],"Genetic":[39],"Algorithm":[40],"Path":[41],"Planning).":[42],"compared":[46],"by":[47],"two":[48],"criteria:":[49],"length":[50],"found":[53],"time":[56],"finding":[58],"path.":[60],"results,":[62],"presented":[63],"analytically":[64],"graphically,":[66],"show":[67],"application":[69],"three":[72],"mazes":[75],"with":[76],"various":[77],"size":[78],"number":[80],"obstacles.":[82]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}