{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:22:44Z","timestamp":1743124964180,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031331695"},{"type":"electronic","value":"9783031331701"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-33170-1_12","type":"book-chapter","created":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T12:55:27Z","timestamp":1685710527000},"page":"191-206","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Centralized Multi-agent Synthesis with\u00a0Spatial Constraints via\u00a0Mixed-Integer Quadratic Programming"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9324-2388","authenticated-orcid":false,"given":"Alexandra","family":"Forsey-Smerek","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3451-8046","authenticated-orcid":false,"given":"Ho Chit","family":"Siu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5894-7190","authenticated-orcid":false,"given":"Kevin","family":"Leahy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,3]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","unstructured":"Belta, C., Sadraddini, S.: Formal methods for control synthesis: an optimization perspective. Annu. Rev. Control Robot. Auton. Syst. 2(1), 115\u2013140 (2019). https:\/\/doi.org\/10.1146\/annurev-control-053018-023717","DOI":"10.1146\/annurev-control-053018-023717"},{"key":"12_CR2","doi-asserted-by":"publisher","unstructured":"B\u00fcy\u00fckko\u00e7ak, A.T., Aksaray, D., Yazicioglu, Y.: Distributed planning of multi-agent systems with coupled temporal logic specifications. In: AIAA Scitech 2021 Forum, p. 1123 (2021). https:\/\/doi.org\/10.2514\/6.2021-1123","DOI":"10.2514\/6.2021-1123"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-642-15297-9_9","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"A Donz\u00e9","year":"2010","unstructured":"Donz\u00e9, A., Maler, O.: Robust satisfaction of temporal logic over real-valued signals. In: Chatterjee, K., Henzinger, T.A. (eds.) FORMATS 2010. LNCS, vol. 6246, pp. 92\u2013106. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15297-9_9"},{"key":"12_CR4","unstructured":"Gurobi Optimization, LLC: Gurobi Optimizer Reference Manual (2023). https:\/\/www.gurobi.com"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1146\/annurev-control-060117-104838","volume":"1","author":"H Kress-Gazit","year":"2018","unstructured":"Kress-Gazit, H., Lahijanian, M., Raman, V.: Synthesis for robots: guarantees and feedback for robot behavior. Annu. Rev. Control Robot. Auton. Syst. 1, 211\u2013236 (2018). https:\/\/doi.org\/10.1146\/annurev-control-060117-104838","journal-title":"Annu. Rev. Control Robot. Auton. Syst."},{"key":"12_CR6","doi-asserted-by":"publisher","unstructured":"Leahy, K., et al.: Scalable and robust algorithms for task-based coordination from high-level specifications (scratches). IEEE Trans. Robot. (2021). https:\/\/doi.org\/10.1109\/TRO.2021.3130794","DOI":"10.1109\/TRO.2021.3130794"},{"key":"12_CR7","unstructured":"Liu, Z., Guo, M., Li, Z.: Time minimization and online synchronization for multi-agent systems under collaborative temporal tasks. arXiv preprint arXiv:2208.07756 (2022). https:\/\/doi.org\/10.48550\/arXiv.2208.07756"},{"issue":"6","key":"12_CR8","doi-asserted-by":"publisher","first-page":"3602","DOI":"10.1109\/TRO.2022.3181948","volume":"38","author":"X Luo","year":"2022","unstructured":"Luo, X., Zavlanos, M.M.: Temporal logic task allocation in heterogeneous multirobot systems. IEEE Trans. Robot. 38(6), 3602\u20133621 (2022). https:\/\/doi.org\/10.1109\/TRO.2022.3181948","journal-title":"IEEE Trans. Robot."},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-540-30206-3_12","volume-title":"Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems","author":"O Maler","year":"2004","unstructured":"Maler, O., Nickovic, D.: Monitoring temporal properties of continuous signals. In: Lakhnech, Y., Yovine, S. (eds.) FORMATS\/FTRTFT -2004. LNCS, vol. 3253, pp. 152\u2013166. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30206-3_12"},{"key":"12_CR10","doi-asserted-by":"publisher","unstructured":"Raman, V., Donz\u00e9, A., Maasoumy, M., Murray, R.M., Sangiovanni-Vincentelli, A., Seshia, S.A.: Model predictive control with signal temporal logic specifications. In: 53rd IEEE Conference on Decision and Control, pp. 81\u201387. IEEE (2014). https:\/\/doi.org\/10.1109\/CDC.2014.7039363","DOI":"10.1109\/CDC.2014.7039363"},{"issue":"4","key":"12_CR11","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1109\/TRO.2019.2957669","volume":"36","author":"YE Sahin","year":"2020","unstructured":"Sahin, Y.E., Nilsson, P., Ozay, N.: Multirobot coordination with counting temporal logics. IEEE Trans. Robot. 36(4), 1189\u20131206 (2020). https:\/\/doi.org\/10.1109\/TRO.2019.2957669","journal-title":"IEEE Trans. Robot."},{"issue":"2","key":"12_CR12","doi-asserted-by":"publisher","first-page":"3451","DOI":"10.1109\/LRA.2022.3146951","volume":"7","author":"D Sun","year":"2022","unstructured":"Sun, D., Chen, J., Mitra, S., Fan, C.: Multi-agent motion planning from signal temporal logic specifications. IEEE Robot. Autom. Lett. 7(2), 3451\u20133458 (2022). https:\/\/doi.org\/10.1109\/LRA.2022.3146951","journal-title":"IEEE Robot. Autom. Lett."}],"container-title":["Lecture Notes in Computer Science","NASA Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33170-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T12:57:31Z","timestamp":1685710651000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33170-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031331695","9783031331701"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33170-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"3 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"NASA Formal Methods Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Houston, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nfm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/nfm-2023","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"75","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.9","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}