{"id":"https://openalex.org/W2009281690","doi":"https://doi.org/10.1177/02783640122067246","title":"Range-Sensor-Based Navigation in Three-Dimensional Polyhedral Environments","display_name":"Range-Sensor-Based Navigation in Three-Dimensional Polyhedral Environments","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W2009281690","doi":"https://doi.org/10.1177/02783640122067246","mag":"2009281690"},"language":"en","primary_location":{"id":"doi:10.1177/02783640122067246","is_oa":false,"landing_page_url":"https://doi.org/10.1177/02783640122067246","pdf_url":null,"source":{"id":"https://openalex.org/S73484101","display_name":"The International Journal of Robotics Research","issn_l":"0278-3649","issn":["0278-3649","1741-3176"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Journal of Robotics Research","raw_type":"journal-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/A5086345606","display_name":"I. Kamon","orcid":null},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Ishay Kamon","raw_affiliation_strings":["CS Department, Technion\u2014Israel Institute of Technology,                         Technion City, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CS Department, Technion\u2014Israel Institute of Technology,                         Technion City, Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049467216","display_name":"Elon Rimon","orcid":"https://orcid.org/0000-0002-8270-6167"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]},{"id":"https://openalex.org/I4394709267","display_name":"Israel Institute","ror":"https://ror.org/00xfkzq83","country_code":null,"type":"nonprofit","lineage":["https://openalex.org/I4394709267"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Elon Rimon","raw_affiliation_strings":["ME Department, Technion\u2014Israel Institute of Technology,                         Technion City, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ME Department, Technion\u2014Israel Institute of Technology,                         Technion City, Israel","institution_ids":["https://openalex.org/I174306211","https://openalex.org/I4394709267"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024009299","display_name":"Ehud Rivlin","orcid":null},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Ehud Rivlin","raw_affiliation_strings":["CS Department, Technion\u2014Israel Institute of Technology,                         Technion City, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CS Department, Technion\u2014Israel Institute of Technology,                         Technion City, Israel","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5086345606"],"corresponding_institution_ids":["https://openalex.org/I174306211"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.12307265,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"20","issue":"1","first_page":"6","last_page":"25"},"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.9995999932289124,"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.9993000030517578,"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/robot","display_name":"Robot","score":0.6035199761390686},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5883743762969971},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5861585140228271},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.5714529752731323},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5013613700866699},{"id":"https://openalex.org/keywords/computer-vision","display_name":"Computer vision","score":0.5011105537414551},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.4546308219432831},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.453703373670578},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4521399736404419},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4500095546245575},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4454105794429779},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.44001099467277527},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3110733926296234},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.14784112572669983},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.08411598205566406}],"concepts":[{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6035199761390686},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5883743762969971},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5861585140228271},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.5714529752731323},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5013613700866699},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.5011105537414551},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.4546308219432831},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.453703373670578},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4521399736404419},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4500095546245575},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4454105794429779},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.44001099467277527},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3110733926296234},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.14784112572669983},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.08411598205566406},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1177/02783640122067246","is_oa":false,"landing_page_url":"https://doi.org/10.1177/02783640122067246","pdf_url":null,"source":{"id":"https://openalex.org/S73484101","display_name":"The International Journal of Robotics Research","issn_l":"0278-3649","issn":["0278-3649","1741-3176"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Journal of Robotics Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4000000059604645,"id":"https://metadata.un.org/sdg/14","display_name":"Life below water"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W102658525","https://openalex.org/W1514632510","https://openalex.org/W1516027685","https://openalex.org/W1575763248","https://openalex.org/W1829541011","https://openalex.org/W1976611803","https://openalex.org/W1988313499","https://openalex.org/W1998678324","https://openalex.org/W1998813085","https://openalex.org/W2016584965","https://openalex.org/W2018347014","https://openalex.org/W2024693023","https://openalex.org/W2036364091","https://openalex.org/W2043146861","https://openalex.org/W2095913006","https://openalex.org/W2096121032","https://openalex.org/W2096268286","https://openalex.org/W2099144379","https://openalex.org/W2099980352","https://openalex.org/W2102029938","https://openalex.org/W2102237796","https://openalex.org/W2118603960","https://openalex.org/W2119559506","https://openalex.org/W2123223818","https://openalex.org/W2125303632","https://openalex.org/W2127726843","https://openalex.org/W2130853184","https://openalex.org/W2138232617","https://openalex.org/W2143576344","https://openalex.org/W2145151038","https://openalex.org/W2163178194","https://openalex.org/W2166297412","https://openalex.org/W4213368568","https://openalex.org/W4246275161","https://openalex.org/W6604116703","https://openalex.org/W6630827198"],"related_works":["https://openalex.org/W170547082","https://openalex.org/W2136735429","https://openalex.org/W2587876411","https://openalex.org/W2358332176","https://openalex.org/W4229950834","https://openalex.org/W4301044568","https://openalex.org/W1587123803","https://openalex.org/W2794103424","https://openalex.org/W2394276631","https://openalex.org/W2990193004"],"abstract_inverted_index":{"This":[0],"paper":[1],"is":[2,16,53,144,266,302],"concerned":[3],"with":[4,146],"the":[5,31,41,59,65,75,103,121,126,131,147,178,182,206,211,214,219,227,232,249,259,264,268,279,282,289,295,300,310,327],"problem":[6,148],"of":[7,30,68,102,106,198,209,230,248,258,288],"sensor-based":[8,89],"navigation":[9,90,158],"in":[10,58,91,141,164,181,221,331,338],"three":[11],"dimensions.":[12],"The":[13,51,170,193,316],"robot,":[14],"which":[15,276],"modeled":[17],"as":[18],"a":[19,22,27,45,79,107,112,135,156,161,165,222],"\u201cbug\u201d":[20],"or":[21],"\u201cpoint":[23],"robot,\u201d":[24],"has":[25],"no":[26],"priori":[28],"knowledge":[29,247,287],"environment.":[32,93,169],"It":[33],"must":[34],"rather":[35],"use":[36],"its":[37,189,246,292],"sensors":[38],"to":[39,48,56,74,130,176,218,235,294],"perceive":[40],"environment":[42,82],"and":[43,83,110,133,202,297,308,334],"plan":[44],"collision-free":[46],"path":[47,124,140,217,293,330],"various":[49],"targets.":[50],"robot":[52,128,163,212,233,269,283],"further":[54],"required":[55,70],"navigate":[57],"most":[60,183],"reactive":[61,184,224],"way":[62,185],"possible,":[63,186],"retaining":[64],"smallest":[66],"amount":[67],"information":[69],"for":[71,88,99,114,137,160],"global":[72,190],"convergence":[73,191],"target.":[76,280],"We":[77,255,304],"assume":[78],"three-dimensional":[80,167,313],"polyhedral":[81,168],"present":[84,111,134,155],"two":[85,196],"basic":[86],"results":[87,318],"this":[92,116,139],"First":[94],"we":[95,119,154],"establish":[96],"sufficient":[97],"conditions":[98],"range-sensor-based":[100,157],"exploration":[101],"entire":[104],"surface":[105],"general":[108,166],"polyhedron":[109],"strategy":[113],"performing":[115],"task.":[117],"Then":[118],"characterize":[120],"locally":[122,215],"shortest":[123,216,329],"from":[125,275],"current":[127],"location":[129],"target":[132,220,265,296,301],"method":[136],"estimating":[138],"time":[142],"that":[143,262,299,320,325],"linear":[145],"size.":[149],"Based":[150],"on":[151,252,312],"these":[152],"results,":[153],"algorithm":[159,194,311],"bug":[162],"algorithm,":[171,260],"called":[172,200],"3":[173,321],"DBug,":[174],"strives":[175],"process":[177],"sensory":[179],"data":[180],"without":[187],"sacrificing":[188],"guarantee.":[192],"uses":[195],"modes":[197],"motion,":[199,210,231],"motion-toward-the-target":[201],"obstacle-":[203],"surface-traversal.":[204],"During":[205,226],"first":[207],"mode":[208,229],"follows":[213],"purely":[223],"fashion.":[225],"second":[228],"attempts":[234],"reach":[236],"exit":[237,273],"points":[238,274],"along":[239],"an":[240],"obstacle":[241,250,272,290],"surface,":[242],"while":[243],"simultaneously":[244],"expanding":[245],"based":[251],"range":[253],"data.":[254],"provide":[256],"analysis":[257],"showing":[261],"if":[263],"reachable,":[267],"always":[270],"finds":[271],"it":[277],"reaches":[278],"Otherwise,":[281],"eventually":[284],"possesses":[285],"full":[286],"blocking":[291],"determines":[298],"unreachable.":[303],"have":[305],"also":[306],"implemented":[307],"verified":[309],"simulated":[314],"environments.":[315,341],"simulation":[317],"show":[319],"DBug":[322],"generates":[323],"paths":[324,337],"resemble":[326],"globally":[328],"simple":[332],"scenarios":[333],"reasonably":[335],"short":[336],"concave":[339],"roomlike":[340]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}