{"id":"https://openalex.org/W2896750934","doi":"https://doi.org/10.1109/ivs.2018.8500396","title":"Graph Search Based Local Path Planning with Adaptive Node Sampling","display_name":"Graph Search Based Local Path Planning with Adaptive Node Sampling","publication_year":2018,"publication_date":"2018-06-01","ids":{"openalex":"https://openalex.org/W2896750934","doi":"https://doi.org/10.1109/ivs.2018.8500396","mag":"2896750934"},"language":"en","primary_location":{"id":"doi:10.1109/ivs.2018.8500396","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ivs.2018.8500396","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Intelligent Vehicles Symposium (IV)","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/A5113481607","display_name":"Rie KATSUKI","orcid":null},"institutions":[{"id":"https://openalex.org/I1292669757","display_name":"Toshiba (Japan)","ror":"https://ror.org/0326v3z14","country_code":"JP","type":"company","lineage":["https://openalex.org/I1292669757"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Rie Katsuki","raw_affiliation_strings":["Kabushiki Kaisha Toshiba, Minato-ku, Tokyo, JP"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kabushiki Kaisha Toshiba, Minato-ku, Tokyo, JP","institution_ids":["https://openalex.org/I1292669757"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103731098","display_name":"Tsuyoshi Tasaki","orcid":"https://orcid.org/0000-0003-1458-760X"},"institutions":[{"id":"https://openalex.org/I1292669757","display_name":"Toshiba (Japan)","ror":"https://ror.org/0326v3z14","country_code":"JP","type":"company","lineage":["https://openalex.org/I1292669757"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Tsuyoshi Tasaki","raw_affiliation_strings":["Kabushiki Kaisha Toshiba, Minato-ku, Tokyo, JP"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kabushiki Kaisha Toshiba, Minato-ku, Tokyo, JP","institution_ids":["https://openalex.org/I1292669757"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102387389","display_name":"Tomoki Watanabe","orcid":null},"institutions":[{"id":"https://openalex.org/I1292669757","display_name":"Toshiba (Japan)","ror":"https://ror.org/0326v3z14","country_code":"JP","type":"company","lineage":["https://openalex.org/I1292669757"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Tomoki Watanabe","raw_affiliation_strings":["Kabushiki Kaisha Toshiba, Minato-ku, Tokyo, JP"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kabushiki Kaisha Toshiba, Minato-ku, Tokyo, JP","institution_ids":["https://openalex.org/I1292669757"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I1292669757"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2084","last_page":"2089"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T11574","display_name":"Artificial Intelligence in Games","score":0.9629999995231628,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9628000259399414,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/motion-planning","display_name":"Motion planning","score":0.6758843064308167},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.5832777619361877},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5584224462509155},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5168593525886536},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5106471180915833},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.4992821216583252},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4663941562175751},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.4414435029029846},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4242987632751465},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42282044887542725},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.421943724155426},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35484015941619873},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.20505282282829285},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1980382800102234},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.16408145427703857},{"id":"https://openalex.org/keywords/computer-vision","display_name":"Computer vision","score":0.12011989951133728},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.0892539918422699},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07737705111503601}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6758843064308167},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.5832777619361877},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5584224462509155},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5168593525886536},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5106471180915833},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.4992821216583252},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4663941562175751},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.4414435029029846},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4242987632751465},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42282044887542725},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.421943724155426},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35484015941619873},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.20505282282829285},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1980382800102234},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.16408145427703857},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.12011989951133728},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0892539918422699},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07737705111503601},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","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},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","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/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ivs.2018.8500396","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ivs.2018.8500396","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Intelligent Vehicles Symposium (IV)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7599999904632568,"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":18,"referenced_works":["https://openalex.org/W198732646","https://openalex.org/W1983948265","https://openalex.org/W2005354226","https://openalex.org/W2014340571","https://openalex.org/W2055207897","https://openalex.org/W2082142320","https://openalex.org/W2082152545","https://openalex.org/W2120179083","https://openalex.org/W2134765105","https://openalex.org/W2136445059","https://openalex.org/W2165216595","https://openalex.org/W2169528473","https://openalex.org/W2560990389","https://openalex.org/W4230028510","https://openalex.org/W4293682399","https://openalex.org/W6608150121","https://openalex.org/W6651853181","https://openalex.org/W6670951443"],"related_works":["https://openalex.org/W2368795992","https://openalex.org/W2394276631","https://openalex.org/W4308080200","https://openalex.org/W2908094156","https://openalex.org/W2389896347","https://openalex.org/W2106119116","https://openalex.org/W4395071568","https://openalex.org/W2904203243","https://openalex.org/W3139139461","https://openalex.org/W2125569607"],"abstract_inverted_index":{"This":[0],"paper":[1],"describes":[2],"a":[3,23,26,31,36,56,60,93,140,176],"graph":[4,24,120],"search-based":[5],"local":[6,32],"path":[7,33,38,58,79,178],"planner":[8,80,117,137,166],"with":[9,49,147,157],"an":[10,63,126,171],"adaptive":[11],"node":[12,82,155],"sampling":[13,45,48,72,83],"according":[14,85],"to":[15,40,54,86,189],"positions":[16,156],"of":[17,22,100],"obstacles.":[18,113],"Randomly":[19],"sampled":[20],"nodes":[21,91,111],"in":[25,59,169],"traversable":[27],"region":[28],"for":[29,124,132],"finding":[30,125],"can":[34,52],"generate":[35],"winding":[37],"due":[39],"connection":[41],"between":[42,65],"the":[43,71,97,101,116,119,133,136,165],"randomly":[44],"nodes.":[46],"Node":[47],"constant":[50],"intervals":[51],"fail":[53],"find":[55],"proper":[57],"case":[61],"that":[62],"interval":[64],"adjacent":[66],"obstacles":[67,188],"are":[68,105,181],"smaller":[69,161],"than":[70],"interval.":[73],"To":[74],"solve":[75],"these":[76],"problems,":[77],"our":[78],"changes":[81],"strategy":[84],"obstacle":[87,193],"positions;":[88],"it":[89,152],"samples":[90,110],"along":[92,175],"reference":[94,177],"path,":[95],"e.g.,":[96],"center":[98],"line":[99],"lane,":[102],"if":[103],"there":[104,180],"no":[106,182],"obstacles,":[107,183],"but":[108],"densely":[109,185],"around":[112,187],"After":[114],"sampling,":[115],"searches":[118],"using":[121],"Dijkstra's":[122],"algorithm":[123],"optimal":[127,134],"trajectory.":[128],"For":[129],"efficient":[130],"search":[131],"trajectory,":[135],"firstly":[138],"generates":[139],"trajectory":[141],"approximated":[142],"by":[143,153],"piecewise":[144],"linear":[145],"lines":[146],"minimum":[148],"cost,":[149],"and":[150,184],"fine-tunes":[151],"adjusting":[154],"curved":[158],"edges":[159],"having":[160],"cost.":[162],"We":[163],"test":[164],"through":[167],"simulations":[168],"which":[170],"ego":[172],"vehicle":[173],"drive":[174],"when":[179],"sample":[186],"improve":[190],"robustness":[191],"against":[192],"locations.":[194]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}