{"id":"https://openalex.org/W2808277861","doi":"https://doi.org/10.1007/s10458-018-9391-2","title":"A complete multi-robot path-planning algorithm","display_name":"A complete multi-robot path-planning algorithm","publication_year":2018,"publication_date":"2018-06-13","ids":{"openalex":"https://openalex.org/W2808277861","doi":"https://doi.org/10.1007/s10458-018-9391-2","mag":"2808277861"},"language":"en","primary_location":{"id":"doi:10.1007/s10458-018-9391-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10458-018-9391-2","pdf_url":null,"source":{"id":"https://openalex.org/S5405189","display_name":"Autonomous Agents and Multi-Agent Systems","issn_l":"1387-2532","issn":["1387-2532","1573-7454"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Autonomous Agents and Multi-Agent Systems","raw_type":"journal-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/A5035063070","display_name":"Ebtehal T. Alotaibi","orcid":"https://orcid.org/0000-0002-8575-0139"},"institutions":[{"id":"https://openalex.org/I240666556","display_name":"Imam Mohammad ibn Saud Islamic University","ror":"https://ror.org/05gxjyb39","country_code":"SA","type":"education","lineage":["https://openalex.org/I240666556"]}],"countries":["SA"],"is_corresponding":true,"raw_author_name":"Ebtehal Turki Saho Alotaibi","raw_affiliation_strings":["Computer Science Department, Al-Imam Muhammad Ibn Saud Islamic University, Riyadh, SA, Saudi Arabia"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Al-Imam Muhammad Ibn Saud Islamic University, Riyadh, SA, Saudi Arabia","institution_ids":["https://openalex.org/I240666556"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027185638","display_name":"Hisham Al-Rawi","orcid":null},"institutions":[{"id":"https://openalex.org/I240666556","display_name":"Imam Mohammad ibn Saud Islamic University","ror":"https://ror.org/05gxjyb39","country_code":"SA","type":"education","lineage":["https://openalex.org/I240666556"]}],"countries":["SA"],"is_corresponding":false,"raw_author_name":"Hisham Al-Rawi","raw_affiliation_strings":["Computer Science Department, Al-Imam Muhammad Ibn Saud Islamic University, Riyadh, SA, Saudi Arabia"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Al-Imam Muhammad Ibn Saud Islamic University, Riyadh, SA, Saudi Arabia","institution_ids":["https://openalex.org/I240666556"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5035063070"],"corresponding_institution_ids":["https://openalex.org/I240666556"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.6374,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.7411596,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"32","issue":"5","first_page":"693","last_page":"740"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998000264167786,"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.9998000264167786,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9807000160217285,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9799000024795532,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5865610241889954},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5540032386779785},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5493672490119934},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5474357008934021},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.507150411605835},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4582502245903015},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44103485345840454},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.43800121545791626},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42920178174972534},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.42382943630218506},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.41699695587158203},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.3219384551048279},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31343722343444824},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.25967785716056824},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19477611780166626}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5865610241889954},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5540032386779785},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5493672490119934},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5474357008934021},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.507150411605835},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4582502245903015},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44103485345840454},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.43800121545791626},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42920178174972534},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42382943630218506},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.41699695587158203},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.3219384551048279},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31343722343444824},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.25967785716056824},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19477611780166626},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10458-018-9391-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10458-018-9391-2","pdf_url":null,"source":{"id":"https://openalex.org/S5405189","display_name":"Autonomous Agents and Multi-Agent Systems","issn_l":"1387-2532","issn":["1387-2532","1573-7454"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Autonomous Agents and Multi-Agent Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6200000047683716,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W93645818","https://openalex.org/W196900508","https://openalex.org/W1595525953","https://openalex.org/W1930659875","https://openalex.org/W1969839206","https://openalex.org/W1986164452","https://openalex.org/W2015098966","https://openalex.org/W2023375975","https://openalex.org/W2026170436","https://openalex.org/W2047441653","https://openalex.org/W2048036606","https://openalex.org/W2100695938","https://openalex.org/W2114720692","https://openalex.org/W2135939055","https://openalex.org/W2136398072","https://openalex.org/W2150470170","https://openalex.org/W2160222800","https://openalex.org/W2167451681","https://openalex.org/W2167979940","https://openalex.org/W2241357751","https://openalex.org/W2272580031","https://openalex.org/W2404271123","https://openalex.org/W2472243347","https://openalex.org/W4288079856","https://openalex.org/W6635615786","https://openalex.org/W6677255978"],"related_works":["https://openalex.org/W4293167680","https://openalex.org/W2776102956","https://openalex.org/W4382866750","https://openalex.org/W4387185483","https://openalex.org/W2022506245","https://openalex.org/W2040572217","https://openalex.org/W2388410942","https://openalex.org/W4385965963","https://openalex.org/W2600678155","https://openalex.org/W2018146256"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}