{"id":"https://openalex.org/W1920459644","doi":"https://doi.org/10.1016/0304-3975(94)00237-d","title":"Reaching a goal with directional uncertainty","display_name":"Reaching a goal with directional uncertainty","publication_year":1995,"publication_date":"1995-04-01","ids":{"openalex":"https://openalex.org/W1920459644","doi":"https://doi.org/10.1016/0304-3975(94)00237-d","mag":"1920459644"},"language":"en","primary_location":{"id":"doi:10.1016/0304-3975(94)00237-d","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0304-3975(94)00237-d","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/0304-3975(94)00237-d","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028410825","display_name":"Mark de Berg","orcid":"https://orcid.org/0000-0001-5770-3784"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Mark de Berg","raw_affiliation_strings":["Vakgroep Informatica, Universiteit Utrecht, Postbus 80.089, 3508 TB Utrecht, Netherlands"],"affiliations":[{"raw_affiliation_string":"Vakgroep Informatica, Universiteit Utrecht, Postbus 80.089, 3508 TB Utrecht, Netherlands","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065368881","display_name":"Leonidas Guibas","orcid":"https://orcid.org/0000-0002-8315-4886"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Leonidas Guibas","raw_affiliation_strings":["Department of Computer Science, Stanford University, Stanford, CA 94305-2095, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Stanford University, Stanford, CA 94305-2095, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038503253","display_name":"Dan Halperin","orcid":"https://orcid.org/0000-0002-3345-3765"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dan Halperin","raw_affiliation_strings":["Department of Computer Science, Stanford University, Stanford, CA 94305-2095, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Stanford University, Stanford, CA 94305-2095, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109262027","display_name":"Mark Overmars","orcid":null},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Mark Overmars","raw_affiliation_strings":["Vakgroep Informatica, Universiteit Utrecht, Postbus 80.089, 3508 TB Utrecht, Netherlands"],"affiliations":[{"raw_affiliation_string":"Vakgroep Informatica, Universiteit Utrecht, Postbus 80.089, 3508 TB Utrecht, Netherlands","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5107832533","display_name":"Otfried Schwarzkopf","orcid":null},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Otfried Schwarzkopf","raw_affiliation_strings":["Vakgroep Informatica, Universiteit Utrecht, Postbus 80.089, 3508 TB Utrecht, Netherlands"],"affiliations":[{"raw_affiliation_string":"Vakgroep Informatica, Universiteit Utrecht, Postbus 80.089, 3508 TB Utrecht, Netherlands","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055296785","display_name":"Micha Sharir","orcid":"https://orcid.org/0000-0002-2541-3763"},"institutions":[{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]},{"id":"https://openalex.org/I36672615","display_name":"Courant Institute of Mathematical Sciences","ror":"https://ror.org/037tm7f56","country_code":"US","type":"education","lineage":["https://openalex.org/I36672615","https://openalex.org/I57206974"]},{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL","US"],"is_corresponding":false,"raw_author_name":"Micha Sharir","raw_affiliation_strings":["Courant Institute of Mathematical Sciences, New York University, 251 Mercer Street, New York, NY 10012-1185, USA","School of Mathematical Sciences, Tel Aviv University, Ramat-Aviv 69978, Israel"],"affiliations":[{"raw_affiliation_string":"Courant Institute of Mathematical Sciences, New York University, 251 Mercer Street, New York, NY 10012-1185, USA","institution_ids":["https://openalex.org/I36672615","https://openalex.org/I57206974"]},{"raw_affiliation_string":"School of Mathematical Sciences, Tel Aviv University, Ramat-Aviv 69978, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033226902","display_name":"Monique Teillaud","orcid":null},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Monique Teillaud","raw_affiliation_strings":["INRIA, B.P. 93, 06902 Sophia-Antipolis Cedex, France"],"affiliations":[{"raw_affiliation_string":"INRIA, B.P. 93, 06902 Sophia-Antipolis Cedex, France","institution_ids":["https://openalex.org/I1326498283"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":7,"corresponding_author_ids":["https://openalex.org/A5028410825"],"corresponding_institution_ids":["https://openalex.org/I193662353"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":{"value":2690,"currency":"USD","value_usd":2690},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08581261,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"140","issue":"2","first_page":"301","last_page":"317"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9987000226974487,"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.9987000226974487,"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.991599977016449,"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/T12288","display_name":"Optimization and Search Problems","score":0.9800999760627747,"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/infinity","display_name":"Infinity","score":0.7667233943939209},{"id":"https://openalex.org/keywords/imperfect","display_name":"Imperfect","score":0.6030639410018921},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5557853579521179},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.5359841585159302},{"id":"https://openalex.org/keywords/line-segment","display_name":"Line segment","score":0.5212160348892212},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5127440690994263},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5015931129455566},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5000247955322266},{"id":"https://openalex.org/keywords/motion","display_name":"Motion (physics)","score":0.4448537528514862},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.443771094083786},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4382967948913574},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.4220188558101654},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40108633041381836},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.37146878242492676},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3390193581581116},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.2335982620716095},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21100199222564697},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.15938037633895874}],"concepts":[{"id":"https://openalex.org/C7321624","wikidata":"https://www.wikidata.org/wiki/Q205","display_name":"Infinity","level":2,"score":0.7667233943939209},{"id":"https://openalex.org/C2780310539","wikidata":"https://www.wikidata.org/wiki/Q12547192","display_name":"Imperfect","level":2,"score":0.6030639410018921},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5557853579521179},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.5359841585159302},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.5212160348892212},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5127440690994263},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5015931129455566},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5000247955322266},{"id":"https://openalex.org/C104114177","wikidata":"https://www.wikidata.org/wiki/Q79782","display_name":"Motion (physics)","level":2,"score":0.4448537528514862},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.443771094083786},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4382967948913574},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.4220188558101654},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40108633041381836},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.37146878242492676},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3390193581581116},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.2335982620716095},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21100199222564697},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.15938037633895874},{"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/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","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}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1016/0304-3975(94)00237-d","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0304-3975(94)00237-d","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:hdl:10068/41778","is_oa":false,"landing_page_url":"http://hdl.handle.net/10068/41778","pdf_url":null,"source":{"id":"https://openalex.org/S4377196900","display_name":"OpenGrey (Institut de l'Information Scientifique et Technique)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1295345811","host_organization_name":"Institut de l'Information Scientifique et Technique","host_organization_lineage":["https://openalex.org/I1295345811"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"R - Report"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.19.2566","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.2566","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://archive.cs.uu.nl/pub/RUU/CS/techreps/CS-1994/1994-09.ps.gz","raw_type":"text"},{"id":"pmh:oai:HAL:inria-00074481v1","is_oa":true,"landing_page_url":"https://inria.hal.science/inria-00074481","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"[Research Report] RR-2190, INRIA. 1994","raw_type":"Reports"},{"id":"mag:1920459644","is_oa":false,"landing_page_url":"https://dspace.library.uu.nl/bitstream/1874/2269/1/RR-2190.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"doi:10.1016/0304-3975(94)00237-d","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0304-3975(94)00237-d","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.75}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1564936167","https://openalex.org/W1965466436","https://openalex.org/W1980092773","https://openalex.org/W2034469604","https://openalex.org/W2146306925","https://openalex.org/W2153204081","https://openalex.org/W6628931468","https://openalex.org/W6629127357","https://openalex.org/W6632354077","https://openalex.org/W6632421093","https://openalex.org/W6664469598","https://openalex.org/W6665335136","https://openalex.org/W6669004971","https://openalex.org/W6678133649"],"related_works":["https://openalex.org/W2132529817","https://openalex.org/W2340768492","https://openalex.org/W2937994833","https://openalex.org/W50228681","https://openalex.org/W1876677152","https://openalex.org/W1588762506","https://openalex.org/W2120812773","https://openalex.org/W2028560778","https://openalex.org/W2007762629","https://openalex.org/W3118834742","https://openalex.org/W2025085543","https://openalex.org/W3010436840","https://openalex.org/W3093688406","https://openalex.org/W2295791598","https://openalex.org/W2294243368","https://openalex.org/W1527079784","https://openalex.org/W1843380006","https://openalex.org/W141423351","https://openalex.org/W2101999703","https://openalex.org/W1539636233"],"abstract_inverted_index":{"We":[0,75,94],"study":[1],"two":[2],"problems":[3],"related":[4],"to":[5],"planar":[6],"motion":[7],"planning":[8],"for":[9,165],"robots":[10],"with":[11,88,142],"imperfect":[12],"control,":[13],"where,":[14],"if":[15],"the":[16,45,56,79,97,129,132,157,167],"robot":[17],"starts":[18],"a":[19,23,38,51,61,68,89,107,139,143],"linear":[20],"movement":[21,33],"in":[22,37,78],"certain":[24],"commanded":[25],"direction,":[26],"we":[27,49,84,105,123,136,151,161],"only":[28],"know":[29],"that":[30,96],"its":[31],"actual":[32],"will":[34],"be":[35],"confined":[36],"cone":[39],"of":[40,63,71,92,100,109,114,131,146],"angle":[41],"\u03b1":[42],"centered":[43],"around":[44],"specified":[46],"direction.":[47],"First,":[48],"consider":[50,106],"single":[52],"goal":[53,112,140],"region,":[54],"namely":[55],"\u201cregion":[57],"at":[58],"infinity\u201d,":[59],"and":[60,160],"set":[62,69],"polygonal":[64,111],"obstacles,":[65],"modeled":[66],"as":[67],"S":[70],"n":[72],"line":[73],"segments.":[74],"are":[76],"interested":[77],"region":[80,133,141],"R\u03b1(S)":[81,101],"from":[82,134],"where":[83,135],"can":[85,137],"reach":[86,138],"infinity":[87],"directional":[90,144],"uncertainty":[91,145],"\u03b1.":[93,147],"prove":[95,124,153],"maximum":[98,158],"complexity":[99,116,130],"is":[102],"O(n\u03b15).":[103],"Second,":[104],"collection":[108],"k":[110],"regions":[113],"total":[115],"m,":[117],"but":[118],"without":[119],"any":[120],"obstacles.":[121],"Here":[122],"an":[125],"O(k3m)":[126],"bound":[127],"on":[128,156],"For":[148],"both":[149],"situations":[150],"also":[152],"lower":[154],"bounds":[155],"complexity,":[159],"give":[162],"efficient":[163],"algorithms":[164],"computing":[166],"regions.":[168]},"counts_by_year":[],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}