{"id":"https://openalex.org/W7124854430","doi":"https://doi.org/10.1109/ic2sda68097.2025.11331417","title":"Path Planning Algorithms: A Comparative Study","display_name":"Path Planning Algorithms: A Comparative Study","publication_year":2025,"publication_date":"2025-11-03","ids":{"openalex":"https://openalex.org/W7124854430","doi":"https://doi.org/10.1109/ic2sda68097.2025.11331417"},"language":"en","primary_location":{"id":"doi:10.1109/ic2sda68097.2025.11331417","doi":"https://doi.org/10.1109/ic2sda68097.2025.11331417","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ic2sda68097.2025.11331417","pdf_url":null,"source":{"id":"https://openalex.org/S7407105323","display_name":"International Conference on Intelligent Computer Systems, Data Science and Applications (IC2SDA)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 International Conference on Intelligent Computer Systems, Data Science and Applications (IC2SDA)","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"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/A5042392379","display_name":"Rahima Bentrcia","orcid":"https://orcid.org/0009-0001-1514-4483","observed_orcids":["https://orcid.org/0009-0001-1514-4483"]},"institutions":[{"id":"https://openalex.org/I4210145508","display_name":"University Mohamed Boudiaf of M'sila","ror":"https://ror.org/055rz8d64","country_code":"DZ","type":"education","lineage":["https://openalex.org/I4210145508"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Rahima Bentrcia","raw_affiliation_strings":["University of M'Sila, University Pole, Road Bordj Bou Arreridj,Dept. of Computer Science,M'Sila,Algeria,28000"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of M'Sila, University Pole, Road Bordj Bou Arreridj,Dept. of Computer Science,M'Sila,Algeria,28000","institution_ids":["https://openalex.org/I4210145508"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5123413302","display_name":"Souheila Zegaar","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I4210145508","display_name":"University Mohamed Boudiaf of M'sila","ror":"https://ror.org/055rz8d64","country_code":"DZ","type":"education","lineage":["https://openalex.org/I4210145508"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Souheila Zegaar","raw_affiliation_strings":["University of M'Sila, University Pole, Road Bordj Bou Arreridj,Dept. of Computer Science,M'Sila,Algeria,28000"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of M'Sila, University Pole, Road Bordj Bou Arreridj,Dept. of Computer Science,M'Sila,Algeria,28000","institution_ids":["https://openalex.org/I4210145508"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5123422634","display_name":"Nour Chames Elassil Saadoune","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I4210145508","display_name":"University Mohamed Boudiaf of M'sila","ror":"https://ror.org/055rz8d64","country_code":"DZ","type":"education","lineage":["https://openalex.org/I4210145508"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Nour Chames Elassil Saadoune","raw_affiliation_strings":["University of M'Sila, University Pole, Road Bordj Bou Arreridj,Dept. of Computer Science,M'Sila,Algeria,28000"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of M'Sila, University Pole, Road Bordj Bou Arreridj,Dept. of Computer Science,M'Sila,Algeria,28000","institution_ids":["https://openalex.org/I4210145508"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210145508"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.53770801,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.0,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.0,"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/path-planning","display_name":"path planning","score":0.9950000047683716},{"id":"https://openalex.org/keywords/robot-navigation","display_name":"robot navigation","score":0.8769999742507935},{"id":"https://openalex.org/keywords/search-algorithms","display_name":"search algorithms","score":0.7419999837875366},{"id":"https://openalex.org/keywords/dijkstra-s-algorithm","display_name":"Dijkstra's algorithm","score":0.8659999966621399},{"id":"https://openalex.org/keywords/a-algorithm","display_name":"A* algorithm","score":0.9679999947547913},{"id":"https://openalex.org/keywords/breadth-first-search","display_name":"breadth-first search","score":0.9990000128746033},{"id":"https://openalex.org/keywords/depth-first-search","display_name":"depth-first search","score":1.0},{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.9110000133514404},{"id":"https://openalex.org/keywords/obstacle-avoidance","display_name":"obstacle avoidance","score":0.7559999823570251},{"id":"https://openalex.org/keywords/algorithm-comparison","display_name":"algorithm comparison","score":0.7110000252723694},{"id":"https://openalex.org/keywords/execution-time","display_name":"execution time","score":0.6499999761581421},{"id":"https://openalex.org/keywords/path-length","display_name":"path length","score":0.9409999847412109}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6651999950408936},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5856999754905701},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.5662000179290771},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5608999729156494},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47999998927116394},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.45100000500679016},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3894999921321869},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.37880000472068787},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.3560999929904938},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3440000116825104},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3149000108242035},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.3010999858379364},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2842999994754791},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28349998593330383},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.2775000035762787},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.2662999927997589},{"id":"https://openalex.org/C103578098","wikidata":"https://www.wikidata.org/wiki/Q277680","display_name":"A* search algorithm","level":2,"score":0.2637999951839447},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.2612000107765198}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ic2sda68097.2025.11331417","doi":"https://doi.org/10.1109/ic2sda68097.2025.11331417","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ic2sda68097.2025.11331417","pdf_url":null,"source":{"id":"https://openalex.org/S7407105323","display_name":"International Conference on Intelligent Computer Systems, Data Science and Applications (IC2SDA)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 International Conference on Intelligent Computer Systems, Data Science and Applications (IC2SDA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1926428750","https://openalex.org/W2103120971","https://openalex.org/W2242461718","https://openalex.org/W2944768436","https://openalex.org/W3034726893","https://openalex.org/W3127511342","https://openalex.org/W3130735748","https://openalex.org/W3160747345","https://openalex.org/W3186792589","https://openalex.org/W3217495337"],"related_works":["https://openalex.org/W4402674222","https://openalex.org/W4416342043","https://openalex.org/W4402824884","https://openalex.org/W3217808769","https://openalex.org/W4391992958","https://openalex.org/W2891479590","https://openalex.org/W4409326201","https://openalex.org/W4414614330","https://openalex.org/W4405267183","https://openalex.org/W4313315806"],"abstract_inverted_index":{"In":[0,13],"environments":[1],"with":[2,96],"obstacles,":[3,97],"path":[4,46,82],"planning":[5],"algorithms":[6,25,31],"are":[7,40],"very":[8],"important":[9],"for":[10,83],"robots'":[11],"navigation.":[12],"this":[14],"work,":[15],"we":[16],"conducted":[17],"a":[18,50],"comparative":[19],"study":[20],"where":[21],"four":[22],"basic":[23],"search":[24,43],"namely":[26],"Dijkstra,$A^{*}$,":[27],"BFS,":[28],"and":[29,45,68],"DFS":[30],"were":[32,66],"compared":[33],"based":[34],"on":[35,99],"three":[36],"evaluation":[37],"metrics":[38],"which":[39],"running":[41],"time,":[42],"path,":[44],"length.":[47],"To":[48],"achieve":[49],"fair":[51],"analysis,":[52],"every":[53],"algorithm":[54,77],"is":[55],"executed":[56],"ten":[57],"times":[58],"in":[59,78,87],"two":[60],"different":[61],"environments.":[62],"The":[63],"experimental":[64],"results":[65],"comprehensive":[67],"expressive,":[69],"directing":[70],"researchers":[71],"to":[72],"choose":[73],"the":[74,80,84,100],"most":[75],"optimal":[76],"finding":[79],"shortest":[81],"robot":[85],"either":[86],"an":[88,94],"environment":[89,95],"free":[90],"of":[91],"obstacles":[92],"or":[93],"depending":[98],"application.":[101]},"counts_by_year":[],"updated_date":"2026-10-28T10:33:24.094632","created_date":"2026-01-21T00:00:00"}