{"id":"https://openalex.org/W2132529817","doi":"https://doi.org/10.1137/s0097539795290593","title":"An Online Algorithm for Improving Performance in Navigation","display_name":"An Online Algorithm for Improving Performance in Navigation","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2132529817","doi":"https://doi.org/10.1137/s0097539795290593","mag":"2132529817"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539795290593","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539795290593","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5024803432","display_name":"Avrim Blum","orcid":"https://orcid.org/0000-0003-2450-5102"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Avrim Blum","raw_affiliation_strings":["School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065160332","display_name":"Prasad Chalasani","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Prasad Chalasani","raw_affiliation_strings":["School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":0.4262,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.75450717,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"29","issue":"6","first_page":"1907","last_page":"1938"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9941999912261963,"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.9914000034332275,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5244826674461365},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5240564346313477},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5135557651519775},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.5105243921279907},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5009760856628418},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48809731006622314},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.47305646538734436},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.45844578742980957},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.4397865831851959},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.42460185289382935},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.4163210391998291},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4094661474227905},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.39933276176452637},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.38892602920532227},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.15866690874099731},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.11170947551727295}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5244826674461365},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5240564346313477},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5135557651519775},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.5105243921279907},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5009760856628418},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48809731006622314},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.47305646538734436},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.45844578742980957},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.4397865831851959},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.42460185289382935},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.4163210391998291},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4094661474227905},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39933276176452637},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.38892602920532227},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.15866690874099731},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.11170947551727295},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s0097539795290593","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539795290593","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.305.621","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.305.621","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1981660486","https://openalex.org/W1983655539","https://openalex.org/W1986610326","https://openalex.org/W1992876208","https://openalex.org/W2019729116","https://openalex.org/W2082099352","https://openalex.org/W2086706470","https://openalex.org/W2095383780","https://openalex.org/W2114302864"],"related_works":["https://openalex.org/W2794103424","https://openalex.org/W1996530509","https://openalex.org/W3028317537","https://openalex.org/W2389515972","https://openalex.org/W4245435724","https://openalex.org/W2055301889","https://openalex.org/W1505959757","https://openalex.org/W2376554934","https://openalex.org/W2077790809","https://openalex.org/W2906246018"],"abstract_inverted_index":{"We":[0,73,158,200],"consider":[1],"the":[2,39,44,55,60,66,80,118,122,128,138,141,146,151,174,194,197,209,217,225,253,256],"following":[3,119],"scenario.":[4],"A":[5,230],"point":[6],"robot":[7,24,42,81],"is":[8,105,133,150,179,222,236],"placed":[9],"at":[10,134],"some":[11],"start":[12],"location":[13,36],"s":[14,32,47,87,155],"in":[15,38,121,145],"a":[16,34,161,182,205,237,244],"2-dimensional":[17],"scene":[18],"containing":[19],"oriented":[20],"rectangular":[21],"obstacles.":[22,61,257],"The":[23,41],"must":[25],"repeatedly":[26],"travel":[27],"back":[28],"and":[29,33,48,88,95,102,156,193],"forth":[30],"between":[31,86,154,190],"second":[35],"t":[37,49,89],"scene.":[40],"knows":[43,52],"coordinates":[45],"of":[46,59,140,196,233,255],"but":[50],"initially":[51,94],"nothing":[53],"about":[54],"positions":[56,254],"or":[57],"sizes":[58],"It":[62],"can":[63,248],"only":[64],"determine":[65],"obstacles'":[67],"locations":[68],"by":[69],"bumping":[70],"into":[71],"them.":[72],"would":[74],"like":[75],"an":[76,112,187],"intelligent":[77],"strategy":[78],"for":[79,114,165,185,212,239],"so":[82],"that":[83,211,247],"its":[84],"trips":[85,99],"both":[90],"are":[91,100],"relatively":[92],"fast":[93],"improve":[96,201],"as":[97],"more":[98,103],"taken":[101],"information":[104],"gathered.":[106],"In":[107],"this":[108,115,202,234],"paper":[109,235],"we":[110],"describe":[111],"algorithm":[113,178,203],"problem":[116],"with":[117],"guarantee:":[120],"first":[123],"$k":[124],"\\leq":[125,215],"n$":[126],"trips,":[127],"average":[129],"distance":[130,153],"per":[131],"trip":[132,220],"most":[135],"$O(\\sqrt{n/k})$":[136],"times":[137,224],"length":[139,221],"shortest":[142,226],"s-t":[143,227],"path":[144,198,228],"scene,":[147],"where":[148],"n":[149],"Euclidean":[152],"t.":[157],"also":[159],"show":[160],"matching":[162],"lower":[163],"bound":[164],"deterministic":[166],"strategies.":[167],"These":[168],"results":[169],"generalize":[170],"known":[171],"bounds":[172],"on":[173,181,252],"one-trip":[175],"problem.":[176],"Our":[177],"based":[180,251],"novel":[183],"method":[184,238],"making":[186],"optimal":[188],"trade-off":[189],"search":[191],"effort":[192],"goodness":[195],"found.":[199],"to":[204],"\"smooth\"":[206],"variant":[207],"having":[208],"property":[210],"every":[213],"$i":[214],"n,$":[216],"robot's":[218],"ith":[219],"$O(\\sqrt{n/i})$":[223],"length.":[229],"key":[231],"idea":[232],"analyzing":[240],"obstacle":[241],"scenes":[242],"using":[243],"tree":[245],"structure":[246],"be":[249],"defined":[250]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}