{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T15:53:46Z","timestamp":1774454026485,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T00:00:00Z","timestamp":1766534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T00:00:00Z","timestamp":1766534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["#N00014-22-1-2476"],"award-info":[{"award-number":["#N00014-22-1-2476"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["#N00014-22-1-2476"],"award-info":[{"award-number":["#N00014-22-1-2476"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["#N00014-22-1-2476"],"award-info":[{"award-number":["#N00014-22-1-2476"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000104","name":"National Aeronautics and Space Administration","doi-asserted-by":"publisher","award":["80NM0018D0004"],"award-info":[{"award-number":["80NM0018D0004"]}],"id":[{"id":"10.13039\/100000104","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Robot"],"published-print":{"date-parts":[[2026,3]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    An important class of robotic applications involves multiple agents cooperating to provide state observations to plan joint actions. We study planning under uncertainty when more than one participant must proactively plan perception and\/or communication acts, and decide whether the cost to obtain a state estimate is justified by the benefits accrued by the information thus obtained. The approach we introduce is suitable for settings where observations are of high quality and they\u2014either alone or along with communication\u2014recover the system\u2019s joint state, but the costs incurred mean this happens only infrequently. We formulate the problem as a type of Markov decision process (\n                    <jats:sc>mdp<\/jats:sc>\n                    ) to be solved over macro-actions, sidestepping the construction of the full joint belief space, a well-known source of intractability. We then give a suitable Bellman-like recurrence that immediately suggests a means of solution. In their most general form, policies for these problems simultaneously describe (1)\u00a0low-level actions to be taken, (2)\u00a0stages when system-wide state is recovered, and (3)\u00a0commitments to future rescheduling acts. The formulation expresses multi-agency in a variety of distinct practical forms, including: one party assisting by providing observations of, or reference points for, another; several agents communicating sensor information to fuse data and recover joint state; multiple agents coordinating activities to arrive at states that make joint state simultaneously observable to all individuals. Though solved in centralized form over joint states, the\n                    <jats:sc>mdp<\/jats:sc>\n                    is structured to allow decentralized execution, under some assumptions of synchrony in activities. After providing small-scale simulation studies of the general formulation, we discuss a specific scenario motivated by underwater gliders. We report on a physical robot implementation mocked-up to respect these same constraints, showing that joint plans are found and executed effectively by individual robots after appropriate projection. On the basis of our experience with hardware, we examine enhancements to the model that address nonidealities we have identified in practice, including the assumptions regarding synchrony.\n                  <\/jats:p>","DOI":"10.1007\/s10514-025-10225-4","type":"journal-article","created":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T06:30:30Z","timestamp":1766557830000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Planned synchronization for multi-robot systems with active observations"],"prefix":"10.1007","volume":"50","author":[{"given":"Patrick","family":"Zhong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Federico","family":"Rossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dylan A.","family":"Shell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,12,24]]},"reference":[{"key":"10225_CR1","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1613\/jair.1.11418","volume":"64","author":"C Amato","year":"2019","unstructured":"Amato, C., Konidaris, G., Kaelbling, L. P., & How, J. P. (2019). Modeling and planning with macro-actions in decentralized POMDPs. Journal of Artificial Intelligence Research, 64, 817\u2013859.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"10225_CR2","doi-asserted-by":"crossref","unstructured":"Armstrong-Crews, N., & Veloso, M. (2008). An approximate algorithm for solving oracular POMDPs. In Proceedings of IEEE International Conference on Robotics and Automation, Pasadena, CA, (pp. 3346\u20133352).","DOI":"10.1109\/ROBOT.2008.4543721"},{"issue":"2","key":"10225_CR3","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10514-017-9615-3","volume":"42","author":"R Bajcsy","year":"2018","unstructured":"Bajcsy, R., Aloimonos, Y., & Tsotsos, J. K. (2018). Revisiting active perception. Autonomous Robots, 42(2), 177\u2013196.","journal-title":"Autonomous Robots"},{"issue":"4","key":"10225_CR4","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1287\/moor.27.4.819.297","volume":"27","author":"DS Bernstein","year":"2002","unstructured":"Bernstein, D. S., Givan, R., Immerman, N., & Zilberstein, S. (2002). The complexity of decentralized control of Markov decision processes. Mathematics of Operations Research, 27(4), 819\u2013840.","journal-title":"Mathematics of Operations Research"},{"key":"10225_CR5","volume-title":"Reinforcement learning and optimal control","author":"DP Bertsekas","year":"2019","unstructured":"Bertsekas, D. P. (2019). Reinforcement learning and optimal control. Athena Scientific."},{"issue":"2\u20133","key":"10225_CR6","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1177\/0278364918755924","volume":"38","author":"G Best","year":"2019","unstructured":"Best, G., Cliff, O. M., Patten, T., Mettu, R. R., & Fitch, R. (2019). Dec-MCTS: Decentralized planning for multi-robot active perception. The International Journal of Robotics Research, 38(2\u20133), 316\u2013337.","journal-title":"The International Journal of Robotics Research"},{"issue":"6","key":"10225_CR7","doi-asserted-by":"publisher","first-page":"2280","DOI":"10.1016\/j.patcog.2014.01.005","volume":"47","author":"S Garrido-Jurado","year":"2014","unstructured":"Garrido-Jurado, S., Mu\u00f1oz-Salinas, R., Madrid-Cuevas, F. J., & Mar\u00edn-Jim\u00e9nez, M. J. (2014). Automatic generation and detection of highly reliable fiducial markers under occlusion. Pattern Recognition, 47(6), 2280\u20132292.","journal-title":"Pattern Recognition"},{"key":"10225_CR8","unstructured":"Hansen, E. A. (1994). Cost-effective sensing during plan execution. In Proceedings of the AAAI Conference on Artificial Intelligence, (pp. 1029\u20131035)."},{"key":"10225_CR9","unstructured":"Hansen, E. A. (1997). Markov decision processes with observation costs. Tech. Rep. UM-CS-1997-001, Department of Computer Science, University of Massachusetts, Amherst"},{"key":"10225_CR10","doi-asserted-by":"publisher","unstructured":"Huang, Y., & Zhu, Q. (2021). Self-triggered markov decision processes. In IEEE Conference on Decision and Control (CDC), (pp. 4507\u20134514). https:\/\/doi.org\/10.1109\/CDC45484.2021.9682918.","DOI":"10.1109\/CDC45484.2021.9682918"},{"key":"10225_CR11","unstructured":"Kapoor, V., & Nair, J. (2025). MDPs with a state sensing cost. arXiv:2505.03280."},{"key":"10225_CR12","doi-asserted-by":"crossref","unstructured":"Langley, P. (1997). Learning to sense selectively in physical domains. In Proceedings of the First International Conference on Autonomous Agents, (pp. 217\u2013226).","DOI":"10.1145\/267658.267719"},{"issue":"1","key":"10225_CR13","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TRO.2022.3200138","volume":"39","author":"M Lauri","year":"2023","unstructured":"Lauri, M., Hsu, D., & Pajarinen, J. (2023). Partially observable Markov decision processes in robotics: A survey. IEEE Transactions on Robotics, 39(1), 21\u201340.","journal-title":"IEEE Transactions on Robotics"},{"key":"10225_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877","volume-title":"Planning algorithms","author":"SM LaValle","year":"2006","unstructured":"LaValle, S. M. (2006). Planning algorithms. Cambridge University Press."},{"issue":"1","key":"10225_CR15","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s10514-019-09849-0","volume":"44","author":"RJ Marcotte","year":"2020","unstructured":"Marcotte, R. J., Wang, X., Mehta, D., & Olson, E. (2020). Optimizing multi-robot communication under bandwidth constraints. Autonomous Robots, 44(1), 43\u201355.","journal-title":"Autonomous Robots"},{"key":"10225_CR16","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316887","volume-title":"Markov decision processes: Discrete stochastic dynamic programming","author":"ML Puterman","year":"1994","unstructured":"Puterman, M. L. (1994). Markov decision processes: Discrete stochastic dynamic programming. Wiley."},{"key":"10225_CR17","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1287\/moor.2023.0172","volume":"50","author":"C Reisinger","year":"2024","unstructured":"Reisinger, C., & Tam, J. (2024). Markov decision processes with observation costs: Framework and computation with a penalty scheme. Mathematics of Operations Research, 50, 1305\u20131332.","journal-title":"Mathematics of Operations Research"},{"key":"10225_CR18","unstructured":"Robotis. (2022). Turtlebot3 Specifications. https:\/\/emanual.robotis.com\/docs\/en\/platform\/turtlebot3\/features\/, last Access: 15 May 2025."},{"key":"10225_CR19","doi-asserted-by":"crossref","unstructured":"Rossi, F., & Shell, D. A. (2022). Planning under periodic observations: Bounds and bounding-based solutions. In IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS).","DOI":"10.1109\/IROS47612.2022.9982056"},{"key":"10225_CR20","doi-asserted-by":"crossref","unstructured":"Roth, M., Simmons, R., & Veloso, M. (2005). Decentralized communication strategies for coordinated multi-agent policies. In Multi-Robot Systems. From Swarms to Intelligent Automata Volume III: Proceedings from the 2005 International Workshop on Multi-Robot Systems, (pp. 93\u2013105). Springer.","DOI":"10.1007\/1-4020-3389-3_8"},{"key":"10225_CR21","doi-asserted-by":"crossref","unstructured":"Williams, T., Torshizi, K., & Tokekar, P. (2024). When to localize?: A POMDP approach. In Proceedings of IEEE International Symposium on Safety Security Rescue Robotics, (pp. 184\u2013189).","DOI":"10.1109\/SSRR62954.2024.10770054"},{"key":"10225_CR22","doi-asserted-by":"crossref","unstructured":"Yang, T., Cao, Y., & Sartoretti, G. (2023). Intent-based deep reinforcement learning for multi-agent informative path planning. In International Symposium on Multi-Robot and Multi-Agent Systems, (pp. 71\u201377).","DOI":"10.1109\/MRS60187.2023.10416797"},{"key":"10225_CR23","doi-asserted-by":"crossref","unstructured":"Zhang, K., Yang, Z., & Ba\u015far, T. (2021). Multi-agent reinforcement learning: A selective overview of theories and algorithms, (pp. 321\u2013384). Springer International Publishing.","DOI":"10.1007\/978-3-030-60990-0_12"},{"key":"10225_CR24","doi-asserted-by":"crossref","unstructured":"Zhong, P., Rossi, F., & Shell, D. A. (2023). Optimizing pre-scheduled, intermittently-observed MDPs. In Proceedings of IEEE International Conference on Decision and Control.","DOI":"10.1109\/CDC49753.2023.10383705"},{"key":"10225_CR25","doi-asserted-by":"crossref","unstructured":"Zhong, P., Rossi, F., & Shell, D. A. (2024). Planning for actively synchronized multi-robot systems. In Proceedings of International Symposium on Distributed Autonomous Robotic Systems.","DOI":"10.1007\/978-3-032-04584-3_39"}],"container-title":["Autonomous Robots"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10514-025-10225-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10514-025-10225-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10514-025-10225-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T15:02:35Z","timestamp":1774450955000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10514-025-10225-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,24]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["10225"],"URL":"https:\/\/doi.org\/10.1007\/s10514-025-10225-4","relation":{},"ISSN":["0929-5593","1573-7527"],"issn-type":[{"value":"0929-5593","type":"print"},{"value":"1573-7527","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,24]]},"assertion":[{"value":"22 May 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 August 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 October 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 December 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"5"}}