{"id":"https://openalex.org/W4383109075","doi":"https://doi.org/10.1109/icra48891.2023.10160479","title":"A general class of combinatorial filters that can be minimized efficiently","display_name":"A general class of combinatorial filters that can be minimized efficiently","publication_year":2023,"publication_date":"2023-05-29","ids":{"openalex":"https://openalex.org/W4383109075","doi":"https://doi.org/10.1109/icra48891.2023.10160479"},"language":"en","primary_location":{"id":"doi:10.1109/icra48891.2023.10160479","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/icra48891.2023.10160479","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE International Conference on Robotics and Automation (ICRA)","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/A5029749178","display_name":"Yulin Zhang","orcid":"https://orcid.org/0000-0003-1833-7456"},"institutions":[{"id":"https://openalex.org/I1311688040","display_name":"Amazon (United States)","ror":"https://ror.org/04mv4n011","country_code":"US","type":"company","lineage":["https://openalex.org/I1311688040"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yulin Zhang","raw_affiliation_strings":["Amazon Robotics,North Reading,MA,USA","Amazon Robotics, North Reading, MA, USA"],"affiliations":[{"raw_affiliation_string":"Amazon Robotics,North Reading,MA,USA","institution_ids":["https://openalex.org/I1311688040"]},{"raw_affiliation_string":"Amazon Robotics, North Reading, MA, USA","institution_ids":["https://openalex.org/I1311688040"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035574727","display_name":"Dylan A. Shell","orcid":null},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dylan A. Shell","raw_affiliation_strings":["Texas A&M University,Dept. of Computer Science & Engineering,College Station,TX,USA"],"affiliations":[{"raw_affiliation_string":"Texas A&M University,Dept. of Computer Science & Engineering,College Station,TX,USA","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5029749178"],"corresponding_institution_ids":["https://openalex.org/I1311688040"],"apc_list":null,"apc_paid":null,"fwci":0.2017,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.53110892,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"50","issue":null,"first_page":"1645","last_page":"1651"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9961000084877014,"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/T10142","display_name":"Formal Methods in Verification","score":0.9961000084877014,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9937999844551086,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9861999750137329,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.6463592648506165},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5800704956054688},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.48588627576828003},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4375758767127991},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.413973331451416},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4126184582710266},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35818225145339966},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3071509897708893},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2996752858161926},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19697007536888123}],"concepts":[{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.6463592648506165},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5800704956054688},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.48588627576828003},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4375758767127991},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.413973331451416},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4126184582710266},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35818225145339966},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3071509897708893},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2996752858161926},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19697007536888123},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icra48891.2023.10160479","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/icra48891.2023.10160479","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.5799999833106995}],"awards":[{"id":"https://openalex.org/G5315779940","display_name":null,"funder_award_id":"IIS-1849249,IIS-2034097","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1789171841","https://openalex.org/W1823369152","https://openalex.org/W1973310391","https://openalex.org/W2056141172","https://openalex.org/W2100440346","https://openalex.org/W2166706645","https://openalex.org/W2238639262","https://openalex.org/W2336416123","https://openalex.org/W2401610261","https://openalex.org/W2461357515","https://openalex.org/W2551987979","https://openalex.org/W2591962788","https://openalex.org/W2617186574","https://openalex.org/W2771579613","https://openalex.org/W3160010482","https://openalex.org/W3198139931","https://openalex.org/W3206383290","https://openalex.org/W4233756358","https://openalex.org/W4283784459","https://openalex.org/W4302339081","https://openalex.org/W4311443223","https://openalex.org/W4383109075","https://openalex.org/W6811350359","https://openalex.org/W6843287011"],"related_works":["https://openalex.org/W2532234348","https://openalex.org/W108084911","https://openalex.org/W2393440248","https://openalex.org/W3151522584","https://openalex.org/W2673314300","https://openalex.org/W1497123311","https://openalex.org/W1569386110","https://openalex.org/W2720892868","https://openalex.org/W2982169251","https://openalex.org/W1971979548"],"abstract_inverted_index":{"State":[0],"minimization":[1,20,123,153],"of":[2,33,57,76,91,140,151,165,182,197],"combinatorial":[3],"filters":[4,198],"is":[5,21,53,124],"a":[6,29,54,89,128,137],"fundamental":[7],"problem":[8],"that":[9,79,103,134,199],"arises,":[10],"for":[11,120,131,147],"example,":[12],"in":[13,154,163],"building":[14],"cheap,":[15],"resource-efficient":[16],"robots.":[17],"But":[18],"exact":[19,122],"known":[22,158],"to":[23,46,65,96,105,116,136,171],"be":[24],"NP-hard.":[25],"This":[26],"paper":[27],"conducts":[28],"more":[30],"nuanced":[31],"analysis":[32],"this":[34,47,112],"hardness":[35,60],"than":[36],"up":[37],"till":[38],"now,":[39],"and":[40,61,83,100],"uncovers":[41],"two":[42],"factors":[43],"which":[44,121,148],"contribute":[45],"complexity.":[48],"We":[49,126,191],"show":[50],"each":[51,164],"factor":[52],"distinct":[55,144],"source":[56],"the":[58,70,77,149,161,180,183],"problem's":[59],"are":[62,200],"able,":[63],"thereby,":[64],"shed":[66],"some":[67],"light":[68],"on":[69],"role":[71],"played":[72],"by":[73],"(1)":[74],"structure":[75],"graph":[78],"encodes":[80],"compatibility":[81],"relationships,":[82],"(2)":[84],"determinism-enforcing":[85],"constraints.":[86],"Just":[87],"as":[88],"line":[90],"prior":[92],"work":[93],"has":[94],"sought":[95],"introduce":[97,127],"additional":[98],"assumptions":[99],"identify":[101],"sub-classes":[102],"lead":[104],"practical":[106],"state":[107],"reduction,":[108],"we":[109],"next":[110],"use":[111],"new,":[113],"sharper":[114],"understanding":[115],"explore":[117],"special":[118,145],"cases":[119,146,168],"efficient.":[125],"new":[129,195],"algorithm":[130],"constraint":[132],"repair":[133],"applies":[135],"large":[138],"sub-class":[139],"filters,":[141],"subsuming":[142],"three":[143,167],"possibility":[150],"optimal":[152],"polynomial":[155],"time":[156],"was":[157],"earlier.":[159],"While":[160],"efficiency":[162],"these":[166],"previously":[169],"appeared":[170],"stem":[172],"from":[173],"seemingly":[174],"dissimilar":[175],"properties,":[176],"when":[177],"seen":[178],"through":[179],"lens":[181],"present":[184],"work,":[185],"their":[186],"commonality":[187],"now":[188],"becomes":[189],"clear.":[190],"also":[192],"provide":[193],"entirely":[194],"families":[196],"efficiently":[201],"reducible.":[202]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2025-12-21T01:58:51.020947","created_date":"2025-10-10T00:00:00"}