{"id":"https://openalex.org/W4319878801","doi":"https://doi.org/10.1109/lra.2023.3243792","title":"Improvement of Submodular Maximization Problems With Routing Constraints via Submodularity and Fourier Sparsity","display_name":"Improvement of Submodular Maximization Problems With Routing Constraints via Submodularity and Fourier Sparsity","publication_year":2023,"publication_date":"2023-02-10","ids":{"openalex":"https://openalex.org/W4319878801","doi":"https://doi.org/10.1109/lra.2023.3243792"},"language":"en","primary_location":{"id":"doi:10.1109/lra.2023.3243792","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2023.3243792","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766","2377-3774"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Robotics and Automation Letters","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/A5029201671","display_name":"Pao-Te Lin","orcid":null},"institutions":[{"id":"https://openalex.org/I22265921","display_name":"National Central University","ror":"https://ror.org/00944ve71","country_code":"TW","type":"education","lineage":["https://openalex.org/I22265921"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Pao-Te Lin","raw_affiliation_strings":["Mathematics Department, National Central University, Taoyuan, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mathematics Department, National Central University, Taoyuan, Taiwan","institution_ids":["https://openalex.org/I22265921"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039241771","display_name":"Kuo-Shih Tseng","orcid":"https://orcid.org/0000-0002-7818-5821"},"institutions":[{"id":"https://openalex.org/I22265921","display_name":"National Central University","ror":"https://ror.org/00944ve71","country_code":"TW","type":"education","lineage":["https://openalex.org/I22265921"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Kuo-Shih Tseng","raw_affiliation_strings":["Mathematics Department, National Central University, Taoyuan, Taiwan"],"raw_orcid":"https://orcid.org/0000-0002-7818-5821","affiliations":[{"raw_affiliation_string":"Mathematics Department, National Central University, Taoyuan, Taiwan","institution_ids":["https://openalex.org/I22265921"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I22265921"],"apc_list":null,"apc_paid":null,"fwci":0.9923,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.7716939,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"8","issue":"4","first_page":"1927","last_page":"1934"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.9976000189781189,"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.9923999905586243,"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.823674201965332},{"id":"https://openalex.org/keywords/notation","display_name":"Notation","score":0.616657018661499},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.6146696209907532},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5222737789154053},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.47587648034095764},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4739637076854706},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4712686240673065},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3787321448326111},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36611199378967285},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36403143405914307},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3535744547843933}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.823674201965332},{"id":"https://openalex.org/C45357846","wikidata":"https://www.wikidata.org/wiki/Q2001982","display_name":"Notation","level":2,"score":0.616657018661499},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.6146696209907532},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5222737789154053},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.47587648034095764},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4739637076854706},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4712686240673065},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3787321448326111},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36611199378967285},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36403143405914307},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3535744547843933},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lra.2023.3243792","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2023.3243792","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766","2377-3774"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Robotics and Automation Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6800000071525574,"display_name":"Life in Land","id":"https://metadata.un.org/sdg/15"}],"awards":[{"id":"https://openalex.org/G3130538586","display_name":"Inverse Reinforcement Learning for Multi-Robot Informative Path Planning","funder_award_id":"MOST111-2221-E008-097","funder_id":"https://openalex.org/F4320322795","funder_display_name":"Ministry of Science and Technology, Taiwan"},{"id":"https://openalex.org/G3603821646","display_name":"Deep Inverse Reinforcement Learning for Informative Path Planning","funder_award_id":"MOST108-2221-E008-074-MY3","funder_id":"https://openalex.org/F4320322795","funder_display_name":"Ministry of Science and Technology, Taiwan"}],"funders":[{"id":"https://openalex.org/F4320322795","display_name":"Ministry of Science and Technology, Taiwan","ror":"https://ror.org/02kv4zf79"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1534987196","https://openalex.org/W1680189815","https://openalex.org/W1969186119","https://openalex.org/W2009803313","https://openalex.org/W2011193572","https://openalex.org/W2017927472","https://openalex.org/W2033885045","https://openalex.org/W2042986967","https://openalex.org/W2061775131","https://openalex.org/W2064209160","https://openalex.org/W2080379754","https://openalex.org/W2117226423","https://openalex.org/W2143996311","https://openalex.org/W2165142526","https://openalex.org/W2169263394","https://openalex.org/W2215252637","https://openalex.org/W2308703108","https://openalex.org/W2531699011","https://openalex.org/W2586783934","https://openalex.org/W2740307401","https://openalex.org/W2757107770","https://openalex.org/W2963409832","https://openalex.org/W3012011993","https://openalex.org/W3013896853","https://openalex.org/W3167700388","https://openalex.org/W4210429346","https://openalex.org/W4223583037","https://openalex.org/W6684811864","https://openalex.org/W6698333356"],"related_works":["https://openalex.org/W1595919516","https://openalex.org/W2945022594","https://openalex.org/W2966531942","https://openalex.org/W2194604332","https://openalex.org/W4379619607","https://openalex.org/W2896347948","https://openalex.org/W2950500962","https://openalex.org/W2915041254","https://openalex.org/W4302557420","https://openalex.org/W2413963148"],"abstract_inverted_index":{"Various":[0],"robotic":[1],"problems":[2,17,22],"(e.g.,":[3],"map":[4],"exploration,":[5],"environmental":[6],"monitoring":[7],"and":[8,29,75],"spatial":[9],"search)":[10],"can":[11],"be":[12],"formulated":[13],"as":[14],"submodular":[15],"maximization":[16],"with":[18,44],"routing":[19,78],"constraints.":[20],"These":[21],"involve":[23],"two":[24],"NP-hard":[25],"problems,":[26],"maximal":[27],"coverage":[28],"traveling":[30],"salesman":[31],"problems.":[32],"The":[33,84,98],"generalized":[34],"cost-benefit":[35],"algorithm":[36],"(GCB)":[37],"is":[38,53],"able":[39],"to":[40,80],"solve":[41],"this":[42,62],"problem":[43],"a$\\frac{1}{2}(1-\\frac{1}{e})\\widetilde{OPT}$guarantee,":[45],"where$\\widetilde{OPT}$is":[46],"the":[47,58,64,73,88,102],"approximation":[48],"of":[49,77],"optimal":[50,59],"performance.":[51,83],"There":[52],"a":[54,92],"gap":[55],"between":[56],"the$\\widetilde{OPT}$and":[57],"solution$(OPT)$.":[60],"In":[61],"research,":[63],"proposed":[65,89,103],"algorithms,":[66],"Tree-Structured":[67],"Fourier":[68],"Supports":[69],"Set":[70],"(TS-FSS),":[71],"utilize":[72],"submodularity":[74],"sparsity":[76],"trees":[79],"boost":[81],"GCB":[82],"theorems":[85],"show":[86],"that":[87,101],"algorithms":[90],"have":[91],"higher":[93],"optimum":[94],"bound":[95],"than":[96],"GCB.":[97],"experiments":[99],"demonstrate":[100],"approach":[104],"outperforms":[105],"benchmark":[106],"approaches.":[107]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}