{"id":"https://openalex.org/W3130227853","doi":"https://doi.org/10.1109/iros45743.2020.9341736","title":"Adaptive Reliable Shortest Path in Gaussian Process Regulated Environments","display_name":"Adaptive Reliable Shortest Path in Gaussian Process Regulated Environments","publication_year":2020,"publication_date":"2020-10-24","ids":{"openalex":"https://openalex.org/W3130227853","doi":"https://doi.org/10.1109/iros45743.2020.9341736","mag":"3130227853"},"language":"en","primary_location":{"id":"doi:10.1109/iros45743.2020.9341736","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros45743.2020.9341736","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","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/A5013923186","display_name":"Xuejie Hou","orcid":null},"institutions":[{"id":"https://openalex.org/I150229711","display_name":"University of Electronic Science and Technology of China","ror":"https://ror.org/04qr3zq92","country_code":"CN","type":"education","lineage":["https://openalex.org/I150229711"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xuejie HOU","raw_affiliation_strings":["University of Electronic Science and Technology of China, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Electronic Science and Technology of China, China","institution_ids":["https://openalex.org/I150229711"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033106028","display_name":"Hongliang Guo","orcid":"https://orcid.org/0000-0002-9836-3090"},"institutions":[{"id":"https://openalex.org/I150229711","display_name":"University of Electronic Science and Technology of China","ror":"https://ror.org/04qr3zq92","country_code":"CN","type":"education","lineage":["https://openalex.org/I150229711"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hongliang GUO","raw_affiliation_strings":["University of Electronic Science and Technology of China, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Electronic Science and Technology of China, China","institution_ids":["https://openalex.org/I150229711"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5115588781","display_name":"Yucheng Zhang","orcid":"https://orcid.org/0009-0000-9901-6376"},"institutions":[{"id":"https://openalex.org/I4210098421","display_name":"Beijing Agricultural Machinery Research Institute","ror":"https://ror.org/010znyz59","country_code":"CN","type":"facility","lineage":["https://openalex.org/I4210098421"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yucheng ZHANG","raw_affiliation_strings":["Intelligent Agricultural Machinery Equipment Laboratory of Chinese Academy of Sciences, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Intelligent Agricultural Machinery Equipment Laboratory of Chinese Academy of Sciences, Beijing, China","institution_ids":["https://openalex.org/I4210098421"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0444,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.76590686,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"6819","last_page":"6825"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11344","display_name":"Traffic Prediction and Management Techniques","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11344","display_name":"Traffic Prediction and Management Techniques","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9937999844551086,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10524","display_name":"Traffic control and management","score":0.9873999953269958,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/computer-science","display_name":"Computer science","score":0.6545529961585999},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.641005277633667},{"id":"https://openalex.org/keywords/gaussian-process","display_name":"Gaussian process","score":0.6409499645233154},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6154404878616333},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.6087192296981812},{"id":"https://openalex.org/keywords/gaussian","display_name":"Gaussian","score":0.6022265553474426},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.559341311454773},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.527748167514801},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.497527152299881},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4860120713710785},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4853616952896118},{"id":"https://openalex.org/keywords/private-network-to-network-interface","display_name":"Private Network-to-Network Interface","score":0.47133374214172363},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3554394543170929},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3448910713195801},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2690682113170624},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.26786839962005615},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2556145191192627},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.2201663851737976},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21181949973106384},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.19668713212013245},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.13114428520202637}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6545529961585999},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.641005277633667},{"id":"https://openalex.org/C61326573","wikidata":"https://www.wikidata.org/wiki/Q1496376","display_name":"Gaussian process","level":3,"score":0.6409499645233154},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6154404878616333},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.6087192296981812},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.6022265553474426},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.559341311454773},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.527748167514801},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.497527152299881},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4860120713710785},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4853616952896118},{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.47133374214172363},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3554394543170929},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3448910713195801},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2690682113170624},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.26786839962005615},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2556145191192627},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.2201663851737976},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21181949973106384},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.19668713212013245},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.13114428520202637},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","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/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iros45743.2020.9341736","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros45743.2020.9341736","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.6600000262260437,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W653434785","https://openalex.org/W1710823669","https://openalex.org/W1964392442","https://openalex.org/W1989750313","https://openalex.org/W1994015283","https://openalex.org/W2007659532","https://openalex.org/W2013734727","https://openalex.org/W2033564834","https://openalex.org/W2034204928","https://openalex.org/W2042022756","https://openalex.org/W2049345634","https://openalex.org/W2058135791","https://openalex.org/W2062568266","https://openalex.org/W2074675836","https://openalex.org/W2091253199","https://openalex.org/W2114251562","https://openalex.org/W2123784360","https://openalex.org/W2125916239","https://openalex.org/W2132493978","https://openalex.org/W2156431668","https://openalex.org/W2168482679","https://openalex.org/W2169528473","https://openalex.org/W2345006952","https://openalex.org/W2431210409","https://openalex.org/W2518921919","https://openalex.org/W2554728250","https://openalex.org/W2558902970","https://openalex.org/W2615600520","https://openalex.org/W2803638397","https://openalex.org/W2908598977","https://openalex.org/W3021656475","https://openalex.org/W4247381401","https://openalex.org/W6621644052"],"related_works":["https://openalex.org/W2138676684","https://openalex.org/W189149726","https://openalex.org/W2741010003","https://openalex.org/W2799397541","https://openalex.org/W2767202586","https://openalex.org/W2030752450","https://openalex.org/W2621038882","https://openalex.org/W3094029073","https://openalex.org/W2388273729","https://openalex.org/W2388051136"],"abstract_inverted_index":{"This":[0],"paper":[1],"studies":[2],"the":[3,19,23,27,61,70,86,90,111,121,124],"adaptive":[4,57,92],"reliable":[5,62],"shortest":[6,63],"path":[7,44,51],"(RSP)":[8],"planning":[9,45,52],"problem":[10],"in":[11,85],"a":[12,32],"Gaussian":[13,34,41,48],"process":[14,42,49],"(GP)":[15],"regulated":[16],"environment.":[17],"With":[18],"reasonable":[20],"assumption":[21],"that":[22,119],"travel":[24],"times":[25],"of":[26,69,74,82,114,120,123],"underlying":[28],"transportation":[29],"network":[30],"follow":[31],"multi-variate":[33],"distribution,":[35],"we":[36],"propose":[37],"two":[38],"algorithms":[39,66],"namely,":[40],"reactive":[43],"(GPRPP),":[46],"and":[47,88,99,106,116],"proactive":[50],"(GP4),":[53],"to":[54],"generate":[55],"online":[56],"routing":[58,93],"policies":[59],"for":[60,95],"path.":[64],"Both":[65],"take":[67],"advantage":[68],"posterior":[71],"analytical":[72],"representation":[73],"GPs":[75],"given":[76],"past":[77],"and/or":[78],"imagined":[79],"future":[80],"observations":[81],"certain":[83],"links":[84],"network,":[87],"calculate":[89],"corresponding":[91],"strategy":[94],"RSP.":[96],"Theoretical":[97],"analysis":[98],"simulation":[100],"results":[101],"(on":[102],"Sioux":[103],"Falls":[104],"Network":[105],"Singapore":[107],"road":[108],"networks)":[109],"show":[110],"superior":[112],"performance":[113],"GPRPP":[115],"GP4":[117],"over":[118],"state":[122],"arts.":[125]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}