{"id":"https://openalex.org/W2922204282","doi":"https://doi.org/10.1109/robio.2018.8665326","title":"Self-Adjusting Roadmaps: A Fast Sampling-Based Path Planning Algorithm for Navigation in Unknown Environments","display_name":"Self-Adjusting Roadmaps: A Fast Sampling-Based Path Planning Algorithm for Navigation in Unknown Environments","publication_year":2018,"publication_date":"2018-12-01","ids":{"openalex":"https://openalex.org/W2922204282","doi":"https://doi.org/10.1109/robio.2018.8665326","mag":"2922204282"},"language":"en","primary_location":{"id":"doi:10.1109/robio.2018.8665326","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robio.2018.8665326","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Conference on Robotics and Biomimetics (ROBIO)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5061869177","display_name":"Weria Khaksar","orcid":"https://orcid.org/0000-0002-6400-3150"},"institutions":[{"id":"https://openalex.org/I184942183","display_name":"University of Oslo","ror":"https://ror.org/01xtthb56","country_code":"NO","type":"education","lineage":["https://openalex.org/I184942183"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Weria Khaksar","raw_affiliation_strings":["Robotics and Intelligent Systems Group, University of Oslo, Oslo, Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Robotics and Intelligent Systems Group, University of Oslo, Oslo, Norway","institution_ids":["https://openalex.org/I184942183"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051442365","display_name":"Md. Zia Uddin","orcid":"https://orcid.org/0000-0002-5215-1834"},"institutions":[{"id":"https://openalex.org/I184942183","display_name":"University of Oslo","ror":"https://ror.org/01xtthb56","country_code":"NO","type":"education","lineage":["https://openalex.org/I184942183"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Md Zia Uddin","raw_affiliation_strings":["Robotics and Intelligent Systems Group, University of Oslo, Oslo, Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Robotics and Intelligent Systems Group, University of Oslo, Oslo, Norway","institution_ids":["https://openalex.org/I184942183"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071144214","display_name":"Jim T\u00f8rresen","orcid":"https://orcid.org/0000-0003-0556-0288"},"institutions":[{"id":"https://openalex.org/I184942183","display_name":"University of Oslo","ror":"https://ror.org/01xtthb56","country_code":"NO","type":"education","lineage":["https://openalex.org/I184942183"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Jim Torresen","raw_affiliation_strings":["Robotics and Intelligent Systems Group, University of Oslo, Oslo, Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Robotics and Intelligent Systems Group, University of Oslo, Oslo, Norway","institution_ids":["https://openalex.org/I184942183"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I184942183"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"139","issue":null,"first_page":"1094","last_page":"1101"},"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.9847999811172485,"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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9789000153541565,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical 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/probabilistic-roadmap","display_name":"Probabilistic roadmap","score":0.9147217273712158},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.8030351996421814},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.7120202779769897},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6868007779121399},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.6453766226768494},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5546904802322388},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5385907888412476},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.5238749384880066},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5097171664237976},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.47988688945770264},{"id":"https://openalex.org/keywords/factor-graph","display_name":"Factor graph","score":0.4673861265182495},{"id":"https://openalex.org/keywords/grid-reference","display_name":"Grid reference","score":0.45815953612327576},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.44117802381515503},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.31037893891334534},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.27540314197540283},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2626704275608063},{"id":"https://openalex.org/keywords/computer-vision","display_name":"Computer vision","score":0.23460474610328674},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.17150941491127014},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12753784656524658}],"concepts":[{"id":"https://openalex.org/C2778803389","wikidata":"https://www.wikidata.org/wiki/Q7246866","display_name":"Probabilistic roadmap","level":4,"score":0.9147217273712158},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.8030351996421814},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.7120202779769897},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6868007779121399},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.6453766226768494},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5546904802322388},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5385907888412476},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.5238749384880066},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5097171664237976},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.47988688945770264},{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.4673861265182495},{"id":"https://openalex.org/C156172958","wikidata":"https://www.wikidata.org/wiki/Q3438407","display_name":"Grid reference","level":4,"score":0.45815953612327576},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.44117802381515503},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.31037893891334534},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.27540314197540283},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2626704275608063},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.23460474610328674},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.17150941491127014},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12753784656524658},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"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/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/robio.2018.8665326","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robio.2018.8665326","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Conference on Robotics and Biomimetics (ROBIO)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.7200000286102295,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1424654272","https://openalex.org/W1656242846","https://openalex.org/W1971086298","https://openalex.org/W1997525204","https://openalex.org/W2000359213","https://openalex.org/W2067754486","https://openalex.org/W2068494056","https://openalex.org/W2070092132","https://openalex.org/W2097096168","https://openalex.org/W2104691494","https://openalex.org/W2104920576","https://openalex.org/W2107535513","https://openalex.org/W2109212155","https://openalex.org/W2123312258","https://openalex.org/W2128990851","https://openalex.org/W2130678356","https://openalex.org/W2130999558","https://openalex.org/W2133826865","https://openalex.org/W2141664020","https://openalex.org/W2150090925","https://openalex.org/W2159722616","https://openalex.org/W2161675447","https://openalex.org/W2313214390","https://openalex.org/W2488693412","https://openalex.org/W2523233404","https://openalex.org/W2526007611","https://openalex.org/W2563927405","https://openalex.org/W2586895547","https://openalex.org/W2611243847"],"related_works":["https://openalex.org/W2107702345","https://openalex.org/W2137520303","https://openalex.org/W1536392978","https://openalex.org/W2216928063","https://openalex.org/W2389713625","https://openalex.org/W2394276631","https://openalex.org/W3216096898","https://openalex.org/W4308217561","https://openalex.org/W2134348961","https://openalex.org/W2115192598"],"abstract_inverted_index":{"Despite":[0],"the":[1,18,40,55,69,72,76,89,111,123,141,152,157,162,173,177,180,188,191,196,203,210,220,223],"outstanding":[2],"performances":[3],"of":[4,20,28,58,68,190,212,222],"sampling-based":[5],"motion":[6],"planning":[7,11,90],"algorithms":[8,61],"in":[9,17,24,51,82,88,114,122,179,239,243],"different":[10],"problems,":[12],"they":[13,185],"fail":[14],"to":[15,35,63,80,84,132,144,176],"operate":[16],"presence":[19],"unknown":[21,38,105,244],"obstacles.":[22],"Even":[23],"few":[25],"recent":[26],"versions":[27],"these":[29],"planners":[30],"which":[31,46,102,127],"has":[32,228],"been":[33,229],"upgraded":[34],"deal":[36,85],"with":[37,86,104],"situations,":[39],"generated":[41,112],"results":[42],"are":[43,199],"computationally":[44,130],"expensive":[45],"creates":[47],"a":[48,65,95,115,148,234],"major":[49],"problem":[50],"online":[52],"implementations.":[53],"Since":[54],"basic":[56],"idea":[57],"randomized":[59],"navigation":[60,241],"is":[62,100,193],"utilize":[64],"pre-constructed":[66],"structure":[67,78,117],"obstacle":[70,204],"map,":[71],"sampling":[73],"procedure":[74],"and":[75,165,172,195,216],"graph":[77,192],"need":[79],"improve":[81],"order":[83],"uncertainty":[87],"space.":[91],"In":[92],"this":[93],"paper,":[94],"self-adjusting":[96],"probabilistic":[97],"roadmap":[98,174],"algorithm":[99,109],"proposed":[101,224],"deals":[103],"obstacles":[106,164],"quickly.":[107],"This":[108],"stores":[110],"samples":[113,168],"grid":[116,159],"based":[118],"on":[119,233],"their":[120,166],"position":[121],"corresponding":[124,167],"configuration":[125],"space":[126],"makes":[128],"it":[129],"affordable":[131],"check":[133],"them":[134],"against":[135],"collision":[136],"later.":[137],"It":[138],"also":[139,230],"enables":[140],"path":[142],"planner":[143,227],"include":[145],"safety":[146],"as":[147,182,184],"decision":[149],"factor":[150],"during":[151],"actual":[153],"navigation.":[154],"Next,":[155],"only":[156],"occupied":[158,197],"cells":[160],"by":[161],"undetected":[163],"will":[169],"be":[170],"checked":[171],"responses":[175],"changes":[178],"environment":[181],"soon":[183],"occur.":[186],"Furthermore,":[187],"size":[189],"maintained,":[194],"nodes":[198],"pushed":[200],"away":[201],"from":[202,209],"rather":[205],"than":[206],"being":[207],"removed":[208],"set":[211],"samples.":[213],"Several":[214],"simulation":[215],"comparative":[217],"studies":[218],"show":[219],"effectiveness":[221],"algorithm.":[225],"The":[226],"successfully":[231],"implemented":[232],"differential":[235],"drive":[236],"robotic":[237],"platform":[238],"two":[240],"missions":[242],"environments.":[245]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}