{"id":"https://openalex.org/W2964283858","doi":"https://doi.org/10.1109/cdc.2017.8263651","title":"Multi-agent discrete search with limited visibility","display_name":"Multi-agent discrete search with limited visibility","publication_year":2017,"publication_date":"2017-12-01","ids":{"openalex":"https://openalex.org/W2964283858","doi":"https://doi.org/10.1109/cdc.2017.8263651","mag":"2964283858"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2017.8263651","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2017.8263651","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE 56th Annual Conference on Decision and Control (CDC)","raw_type":"proceedings-article"},"type":"preprint","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/A5086339662","display_name":"Hanyi Ding","orcid":"https://orcid.org/0000-0002-0307-9119"},"institutions":[{"id":"https://openalex.org/I111088046","display_name":"Boston University","ror":"https://ror.org/05qwgg493","country_code":"US","type":"education","lineage":["https://openalex.org/I111088046"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Huanyu Ding","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Boston University, United States"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Boston University, United States","institution_ids":["https://openalex.org/I111088046"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103073490","display_name":"David A. Casta\u00f1\u00f3n","orcid":"https://orcid.org/0000-0002-9635-9776"},"institutions":[{"id":"https://openalex.org/I111088046","display_name":"Boston University","ror":"https://ror.org/05qwgg493","country_code":"US","type":"education","lineage":["https://openalex.org/I111088046"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David Castanon","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Boston University, United States"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Boston University, United States","institution_ids":["https://openalex.org/I111088046"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5086339662"],"corresponding_institution_ids":["https://openalex.org/I111088046"],"apc_list":null,"apc_paid":null,"fwci":1.65101077,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.85544558,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"108","last_page":"113"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9973999857902527,"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.9973999857902527,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9958999752998352,"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/T12158","display_name":"Guidance and Control Systems","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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.6696570515632629},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.660038411617279},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5707776546478271},{"id":"https://openalex.org/keywords/combinatorial-search","display_name":"Combinatorial search","score":0.5639223456382751},{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.5035876631736755},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.46979081630706787},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4319915473461151},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.426765501499176},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.42581576108932495},{"id":"https://openalex.org/keywords/visibility","display_name":"Visibility","score":0.41227248311042786},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4044114351272583},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3419809341430664},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.31636476516723633},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22854942083358765}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6696570515632629},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.660038411617279},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5707776546478271},{"id":"https://openalex.org/C203208320","wikidata":"https://www.wikidata.org/wiki/Q5150830","display_name":"Combinatorial search","level":4,"score":0.5639223456382751},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.5035876631736755},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.46979081630706787},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4319915473461151},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.426765501499176},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.42581576108932495},{"id":"https://openalex.org/C123403432","wikidata":"https://www.wikidata.org/wiki/Q654068","display_name":"Visibility","level":2,"score":0.41227248311042786},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4044114351272583},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3419809341430664},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.31636476516723633},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22854942083358765},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc.2017.8263651","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2017.8263651","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE 56th Annual Conference on Decision and Control (CDC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1532421987","https://openalex.org/W1680189815","https://openalex.org/W1975967782","https://openalex.org/W1989562319","https://openalex.org/W1997829210","https://openalex.org/W2015425837","https://openalex.org/W2031168329","https://openalex.org/W2047961819","https://openalex.org/W2107939512","https://openalex.org/W2114375687","https://openalex.org/W2132022337","https://openalex.org/W2132651631","https://openalex.org/W2152187004","https://openalex.org/W2292413319","https://openalex.org/W2477751029","https://openalex.org/W2529190220","https://openalex.org/W2539560240","https://openalex.org/W2757107770","https://openalex.org/W2964283858","https://openalex.org/W4213060235","https://openalex.org/W6721349885"],"related_works":["https://openalex.org/W4386269615","https://openalex.org/W2540870307","https://openalex.org/W4390091683","https://openalex.org/W3106196307","https://openalex.org/W2064794194","https://openalex.org/W3084994579","https://openalex.org/W58921990","https://openalex.org/W2998661990","https://openalex.org/W2808808802","https://openalex.org/W2354057059"],"abstract_inverted_index":{"The":[0],"problem":[1,54,100,119,124],"of":[2,24,37,140,145],"search":[3,26,40,146],"by":[4],"multiple":[5],"agents":[6],"to":[7,113,120],"find":[8],"and":[9,65,81,108,128,148],"localize":[10],"objects":[11],"arises":[12],"in":[13,28],"many":[14],"important":[15],"applications.":[16],"In":[17],"this":[18,53],"paper,":[19],"we":[20],"study":[21],"a":[22,35,38,59,67,121,126],"class":[23],"multi-agent":[25],"problems":[27,147],"which":[29,110],"each":[30],"agent":[31],"can":[32,55],"access":[33],"only":[34,47],"subset":[36],"discrete":[39],"space,":[41],"with":[42,133,143,151],"detection":[43,102],"performance":[44,86,103,139],"that":[45,76,87],"depends":[46,104],"on":[48,105],"the":[49,72,99,118,138],"location.":[50],"We":[51,74,96,116,136],"show":[52],"be":[56,114],"reformulated":[57],"as":[58],"minimum":[60,92],"cost":[61,93],"network":[62],"optimization":[63],"problem,":[64],"develop":[66],"fast":[68],"specialized":[69],"algorithm":[70,78,132],"for":[71],"solution.":[73],"prove":[75],"our":[77,141],"is":[79,88,111],"correct,":[80],"has":[82],"worst":[83],"case":[84],"computation":[85],"faster":[89],"than":[90],"general":[91],"flow":[94,154],"algorithms.":[95,155],"also":[97],"address":[98],"where":[101],"both":[106],"location":[107],"agent,":[109],"known":[112],"NP-Hard.":[115],"reduce":[117],"submodular":[122],"maximization":[123],"over":[125],"matroid,":[127],"provide":[129],"an":[130],"approximate":[131],"guaranteed":[134],"performance.":[135],"illustrate":[137],"algorithms":[142],"simulations":[144],"compare":[149],"it":[150],"other":[152],"min-cost":[153]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}