{"id":"https://openalex.org/W4200520970","doi":"https://doi.org/10.1109/iros51168.2021.9635957","title":"Risk-Aware Submodular Optimization for Stochastic Travelling Salesperson Problem","display_name":"Risk-Aware Submodular Optimization for Stochastic Travelling Salesperson Problem","publication_year":2021,"publication_date":"2021-09-27","ids":{"openalex":"https://openalex.org/W4200520970","doi":"https://doi.org/10.1109/iros51168.2021.9635957"},"language":"en","primary_location":{"id":"doi:10.1109/iros51168.2021.9635957","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros51168.2021.9635957","pdf_url":null,"source":{"id":"https://openalex.org/S4363607734","display_name":"2021 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5088070887","display_name":"Rishab Balasubramanian","orcid":null},"institutions":[{"id":"https://openalex.org/I288749910","display_name":"Indian Institute of Science Education and Research, Bhopal","ror":"https://ror.org/02rb21j89","country_code":"IN","type":"education","lineage":["https://openalex.org/I288749910"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Rishab Balasubramanian","raw_affiliation_strings":["IISER Bhopal, Bhopal, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IISER Bhopal, Bhopal, India","institution_ids":["https://openalex.org/I288749910"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041045546","display_name":"Lifeng Zhou","orcid":"https://orcid.org/0000-0001-7927-8504"},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lifeng Zhou","raw_affiliation_strings":["Virginia Tech, Blacksburg, VA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Virginia Tech, Blacksburg, VA, USA","institution_ids":["https://openalex.org/I859038795"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086188394","display_name":"Pratap Tokekar","orcid":"https://orcid.org/0000-0002-3715-0382"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pratap Tokekar","raw_affiliation_strings":["University of Maryland, College Park, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014252229","display_name":"P. B. Sujit","orcid":"https://orcid.org/0000-0002-7297-1493"},"institutions":[{"id":"https://openalex.org/I288749910","display_name":"Indian Institute of Science Education and Research, Bhopal","ror":"https://ror.org/02rb21j89","country_code":"IN","type":"education","lineage":["https://openalex.org/I288749910"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"P. B. Sujit","raw_affiliation_strings":["IISER Bhopal, Bhopal, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IISER Bhopal, Bhopal, India","institution_ids":["https://openalex.org/I288749910"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2713,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.46354904,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"4720","last_page":"4725"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9940000176429749,"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":0.9940000176429749,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9939000010490417,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9868000149726868,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/submodular-set-function","display_name":"Submodular set function","score":0.8787079453468323},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5943227410316467},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5314183235168457},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.47411754727363586},{"id":"https://openalex.org/keywords/stochastic-optimization","display_name":"Stochastic optimization","score":0.4629218578338623},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.4248208999633789},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22695189714431763},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.16488513350486755}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.8787079453468323},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5943227410316467},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5314183235168457},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.47411754727363586},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.4629218578338623},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.4248208999633789},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22695189714431763},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.16488513350486755}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iros51168.2021.9635957","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros51168.2021.9635957","pdf_url":null,"source":{"id":"https://openalex.org/S4363607734","display_name":"2021 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.5699999928474426,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1865682536","https://openalex.org/W1969007958","https://openalex.org/W2000770578","https://openalex.org/W2011193572","https://openalex.org/W2017016496","https://openalex.org/W2073110021","https://openalex.org/W2144918053","https://openalex.org/W2144933361","https://openalex.org/W2170816677","https://openalex.org/W2174465401","https://openalex.org/W2411454766","https://openalex.org/W2605019791","https://openalex.org/W2738761080","https://openalex.org/W2769020055","https://openalex.org/W2892376036","https://openalex.org/W3021487874","https://openalex.org/W4287824667","https://openalex.org/W6681106510","https://openalex.org/W6775550499"],"related_works":["https://openalex.org/W2495211334","https://openalex.org/W4285140130","https://openalex.org/W3104770499","https://openalex.org/W4285677055","https://openalex.org/W1992731528","https://openalex.org/W2007843488","https://openalex.org/W1978745259","https://openalex.org/W1994436307","https://openalex.org/W3127438322","https://openalex.org/W4287330080"],"abstract_inverted_index":{"We":[0,30,70,113],"introduce":[1],"a":[2,59,72,95],"risk-aware":[3],"variant":[4],"of":[5,66,98,110],"the":[6,12,32,35,38,48,51,67,99,108,115,126],"Traveling":[7],"Salesperson":[8],"Problem":[9],"(TSP),":[10],"where":[11,34],"robot":[13],"tour":[14],"cost":[15],"and":[16,37,50,92,101,124],"reward":[17],"have":[18],"to":[19,26,57,77,119],"be":[20],"optimized":[21],"simultaneously,":[22],"while":[23],"being":[24],"subjected":[25],"uncertainty":[27],"in":[28,89],"both.":[29],"study":[31],"case":[33],"rewards":[36,52],"costs":[39,49],"exhibit":[40],"diminishing":[41],"marginal":[42],"gains,":[43],"i.e.,":[44],"are":[45,53],"submodular.":[46],"Since":[47],"stochastic,":[54],"we":[55],"seek":[56],"maximize":[58],"risk":[60],"metric":[61],"known":[62],"as":[63],"Conditional-Value-at-Risk":[64],"(CVaR)":[65],"submodular":[68,116],"function.":[69],"propose":[71],"Risk-Aware":[73],"Greedy":[74],"Algorithm":[75],"(RAGA)":[76],"find":[78],"an":[79,102],"approximate":[80],"solution":[81],"for":[82],"this":[83],"problem.":[84],"The":[85],"approximation":[86,121],"algorithm":[87],"runs":[88],"polynomial":[90],"time":[91],"is":[93],"within":[94],"constant":[96],"factor":[97],"optimal":[100,111],"additive":[103],"term":[104],"that":[105],"depends":[106],"on":[107],"value":[109],"solution.":[112],"use":[114],"function\u2019s":[117],"curvature":[118],"improve":[120],"results":[122],"further":[123],"verify":[125],"algorithm\u2019s":[127],"performance":[128],"through":[129],"simulations.":[130]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}