{"id":"https://openalex.org/W2913902948","doi":"https://doi.org/10.1109/cdc.2018.8618883","title":"Moving Object Search with Multiple Agents","display_name":"Moving Object Search with Multiple Agents","publication_year":2018,"publication_date":"2018-12-01","ids":{"openalex":"https://openalex.org/W2913902948","doi":"https://doi.org/10.1109/cdc.2018.8618883","mag":"2913902948"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2018.8618883","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2018.8618883","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Conference on Decision and Control (CDC)","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/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":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.20999547,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"25","issue":null,"first_page":"5746","last_page":"5752"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.995199978351593,"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.995199978351593,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9930999875068665,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T13371","display_name":"Military Defense Systems Analysis","score":0.9916999936103821,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.6895675659179688},{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.5774460434913635},{"id":"https://openalex.org/keywords/coordinate-descent","display_name":"Coordinate descent","score":0.5742374062538147},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5651817917823792},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5572512745857239},{"id":"https://openalex.org/keywords/combinatorial-search","display_name":"Combinatorial search","score":0.5352502465248108},{"id":"https://openalex.org/keywords/iterative-deepening-depth-first-search","display_name":"Iterative deepening depth-first search","score":0.528094470500946},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.48994702100753784},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4861118793487549},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.4185110032558441},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.38994598388671875},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.38245314359664917},{"id":"https://openalex.org/keywords/best-first-search","display_name":"Best-first search","score":0.3800196647644043},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3744528889656067},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36583760380744934}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6895675659179688},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.5774460434913635},{"id":"https://openalex.org/C157553263","wikidata":"https://www.wikidata.org/wiki/Q5168004","display_name":"Coordinate descent","level":2,"score":0.5742374062538147},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5651817917823792},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5572512745857239},{"id":"https://openalex.org/C203208320","wikidata":"https://www.wikidata.org/wiki/Q5150830","display_name":"Combinatorial search","level":4,"score":0.5352502465248108},{"id":"https://openalex.org/C14362708","wikidata":"https://www.wikidata.org/wiki/Q1675274","display_name":"Iterative deepening depth-first search","level":5,"score":0.528094470500946},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.48994702100753784},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4861118793487549},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.4185110032558441},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.38994598388671875},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.38245314359664917},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.3800196647644043},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3744528889656067},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36583760380744934},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc.2018.8618883","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2018.8618883","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE 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":24,"referenced_works":["https://openalex.org/W77889016","https://openalex.org/W1532421987","https://openalex.org/W1966283062","https://openalex.org/W1975967782","https://openalex.org/W1984142532","https://openalex.org/W1989562319","https://openalex.org/W2007216244","https://openalex.org/W2015425837","https://openalex.org/W2024928519","https://openalex.org/W2031168329","https://openalex.org/W2038435222","https://openalex.org/W2042189440","https://openalex.org/W2047961819","https://openalex.org/W2049973619","https://openalex.org/W2064369482","https://openalex.org/W2082639035","https://openalex.org/W2107939512","https://openalex.org/W2116320509","https://openalex.org/W2152187004","https://openalex.org/W2156916036","https://openalex.org/W2477751029","https://openalex.org/W2529190220","https://openalex.org/W2964283858","https://openalex.org/W6721349885"],"related_works":["https://openalex.org/W2208339373","https://openalex.org/W2808808802","https://openalex.org/W2125033394","https://openalex.org/W2540870307","https://openalex.org/W2064794194","https://openalex.org/W4386269615","https://openalex.org/W156396538","https://openalex.org/W58921990","https://openalex.org/W3106196307","https://openalex.org/W2998661990"],"abstract_inverted_index":{"In":[0],"this":[1,107],"paper,":[2],"we":[3,51,95],"study":[4],"the":[5,65,75,101,119,130,136,139,152,172,181],"problem":[6,104,121,137,153,158],"of":[7,24,70,86,100,118,141,174],"searching":[8],"for":[9,36,129],"a":[10,22,25,53,87,97,155,160,164],"moving":[11],"object":[12],"with":[13,167,177,183],"multiple":[14],"agents":[15],"where":[16,67,138],"each":[17,79],"agent":[18],"can":[19,81,108],"access":[20],"only":[21,73],"subset":[23],"discrete":[26],"search":[27,39,45,103],"space":[28],"at":[29],"any":[30],"time.":[31],"We":[32,133,150,170],"develop":[33,52],"necessary":[34,49],"conditions":[35,128],"an":[37],"optimal":[38],"plan,":[40],"extending":[41],"prior":[42],"results":[43,182],"in":[44],"theory.":[46],"Using":[47],"these":[48],"conditions,":[50],"forward-backward":[54],"algorithm":[55,166],"based":[56,186],"on":[57,74,144,187],"coordinate":[58,113],"descent":[59,114],"techniques":[60],"to":[61,84,124,154],"obtain":[62],"solutions.":[63],"For":[64],"case":[66],"agent's":[68],"probabilities":[69,140],"detection":[71,142],"depend":[72,143],"cell":[76],"being":[77],"searched,":[78],"iteration":[80],"be":[82,109],"reduced":[83],"solution":[85],"network":[88],"optimization":[89],"problem.":[90],"To":[91],"avoid":[92],"local":[93],"minima,":[94],"derive":[96],"convex":[98],"relaxation":[99],"dynamic":[102],"and":[105,148,162,179],"show":[106],"solved":[110],"optimally":[111],"using":[112],"techniques.":[115,189],"The":[116],"solutions":[117],"relaxed":[120],"are":[122],"used":[123],"provide":[125],"random":[126],"starting":[127],"iterative":[131],"algorithm.":[132],"also":[134],"address":[135],"agents,":[145],"time":[146],"periods":[147],"locations.":[149],"reduce":[151],"submodular":[156],"maximization":[157],"over":[159],"matroid":[161],"give":[163],"greedy":[165],"performance":[168,173],"guarantees.":[169],"illustrate":[171],"our":[175],"algorithms":[176,185],"experiments":[178],"compare":[180],"alternative":[184],"combinatorial":[188]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}