{"id":"https://openalex.org/W2164457900","doi":"https://doi.org/10.1109/iros.2004.1389462","title":"Planning expected-time optimal paths for searching known environments","display_name":"Planning expected-time optimal paths for searching known environments","publication_year":2005,"publication_date":"2005-04-01","ids":{"openalex":"https://openalex.org/W2164457900","doi":"https://doi.org/10.1109/iros.2004.1389462","mag":"2164457900"},"language":"en","primary_location":{"id":"doi:10.1109/iros.2004.1389462","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2004.1389462","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (IEEE Cat. No.04CH37566)","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/A5015785150","display_name":"Alejandro Sarmiento","orcid":"https://orcid.org/0000-0001-6710-163X"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"A. Sarmiento","raw_affiliation_strings":["Beckman Institute for Advanced Science and Technology, University of Illinois at Urbana-Champaign, Urbana, Illinois, USA"],"affiliations":[{"raw_affiliation_string":"Beckman Institute for Advanced Science and Technology, University of Illinois at Urbana-Champaign, Urbana, Illinois, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110269635","display_name":"R. Marrieta-Cid","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. Marrieta-Cid","raw_affiliation_strings":["Beckman Institute for Advanced Science and Technology, University of Illinois at Urbana-Champaign, Urbana, Illinois, USA"],"affiliations":[{"raw_affiliation_string":"Beckman Institute for Advanced Science and Technology, University of Illinois at Urbana-Champaign, Urbana, Illinois, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071296935","display_name":"Seth Hutchinson","orcid":"https://orcid.org/0000-0002-3949-6061"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Hutchinson","raw_affiliation_strings":["Beckman Institute for Advanced Science and Technology, University of Illinois at Urbana-Champaign, Urbana, Illinois, USA"],"affiliations":[{"raw_affiliation_string":"Beckman Institute for Advanced Science and Technology, University of Illinois at Urbana-Champaign, Urbana, Illinois, USA","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5015785150"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":1.297,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.81857402,"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":"872","last_page":"878"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9991999864578247,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9991999864578247,"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"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9980999827384949,"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/T10757","display_name":"Geographic Information Systems Studies","score":0.9864000082015991,"subfield":{"id":"https://openalex.org/subfields/3305","display_name":"Geography, Planning and Development"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6160869002342224},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6055619120597839},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6017487049102783},{"id":"https://openalex.org/keywords/object","display_name":"Object (grammar)","score":0.5879461169242859},{"id":"https://openalex.org/keywords/probability-density-function","display_name":"Probability density function","score":0.5027163028717041},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4744991958141327},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.458733469247818},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.43639475107192993},{"id":"https://openalex.org/keywords/fast-path","display_name":"Fast path","score":0.4338610768318176},{"id":"https://openalex.org/keywords/bidirectional-search","display_name":"Bidirectional search","score":0.4331430196762085},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4181599020957947},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.4131522476673126},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3597456216812134},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34571292996406555},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.2335403859615326},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19685742259025574},{"id":"https://openalex.org/keywords/best-first-search","display_name":"Best-first search","score":0.18458786606788635},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.15478718280792236}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6160869002342224},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6055619120597839},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6017487049102783},{"id":"https://openalex.org/C2781238097","wikidata":"https://www.wikidata.org/wiki/Q175026","display_name":"Object (grammar)","level":2,"score":0.5879461169242859},{"id":"https://openalex.org/C197055811","wikidata":"https://www.wikidata.org/wiki/Q207522","display_name":"Probability density function","level":2,"score":0.5027163028717041},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4744991958141327},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.458733469247818},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.43639475107192993},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.4338610768318176},{"id":"https://openalex.org/C831591","wikidata":"https://www.wikidata.org/wiki/Q59750","display_name":"Bidirectional search","level":5,"score":0.4331430196762085},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4181599020957947},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.4131522476673126},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3597456216812134},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34571292996406555},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.2335403859615326},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19685742259025574},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.18458786606788635},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.15478718280792236},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/iros.2004.1389462","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2004.1389462","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (IEEE Cat. No.04CH37566)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.60.7997","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.60.7997","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-cvr.ai.uiuc.edu/~murrieta/Papersonline/SaMuHuIROS04.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.75}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1505265967","https://openalex.org/W1973307935","https://openalex.org/W2008416425","https://openalex.org/W2023182928","https://openalex.org/W2024060531","https://openalex.org/W2025753535","https://openalex.org/W2068605895","https://openalex.org/W2094658339","https://openalex.org/W2168514680","https://openalex.org/W2432517183","https://openalex.org/W2610275220","https://openalex.org/W2611132655","https://openalex.org/W2981264952","https://openalex.org/W2986240932","https://openalex.org/W3156466618","https://openalex.org/W4229889435","https://openalex.org/W4242986078"],"related_works":["https://openalex.org/W2116465486","https://openalex.org/W830396839","https://openalex.org/W3196508834","https://openalex.org/W2171940562","https://openalex.org/W2101572961","https://openalex.org/W2490317825","https://openalex.org/W2154884030","https://openalex.org/W4224281459","https://openalex.org/W2352257694","https://openalex.org/W2557100306"],"abstract_inverted_index":{"In":[0,16],"this":[1,42,150],"paper":[2],"we":[3],"address":[4],"the":[5,18,44,49,57,64,67,76,80,85,90,121,125],"problem":[6,72],"of":[7,59,84,105,124,138],"finding":[8],"time":[9,45,86],"optimal":[10,134],"search":[11,22,60],"paths":[12],"in":[13,108],"known":[14,24,36],"environments.":[15],"particular,":[17],"task":[19],"is":[20,32,51,73,112],"to":[21,47,74,88,120,127,141],"a":[23,35,52,94,109,143],"environment":[25],"for":[26,66],"an":[27,102],"object":[28,50],"whose":[29],"unknown":[30],"location":[31],"characterized":[33],"by":[34,56,114],"probability":[37],"density":[38],"function":[39],"(pdf).":[40],"With":[41],"formulation,":[43],"required":[46,87],"find":[48,75,89],"random":[53],"variable":[54],"induced":[55],"choice":[58],"path":[61,77],"together":[62],"with":[63],"pdf":[65],"object's":[68],"location.":[69],"The":[70],"optimization":[71],"that":[78,111,117],"yields":[79],"minimum":[81],"expected":[82],"value":[83],"object.":[91],"We":[92,147],"propose":[93],"two":[95],"layered":[96],"approach.":[97],"Our":[98],"algorithm":[99,151],"first":[100],"determines":[101],"efficient":[103],"ordering":[104],"visiting":[106],"regions":[107,140],"decomposition":[110],"defined":[113],"critical":[115],"curves":[116],"are":[118],"related":[119],"aspect":[122],"graph":[123],"space":[126],"be":[128],"searched.":[129],"It":[130],"then":[131],"generates":[132],"locally":[133],"trajectories":[135],"within":[136],"each":[137],"these":[139],"construct":[142],"complete":[144],"continuous":[145],"path.":[146],"have":[148],"implemented":[149],"and":[152],"present":[153],"results.":[154]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}