{"id":"https://openalex.org/W2592309595","doi":"https://doi.org/10.1109/tac.2017.2678920","title":"An Approximate Dynamic Programming Approach to Multiagent Persistent Monitoring in Stochastic Environments With Temporal Logic Constraints","display_name":"An Approximate Dynamic Programming Approach to Multiagent Persistent Monitoring in Stochastic Environments With Temporal Logic Constraints","publication_year":2017,"publication_date":"2017-03-06","ids":{"openalex":"https://openalex.org/W2592309595","doi":"https://doi.org/10.1109/tac.2017.2678920","mag":"2592309595"},"language":"en","primary_location":{"id":"doi:10.1109/tac.2017.2678920","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2017.2678920","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"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 Transactions on Automatic Control","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/A5079564314","display_name":"Kun Deng","orcid":"https://orcid.org/0000-0002-8707-1113"},"institutions":[{"id":"https://openalex.org/I1292974536","display_name":"Ford Motor Company (United States)","ror":"https://ror.org/00g2tkw06","country_code":"US","type":"company","lineage":["https://openalex.org/I1292974536"]},{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kun Deng","raw_affiliation_strings":["Coordinated Science Laboratory, University of Illinois at Urbana\u2013Champaign, Urbana, IL, USA","Ford Motor Company, Dearborn, MI, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Coordinated Science Laboratory, University of Illinois at Urbana\u2013Champaign, Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Ford Motor Company, Dearborn, MI, USA","institution_ids":["https://openalex.org/I1292974536"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032147874","display_name":"Yushan Chen","orcid":"https://orcid.org/0000-0001-9391-2815"},"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":"Yushan Chen","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Boston University, Boston, MA, USA","Orbeus Inc., Chicago, IL, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Boston University, Boston, MA, USA","institution_ids":["https://openalex.org/I111088046"]},{"raw_affiliation_string":"Orbeus Inc., Chicago, IL, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086742095","display_name":"C\u0103lin Belta","orcid":"https://orcid.org/0000-0002-7141-2657"},"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":"Calin Belta","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Boston University, Boston, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Boston University, Boston, MA, USA","institution_ids":["https://openalex.org/I111088046"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.0623,"has_fulltext":false,"cited_by_count":29,"citation_normalized_percentile":{"value":0.87832794,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"62","issue":"9","first_page":"4549","last_page":"4563"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9986000061035156,"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.9986000061035156,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9890999794006348,"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/T10791","display_name":"Advanced Control Systems Optimization","score":0.9873999953269958,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/markov-decision-process","display_name":"Markov decision process","score":0.8160678148269653},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.7698426842689514},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.7075580358505249},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6348040103912354},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.5897871851921082},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5884155035018921},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.5143424272537231},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.49935197830200195},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.48552775382995605},{"id":"https://openalex.org/keywords/optimal-control","display_name":"Optimal control","score":0.4543355107307434},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.44905900955200195},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.441321462392807},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.43053147196769714},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.24549922347068787},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2055569291114807},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1499595046043396}],"concepts":[{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.8160678148269653},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7698426842689514},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.7075580358505249},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6348040103912354},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.5897871851921082},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5884155035018921},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.5143424272537231},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.49935197830200195},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.48552775382995605},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.4543355107307434},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.44905900955200195},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.441321462392807},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.43053147196769714},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.24549922347068787},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2055569291114807},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1499595046043396},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tac.2017.2678920","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2017.2678920","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"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 Transactions on Automatic Control","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1243933939","display_name":null,"funder_award_id":"YIP FA9550-09-1-0209","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"},{"id":"https://openalex.org/G1940259160","display_name":null,"funder_award_id":"MURI N00014-09-1051","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G8724135486","display_name":null,"funder_award_id":"W911NF-09-1-0088","funder_id":"https://openalex.org/F4320338281","funder_display_name":"Army Research Office"}],"funders":[{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"},{"id":"https://openalex.org/F4320338279","display_name":"Air Force Office of Scientific Research","ror":"https://ror.org/011e9bt93"},{"id":"https://openalex.org/F4320338281","display_name":"Army Research Office","ror":"https://ror.org/05epdh915"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":49,"referenced_works":["https://openalex.org/W195642197","https://openalex.org/W1488462636","https://openalex.org/W1496256885","https://openalex.org/W1498432697","https://openalex.org/W1506342804","https://openalex.org/W1507222174","https://openalex.org/W1518436864","https://openalex.org/W1518539242","https://openalex.org/W1531214994","https://openalex.org/W1547105496","https://openalex.org/W1601081659","https://openalex.org/W1943821960","https://openalex.org/W1970269621","https://openalex.org/W1972203711","https://openalex.org/W2009303086","https://openalex.org/W2012947775","https://openalex.org/W2020293036","https://openalex.org/W2025063471","https://openalex.org/W2059470663","https://openalex.org/W2064572756","https://openalex.org/W2072931156","https://openalex.org/W2083499080","https://openalex.org/W2087107980","https://openalex.org/W2098432798","https://openalex.org/W2100857832","https://openalex.org/W2112895077","https://openalex.org/W2113261006","https://openalex.org/W2114202040","https://openalex.org/W2117927826","https://openalex.org/W2119567691","https://openalex.org/W2121863487","https://openalex.org/W2123952007","https://openalex.org/W2124477018","https://openalex.org/W2132351269","https://openalex.org/W2145970716","https://openalex.org/W2150335178","https://openalex.org/W2156737235","https://openalex.org/W2165364079","https://openalex.org/W2165418472","https://openalex.org/W2167185915","https://openalex.org/W2294030877","https://openalex.org/W2415292238","https://openalex.org/W2964131705","https://openalex.org/W4214717370","https://openalex.org/W4245558686","https://openalex.org/W4250417675","https://openalex.org/W4307347247","https://openalex.org/W4320800818","https://openalex.org/W6677063957"],"related_works":["https://openalex.org/W2124110813","https://openalex.org/W4389475841","https://openalex.org/W3021103820","https://openalex.org/W4241327272","https://openalex.org/W2120406836","https://openalex.org/W175006096","https://openalex.org/W2763487042","https://openalex.org/W1996214847","https://openalex.org/W2903299703","https://openalex.org/W2031188261"],"abstract_inverted_index":{"We":[0,110,148],"consider":[1],"the":[2,55,62,68,136,141,145,158],"problem":[3,69],"of":[4,11,108,131],"generating":[5],"control":[6,75],"policies":[7,121],"for":[8,77,102],"a":[9,15,30,42,47,78,85,129,151],"team":[10,19],"robots":[12,56],"moving":[13],"in":[14,28],"stochastic":[16],"environment.":[17],"The":[18,89],"is":[20,51],"required":[21],"to":[22,35,71,118,134,155],"achieve":[23],"an":[24,73,112],"optimal":[25,74,137],"surveillance":[26],"mission,":[27],"which":[29,82],"certain":[31],"\u201coptimizing":[32],"proposition\u201d":[33],"needs":[34],"be":[36],"satisfied":[37],"infinitely":[38],"often.":[39],"In":[40],"addition,":[41],"correctness":[43],"requirement":[44],"expressed":[45],"as":[46,57,65],"temporal":[48,86],"logic":[49,87],"formula":[50],"imposed.":[52],"By":[53],"modeling":[54],"game":[58],"transition":[59],"systems":[60],"and":[61,139,165],"environmental":[63],"elements":[64],"Markov":[66,79],"chains,":[67],"reduces":[70],"finding":[72],"policy":[76],"decision":[80],"process,":[81],"also":[83,149],"satisfies":[84],"specification.":[88],"existing":[90],"approaches":[91],"based":[92],"on":[93],"dynamic":[94,114],"programming":[95,115],"are":[96],"computationally":[97],"intensive,":[98],"thus":[99],"not":[100],"feasible":[101],"large":[103,106],"environments":[104],"and/or":[105],"numbers":[107],"robots.":[109],"propose":[111,150],"approximate":[113,135],"(ADP)":[116],"framework":[117],"obtain":[119],"suboptimal":[120],"with":[122],"reduced":[123],"computational":[124,159],"complexity.":[125],"Specifically,":[126],"we":[127],"choose":[128],"set":[130],"basis":[132],"functions":[133],"costs":[138],"find":[140],"best":[142],"approximation":[143],"through":[144],"least-squares":[146],"method.":[147],"simulation-based":[152],"ADP":[153],"approach":[154],"further":[156],"reduce":[157],"complexity":[160],"by":[161],"employing":[162],"low-dimensional":[163],"calculations":[164],"simulation":[166],"samples.":[167]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"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"}