{"id":"https://openalex.org/W1541231764","doi":"https://doi.org/10.1109/icar.2015.7251456","title":"Mobile robot path planning for complex dynamic environments","display_name":"Mobile robot path planning for complex dynamic environments","publication_year":2015,"publication_date":"2015-07-01","ids":{"openalex":"https://openalex.org/W1541231764","doi":"https://doi.org/10.1109/icar.2015.7251456","mag":"1541231764"},"language":"en","primary_location":{"id":"doi:10.1109/icar.2015.7251456","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icar.2015.7251456","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 International Conference on Advanced Robotics (ICAR)","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/A5057254996","display_name":"Mohamed Lamine Tazir","orcid":null},"institutions":[{"id":"https://openalex.org/I39804081","display_name":"Sorbonne Universit\u00e9","ror":"https://ror.org/02en5vm52","country_code":"FR","type":"education","lineage":["https://openalex.org/I39804081"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mohamed Lamine Tazir","raw_affiliation_strings":["Faculty d'ing\u00e9nierie, Universit\u00e9 Pierre et Marie Curie, Paris, France","Faculty d'ing\u00e9nierie, Universit\u00e9 Pierre et Marie Curie, 75005 Paris, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty d'ing\u00e9nierie, Universit\u00e9 Pierre et Marie Curie, Paris, France","institution_ids":["https://openalex.org/I39804081"]},{"raw_affiliation_string":"Faculty d'ing\u00e9nierie, Universit\u00e9 Pierre et Marie Curie, 75005 Paris, France","institution_ids":["https://openalex.org/I39804081"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007777913","display_name":"Ouahiba Azouaoui","orcid":null},"institutions":[{"id":"https://openalex.org/I4210102186","display_name":"Centre de D\u00e9veloppement des Technologies Avanc\u00e9es","ror":"https://ror.org/01ay87255","country_code":"DZ","type":"facility","lineage":["https://openalex.org/I4210102186"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Ouahiba Azouaoui","raw_affiliation_strings":["CDTA, Centre de d\u00e9veloppement des technologies avanc\u00e9es, Alger, Algeria","Centre de d\u00e9veloppement des technologies avanc\u00e9es, CDTA, 16081 Alger, Algeria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CDTA, Centre de d\u00e9veloppement des technologies avanc\u00e9es, Alger, Algeria","institution_ids":["https://openalex.org/I4210102186"]},{"raw_affiliation_string":"Centre de d\u00e9veloppement des technologies avanc\u00e9es, CDTA, 16081 Alger, Algeria","institution_ids":["https://openalex.org/I4210102186"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065364321","display_name":"Mohamed Hazerchi","orcid":null},"institutions":[{"id":"https://openalex.org/I2802493600","display_name":"Polytechnic School of Algiers","ror":"https://ror.org/05t0zwy08","country_code":"DZ","type":"education","lineage":["https://openalex.org/I2802493600"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Mohamed Hazerchi","raw_affiliation_strings":["D\u00e9partement d'Automatique, \u00c9cole Nationale Polytechnique, Alger, Algeria","D\u00e9partement d'Automatique, \u00c9cole Nationale Polytechnique, 16200 Alger, Algeria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"D\u00e9partement d'Automatique, \u00c9cole Nationale Polytechnique, Alger, Algeria","institution_ids":["https://openalex.org/I2802493600"]},{"raw_affiliation_string":"D\u00e9partement d'Automatique, \u00c9cole Nationale Polytechnique, 16200 Alger, Algeria","institution_ids":["https://openalex.org/I2802493600"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044514578","display_name":"Mohammed Brahimi","orcid":"https://orcid.org/0000-0003-2034-644X"},"institutions":[{"id":"https://openalex.org/I4210149016","display_name":"\u00c9cole Nationale Sup\u00e9rieure d'Informatique","ror":"https://ror.org/04dj1dn66","country_code":"DZ","type":"education","lineage":["https://openalex.org/I4210149016"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Mohamed Brahimi","raw_affiliation_strings":["\u00c9cole Sup\u00e9rieure d'Informatique, Alger, Algeria","\u00c9cole Sup\u00e9rieure d'Informatique, 16270 Alger, Algeria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"\u00c9cole Sup\u00e9rieure d'Informatique, Alger, Algeria","institution_ids":["https://openalex.org/I4210149016"]},{"raw_affiliation_string":"\u00c9cole Sup\u00e9rieure d'Informatique, 16270 Alger, Algeria","institution_ids":["https://openalex.org/I4210149016"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3744,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.66686356,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"200","last_page":"206"},"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/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":1.0,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.992900013923645,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/T11615","display_name":"Control and Dynamics of Mobile Robots","score":0.9905999898910522,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.7683326005935669},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7436542510986328},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6833767890930176},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.6314253807067871},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.6073441505432129},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5608465075492859},{"id":"https://openalex.org/keywords/mobile-robot-navigation","display_name":"Mobile robot navigation","score":0.5197412967681885},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5129887461662292},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.5021440982818604},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.4822712540626526},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.4734484851360321},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.46309590339660645},{"id":"https://openalex.org/keywords/obstacle-avoidance","display_name":"Obstacle avoidance","score":0.4476343095302582},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.416806161403656},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.37598344683647156},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3585476279258728},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.34048736095428467},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2641443908214569},{"id":"https://openalex.org/keywords/robot-control","display_name":"Robot control","score":0.23304402828216553},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.18134376406669617},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.15394896268844604}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7683326005935669},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7436542510986328},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6833767890930176},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.6314253807067871},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6073441505432129},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5608465075492859},{"id":"https://openalex.org/C26990112","wikidata":"https://www.wikidata.org/wiki/Q6887224","display_name":"Mobile robot navigation","level":5,"score":0.5197412967681885},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5129887461662292},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.5021440982818604},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.4822712540626526},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.4734484851360321},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.46309590339660645},{"id":"https://openalex.org/C6683253","wikidata":"https://www.wikidata.org/wiki/Q7075535","display_name":"Obstacle avoidance","level":4,"score":0.4476343095302582},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.416806161403656},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.37598344683647156},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3585476279258728},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.34048736095428467},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2641443908214569},{"id":"https://openalex.org/C65401140","wikidata":"https://www.wikidata.org/wiki/Q7353385","display_name":"Robot control","level":4,"score":0.23304402828216553},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.18134376406669617},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.15394896268844604},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icar.2015.7251456","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icar.2015.7251456","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 International Conference on Advanced Robotics (ICAR)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.46000000834465027,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W76982152","https://openalex.org/W1414451058","https://openalex.org/W1424654272","https://openalex.org/W1497256448","https://openalex.org/W1539694548","https://openalex.org/W1553010236","https://openalex.org/W1827199899","https://openalex.org/W1982738050","https://openalex.org/W1993262167","https://openalex.org/W1994955764","https://openalex.org/W1998277076","https://openalex.org/W2009393207","https://openalex.org/W2015136933","https://openalex.org/W2024694195","https://openalex.org/W2068878320","https://openalex.org/W2073630694","https://openalex.org/W2087085495","https://openalex.org/W2103120971","https://openalex.org/W2114072408","https://openalex.org/W2115200209","https://openalex.org/W2116087455","https://openalex.org/W2133002596","https://openalex.org/W2340542859","https://openalex.org/W2340841877","https://openalex.org/W2611243847","https://openalex.org/W4285719527","https://openalex.org/W6654506329","https://openalex.org/W6677070995","https://openalex.org/W6679962398","https://openalex.org/W6704109102","https://openalex.org/W6704356574"],"related_works":["https://openalex.org/W3209137076","https://openalex.org/W4223969905","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W4221129498","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475","https://openalex.org/W4310124294","https://openalex.org/W143403600"],"abstract_inverted_index":{"The":[0,60,90,114,124,199,210],"last":[1],"few":[2],"years,":[3],"research":[4],"in":[5,24,42,177,221],"the":[6,30,34,46,100,120,154,159,163,172,193,196,202,214],"area":[7],"of":[8,21,33,53,64,80,153,174,195,201,218],"path":[9,32,102,145,169],"planning":[10],"for":[11,165],"mobile":[12],"robots":[13],"has":[14],"been":[15],"focusing":[16],"on":[17],"dynamic":[18,115],"environments.":[19,223],"Most":[20],"methods":[22,55,75],"proposed":[23,61],"this":[25,219],"topic":[26],"need":[27],"to":[28,76,128,157,185],"re-plan":[29],"remaining":[31],"robot,":[35],"every":[36],"time":[37,48,189],"when":[38],"new":[39,142,151,208],"information":[40,79,86,94,161],"come":[41],"which":[43,183],"significantly":[44,187],"increase":[45],"computation":[47,188],"and":[49,57,69,84,98,171,180,191,216],"make":[50],"real-time":[51],"implementation":[52],"these":[54],"difficult":[56],"sometimes":[58],"impossible.":[59],"approach":[62,220],"consists":[63],"two":[65,73],"different":[66],"modules":[67],"(static":[68],"dynamic)":[70],"that":[71],"combine":[72],"navigation":[74],"exploit":[77],"prior":[78,160],"global":[81,93,168,197],"static":[82,112],"map":[83],"local":[85,144],"coming":[87],"from":[88],"sensors.":[89],"robot":[91,121],"uses":[92],"about":[95,162],"his":[96],"environment,":[97],"plans":[99],"optimal":[101,143],"using":[103,146],"genetic":[104],"algorithms":[105],"(GA)":[106],"combined":[107],"with":[108],"Dijkstra":[109,147,175],"algorithm":[110,125,176],"through":[111],"obstacles.":[113],"phase":[116],"is":[117,122,126,156,205],"done":[118],"while":[119],"moving.":[123],"able":[127],"avoid":[129],"a":[130,141,167,186,207],"moving":[131],"obstacle":[132],"by":[133,139],"wait/Accelerate":[134],"concept":[135],"(W/A":[136],"C),":[137],"or":[138],"producing":[140],"algorithm.":[148],"A":[149],"particularly":[150],"aspect":[152],"work":[155],"use":[158],"environment":[164],"searching":[166],"efficiently":[170],"incorporation":[173],"both":[178],"off-line":[179],"online":[181],"phases,":[182],"leads":[184],"reducing,":[190],"increases":[192],"accuracy":[194],"trajectory.":[198],"introduction":[200],"accelerate":[203],"action":[204],"also":[206],"aspect.":[209],"simulation":[211],"results":[212],"confirm":[213],"efficiency":[215],"effectiveness":[217],"complex":[222]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}
