{"id":"https://openalex.org/W2611972117","doi":"https://doi.org/10.1109/smc.2017.8122814","title":"Dynamic path planning and replanning for mobile robots using RRT","display_name":"Dynamic path planning and replanning for mobile robots using RRT","publication_year":2017,"publication_date":"2017-10-01","ids":{"openalex":"https://openalex.org/W2611972117","doi":"https://doi.org/10.1109/smc.2017.8122814","mag":"2611972117"},"language":"en","primary_location":{"id":"doi:10.1109/smc.2017.8122814","is_oa":false,"landing_page_url":"https://doi.org/10.1109/smc.2017.8122814","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","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/A5058712885","display_name":"Devin Connell","orcid":null},"institutions":[{"id":"https://openalex.org/I134113660","display_name":"University of Nevada, Reno","ror":"https://ror.org/01keh0577","country_code":"US","type":"education","lineage":["https://openalex.org/I134113660"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Devin Connell","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Nevada, Reno, NV, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Nevada, Reno, NV, USA","institution_ids":["https://openalex.org/I134113660"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060555317","display_name":"Hung Manh La","orcid":"https://orcid.org/0000-0003-2183-2634"},"institutions":[{"id":"https://openalex.org/I134113660","display_name":"University of Nevada, Reno","ror":"https://ror.org/01keh0577","country_code":"US","type":"education","lineage":["https://openalex.org/I134113660"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hung Manh La","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Nevada, Reno, NV, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Nevada, Reno, NV, USA","institution_ids":["https://openalex.org/I134113660"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5058712885"],"corresponding_institution_ids":["https://openalex.org/I134113660"],"apc_list":null,"apc_paid":null,"fwci":3.3281,"has_fulltext":false,"cited_by_count":96,"citation_normalized_percentile":{"value":0.95541292,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"1429","last_page":"1434"},"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.9983999729156494,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9940999746322632,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/mobile-robot","display_name":"Mobile robot","score":0.7920106053352356},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.7579746246337891},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.7401895523071289},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.7358889579772949},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.7102085947990417},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6753835678100586},{"id":"https://openalex.org/keywords/plan","display_name":"Plan (archaeology)","score":0.6116234660148621},{"id":"https://openalex.org/keywords/obstacle-avoidance","display_name":"Obstacle avoidance","score":0.4983048439025879},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.49135008454322815},{"id":"https://openalex.org/keywords/simulation","display_name":"Simulation","score":0.37737932801246643},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.33986571431159973},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.23583891987800598},{"id":"https://openalex.org/keywords/systems-engineering","display_name":"Systems engineering","score":0.06306546926498413},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.06097438931465149},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.055422067642211914}],"concepts":[{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.7920106053352356},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.7579746246337891},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7401895523071289},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.7358889579772949},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.7102085947990417},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6753835678100586},{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.6116234660148621},{"id":"https://openalex.org/C6683253","wikidata":"https://www.wikidata.org/wiki/Q7075535","display_name":"Obstacle avoidance","level":4,"score":0.4983048439025879},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.49135008454322815},{"id":"https://openalex.org/C44154836","wikidata":"https://www.wikidata.org/wiki/Q45045","display_name":"Simulation","level":1,"score":0.37737932801246643},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.33986571431159973},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.23583891987800598},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.06306546926498413},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.06097438931465149},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.055422067642211914},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/smc.2017.8122814","is_oa":false,"landing_page_url":"https://doi.org/10.1109/smc.2017.8122814","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7900000214576721,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W131069610","https://openalex.org/W1976930960","https://openalex.org/W1978540745","https://openalex.org/W1992675343","https://openalex.org/W1995224428","https://openalex.org/W2043698158","https://openalex.org/W2061782717","https://openalex.org/W2070485973","https://openalex.org/W2071401582","https://openalex.org/W2076162824","https://openalex.org/W2089108971","https://openalex.org/W2095757353","https://openalex.org/W2099593662","https://openalex.org/W2108643443","https://openalex.org/W2112271657","https://openalex.org/W2128990851","https://openalex.org/W2166077797","https://openalex.org/W2296385533","https://openalex.org/W2315770071","https://openalex.org/W2335799662","https://openalex.org/W2519453022","https://openalex.org/W2570852788","https://openalex.org/W2588162001","https://openalex.org/W3102121895","https://openalex.org/W6605295560","https://openalex.org/W6649268673"],"related_works":["https://openalex.org/W2930076404","https://openalex.org/W4253519380","https://openalex.org/W2071957557","https://openalex.org/W2596413128","https://openalex.org/W4391249562","https://openalex.org/W2356867392","https://openalex.org/W2782776446","https://openalex.org/W3043170174","https://openalex.org/W2155948905","https://openalex.org/W4380590094"],"abstract_inverted_index":{"It":[0],"is":[1,27,34,43,81,92],"necessary":[2],"for":[3],"a":[4,13,22,28],"mobile":[5],"robot":[6,42,54,68,95],"to":[7,10,21,71,74],"be":[8],"able":[9],"efficiently":[11],"plan":[12,100],"path":[14],"from":[15],"its":[16],"starting,":[17],"or":[18,58],"current":[19,99],"location":[20],"desired":[23],"goal":[24],"location.":[25],"This":[26],"trivial":[29],"task":[30],"when":[31,76,101],"the":[32,37,41,108,114,117],"environment":[33,39],"static.":[35],"However,":[36],"operational":[38],"of":[40,60,78,87,116],"rarely":[44],"static,":[45],"and":[46,63],"it":[47],"often":[48],"has":[49],"many":[50,59],"moving":[51,65,105],"obstacles.":[52,66],"The":[53,67,94],"may":[55],"encounter":[56],"one,":[57],"these":[61,79],"unknown":[62,103],"unpredictable":[64],"will":[69,96],"need":[70],"decide":[72],"how":[73],"proceed":[75],"one":[77],"obstacles":[80],"obstructing":[82],"it's":[83,98],"path.":[84,109],"A":[85],"method":[86],"dynamic":[88],"replanning":[89],"using":[90],"RRT*":[91],"presented.":[93],"modify":[97],"an":[102],"random":[104],"obstacle":[106],"obstructs":[107],"Various":[110],"experimental":[111],"results":[112],"show":[113],"effectiveness":[115],"proposed":[118],"method.":[119]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":12},{"year":2024,"cited_by_count":13},{"year":2023,"cited_by_count":11},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":14},{"year":2020,"cited_by_count":16},{"year":2019,"cited_by_count":17},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2026-04-18T07:56:08.524223","created_date":"2025-10-10T00:00:00"}