{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T14:10:07Z","timestamp":1784038207549,"version":"3.55.0"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031248658","type":"print"},{"value":"9783031248665","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-24866-5_18","type":"book-chapter","created":{"date-parts":[[2023,2,4]],"date-time":"2023-02-04T19:02:42Z","timestamp":1675537362000},"page":"232-247","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Safe-Exploration of\u00a0Control Policies from\u00a0Safe-Experience via\u00a0Gaussian Processes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1431-576X","authenticated-orcid":false,"given":"Antonio","family":"Candelieri","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4187-4209","authenticated-orcid":false,"given":"Andrea","family":"Ponti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1131-3830","authenticated-orcid":false,"given":"Francesco","family":"Archetti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,2,5]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jhydrol.2021.126388","volume":"599","author":"Q Lu","year":"2021","unstructured":"Lu, Q., et al.: Stochastic programming for floodwater utilization of a complex multi-reservoir system considering risk constraints. J. Hydrol. 599, 126388 (2021)","journal-title":"J. Hydrol."},{"key":"18_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.apenergy.2021.116830","volume":"291","author":"D Han","year":"2021","unstructured":"Han, D., Lee, J.H.: Two-stage stochastic programming formulation for optimal design and operation of multi-microgrid system using data-based modeling of renewable energy sources. Appl. Energy 291, 116830 (2021)","journal-title":"Appl. Energy"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"1795","DOI":"10.1287\/ijoc.2022.1157","volume":"34","author":"RM Lima","year":"2022","unstructured":"Lima, R.M., Conejo, A.J., Giraldi, L., LeMaitre, O., Hoteit, I., Knio, O.M.: Risk-averse stochastic programming vs. adaptive robust optimization: a virtual power plant application. INFORMS J. Comput. 34, 1795\u20131818 (2022)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"18_CR4","doi-asserted-by":"publisher","first-page":"43","DOI":"10.5267\/j.dsl.2021.9.001","volume":"11","author":"H Rachih","year":"2022","unstructured":"Rachih, H., Mhada, F., Chiheb, R.: Simulation optimization of an inventory control model for a reverse logistics system. Dec. Sci. Lett. 11(1), 43\u201354 (2022)","journal-title":"Dec. Sci. Lett."},{"issue":"3","key":"18_CR5","doi-asserted-by":"publisher","first-page":"05021001","DOI":"10.1061\/(ASCE)WR.1943-5452.0001339","volume":"147","author":"I Chakraei","year":"2021","unstructured":"Chakraei, I., Safavi, H.R., Dandy, G.C., Golmohammadi, M.H.: Integrated simulation-optimization framework for water allocation based on sustainability of surface water and groundwater resources. J. Water Resour. Plan. Manag. 147(3), 05021001 (2021)","journal-title":"J. Water Resour. Plan. Manag."},{"key":"18_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.simpat.2020.102166","volume":"106","author":"RD Tordecilla","year":"2021","unstructured":"Tordecilla, R.D., Juan, A.A., Montoya-Torres, J.R., Quintero-Araujo, C.L., Panadero, J.: Simulation-optimization methods for designing and assessing resilient supply chain networks under uncertainty scenarios: A review. Simul. Model. Pract. Theory 106, 102166 (2021)","journal-title":"Simul. Model. Pract. Theory"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Candelieri, A., Galuzzi, B., Giordani, I., Archetti, F.: Learning optimal control of water distribution networks through sequential model-based optimization. In: International Conference on Learning and Intelligent Optimization, pp. 303\u2013315 (2020)","DOI":"10.1007\/978-3-030-53552-0_28"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Candelieri, A., Ponti, A., Archetti, F.: Data efficient learning of implicit control strategies in water distribution networks. In: 2021 IEEE 17th International Conference on Automation Science and Engineering (CASE), pp. 1812\u20131816 (2021)","DOI":"10.1109\/CASE49439.2021.9551619"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-319-23461-8_9","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"J Schreiter","year":"2015","unstructured":"Schreiter, J., Nguyen-Tuong, D., Eberts, M., Bischoff, B., Markert, H., Toussaint, M.: Safe exploration for active learning with gaussian processes. In: Bifet, A., et al. (eds.) ECML PKDD 2015. LNCS (LNAI), vol. 9286, pp. 133\u2013149. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23461-8_9"},{"issue":"1","key":"18_CR10","doi-asserted-by":"publisher","first-page":"5967","DOI":"10.1016\/j.ifacol.2017.08.1258","volume":"50","author":"M Schillinger","year":"2017","unstructured":"Schillinger, M., Hartmann, B., Skalecki, P., Meister, M., Nguyen-Tuong, D., Nelles, O.: Safe active learning and safe Bayesian optimization for tuning a PI-controller. IFAC-PapersOnLine 50(1), 5967\u20135972 (2017)","journal-title":"IFAC-PapersOnLine"},{"key":"18_CR11","unstructured":"Sui, Y., Zhuang, V., Burdick, J., Yue, Y.: Stagewise safe Bayesian optimization with gaussian processes. In: International Conference on Machine Learning, pp. 4781\u20134789. PMLR (2018)"},{"key":"18_CR12","unstructured":"Kirschner, J., Mutny, M., Hiller, N., Ischebeck, R., Krause, A.: Adaptive and safe Bayesian optimization in high dimensions via one-dimensional subspaces. In: International Conference on Machine Learning, pp. 3429\u20133438. PMLR (2019)"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Fiducioso, M., Curi, S., Schumacher, B., Gwerder, M., Krause, A.: Safe contextual Bayesian optimization for sustainable room temperature PID control tuning. arXiv preprint arXiv:1906.12086 (2019)","DOI":"10.24963\/ijcai.2019\/811"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Berkenkamp, F., Krause, A., Schoellig, A. P.: Bayesian optimization with safety constraints: safe and automatic parameter tuning in robotics. Mach. Learn. 1\u201335 (2021)","DOI":"10.1007\/s10994-021-06019-1"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"K\u00f6nig, C., Turchetta, M., Lygeros, J., Rupenyan, A., Krause, A.: Safe and efficient model-free adaptive control via Bayesian optimization. In: 2021 IEEE International Conference on Robotics and Automation (ICRA), pp. 9782\u20139788. IEEE (2021)","DOI":"10.1109\/ICRA48506.2021.9561349"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Frazier, P.I.: Bayesian optimization. In: Recent Advances in Optimization and Modeling of Contemporary Problems, pp. 255\u2013278. Informs (2018)","DOI":"10.1287\/educ.2018.0188"},{"key":"18_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-24494-1","volume-title":"Bayesian Optimization and Data Science","author":"F Archetti","year":"2019","unstructured":"Archetti, F., Candelieri, A.: Bayesian Optimization and Data Science. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24494-1"},{"key":"18_CR18","volume-title":"Gaussian Processes for Machine Learning","author":"CK Williams","year":"2006","unstructured":"Williams, C.K., Rasmussen, C.E.: Gaussian Processes for Machine Learning. MIT Press, Cambridge (2006)"},{"key":"18_CR19","doi-asserted-by":"publisher","DOI":"10.1201\/9780367815493","volume-title":"Surrogates: Gaussian Process Modeling, Design, and Optimization for the Applied Sciences","author":"RB Gramacy","year":"2020","unstructured":"Gramacy, R.B.: Surrogates: Gaussian Process Modeling, Design, and Optimization for the Applied Sciences. Chapman and Hall\/CRC, Boca Raton (2020)"},{"issue":"2","key":"18_CR20","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1109\/TPAMI.2013.218","volume":"37","author":"MP Deisenroth","year":"2013","unstructured":"Deisenroth, M.P., Fox, D., Rasmussen, C.E.: Gaussian processes for data-efficient learning in robotics and control. IEEE Trans. Pattern Anal. Mach. Intell. 37(2), 408\u2013423 (2013)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Bischoff, B., et al.: Policy search for learning robot control using sparse data. In: 2014 IEEE International Conference on Robotics and Automation (ICRA), pp. 3882\u20133887. IEEE (2014)","DOI":"10.1109\/ICRA.2014.6907422"},{"key":"18_CR22","unstructured":"Kamthe, S., Deisenroth, M.: Data-efficient reinforcement learning with probabilistic model predictive control. In: International Conference on Artificial Intelligence and Statistics, pp. 1701\u20131710. PMLR (2018)"},{"issue":"23","key":"18_CR23","doi-asserted-by":"publisher","first-page":"17715","DOI":"10.1007\/s00500-020-05030-3","volume":"24","author":"YD Sergeyev","year":"2020","unstructured":"Sergeyev, Y.D., Candelieri, A., Kvasov, D.E., Perego, R.: Safe global optimization of expensive noisy black-box functions in the $$\\delta $$-Lipschitz framework. Soft. Comput. 24(23), 17715\u201317735 (2020). https:\/\/doi.org\/10.1007\/s00500-020-05030-3","journal-title":"Soft. Comput."},{"issue":"5","key":"18_CR24","doi-asserted-by":"publisher","first-page":"3250","DOI":"10.1109\/TIT.2011.2182033","volume":"58","author":"N Srinivas","year":"2012","unstructured":"Srinivas, N., Krause, A., Kakade, S.M., Seeger, M.W.: Information-theoretic regret bounds for gaussian process optimization in the bandit setting. IEEE Trans. Inf. Theory 58(5), 3250\u20133265 (2012)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"18_CR25","doi-asserted-by":"crossref","unstructured":"De Ath, G., Everson, R. M., Fieldsend, J. E., Rahat, A. A.: $$\\varepsilon $$-shotgun: $$\\varepsilon $$-greedy batch Bayesian optimisation. In: Proceedings of the 2020 Genetic and Evolutionary Computation Conference, pp. 787\u2013795 (2020)","DOI":"10.1145\/3377930.3390154"},{"issue":"1","key":"18_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3425501","volume":"1","author":"G De Ath","year":"2021","unstructured":"De Ath, G., Everson, R.M., Rahat, A.A., Fieldsend, J.E.: Greed is good: exploration and exploitation trade-offs in Bayesian optimisation. ACM Trans. Evol. Learn. Optim. 1(1), 1\u201322 (2021)","journal-title":"ACM Trans. Evol. Learn. Optim."},{"key":"18_CR27","doi-asserted-by":"crossref","unstructured":"Berk, J., Gupta, S., Rana, S., Venkatesh, S.: Randomised Gaussian process upper confidence bound for Bayesian optimisation. In: Proceedings of the 29th International Conference on Artificial Intelligence, pp. 2284\u20132290 (2021)","DOI":"10.24963\/ijcai.2020\/316"},{"issue":"1","key":"18_CR28","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s00158-021-02882-7","volume":"64","author":"A Candelieri","year":"2021","unstructured":"Candelieri, A., Archetti, F.: Sparsifying to optimize over multiple information sources: an augmented Gaussian process based algorithm. Struct. Multidiscip. Optim. 64(1), 239\u2013255 (2021). https:\/\/doi.org\/10.1007\/s00158-021-02882-7","journal-title":"Struct. Multidiscip. Optim."},{"issue":"19","key":"18_CR29","doi-asserted-by":"publisher","first-page":"12591","DOI":"10.1007\/s00500-021-05684-7","volume":"25","author":"A Candelieri","year":"2021","unstructured":"Candelieri, A., Perego, R., Archetti, F.: Green machine learning via augmented Gaussian processes and multi-information source optimization. Soft. Comput. 25(19), 12591\u201312603 (2021). https:\/\/doi.org\/10.1007\/s00500-021-05684-7","journal-title":"Soft. Comput."}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-24866-5_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,4]],"date-time":"2023-02-04T19:05:46Z","timestamp":1675537546000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-24866-5_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031248658","9783031248665"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-24866-5_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"5 February 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Learning and Intelligent Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Milos Island","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lion2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lion16.sba-research.org\/index.html","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":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60","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":"36","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":"60% - 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":"2","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":"3","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)"}}]}}