{"id":"https://openalex.org/W2108150510","doi":"https://doi.org/10.1109/robot.2004.1302470","title":"Computing a set of local optimal paths through cluttered environments and over open terrain","display_name":"Computing a set of local optimal paths through cluttered environments and over open terrain","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2108150510","doi":"https://doi.org/10.1109/robot.2004.1302470","mag":"2108150510"},"language":"en","primary_location":{"id":"doi:10.1109/robot.2004.1302470","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robot.2004.1302470","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004","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/A5030950811","display_name":"Zvi Shiller","orcid":"https://orcid.org/0000-0003-1303-0367"},"institutions":[{"id":"https://openalex.org/I52170813","display_name":"Ariel University","ror":"https://ror.org/03nz8qe97","country_code":"IL","type":"education","lineage":["https://openalex.org/I52170813"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Z. Shiller","raw_affiliation_strings":["Department of Mechanical Engineering-Mechatronics, The College of Judea and Samaria, Ariel, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering-Mechatronics, The College of Judea and Samaria, Ariel, Israel","institution_ids":["https://openalex.org/I52170813"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090130469","display_name":"Yusuke Fujita","orcid":"https://orcid.org/0000-0002-4679-7065"},"institutions":[{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Y. Fujita","raw_affiliation_strings":["Department of Mechano-Informatics, University of Tokyo, Bunkyo-ku, Tokyo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechano-Informatics, University of Tokyo, Bunkyo-ku, Tokyo, Japan","institution_ids":["https://openalex.org/I74801974"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068237941","display_name":"Dan Ophir","orcid":null},"institutions":[{"id":"https://openalex.org/I52170813","display_name":"Ariel University","ror":"https://ror.org/03nz8qe97","country_code":"IL","type":"education","lineage":["https://openalex.org/I52170813"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"D. Ophir","raw_affiliation_strings":["Department of Mechanical Engineering-Mechatronics, The College of Judea and Samaria, Ariel, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering-Mechatronics, The College of Judea and Samaria, Ariel, Israel","institution_ids":["https://openalex.org/I52170813"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040633710","display_name":"Yoshihiko Nakamura","orcid":"https://orcid.org/0000-0001-7162-5102"},"institutions":[{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Y. Nakamura","raw_affiliation_strings":["Department of Mechano-Informatics, University of Tokyo, Bunkyo-ku, Tokyo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechano-Informatics, University of Tokyo, Bunkyo-ku, Tokyo, Japan","institution_ids":["https://openalex.org/I74801974"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.15741965,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"1","issue":null,"first_page":"4759","last_page":"4764 Vol.5"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.98089998960495,"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"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.979200005531311,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/path","display_name":"Path (computing)","score":0.578184187412262},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.5724616050720215},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.54572594165802},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5437433123588562},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5412710309028625},{"id":"https://openalex.org/keywords/terrain","display_name":"Terrain","score":0.5301578640937805},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5249740481376648},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49692419171333313},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49201270937919617},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.48831412196159363},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.4769503176212311},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46482211351394653},{"id":"https://openalex.org/keywords/bidirectional-search","display_name":"Bidirectional search","score":0.4643239378929138},{"id":"https://openalex.org/keywords/guided-local-search","display_name":"Guided Local Search","score":0.45869180560112},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.45828667283058167},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4580274224281311},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43562647700309753},{"id":"https://openalex.org/keywords/best-first-search","display_name":"Best-first search","score":0.34481847286224365},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2404431402683258},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23724737763404846},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.21325072646141052},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.1470186710357666},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.14249342679977417}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.578184187412262},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.5724616050720215},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.54572594165802},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5437433123588562},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5412710309028625},{"id":"https://openalex.org/C161840515","wikidata":"https://www.wikidata.org/wiki/Q186131","display_name":"Terrain","level":2,"score":0.5301578640937805},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5249740481376648},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49692419171333313},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49201270937919617},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.48831412196159363},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.4769503176212311},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46482211351394653},{"id":"https://openalex.org/C831591","wikidata":"https://www.wikidata.org/wiki/Q59750","display_name":"Bidirectional search","level":5,"score":0.4643239378929138},{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.45869180560112},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.45828667283058167},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4580274224281311},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43562647700309753},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.34481847286224365},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2404431402683258},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23724737763404846},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.21325072646141052},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.1470186710357666},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.14249342679977417},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/robot.2004.1302470","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robot.2004.1302470","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.6800000071525574}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W101508493","https://openalex.org/W1483286533","https://openalex.org/W1878086965","https://openalex.org/W2056203932","https://openalex.org/W2106996440","https://openalex.org/W2113526778","https://openalex.org/W2140540559","https://openalex.org/W2146494230","https://openalex.org/W2169528473","https://openalex.org/W2340149117","https://openalex.org/W4241834925","https://openalex.org/W4242811155"],"related_works":["https://openalex.org/W2359164233","https://openalex.org/W2125033394","https://openalex.org/W4292148852","https://openalex.org/W2796795701","https://openalex.org/W2128203640","https://openalex.org/W4300167198","https://openalex.org/W2794473043","https://openalex.org/W4386259575","https://openalex.org/W2574129481","https://openalex.org/W2060921394"],"abstract_inverted_index":{"This":[0],"paper":[1],"describes":[2],"an":[3],"efficient":[4],"algorithm":[5,143],"to":[6,95],"generate":[7],"a":[8,53,96],"set":[9,34,58],"of":[10,35,59,114,128,135],"local":[11,27,71],"optimal":[12,28,72,91],"paths":[13,29,38,63,73],"between":[14],"two":[15],"given":[16],"end":[17],"points":[18],"in":[19,46,84,102],"cluttered":[20],"environments":[21],"or":[22,77],"over":[23],"open":[24],"terrain.":[25,151],"The":[26,56,87,110,142],"are":[30],"selected":[31],"from":[32],"the":[33,47,60,65,80,85,90,99,118,126,133],"shortest":[36,61],"constrained":[37,62,82],"through":[39],"every":[40],"node":[41],"(one":[42],"for":[43,89,98,146],"each":[44,103],"path)":[45],"graph,":[48],"generated":[49,106,138],"by":[50,107,139],"running":[51],"twice":[52],"\"single-source\"":[54],"search.":[55,109,141],"initial":[57,111],"spans":[64],"entire":[66],"search":[67,88,97,112],"space":[68],"and":[69,117,130],"includes":[70],"with":[74],"costs":[75],"equal":[76],"better":[78],"than":[79],"longest":[81],"path":[83,92,101],"set.":[86],"is":[93,113,121,125,132,144],"transformed":[94],"best":[100],"homotopy":[104,136],"class":[105],"this":[108,140],"complexity":[115],"O(nlogn),":[116],"pruning":[119],"procedure":[120],"O(nmlogm),":[122],"where":[123],"n":[124],"number":[127,134],"nodes":[129],"m":[131],"classes":[137],"demonstrated":[145],"motion":[147],"planning":[148],"on":[149],"rough":[150]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}