{
    "id": 153,
    "date": "2021-10-07T19:41:27",
    "date_gmt": "2021-10-07T19:41:27",
    "guid": {
        "rendered": "https:\/\/www.sas-lab.deib.polimi.it\/?page_id=153"
    },
    "modified": "2025-07-23T10:17:24",
    "modified_gmt": "2025-07-23T10:17:24",
    "slug": "publications",
    "status": "publish",
    "type": "page",
    "link": "https:\/\/www.sas-lab.deib.polimi.it\/it\/?page_id=153",
    "title": {
        "rendered": "Publications"
    },
    "content": {
        "rendered": "<div data-elementor-type=\"wp-page\" data-elementor-id=\"153\" class=\"elementor elementor-153\">\n\t\t\t\t\t\t<section class=\"elementor-section elementor-top-section elementor-element elementor-element-cea934a elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"cea934a\" data-element_type=\"section\" data-e-type=\"section\" data-settings=\"{&quot;background_background&quot;:&quot;classic&quot;}\">\n\t\t\t\t\t\t<div class=\"elementor-container elementor-column-gap-default\">\n\t\t\t\t\t<div class=\"elementor-column elementor-col-100 elementor-top-column elementor-element elementor-element-9ffa8e9\" data-id=\"9ffa8e9\" data-element_type=\"column\" data-e-type=\"column\">\n\t\t\t<div class=\"elementor-widget-wrap elementor-element-populated\">\n\t\t\t\t\t\t<div class=\"elementor-element elementor-element-6a014e4 elementor-widget elementor-widget-heading\" data-id=\"6a014e4\" data-element_type=\"widget\" data-e-type=\"widget\" data-widget_type=\"heading.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t<h1 class=\"elementor-heading-title elementor-size-xxl\">Publications<\/h1>\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<section class=\"elementor-section elementor-top-section elementor-element elementor-element-ca772d3 elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"ca772d3\" data-element_type=\"section\" data-e-type=\"section\" data-settings=\"{&quot;background_background&quot;:&quot;classic&quot;}\">\n\t\t\t\t\t\t<div class=\"elementor-container elementor-column-gap-default\">\n\t\t\t\t\t<div class=\"elementor-column elementor-col-100 elementor-top-column elementor-element elementor-element-b068bfc\" data-id=\"b068bfc\" data-element_type=\"column\" data-e-type=\"column\">\n\t\t\t<div class=\"elementor-widget-wrap elementor-element-populated\">\n\t\t\t\t\t\t<div class=\"elementor-element elementor-element-2d2746a publication-list elementor-widget elementor-widget-shortcode\" data-id=\"2d2746a\" data-element_type=\"widget\" data-e-type=\"widget\" data-widget_type=\"shortcode.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t<div class=\"elementor-shortcode\"><div class=\"teachpress_pub_list\"><form name=\"tppublistform\" method=\"get\" action=\"\"><a name=\"tppubs\" id=\"tppubs\"><\/a><div class=\"tp_search_input\"><input type=\"hidden\" name=\"p\" id=\"page_id\" value=\"153\"\/><input name=\"tsr\" id=\"tp_search_input_field\" type=\"search\" placeholder=\"Enter search word\" value=\"\" tabindex=\"1\"\/><\/div><div class=\"teachpress_filter\"><select class=\"block\" title=\"Tutti gli anni\" name=\"yr\" id=\"yr\" tabindex=\"2\">\r\n                   <option value=\"\">Tutti gli anni<\/option>\r\n                   <option value=\"2025\" >2025<\/option><option value=\"2024\" >2024<\/option><option value=\"2023\" >2023<\/option><option value=\"2022\" >2022<\/option><option value=\"2021\" >2021<\/option><option value=\"2020\" >2020<\/option><option value=\"2019\" >2019<\/option><option value=\"2018\" >2018<\/option><option value=\"2017\" >2017<\/option><option value=\"2016\" >2016<\/option><option value=\"2015\" >2015<\/option><option value=\"2014\" >2014<\/option><option value=\"2013\" >2013<\/option><option value=\"2012\" >2012<\/option><option value=\"2011\" >2011<\/option><option value=\"2010\" >2010<\/option><option value=\"2009\" >2009<\/option><option value=\"2008\" >2008<\/option><option value=\"2007\" >2007<\/option><option value=\"2006\" >2006<\/option>\r\n                <\/select><select class=\"block\" title=\"Tutti gli autori\" name=\"auth\" id=\"auth\" tabindex=\"5\">\r\n                   <option value=\"\">Tutti gli autori<\/option>\r\n                   <option value=\"626\" > Adami, A.<\/option><option value=\"555\" > Ahmed, Syed Hassan<\/option><option value=\"616\" > Alborghetti, Mattia<\/option><option value=\"548\" > Almaleck, Pablo<\/option><option value=\"645\" > Angelis, Enrico De<\/option><option value=\"600\" > Angelosante, Daniele<\/option><option value=\"656\" > Ankersen, Finn<\/option><option value=\"633\" > Armenio, Luca Bugliari<\/option><option value=\"644\" > Autelitano, Kevin<\/option><option value=\"694\" > Bamieh, B.<\/option><option value=\"677\" > Bamieh, Bassam<\/option><option value=\"511\" > Baniotopoulos, Charalampos<\/option><option value=\"598\" > Barlini, Davide<\/option><option value=\"512\" > Barth, Stephan<\/option><option value=\"513\" > Bartoli, Gianni<\/option><option value=\"514\" > Bauer, Florian<\/option><option value=\"649\" > Bauer, Margret<\/option><option value=\"545\" > Bella, Alessio La<\/option><option value=\"615\" > Bemporad, Alberto<\/option><option value=\"614\" > Bernardini, Daniele<\/option><option value=\"666\" > Berra, Andrea<\/option><option value=\"625\" > Bianchetti, R.<\/option><option value=\"608\" > Bianchi, Giacomo<\/option><option value=\"515\" > Boelman, Elisa<\/option><option value=\"640\" > Boffadossi, R.<\/option><option value=\"543\" > Boffadossi, Roberto<\/option><option value=\"667\" > Bolognini, M.<\/option><option value=\"609\" > Bolognini, Michele<\/option><option value=\"708\" > Bonansone, Mario<\/option><option value=\"544\" > Bonassi, Fabio<\/option><option value=\"610\" > Bonetti, T.<\/option><option value=\"556\" > Bonetti, Tommaso<\/option><option value=\"746\" > Bordignon, Matteo<\/option><option value=\"684\" > Borodani, P.<\/option><option value=\"650\" > Bortoff, Scott<\/option><option value=\"516\" > Bosse, Dennis<\/option><option value=\"731\" > Brochero, Pedro Nel Acero<\/option><option value=\"618\" > Brusaferri, Alessandro<\/option><option value=\"702\" > Buffoni, M.<\/option><option value=\"558\" > Busk, J\u00f8rgen<\/option><option value=\"647\" > Cai, Zhongtian<\/option><option value=\"651\" > Cairano, Stefano Di<\/option><option value=\"685\" > Calafiore, G. C.<\/option><option value=\"682\" > Calafiore, Giuseppe C.<\/option><option value=\"737\" > CALCIOLARI, GIACOMO<\/option><option value=\"674\" > Canale, M.<\/option><option value=\"671\" > Canale, Massimo<\/option><option value=\"720\" > CANKURT, RAFET TOLGA<\/option><option value=\"576\" > Carnel, Lode<\/option><option value=\"581\" > Carron, Andrea<\/option><option value=\"641\" > Cataldo, A.<\/option><option value=\"560\" > Cataldo, Andrea<\/option><option value=\"500\" > Catenaro, Edoardo<\/option><option value=\"554\" > Cattano, Aldo<\/option><option value=\"591\" > Cecchin, Leonardo<\/option><option value=\"517\" > Cherubini, Antonello<\/option><option value=\"722\" > CIAVARELLA, LUCA<\/option><option value=\"724\" > Cinelli, Matteo<\/option><option value=\"665\" > Cirillo, Fabrizio<\/option><option value=\"718\" > CLARIZIA, GIOVANNI<\/option><option value=\"583\" > Cobb, Mitchell<\/option><option value=\"507\" > Colaneri, Patrizio<\/option><option value=\"727\" > Colombo, Marina<\/option><option value=\"735\" > COROVIC, PAVLE<\/option><option value=\"742\" > Costantini, Matteo<\/option><option value=\"518\" > Croce, Alessandro<\/option><option value=\"634\" > Cupo, Alessandro<\/option><option value=\"734\" > d'Introno, Francesco<\/option><option value=\"760\" > De Santis, Sonia<\/option><option value=\"723\" > DEENADAYALAN, PRASATH<\/option><option value=\"762\" > DellaPorta, Tommaso<\/option><option value=\"590\" > Demetriou, Michael<\/option><option value=\"635\" > Demir, Ozan<\/option><option value=\"585\" > Diehl, Moritz<\/option><option value=\"709\" > Energies, Altaeros<\/option><option value=\"570\" > Fagiano, L.<\/option><option value=\"496\" > Fagiano, Lorenzo<\/option><option value=\"571\" > Farina, M.<\/option><option value=\"551\" > Farina, Marcello<\/option><option value=\"506\" > Farooqi, Hafsa<\/option><option value=\"698\" > Ferrara, A.<\/option><option value=\"696\" > Ferrara, Antonella<\/option><option value=\"704\" > Ferreau, J.<\/option><option value=\"519\" > Fontana, Marco<\/option><option value=\"670\" > Frei, Christoph<\/option><option value=\"631\" > Frigo, Luca<\/option><option value=\"748\" > Gaeta, Alessandro<\/option><option value=\"612\" > Galbiati, Raffaele<\/option><option value=\"703\" > Galletti, B.<\/option><option value=\"725\" > GALLON, GIOVANNI NETO<\/option><option value=\"520\" > Gambier, Adrian<\/option><option value=\"627\" > Gati, R.<\/option><option value=\"662\" > Gati, Rudolf<\/option><option value=\"691\" > Gerlero, I.<\/option><option value=\"690\" > Gerlero, Ilario<\/option><option value=\"728\" > Gini, Roberto<\/option><option value=\"717\" > GIUSTIZIERI, NICOLA<\/option><option value=\"521\" > Gkoumas, Konstantinos<\/option><option value=\"562\" > Gligorovski, Vojislav<\/option><option value=\"522\" > Golightly, Christopher<\/option><option value=\"700\" > Goulart, Paul<\/option><option value=\"657\" > Goupil, Philippe<\/option><option value=\"601\" > Grasso, Fabio<\/option><option value=\"658\" > Grosman, Benyamin<\/option><option value=\"659\" > Heertjes, Marcel<\/option><option value=\"628\" > Hofstetter, L.<\/option><option value=\"693\" > Huynh, K.<\/option><option value=\"676\" > Huynh, Khanh<\/option><option value=\"663\" > Incremona, Gian Paolo<\/option><option value=\"692\" > Ippolito, M.<\/option><option value=\"636\" > Izzo, Giovanni<\/option><option value=\"539\" > Jain, Achin<\/option><option value=\"524\" > Jamieson, Peter<\/option><option value=\"525\" > Kaldellis, John<\/option><option value=\"599\" > Kessler, Nicolas<\/option><option value=\"757\" > KESSLER, NICOLAS MATTHIAS<\/option><option value=\"689\" > Khammash, M.<\/option><option value=\"678\" > Khammash, Mustafa<\/option><option value=\"715\" > KUZHANDAIRAJ, JUSTIN CHRISTOPHER<\/option><option value=\"726\" > LAEZZA, FRANCESCO<\/option><option value=\"523\" > Latour, Mikel Iribas<\/option><option value=\"643\" > Lauricella, M.<\/option><option value=\"567\" > Lauricella, Marco<\/option><option value=\"607\" > Leonesio, Marco<\/option><option value=\"584\" > Leuthold, Rachel<\/option><option value=\"638\" > Limongelli, Maria Pina<\/option><option value=\"505\" > Lowenstein, Kristoffer Fink<\/option><option value=\"613\" > L\u00f8wenstein, Kristoffer Fink<\/option><option value=\"701\" > Lyons, Daniel<\/option><option value=\"526\" > Macdonald, Andrew<\/option><option value=\"577\" > Mallitasig, Lenin Cucas<\/option><option value=\"729\" > MANZO, LAURA<\/option><option value=\"721\" > MARCHESI, ANGELO<\/option><option value=\"637\" > Marchisotti, Daniele<\/option><option value=\"660\" > Mareels, Iven<\/option><option value=\"739\" > MARINO, GIANLUCA<\/option><option value=\"669\" > Marks, Trevor<\/option><option value=\"730\" > Martinez, Alex Miguel Franco<\/option><option value=\"740\" > Mathis, Rodolfo<\/option><option value=\"619\" > Matteucci, Matteo<\/option><option value=\"712\" > MATTIA, GIORGIO<\/option><option value=\"705\" > Mercangoez, M.<\/option><option value=\"741\" > MESGHALI, KIMIA<\/option><option value=\"504\" > Meza, Gonzalo<\/option><option value=\"553\" > Micheli, Claudio<\/option><option value=\"679\" > Milanese, M.<\/option><option value=\"672\" > Milanese, Mario<\/option><option value=\"578\" > Minnetian, Lawrence<\/option><option value=\"736\" > MITIDIERI, PEDRO PABLO<\/option><option value=\"758\" > MOHAMMED, TAREG MAHMOUD HASSAN<\/option><option value=\"557\" > Mohammed, Tareg<\/option><option value=\"716\" > MONTANARI, FEDERICO<\/option><option value=\"617\" > Montecchio, Giulio<\/option><option value=\"707\" > Morari, M.<\/option><option value=\"541\" > Morari, Manfred<\/option><option value=\"509\" > Moro, Alberto<\/option><option value=\"714\" > MUCCIOLO, JOAO VICTOR MIRANDA<\/option><option value=\"527\" > Murphy, Jimmy<\/option><option value=\"528\" > Muskulus, Michael<\/option><option value=\"624\" > Neto, Alexandre Trofino<\/option><option value=\"603\" > Nguyen-Van, E.<\/option><option value=\"563\" > Nguyen-Van, Eric<\/option><option value=\"680\" > Novara, C.<\/option><option value=\"568\" > Novara, Carlo<\/option><option value=\"652\" > Odgaard, Peter Fogh<\/option><option value=\"606\" > Ohler, C.<\/option><option value=\"565\" > Ohler, Christian<\/option><option value=\"559\" > Oland, Espen<\/option><option value=\"589\" > Olinger, David<\/option><option value=\"622\" > Oliveira, Marcelo De Lellis Costa De<\/option><option value=\"745\" > PA\u0303\u00a9rez, Gonzalo JesA\u0303os Meza<\/option><option value=\"595\" > Paganelli, Sofia<\/option><option value=\"744\" > PAJNI, GIANMARCO<\/option><option value=\"501\" > Panzani, Giulio<\/option><option value=\"574\" > Pasta, Edoardo<\/option><option value=\"594\" > Pena, D. Munoz De La<\/option><option value=\"529\" > Petrini, Francesco<\/option><option value=\"754\" > Petulicchio, Lorenzo<\/option><option value=\"750\" > PICARIELLO, NICOLO'<\/option><option value=\"681\" > Piga, D.<\/option><option value=\"688\" > Piga, Dario<\/option><option value=\"530\" > Pigolotti, Luca<\/option><option value=\"753\" > POLISINI, LEONARDO<\/option><option value=\"575\" > Quack, Manfred<\/option><option value=\"602\" > Ragaini, Enrico<\/option><option value=\"604\" > Rager, F.<\/option><option value=\"564\" > Rager, Felix<\/option><option value=\"593\" > Ramirez, D. R.<\/option><option value=\"588\" > Rapp, Sebastian<\/option><option value=\"531\" > Rasmussen, Flemming<\/option><option value=\"687\" > Razza, V.<\/option><option value=\"673\" > Razza, Valentino<\/option><option value=\"510\" > Reis, Vera<\/option><option value=\"653\" > Rhinehart, R. Russell<\/option><option value=\"755\" > Rositani, Marco<\/option><option value=\"710\" > Rotea, Mario<\/option><option value=\"683\" > Ruiz, F.<\/option><option value=\"499\" > Ruiz, Fredy<\/option><option value=\"756\" > Sabug, Lorenzo Jr<\/option><option value=\"498\" > Sabug, Lorenzo<\/option><option value=\"611\" > Saccani, D.<\/option><option value=\"579\" > Saccani, Danilo<\/option><option value=\"592\" > Salvador, J. R.<\/option><option value=\"648\" > Samad, Tariq<\/option><option value=\"654\" > S\u00e1nchez-Pe\u00f1a, Ricardo<\/option><option value=\"629\" > Sandroni, Carlo<\/option><option value=\"542\" > Santis, Sonia De<\/option><option value=\"597\" > Santos, Pedro Henrique Gomes Dos<\/option><option value=\"503\" > Savaresi, Sergio M.<\/option><option value=\"646\" > Scaioni, Marco<\/option><option value=\"572\" > Scattolini, R.<\/option><option value=\"546\" > Scattolini, Riccardo<\/option><option value=\"532\" > Schild, Philippe<\/option><option value=\"540\" > Schildbach, Georg<\/option><option value=\"533\" > Schmehl, Roland<\/option><option value=\"621\" > Schmidt, Eduardo<\/option><option value=\"605\" > Schnez, S.<\/option><option value=\"497\" > Schnez, Stephan<\/option><option value=\"733\" > SCOMAZZON, ENRICO<\/option><option value=\"655\" > Serbezov, Atanas<\/option><option value=\"549\" > Serra, Pietro<\/option><option value=\"502\" > Sette, Davide<\/option><option value=\"675\" > Signorile, M. C.<\/option><option value=\"686\" > Signorile, Maria C.<\/option><option value=\"623\" > Silva, Ramiro Saraiva Da<\/option><option value=\"586\" > Smith, Roy S.<\/option><option value=\"668\" > Smith, Roy<\/option><option value=\"661\" > Sosseh, Raye<\/option><option value=\"534\" > Stavridou, Nafsika<\/option><option value=\"711\" > Stewart, Greg<\/option><option value=\"751\" > Talacci, Mattia<\/option><option value=\"642\" > Tanaskovic, M.<\/option><option value=\"561\" > Tanaskovic, Marko<\/option><option value=\"535\" > Tande, John<\/option><option value=\"664\" > Tanelli, Mara<\/option><option value=\"536\" > Taylor, Nigel<\/option><option value=\"695\" > Teel, Andrew R.<\/option><option value=\"537\" > Telsnig, Thomas<\/option><option value=\"738\" > Tenani, Pietro<\/option><option value=\"569\" > Terzi, E.<\/option><option value=\"550\" > Terzi, Enrico<\/option><option value=\"732\" > Tiraboschi, Alberto<\/option><option value=\"552\" > Todeschini, Davide<\/option><option value=\"713\" > TRABATTONI, ANDREA<\/option><option value=\"632\" > Trachte, Adrian<\/option><option value=\"630\" > Trevisi, Filippo<\/option><option value=\"573\" > Trombini, Sofia<\/option><option value=\"749\" > Vallese, Andrea<\/option><option value=\"495\" > Van, Eric Nguyen<\/option><option value=\"699\" > Vecchio, C.<\/option><option value=\"697\" > Vecchio, Claudio<\/option><option value=\"582\" > Vermillion, Chris<\/option><option value=\"620\" > Vitali, Andrea<\/option><option value=\"743\" > Vitr\u00f2, Federico Maria<\/option><option value=\"508\" > Watson, Simon<\/option><option value=\"538\" > Wiser, Ryan<\/option><option value=\"587\" > Wood, Tony A.<\/option><option value=\"719\" > YANG, ZIJIAN<\/option><option value=\"596\" > Yunus, Ilhan<\/option><option value=\"752\" > ZAGATI, ALEX<\/option><option value=\"639\" > Zappa, Emanuele<\/option><option value=\"547\" > Zarrilli, Donato<\/option><option value=\"580\" > Zeilinger, Melanie N.<\/option><option value=\"706\" > Zgraggen, A. U.<\/option><option value=\"566\" > Zgraggen, Aldo U.<\/option>\r\n                <\/select><div class=\"teachpress_search_button\"><input name=\"tps_button\" class=\"tp_search_button\" type=\"submit\" tabindex=\"10\" value=\"Search\"\/><\/div><\/div><input type=\"hidden\" name=\"trp-form-language\" value=\"it\"\/><\/form><div class=\"tablenav\"><div class=\"tablenav-pages\"><span class=\"displaying-num\">186 dati<\/span> <a class=\"page-numbers button disabled\">&laquo;<\/a> <a class=\"page-numbers button disabled\">&lsaquo;<\/a> 1 di 10 <a href=\"https:\/\/www.sas-lab.deib.polimi.it\/it\/?page_id=153&amp;limit=2&amp;tgid=&amp;yr=&amp;type=&amp;usr=&amp;auth=&amp;tsr=\" title=\"Prossima pagina\" class=\"page-numbers button\">&rsaquo;<\/a> <a href=\"https:\/\/www.sas-lab.deib.polimi.it\/it\/?page_id=153&amp;limit=10&amp;tgid=&amp;yr=&amp;type=&amp;usr=&amp;auth=&amp;tsr=\" title=\"last page\" class=\"page-numbers button\">&raquo;<\/a> <\/div><\/div><div class=\"teachpress_publication_list\"><div class=\"tp_publication tp_publication_conference\"><div class=\"tp_pub_number\">1.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Alborghetti, Mattia;  Trevisi, Filippo;  Boffadossi, Roberto;  Fagiano, Lorenzo<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('574','tp_links')\" style=\"cursor:pointer;\">Optimal Power Smoothing of Airborne Wind Energy Systems Via Pseudo-Spectral Methods and Multi-Objective Analysis<\/a> <span class=\"tp_pub_type tp_  conference\">Conference<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_booktitle\">European Control Conference 2025, <\/span><span class=\"tp_pub_additional_year\">2025<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_abstract_link\"><a id=\"tp_abstract_sh_574\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('574','tp_abstract')\" title=\"Show abstract\" style=\"cursor:pointer;\">Abstract<\/a><\/span> | <span class=\"tp_resource_link\"><a id=\"tp_links_sh_574\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('574','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_574\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('574','tp_bibtex')\" title=\"Visualizza BibTeX\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_574\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@conference{alborghetti2025,<br \/>\r\ntitle = {Optimal Power Smoothing of Airborne Wind Energy Systems Via Pseudo-Spectral Methods and Multi-Objective Analysis},<br \/>\r\nauthor = {Mattia Alborghetti and Filippo Trevisi and Roberto Boffadossi and Lorenzo Fagiano},<br \/>\r\nurl = {https:\/\/www.sas-lab.deib.polimi.it\/?attachment_id=1544},<br \/>\r\ndoi = {to appear},<br \/>\r\nyear  = {2025},<br \/>\r\ndate = {2025-06-27},<br \/>\r\nurldate = {2025-06-27},<br \/>\r\nbooktitle = {European Control Conference 2025},<br \/>\r\nabstract = {The problem of optimizing the power output of a class of Airborne Wind Energy Systems (AWES), named fly-gen, is considered. Fly-gen AWES, called windplanes in this paper, harvest wind power by means of an autonomous tethered aircraft that carries out periodic trajectories roughly perpendicular to the wind flow (crosswind conditions), using on-board turbines and converters and an electric tether to transfer power to the ground. The amount of generated power and its variability strongly depend on the flown trajectory, whose optimization is a highly nonlinear and non-convex problem. Differently from most of the existing literature on the topic, this problem is here addressed from a multi-objective perspective, where both the average power and its variability are considered. Through a recently-proposed pseudo-spectral decomposition of the states and inputs, a rather small-scale nonlinear program is derived to obtain a periodic orbit that maximizes the average power under a constraint on its variability. Then, a series of such programs is formulated and solved to approximate the Pareto front of the problem. Finally, the latter is exploited to analyze the possible trade-offs. The main finding of this work is that, contrary to what postulated so far in the scientific community, it is possible to operate the windplane with minimal power fluctuations (10% of the average) with a very small reduction of mean power, of the order of 5% with respect to the maximum achievable. Additional considerations regarding the sensitivity of the optimal trajectories to various factors are presented, too. These results pave the way for a completely novel way of optimizing and controlling windplanes.},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {conference}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('574','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_abstract\" id=\"tp_abstract_574\" style=\"display:none;\"><div class=\"tp_abstract_entry\">The problem of optimizing the power output of a class of Airborne Wind Energy Systems (AWES), named fly-gen, is considered. Fly-gen AWES, called windplanes in this paper, harvest wind power by means of an autonomous tethered aircraft that carries out periodic trajectories roughly perpendicular to the wind flow (crosswind conditions), using on-board turbines and converters and an electric tether to transfer power to the ground. The amount of generated power and its variability strongly depend on the flown trajectory, whose optimization is a highly nonlinear and non-convex problem. Differently from most of the existing literature on the topic, this problem is here addressed from a multi-objective perspective, where both the average power and its variability are considered. Through a recently-proposed pseudo-spectral decomposition of the states and inputs, a rather small-scale nonlinear program is derived to obtain a periodic orbit that maximizes the average power under a constraint on its variability. Then, a series of such programs is formulated and solved to approximate the Pareto front of the problem. Finally, the latter is exploited to analyze the possible trade-offs. The main finding of this work is that, contrary to what postulated so far in the scientific community, it is possible to operate the windplane with minimal power fluctuations (10% of the average) with a very small reduction of mean power, of the order of 5% with respect to the maximum achievable. Additional considerations regarding the sensitivity of the optimal trajectories to various factors are presented, too. These results pave the way for a completely novel way of optimizing and controlling windplanes.<\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('574','tp_abstract')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_574\" style=\"display:none;\"><div class=\"tp_links_entry\"><ul class=\"tp_pub_list\"><li><i class=\"fas fa-globe\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/www.sas-lab.deib.polimi.it\/it\/?attachment_id=1544\" title=\"https:\/\/www.sas-lab.deib.polimi.it\/?attachment_id=1544\" target=\"_blank\">https:\/\/www.sas-lab.deib.polimi.it\/?attachment_id=1544<\/a><\/li><li><i class=\"ai ai-doi\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/dx.doi.org\/to appear\" title=\"Follow DOI:to appear\" target=\"_blank\">doi:to appear<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('574','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_article\"><div class=\"tp_pub_number\">2.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Catenaro, Edoardo;  Sabug, Lorenzo;  Panzani, Giulio;  Sette, Davide;  Ruiz, Fredy;  Fagiano, Lorenzo;  Savaresi, Sergio M.<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('391','tp_links')\" style=\"cursor:pointer;\">Automatic Learning-Based Calibration of Assisted Motorcycle Gearshift: A Comparative Study<\/a> <span class=\"tp_pub_type tp_  article\">Journal Article<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_in\">In: <\/span><span class=\"tp_pub_additional_journal\">IEEE Transactions on Control Systems Technology, <\/span><span class=\"tp_pub_additional_year\">2025<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_abstract_link\"><a id=\"tp_abstract_sh_391\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('391','tp_abstract')\" title=\"Show abstract\" style=\"cursor:pointer;\">Abstract<\/a><\/span> | <span class=\"tp_resource_link\"><a id=\"tp_links_sh_391\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('391','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_391\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('391','tp_bibtex')\" title=\"Visualizza BibTeX\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_391\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@article{Catenaro2025,<br \/>\r\ntitle = {Automatic Learning-Based Calibration of Assisted Motorcycle Gearshift: A Comparative Study},<br \/>\r\nauthor = {Edoardo Catenaro and Lorenzo Sabug and Giulio Panzani and Davide Sette and Fredy Ruiz and Lorenzo Fagiano and Sergio M. Savaresi},<br \/>\r\nurl = {https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-105004672295&doi=10.1109%2fTCST.2025.3561504&partnerID=40&md5=9721bf3ba2794fb9cbd698537f8aaf75},<br \/>\r\ndoi = {10.1109\/TCST.2025.3561504},<br \/>\r\nyear  = {2025},<br \/>\r\ndate = {2025-01-01},<br \/>\r\njournal = {IEEE Transactions on Control Systems Technology},<br \/>\r\nabstract = {A comparison of different approaches to the automatic online, data-driven calibration of assisted gearshift settings for a motorcycle is presented. An objective function associated with the component stress and clutch resynchronization time is exploited and optimized during operation using different strategies: from na\u00efve space-filling approaches to learning-based black-box optimization algorithms. The performance of various methods is compared in real-world experiments using metrics related to the experimental convergence rate and the quality of the best found result. \u00a9 1993-2012 IEEE.},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {article}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('391','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_abstract\" id=\"tp_abstract_391\" style=\"display:none;\"><div class=\"tp_abstract_entry\">A comparison of different approaches to the automatic online, data-driven calibration of assisted gearshift settings for a motorcycle is presented. An objective function associated with the component stress and clutch resynchronization time is exploited and optimized during operation using different strategies: from na\u00efve space-filling approaches to learning-based black-box optimization algorithms. The performance of various methods is compared in real-world experiments using metrics related to the experimental convergence rate and the quality of the best found result. \u00a9 1993-2012 IEEE.<\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('391','tp_abstract')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_391\" style=\"display:none;\"><div class=\"tp_links_entry\"><ul class=\"tp_pub_list\"><li><i class=\"fas fa-globe\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-105004672295&amp;doi=10.1109%2fTCST.2025.3561504&amp;partnerID=40&amp;md5=9721bf3ba2794fb9cbd698537f8aaf75\" title=\"https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-105004672295&amp;doi=10.1109[...]\" target=\"_blank\">https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-105004672295&amp;doi=10.1109[...]<\/a><\/li><li><i class=\"ai ai-doi\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/dx.doi.org\/10.1109\/TCST.2025.3561504\" title=\"Follow DOI:10.1109\/TCST.2025.3561504\" target=\"_blank\">doi:10.1109\/TCST.2025.3561504<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('391','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_article\"><div class=\"tp_pub_number\">3.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Ahmed, Syed Hassan;  Bonetti, Tommaso;  Fagiano, Lorenzo<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('400','tp_links')\" style=\"cursor:pointer;\">Periodic Disturbance Learning Model Predictive Control<\/a> <span class=\"tp_pub_type tp_  article\">Journal Article<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_in\">In: <\/span><span class=\"tp_pub_additional_journal\">IEEE Control Systems Letters, <\/span><span class=\"tp_pub_additional_year\">2025<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_abstract_link\"><a id=\"tp_abstract_sh_400\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('400','tp_abstract')\" title=\"Show abstract\" style=\"cursor:pointer;\">Abstract<\/a><\/span> | <span class=\"tp_resource_link\"><a id=\"tp_links_sh_400\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('400','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_400\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('400','tp_bibtex')\" title=\"Visualizza BibTeX\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_400\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@article{Ahmed2025,<br \/>\r\ntitle = {Periodic Disturbance Learning Model Predictive Control},<br \/>\r\nauthor = {Syed Hassan Ahmed and Tommaso Bonetti and Lorenzo Fagiano},<br \/>\r\nurl = {https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-105010219505&doi=10.1109%2fLCSYS.2025.3586633&partnerID=40&md5=ad42d331d4a119b26ac13d3387a4e55d},<br \/>\r\ndoi = {10.1109\/LCSYS.2025.3586633},<br \/>\r\nyear  = {2025},<br \/>\r\ndate = {2025-01-01},<br \/>\r\njournal = {IEEE Control Systems Letters},<br \/>\r\nabstract = {A novel Model Predictive Control (MPC) framework called disturbance-learning MPC (DL-MPC) for constrained LTI systems subject to bounded disturbances is proposed. The primary objective is to improve the disturbance rejection performance of the tube-based MPC (tube-MPC) law, especially focusing on periodic disturbance signals. Based on convex optimization, the method uses real-time measurements to learn a model of the disturbance, to predict its future behavior. By including this model in the MPC, the latter can proactively counteract the disturbance, significantly improving closed-loop performance. The presented technique includes the disturbance model while preserving robust recursive feasibility and constraint satisfaction. The effectiveness of DL-MPC is demonstrated through simulation of a multivariable nonlinear system, a Continuous-flow Stirred Tank Reactor, subject to periodic disturbances. The results clearly show enhanced tracking accuracy compared to nominal MPC and tube-MPC methods. \u00a9 2017 IEEE.},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {article}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('400','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_abstract\" id=\"tp_abstract_400\" style=\"display:none;\"><div class=\"tp_abstract_entry\">A novel Model Predictive Control (MPC) framework called disturbance-learning MPC (DL-MPC) for constrained LTI systems subject to bounded disturbances is proposed. The primary objective is to improve the disturbance rejection performance of the tube-based MPC (tube-MPC) law, especially focusing on periodic disturbance signals. Based on convex optimization, the method uses real-time measurements to learn a model of the disturbance, to predict its future behavior. By including this model in the MPC, the latter can proactively counteract the disturbance, significantly improving closed-loop performance. The presented technique includes the disturbance model while preserving robust recursive feasibility and constraint satisfaction. The effectiveness of DL-MPC is demonstrated through simulation of a multivariable nonlinear system, a Continuous-flow Stirred Tank Reactor, subject to periodic disturbances. The results clearly show enhanced tracking accuracy compared to nominal MPC and tube-MPC methods. \u00a9 2017 IEEE.<\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('400','tp_abstract')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_400\" style=\"display:none;\"><div class=\"tp_links_entry\"><ul class=\"tp_pub_list\"><li><i class=\"fas fa-globe\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-105010219505&amp;doi=10.1109%2fLCSYS.2025.3586633&amp;partnerID=40&amp;md5=ad42d331d4a119b26ac13d3387a4e55d\" title=\"https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-105010219505&amp;doi=10.1109[...]\" target=\"_blank\">https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-105010219505&amp;doi=10.1109[...]<\/a><\/li><li><i class=\"ai ai-doi\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/dx.doi.org\/10.1109\/LCSYS.2025.3586633\" title=\"Follow DOI:10.1109\/LCSYS.2025.3586633\" target=\"_blank\">doi:10.1109\/LCSYS.2025.3586633<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('400','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_conference\"><div class=\"tp_pub_number\">4.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Trevisi, Filippo;  Sabug, Lorenzo;  Fagiano, Lorenzo<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('451','tp_links')\" style=\"cursor:pointer;\">A Gaussian wake model for Airborne Wind Energy Systems<\/a> <span class=\"tp_pub_type tp_  conference\">Conference<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_booktitle\">Wake Conference 2025 Visby, Sweden, <\/span><span class=\"tp_pub_additional_volume\">vol. 3016, <\/span><span class=\"tp_pub_additional_number\">no 1, <\/span><span class=\"tp_pub_additional_series\">Journal of Physics: Conference Series <\/span><span class=\"tp_pub_additional_year\">2025<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_abstract_link\"><a id=\"tp_abstract_sh_451\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('451','tp_abstract')\" title=\"Show abstract\" style=\"cursor:pointer;\">Abstract<\/a><\/span> | <span class=\"tp_resource_link\"><a id=\"tp_links_sh_451\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('451','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_451\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('451','tp_bibtex')\" title=\"Visualizza BibTeX\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_451\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@conference{Trevisi2025,<br \/>\r\ntitle = {A Gaussian wake model for Airborne Wind Energy Systems},<br \/>\r\nauthor = {Filippo Trevisi and Lorenzo Sabug and Lorenzo Fagiano},<br \/>\r\nurl = {https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-105007615616&doi=10.1088%2f1742-6596%2f3016%2f1%2f012038&partnerID=40&md5=e2dceed356557b4c5caec901a97faf58},<br \/>\r\ndoi = {10.1088\/1742-6596\/3016\/1\/012038},<br \/>\r\nyear  = {2025},<br \/>\r\ndate = {2025-01-01},<br \/>\r\nurldate = {2025-01-01},<br \/>\r\nbooktitle = {Wake Conference 2025 Visby, Sweden},<br \/>\r\njournal = {Journal of Physics: Conference Series},<br \/>\r\nvolume = {3016},<br \/>\r\nnumber = {1},<br \/>\r\nseries = {Journal of Physics: Conference Series},<br \/>\r\nabstract = {Modeling the aerodynamic interactions between Airborne Wind Energy Systems (AWES) is an open and challenging problem. To this end, a new Gaussian wake model is introduced for fly-gen AWES, also called windplanes here. The engineering wake models of windplanes can be split in induction models, used to find the induced velocities at the wing, and wake models, used to account for the wind deficit downwind. The proposed model combines an improved induction model, starting from one available in the literature, with a novel wake model that assumes that the wake velocity has a Gaussian shape and imposes momentum conservation. The variance of the Gaussian wake is assumed to vary with the downstream distance from the windplane. The model entails just one tuning parameter that is estimated using CFD results from the literature, showing high accuracy. The new model is then used to study the influence of an upwind system on a downwind one. A sensitivity analysis is carried out by moving the downwind system in the direction transverse to the wind speed or by yawing it with respect to the wind direction. A maximum in power production of the downwind system is found when the projections of the two trajectories are partially overlapping. The extremely low computational cost of the model and the physical insights provided by this paper contribute to clear the way for simulation, planning and control of large scale airborne wind farms. \u00a9 Published under licence by IOP Publishing Ltd.},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {conference}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('451','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_abstract\" id=\"tp_abstract_451\" style=\"display:none;\"><div class=\"tp_abstract_entry\">Modeling the aerodynamic interactions between Airborne Wind Energy Systems (AWES) is an open and challenging problem. To this end, a new Gaussian wake model is introduced for fly-gen AWES, also called windplanes here. The engineering wake models of windplanes can be split in induction models, used to find the induced velocities at the wing, and wake models, used to account for the wind deficit downwind. The proposed model combines an improved induction model, starting from one available in the literature, with a novel wake model that assumes that the wake velocity has a Gaussian shape and imposes momentum conservation. The variance of the Gaussian wake is assumed to vary with the downstream distance from the windplane. The model entails just one tuning parameter that is estimated using CFD results from the literature, showing high accuracy. The new model is then used to study the influence of an upwind system on a downwind one. A sensitivity analysis is carried out by moving the downwind system in the direction transverse to the wind speed or by yawing it with respect to the wind direction. A maximum in power production of the downwind system is found when the projections of the two trajectories are partially overlapping. The extremely low computational cost of the model and the physical insights provided by this paper contribute to clear the way for simulation, planning and control of large scale airborne wind farms. \u00a9 Published under licence by IOP Publishing Ltd.<\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('451','tp_abstract')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_451\" style=\"display:none;\"><div class=\"tp_links_entry\"><ul class=\"tp_pub_list\"><li><i class=\"fas fa-globe\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-105007615616&amp;doi=10.1088%2f1742-6596%2f3016%2f1%2f012038&amp;partnerID=40&amp;md5=e2dceed356557b4c5caec901a97faf58\" title=\"https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-105007615616&amp;doi=10.1088[...]\" target=\"_blank\">https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-105007615616&amp;doi=10.1088[...]<\/a><\/li><li><i class=\"ai ai-doi\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/dx.doi.org\/10.1088\/1742-6596\/3016\/1\/012038\" title=\"Follow DOI:10.1088\/1742-6596\/3016\/1\/012038\" target=\"_blank\">doi:10.1088\/1742-6596\/3016\/1\/012038<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('451','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_article\"><div class=\"tp_pub_number\">5.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Kessler, Nicolas;  Fagiano, Lorenzo<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('452','tp_links')\" style=\"cursor:pointer;\">On Gain Scheduling Trajectory Stabilization for Nonlinear Systems: Theoretical Insights and Experimental Results<\/a> <span class=\"tp_pub_type tp_  article\">Journal Article<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_in\">In: <\/span><span class=\"tp_pub_additional_journal\">International Journal of Robust and Nonlinear Control, <\/span><span class=\"tp_pub_additional_volume\">vol. 35, <\/span><span class=\"tp_pub_additional_number\">no 6, <\/span><span class=\"tp_pub_additional_pages\">pp. 2142 \u2013 2155, <\/span><span class=\"tp_pub_additional_year\">2025<\/span><span class=\"tp_pub_additional_note\">, (All Open Access, Green Open Access, Hybrid Gold Open Access)<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_abstract_link\"><a id=\"tp_abstract_sh_452\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('452','tp_abstract')\" title=\"Show abstract\" style=\"cursor:pointer;\">Abstract<\/a><\/span> | <span class=\"tp_resource_link\"><a id=\"tp_links_sh_452\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('452','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_452\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('452','tp_bibtex')\" title=\"Visualizza BibTeX\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_452\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@article{Kessler20252142,<br \/>\r\ntitle = {On Gain Scheduling Trajectory Stabilization for Nonlinear Systems: Theoretical Insights and Experimental Results},<br \/>\r\nauthor = {Nicolas Kessler and Lorenzo Fagiano},<br \/>\r\nurl = {https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-86000427164&doi=10.1002%2frnc.7784&partnerID=40&md5=60657f166d42065468d94f1366f650bd},<br \/>\r\ndoi = {10.1002\/rnc.7784},<br \/>\r\nyear  = {2025},<br \/>\r\ndate = {2025-01-01},<br \/>\r\njournal = {International Journal of Robust and Nonlinear Control},<br \/>\r\nvolume = {35},<br \/>\r\nnumber = {6},<br \/>\r\npages = {2142 \u2013 2155},<br \/>\r\nabstract = {Steering a nonlinear system from an initial state to a desired one is a common task in control. While a nominal trajectory can be obtained rather systematically using a model, for example, via numerical optimization, heuristics, or reinforcement learning, the design of a computationally fast and reliable feedback control law that guarantees bounded deviations around the found trajectory can be much more involved. An approach that does not require high online computational power and is well-accepted in industry is gain-scheduling. The results presented here pertain to the boundedness guarantees and the set of safe initial conditions of gain-scheduled control laws, based on subsequent linearizations along the reference trajectory. The approach bounds the uncertainty arising from the linearization process, builds polytopic sets of linear time-varying systems covering the nonlinear dynamics along the trajectory, and exploits sufficient conditions for the existence of a robust polyquadratic Lyapunov function to attempt the derivation of the desired gain-scheduled controller via the solution of linear matrix inequalities (LMIs). A result to estimate an ellipsoidal set of safe initial conditions is provided too. Moreover, arbitrary scheduling strategies between the control gains are considered in the analysis, and the method can also be used to check\/assess the boundedness properties obtained with an existing gain-scheduled law. The approach is demonstrated experimentally on a small quadcopter, as well as in simulation to design a scheduled controller for a chemical reactor model and to validate an existing control law for a gantry crane model. \u00a9 2025 The Author(s). International Journal of Robust and Nonlinear Control published by John Wiley & Sons Ltd.},<br \/>\r\nnote = {All Open Access, Green Open Access, Hybrid Gold Open Access},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {article}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('452','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_abstract\" id=\"tp_abstract_452\" style=\"display:none;\"><div class=\"tp_abstract_entry\">Steering a nonlinear system from an initial state to a desired one is a common task in control. While a nominal trajectory can be obtained rather systematically using a model, for example, via numerical optimization, heuristics, or reinforcement learning, the design of a computationally fast and reliable feedback control law that guarantees bounded deviations around the found trajectory can be much more involved. An approach that does not require high online computational power and is well-accepted in industry is gain-scheduling. The results presented here pertain to the boundedness guarantees and the set of safe initial conditions of gain-scheduled control laws, based on subsequent linearizations along the reference trajectory. The approach bounds the uncertainty arising from the linearization process, builds polytopic sets of linear time-varying systems covering the nonlinear dynamics along the trajectory, and exploits sufficient conditions for the existence of a robust polyquadratic Lyapunov function to attempt the derivation of the desired gain-scheduled controller via the solution of linear matrix inequalities (LMIs). A result to estimate an ellipsoidal set of safe initial conditions is provided too. Moreover, arbitrary scheduling strategies between the control gains are considered in the analysis, and the method can also be used to check\/assess the boundedness properties obtained with an existing gain-scheduled law. The approach is demonstrated experimentally on a small quadcopter, as well as in simulation to design a scheduled controller for a chemical reactor model and to validate an existing control law for a gantry crane model. \u00a9 2025 The Author(s). International Journal of Robust and Nonlinear Control published by John Wiley &amp; Sons Ltd.<\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('452','tp_abstract')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_452\" style=\"display:none;\"><div class=\"tp_links_entry\"><ul class=\"tp_pub_list\"><li><i class=\"fas fa-globe\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-86000427164&amp;doi=10.1002%2frnc.7784&amp;partnerID=40&amp;md5=60657f166d42065468d94f1366f650bd\" title=\"https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-86000427164&amp;doi=10.1002%[...]\" target=\"_blank\">https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-86000427164&amp;doi=10.1002%[...]<\/a><\/li><li><i class=\"ai ai-doi\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/dx.doi.org\/10.1002\/rnc.7784\" title=\"Follow DOI:10.1002\/rnc.7784\" target=\"_blank\">doi:10.1002\/rnc.7784<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('452','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_conference\"><div class=\"tp_pub_number\">6.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Meza, Gonzalo;  Lowenstein, Kristoffer Fink;  Fagiano, Lorenzo<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('392','tp_links')\" style=\"cursor:pointer;\">Obstacle avoidance for a robotic manipulator with linear-quadratic Model Predictive Control<\/a> <span class=\"tp_pub_type tp_  conference\">Conference<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_year\">2024<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_abstract_link\"><a id=\"tp_abstract_sh_392\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('392','tp_abstract')\" title=\"Show abstract\" style=\"cursor:pointer;\">Abstract<\/a><\/span> | <span class=\"tp_resource_link\"><a id=\"tp_links_sh_392\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('392','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_392\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('392','tp_bibtex')\" title=\"Visualizza BibTeX\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_392\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@conference{Meza20243365,<br \/>\r\ntitle = {Obstacle avoidance for a robotic manipulator with linear-quadratic Model Predictive Control},<br \/>\r\nauthor = {Gonzalo Meza and Kristoffer Fink Lowenstein and Lorenzo Fagiano},<br \/>\r\nurl = {https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85208276051&doi=10.1109%2fCASE59546.2024.10711546&partnerID=40&md5=dc5df15c31ee283e5083ebcec6b1e560},<br \/>\r\ndoi = {10.1109\/CASE59546.2024.10711546},<br \/>\r\nyear  = {2024},<br \/>\r\ndate = {2024-01-01},<br \/>\r\njournal = {IEEE International Conference on Automation Science and Engineering},<br \/>\r\npages = {3365 \u2013 3370},<br \/>\r\nabstract = {The problem of moving a six-degrees-of-freedom manipulator in an environment with unknown obstacles is considered. The manipulator is assumed to be equipped with an exteroceptive sensor that provides a partial sampling of the surroundings. A hierarchical control layout is proposed: in the outer layer, a path planner generates an obstacle-free trajectory based on the available local information; in the inner layer, an Inverse-Kinematics Model Predictive Controller tracks the trajectory while reactively avoiding unseen obstacles and self-collisions at a higher rate. By constructing a polytopic under-approximation of the free environment and employing a linearization of the task, the predictive controller features a convex quadratic cost and linear constraints, thus requiring the solution of a quadratic program at each time step. The proposed method is evaluated on the kinematic model of a MyCobot280 robotic arm, showing the potential for real-time feasibility. \u00a9 2024 IEEE.},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {conference}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('392','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_abstract\" id=\"tp_abstract_392\" style=\"display:none;\"><div class=\"tp_abstract_entry\">The problem of moving a six-degrees-of-freedom manipulator in an environment with unknown obstacles is considered. The manipulator is assumed to be equipped with an exteroceptive sensor that provides a partial sampling of the surroundings. A hierarchical control layout is proposed: in the outer layer, a path planner generates an obstacle-free trajectory based on the available local information; in the inner layer, an Inverse-Kinematics Model Predictive Controller tracks the trajectory while reactively avoiding unseen obstacles and self-collisions at a higher rate. By constructing a polytopic under-approximation of the free environment and employing a linearization of the task, the predictive controller features a convex quadratic cost and linear constraints, thus requiring the solution of a quadratic program at each time step. The proposed method is evaluated on the kinematic model of a MyCobot280 robotic arm, showing the potential for real-time feasibility. \u00a9 2024 IEEE.<\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('392','tp_abstract')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_392\" style=\"display:none;\"><div class=\"tp_links_entry\"><ul class=\"tp_pub_list\"><li><i class=\"fas fa-globe\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85208276051&amp;doi=10.1109%2fCASE59546.2024.10711546&amp;partnerID=40&amp;md5=dc5df15c31ee283e5083ebcec6b1e560\" title=\"https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85208276051&amp;doi=10.1109%[...]\" target=\"_blank\">https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85208276051&amp;doi=10.1109%[...]<\/a><\/li><li><i class=\"ai ai-doi\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/dx.doi.org\/10.1109\/CASE59546.2024.10711546\" title=\"Follow DOI:10.1109\/CASE59546.2024.10711546\" target=\"_blank\">doi:10.1109\/CASE59546.2024.10711546<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('392','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_article\"><div class=\"tp_pub_number\">7.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Mohammed, Tareg;  Busk, J\u00f8rgen;  Oland, Espen;  Fagiano, Lorenzo<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('401','tp_links')\" style=\"cursor:pointer;\">Large-Scale Reverse Pumping for Rigid-Wing Airborne Wind Energy Systems<\/a> <span class=\"tp_pub_type tp_  article\">Journal Article<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_in\">In: <\/span><span class=\"tp_pub_additional_journal\">Journal of Guidance, Control, and Dynamics, <\/span><span class=\"tp_pub_additional_volume\">vol. 47, <\/span><span class=\"tp_pub_additional_number\">no 8, <\/span><span class=\"tp_pub_additional_pages\">pp. 1748 \u2013 1758, <\/span><span class=\"tp_pub_additional_year\">2024<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_resource_link\"><a id=\"tp_links_sh_401\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('401','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_401\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('401','tp_bibtex')\" title=\"Visualizza BibTeX\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_401\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@article{Mohammed20241748,<br \/>\r\ntitle = {Large-Scale Reverse Pumping for Rigid-Wing Airborne Wind Energy Systems},<br \/>\r\nauthor = {Tareg Mohammed and J\u00f8rgen Busk and Espen Oland and Lorenzo Fagiano},<br \/>\r\nurl = {https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85201687286&doi=10.2514%2f1.G007859&partnerID=40&md5=022d3ef14b7aa30dcd28668b0b7a4c6e},<br \/>\r\ndoi = {10.2514\/1.G007859},<br \/>\r\nyear  = {2024},<br \/>\r\ndate = {2024-01-01},<br \/>\r\njournal = {Journal of Guidance, Control, and Dynamics},<br \/>\r\nvolume = {47},<br \/>\r\nnumber = {8},<br \/>\r\npages = {1748 \u2013 1758},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {article}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('401','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_401\" style=\"display:none;\"><div class=\"tp_links_entry\"><ul class=\"tp_pub_list\"><li><i class=\"fas fa-globe\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85201687286&amp;doi=10.2514%2f1.G007859&amp;partnerID=40&amp;md5=022d3ef14b7aa30dcd28668b0b7a4c6e\" title=\"https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85201687286&amp;doi=10.2514%[...]\" target=\"_blank\">https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85201687286&amp;doi=10.2514%[...]<\/a><\/li><li><i class=\"ai ai-doi\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/dx.doi.org\/10.2514\/1.G007859\" title=\"Follow DOI:10.2514\/1.G007859\" target=\"_blank\">doi:10.2514\/1.G007859<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('401','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_conference\"><div class=\"tp_pub_number\">8.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Sabug, Lorenzo;  Ruiz, Fredy;  Fagiano, Lorenzo<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('410','tp_links')\" style=\"cursor:pointer;\">Multi-Agent Global Optimization with Decision Variable Coupling<\/a> <span class=\"tp_pub_type tp_  conference\">Conference<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_year\">2024<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_abstract_link\"><a id=\"tp_abstract_sh_410\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('410','tp_abstract')\" title=\"Show abstract\" style=\"cursor:pointer;\">Abstract<\/a><\/span> | <span class=\"tp_resource_link\"><a id=\"tp_links_sh_410\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('410','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_410\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('410','tp_bibtex')\" title=\"Visualizza BibTeX\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_410\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@conference{Sabug20242544,<br \/>\r\ntitle = {Multi-Agent Global Optimization with Decision Variable Coupling},<br \/>\r\nauthor = {Lorenzo Sabug and Fredy Ruiz and Lorenzo Fagiano},<br \/>\r\nurl = {https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-86000520212&doi=10.1109%2fCDC56724.2024.10886148&partnerID=40&md5=22a6fbefd438993a678fbc1fb7c8d063},<br \/>\r\ndoi = {10.1109\/CDC56724.2024.10886148},<br \/>\r\nyear  = {2024},<br \/>\r\ndate = {2024-01-01},<br \/>\r\njournal = {Proceedings of the IEEE Conference on Decision and Control},<br \/>\r\npages = {2544 \u2013 2550},<br \/>\r\nabstract = {A cooperative, multi-agent global optimization problem is considered, where the global cost function is the sum of the agents' private, non-convex costs. In contrast to all previously considered setups, evaluating the private costs involves a global experiment, using a common instance of the decision vector. This is relevant when each agent can only control a part ('subvariable') of the decision vector, but its private cost is also affected by the other subvariables. A novel cooperative optimization method using Set Membership identification and consensus-based techniques is proposed, to make all agents agree on the next global decision vector to be tested. A trade-off between exploitation close to the best point found and exploration around the search set is achieved, even without explicitly sharing the private costs' information. Statistical tests show that the proposed distributed method is competitive with respect to a centralized one. \u00a9 2024 IEEE.},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {conference}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('410','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_abstract\" id=\"tp_abstract_410\" style=\"display:none;\"><div class=\"tp_abstract_entry\">A cooperative, multi-agent global optimization problem is considered, where the global cost function is the sum of the agents' private, non-convex costs. In contrast to all previously considered setups, evaluating the private costs involves a global experiment, using a common instance of the decision vector. This is relevant when each agent can only control a part ('subvariable') of the decision vector, but its private cost is also affected by the other subvariables. A novel cooperative optimization method using Set Membership identification and consensus-based techniques is proposed, to make all agents agree on the next global decision vector to be tested. A trade-off between exploitation close to the best point found and exploration around the search set is achieved, even without explicitly sharing the private costs' information. Statistical tests show that the proposed distributed method is competitive with respect to a centralized one. \u00a9 2024 IEEE.<\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('410','tp_abstract')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_410\" style=\"display:none;\"><div class=\"tp_links_entry\"><ul class=\"tp_pub_list\"><li><i class=\"fas fa-globe\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-86000520212&amp;doi=10.1109%2fCDC56724.2024.10886148&amp;partnerID=40&amp;md5=22a6fbefd438993a678fbc1fb7c8d063\" title=\"https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-86000520212&amp;doi=10.1109%[...]\" target=\"_blank\">https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-86000520212&amp;doi=10.1109%[...]<\/a><\/li><li><i class=\"ai ai-doi\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/dx.doi.org\/10.1109\/CDC56724.2024.10886148\" title=\"Follow DOI:10.1109\/CDC56724.2024.10886148\" target=\"_blank\">doi:10.1109\/CDC56724.2024.10886148<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('410','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_article\"><div class=\"tp_pub_number\">9.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Trombini, Sofia;  Pasta, Edoardo;  Fagiano, Lorenzo<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('412','tp_links')\" style=\"cursor:pointer;\">On the kite-platform interactions in offshore Airborne Wind Energy Systems: Frequency analysis and control approach<\/a> <span class=\"tp_pub_type tp_  article\">Journal Article<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_in\">In: <\/span><span class=\"tp_pub_additional_journal\">European Journal of Control, <\/span><span class=\"tp_pub_additional_volume\">vol. 80, <\/span><span class=\"tp_pub_additional_year\">2024<\/span><span class=\"tp_pub_additional_note\">, (All Open Access, Green Open Access, Hybrid Gold Open Access)<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_abstract_link\"><a id=\"tp_abstract_sh_412\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('412','tp_abstract')\" title=\"Show abstract\" style=\"cursor:pointer;\">Abstract<\/a><\/span> | <span class=\"tp_resource_link\"><a id=\"tp_links_sh_412\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('412','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_412\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('412','tp_bibtex')\" title=\"Visualizza BibTeX\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_412\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@article{Trombini2024,<br \/>\r\ntitle = {On the kite-platform interactions in offshore Airborne Wind Energy Systems: Frequency analysis and control approach},<br \/>\r\nauthor = {Sofia Trombini and Edoardo Pasta and Lorenzo Fagiano},<br \/>\r\nurl = {https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85196822443&doi=10.1016%2fj.ejcon.2024.101065&partnerID=40&md5=662a7b724fd8ae32429e343613eaa49d},<br \/>\r\ndoi = {10.1016\/j.ejcon.2024.101065},<br \/>\r\nyear  = {2024},<br \/>\r\ndate = {2024-01-01},<br \/>\r\njournal = {European Journal of Control},<br \/>\r\nvolume = {80},<br \/>\r\nabstract = {This study investigates deep offshore, pumping Airborne Wind Energy systems, focusing on the kite-platform interaction. The considered system includes a 360 m2 soft-wing kite, connected by a tether to a winch installed on a 10-meter-deep spar with four mooring lines. Wind power is converted into electricity with a feedback controlled periodic trajectory of the kite and corresponding reeling motion of the tether. An analysis of the mutual influence between the platform and the kite dynamics, with different wave regimes, reveals a rather small sensitivity of the flight pattern to the platform oscillations; on the other hand, the frequency of tether force oscillations can be close to the platform resonance peaks, resulting in possible increased fatigue loads and damage of the floating and submerged components. A control design procedure is then proposed to avoid this problem, acting on the kite path planner. Simulation results confirm the effectiveness of the approach. \u00a9 2024 The Authors},<br \/>\r\nnote = {All Open Access, Green Open Access, Hybrid Gold Open Access},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {article}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('412','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_abstract\" id=\"tp_abstract_412\" style=\"display:none;\"><div class=\"tp_abstract_entry\">This study investigates deep offshore, pumping Airborne Wind Energy systems, focusing on the kite-platform interaction. The considered system includes a 360 m2 soft-wing kite, connected by a tether to a winch installed on a 10-meter-deep spar with four mooring lines. Wind power is converted into electricity with a feedback controlled periodic trajectory of the kite and corresponding reeling motion of the tether. An analysis of the mutual influence between the platform and the kite dynamics, with different wave regimes, reveals a rather small sensitivity of the flight pattern to the platform oscillations; on the other hand, the frequency of tether force oscillations can be close to the platform resonance peaks, resulting in possible increased fatigue loads and damage of the floating and submerged components. A control design procedure is then proposed to avoid this problem, acting on the kite path planner. Simulation results confirm the effectiveness of the approach. \u00a9 2024 The Authors<\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('412','tp_abstract')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_412\" style=\"display:none;\"><div class=\"tp_links_entry\"><ul class=\"tp_pub_list\"><li><i class=\"fas fa-globe\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85196822443&amp;doi=10.1016%2fj.ejcon.2024.101065&amp;partnerID=40&amp;md5=662a7b724fd8ae32429e343613eaa49d\" title=\"https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85196822443&amp;doi=10.1016%[...]\" target=\"_blank\">https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85196822443&amp;doi=10.1016%[...]<\/a><\/li><li><i class=\"ai ai-doi\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/dx.doi.org\/10.1016\/j.ejcon.2024.101065\" title=\"Follow DOI:10.1016\/j.ejcon.2024.101065\" target=\"_blank\">doi:10.1016\/j.ejcon.2024.101065<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('412','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_article\"><div class=\"tp_pub_number\">10.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Sabug, Lorenzo;  Fagiano, Lorenzo;  Ruiz, Fredy<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('416','tp_links')\" style=\"cursor:pointer;\">Sample-Based Trust Region Dynamics in Contextual Global Optimization<\/a> <span class=\"tp_pub_type tp_  article\">Journal Article<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_in\">In: <\/span><span class=\"tp_pub_additional_journal\">IEEE Control Systems Letters, <\/span><span class=\"tp_pub_additional_volume\">vol. 8, <\/span><span class=\"tp_pub_additional_pages\">pp. 1619 \u2013 1624, <\/span><span class=\"tp_pub_additional_year\">2024<\/span><span class=\"tp_pub_additional_note\">, (All Open Access, Hybrid Gold Open Access)<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_abstract_link\"><a id=\"tp_abstract_sh_416\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('416','tp_abstract')\" title=\"Show abstract\" style=\"cursor:pointer;\">Abstract<\/a><\/span> | <span class=\"tp_resource_link\"><a id=\"tp_links_sh_416\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('416','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_416\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('416','tp_bibtex')\" title=\"Visualizza BibTeX\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_416\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@article{Sabug20241619,<br \/>\r\ntitle = {Sample-Based Trust Region Dynamics in Contextual Global Optimization},<br \/>\r\nauthor = {Lorenzo Sabug and Lorenzo Fagiano and Fredy Ruiz},<br \/>\r\nurl = {https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85196083674&doi=10.1109%2fLCSYS.2024.3414970&partnerID=40&md5=5e5d29a34d1c74fce70fc29f899a71bd},<br \/>\r\ndoi = {10.1109\/LCSYS.2024.3414970},<br \/>\r\nyear  = {2024},<br \/>\r\ndate = {2024-01-01},<br \/>\r\njournal = {IEEE Control Systems Letters},<br \/>\r\nvolume = {8},<br \/>\r\npages = {1619 \u2013 1624},<br \/>\r\nabstract = {The problem of contextual global optimization is treated, in which a generally non-convex scalar objective (possibly black-box) depends not only on the decision variables, but also on uncontrollable, observable context variables. Assuming Lipschitz continuity of the objective function with respect to its arguments, the proposed approach builds a Set Membership model from observed samples. According to the observed context, a submodel that relates the objective to the decision variables is isolated, and used by a zeroth-order technique to pick the appropriate decision variable for sampling. A novel trust region dynamic is introduced, adjusting its size with samples instead of iterations. Such a technique makes the resulting contextual optimization algorithm more flexible with respect to the context behavior, whether it is changing smoothly, abruptly, or a combination of both. Benchmark tests and a case study demonstrate the efficacy of the proposed method. \u00a9 2017 IEEE.},<br \/>\r\nnote = {All Open Access, Hybrid Gold Open Access},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {article}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('416','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_abstract\" id=\"tp_abstract_416\" style=\"display:none;\"><div class=\"tp_abstract_entry\">The problem of contextual global optimization is treated, in which a generally non-convex scalar objective (possibly black-box) depends not only on the decision variables, but also on uncontrollable, observable context variables. Assuming Lipschitz continuity of the objective function with respect to its arguments, the proposed approach builds a Set Membership model from observed samples. According to the observed context, a submodel that relates the objective to the decision variables is isolated, and used by a zeroth-order technique to pick the appropriate decision variable for sampling. A novel trust region dynamic is introduced, adjusting its size with samples instead of iterations. Such a technique makes the resulting contextual optimization algorithm more flexible with respect to the context behavior, whether it is changing smoothly, abruptly, or a combination of both. Benchmark tests and a case study demonstrate the efficacy of the proposed method. \u00a9 2017 IEEE.<\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('416','tp_abstract')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_416\" style=\"display:none;\"><div class=\"tp_links_entry\"><ul class=\"tp_pub_list\"><li><i class=\"fas fa-globe\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85196083674&amp;doi=10.1109%2fLCSYS.2024.3414970&amp;partnerID=40&amp;md5=5e5d29a34d1c74fce70fc29f899a71bd\" title=\"https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85196083674&amp;doi=10.1109%[...]\" target=\"_blank\">https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85196083674&amp;doi=10.1109%[...]<\/a><\/li><li><i class=\"ai ai-doi\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/dx.doi.org\/10.1109\/LCSYS.2024.3414970\" title=\"Follow DOI:10.1109\/LCSYS.2024.3414970\" target=\"_blank\">doi:10.1109\/LCSYS.2024.3414970<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('416','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_conference\"><div class=\"tp_pub_number\">11.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Kessler, Nicolas;  Fagiano, Lorenzo<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('427','tp_links')\" style=\"cursor:pointer;\">On the Design of Terminal Ingredients for Linear Time Varying Model Predictive Control: Theory and Experimental Application<\/a> <span class=\"tp_pub_type tp_  conference\">Conference<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_volume\">vol. 58, <\/span><span class=\"tp_pub_additional_number\">no 18, <\/span><span class=\"tp_pub_additional_year\">2024<\/span><span class=\"tp_pub_additional_note\">, (All Open Access, Gold Open Access)<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_abstract_link\"><a id=\"tp_abstract_sh_427\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('427','tp_abstract')\" title=\"Show abstract\" style=\"cursor:pointer;\">Abstract<\/a><\/span> | <span class=\"tp_resource_link\"><a id=\"tp_links_sh_427\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('427','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_427\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('427','tp_bibtex')\" title=\"Visualizza BibTeX\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_427\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@conference{Kessler2024263,<br \/>\r\ntitle = {On the Design of Terminal Ingredients for Linear Time Varying Model Predictive Control: Theory and Experimental Application},<br \/>\r\nauthor = {Nicolas Kessler and Lorenzo Fagiano},<br \/>\r\nurl = {https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85206087125&doi=10.1016%2fj.ifacol.2024.09.041&partnerID=40&md5=e95b443facb45ff988c693a7dce1c01b},<br \/>\r\ndoi = {10.1016\/j.ifacol.2024.09.041},<br \/>\r\nyear  = {2024},<br \/>\r\ndate = {2024-01-01},<br \/>\r\njournal = {IFAC-PapersOnLine},<br \/>\r\nvolume = {58},<br \/>\r\nnumber = {18},<br \/>\r\npages = {263 \u2013 268},<br \/>\r\nabstract = {The use of Linear Time Varying (LTV) Model Predictive Control (MPC) to stabilize a set of trajectories of a nonlinear system is considered. This technique has been successfully applied in simulations and experiments, but only few contributions investigate stability aspects and the essential involved quantities: the terminal penalty and terminal constraint. Deriving the former is not always thoroughly addressed or it is based on the -rather restrictive- assumption that the whole set of linearized dynamics is quadratically stabilizable. In this article, we propose Linear Matrix Inequality (LMI) conditions to co-design a gain-scheduled auxiliary feedback and Lyapunov function, used to derive offline terminal set conditions and a terminal penalty constraint for an LTV MPC scheme guaranteeing stability and recursive constraint satisfaction. Recent results by the authors are extended to the case of a varying stage cost, such that the controller can be tuned to meet time-varying trade-offs between tracking accuracy and input activity. The approach is demonstrated in embedded hardware running on a CrazyFlie drone. Copyright \u00a9 2024 The Authors.},<br \/>\r\nnote = {All Open Access, Gold Open Access},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {conference}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('427','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_abstract\" id=\"tp_abstract_427\" style=\"display:none;\"><div class=\"tp_abstract_entry\">The use of Linear Time Varying (LTV) Model Predictive Control (MPC) to stabilize a set of trajectories of a nonlinear system is considered. This technique has been successfully applied in simulations and experiments, but only few contributions investigate stability aspects and the essential involved quantities: the terminal penalty and terminal constraint. Deriving the former is not always thoroughly addressed or it is based on the -rather restrictive- assumption that the whole set of linearized dynamics is quadratically stabilizable. In this article, we propose Linear Matrix Inequality (LMI) conditions to co-design a gain-scheduled auxiliary feedback and Lyapunov function, used to derive offline terminal set conditions and a terminal penalty constraint for an LTV MPC scheme guaranteeing stability and recursive constraint satisfaction. Recent results by the authors are extended to the case of a varying stage cost, such that the controller can be tuned to meet time-varying trade-offs between tracking accuracy and input activity. The approach is demonstrated in embedded hardware running on a CrazyFlie drone. Copyright \u00a9 2024 The Authors.<\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('427','tp_abstract')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_427\" style=\"display:none;\"><div class=\"tp_links_entry\"><ul class=\"tp_pub_list\"><li><i class=\"fas fa-globe\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85206087125&amp;doi=10.1016%2fj.ifacol.2024.09.041&amp;partnerID=40&amp;md5=e95b443facb45ff988c693a7dce1c01b\" title=\"https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85206087125&amp;doi=10.1016%[...]\" target=\"_blank\">https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85206087125&amp;doi=10.1016%[...]<\/a><\/li><li><i class=\"ai ai-doi\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/dx.doi.org\/10.1016\/j.ifacol.2024.09.041\" title=\"Follow DOI:10.1016\/j.ifacol.2024.09.041\" target=\"_blank\">doi:10.1016\/j.ifacol.2024.09.041<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('427','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_conference\"><div class=\"tp_pub_number\">12.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> L\u00f8wenstein, Kristoffer Fink;  Bernardini, Daniele;  Bemporad, Alberto;  Fagiano, Lorenzo<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('440','tp_links')\" style=\"cursor:pointer;\">Physics-Informed Online Learning by Moving Horizon Estimation: Learning Recurrent Neural Networks in Gray-box Models<\/a> <span class=\"tp_pub_type tp_  conference\">Conference<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_volume\">vol. 58, <\/span><span class=\"tp_pub_additional_number\">no 18, <\/span><span class=\"tp_pub_additional_year\">2024<\/span><span class=\"tp_pub_additional_note\">, (All Open Access, Gold Open Access)<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_abstract_link\"><a id=\"tp_abstract_sh_440\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('440','tp_abstract')\" title=\"Show abstract\" style=\"cursor:pointer;\">Abstract<\/a><\/span> | <span class=\"tp_resource_link\"><a id=\"tp_links_sh_440\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('440','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_440\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('440','tp_bibtex')\" title=\"Visualizza BibTeX\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_440\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@conference{L\u00f8wenstein202478,<br \/>\r\ntitle = {Physics-Informed Online Learning by Moving Horizon Estimation: Learning Recurrent Neural Networks in Gray-box Models},<br \/>\r\nauthor = {Kristoffer Fink L\u00f8wenstein and Daniele Bernardini and Alberto Bemporad and Lorenzo Fagiano},<br \/>\r\nurl = {https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85206110971&doi=10.1016%2fj.ifacol.2024.09.013&partnerID=40&md5=7ccb836b7754ac684023e234fd253678},<br \/>\r\ndoi = {10.1016\/j.ifacol.2024.09.013},<br \/>\r\nyear  = {2024},<br \/>\r\ndate = {2024-01-01},<br \/>\r\njournal = {IFAC-PapersOnLine},<br \/>\r\nvolume = {58},<br \/>\r\nnumber = {18},<br \/>\r\npages = {78 \u2013 85},<br \/>\r\nabstract = {In Model Predictive Control (MPC) closed-loop performance heavily depends on the quality of the underlying prediction model, where such a model must be accurate and yet simple. A key feature in modern MPC applications is the potential for online model adaptation to cope with time-varying changes, part-to-part variations, and complex features of the system dynamics not caught by models derived from first principles. In this paper, we propose to use a physics-informed, or gray-box, model that extends the physics-based model with a data-driven component, namely a Recurrent Neural Network (RNN). Relying on physics-informed models allows for a rather limited size of the RNN, thereby enhancing online applicability compared to pure black-box models. This work presents a method based on Moving Horizon Estimation (MHE) for simultaneous state estimation and learning of the RNN sub-model, a potentially challenging issue due to limited information available in noisy input-output data and lack of knowledge of the internal state of the RNN. We provide a case study on a quadruple tank benchmark showing how the method can cope with part-to-part variations. Copyright \u00a9 2024 The Authors.},<br \/>\r\nnote = {All Open Access, Gold Open Access},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {conference}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('440','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_abstract\" id=\"tp_abstract_440\" style=\"display:none;\"><div class=\"tp_abstract_entry\">In Model Predictive Control (MPC) closed-loop performance heavily depends on the quality of the underlying prediction model, where such a model must be accurate and yet simple. A key feature in modern MPC applications is the potential for online model adaptation to cope with time-varying changes, part-to-part variations, and complex features of the system dynamics not caught by models derived from first principles. In this paper, we propose to use a physics-informed, or gray-box, model that extends the physics-based model with a data-driven component, namely a Recurrent Neural Network (RNN). Relying on physics-informed models allows for a rather limited size of the RNN, thereby enhancing online applicability compared to pure black-box models. This work presents a method based on Moving Horizon Estimation (MHE) for simultaneous state estimation and learning of the RNN sub-model, a potentially challenging issue due to limited information available in noisy input-output data and lack of knowledge of the internal state of the RNN. We provide a case study on a quadruple tank benchmark showing how the method can cope with part-to-part variations. Copyright \u00a9 2024 The Authors.<\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('440','tp_abstract')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_440\" style=\"display:none;\"><div class=\"tp_links_entry\"><ul class=\"tp_pub_list\"><li><i class=\"fas fa-globe\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85206110971&amp;doi=10.1016%2fj.ifacol.2024.09.013&amp;partnerID=40&amp;md5=7ccb836b7754ac684023e234fd253678\" title=\"https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85206110971&amp;doi=10.1016%[...]\" target=\"_blank\">https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85206110971&amp;doi=10.1016%[...]<\/a><\/li><li><i class=\"ai ai-doi\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/dx.doi.org\/10.1016\/j.ifacol.2024.09.013\" title=\"Follow DOI:10.1016\/j.ifacol.2024.09.013\" target=\"_blank\">doi:10.1016\/j.ifacol.2024.09.013<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('440','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_conference\"><div class=\"tp_pub_number\">13.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Alborghetti, Mattia;  Montecchio, Giulio;  Sabug, Lorenzo;  Fagiano, Lorenzo;  Ruiz, Fredy<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('441','tp_links')\" style=\"cursor:pointer;\">Controlling the Exploitation\/Exploration Trade-Off in Global Optimization: A Set Membership Approach<\/a> <span class=\"tp_pub_type tp_  conference\">Conference<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_year\">2024<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_abstract_link\"><a id=\"tp_abstract_sh_441\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('441','tp_abstract')\" title=\"Show abstract\" style=\"cursor:pointer;\">Abstract<\/a><\/span> | <span class=\"tp_resource_link\"><a id=\"tp_links_sh_441\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('441','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_441\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('441','tp_bibtex')\" title=\"Visualizza BibTeX\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_441\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@conference{Alborghetti20242918,<br \/>\r\ntitle = {Controlling the Exploitation\/Exploration Trade-Off in Global Optimization: A Set Membership Approach},<br \/>\r\nauthor = {Mattia Alborghetti and Giulio Montecchio and Lorenzo Sabug and Lorenzo Fagiano and Fredy Ruiz},<br \/>\r\nurl = {https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85204500773&doi=10.23919%2fACC60939.2024.10644762&partnerID=40&md5=038d82e90119804327bf4fed9ae5971e},<br \/>\r\ndoi = {10.23919\/ACC60939.2024.10644762},<br \/>\r\nyear  = {2024},<br \/>\r\ndate = {2024-01-01},<br \/>\r\njournal = {Proceedings of the American Control Conference},<br \/>\r\npages = {2918 \u2013 2923},<br \/>\r\nabstract = {Trading off exploration and exploitation is a crucial task in global (or black-box) optimization, to balance the search for better local optimizers with the refinement of already-found ones. Often, such a trade-off is not easily controlled by the user, as it depends non-trivially on the tuning parameters of the selected algorithm. A new concept is proposed here, where the share of exploitation moves over the total number of iterations is regulated by a feedback control law, to achieve a user-defined set-point. This concept is applied to the recently proposed Set Membership Global Optimization (SMGO) technique, resulting in a modified algorithm. Additional computational improvements are presented as well, and the resulting approach is extensively tested and compared with other methods. The statistical tests indicate that the new algorithm has better iteration-based optimization performance than the original one, at the same time shortening the computational times by around one order of magnitude. \u00a9 2024 AACC.},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {conference}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('441','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_abstract\" id=\"tp_abstract_441\" style=\"display:none;\"><div class=\"tp_abstract_entry\">Trading off exploration and exploitation is a crucial task in global (or black-box) optimization, to balance the search for better local optimizers with the refinement of already-found ones. Often, such a trade-off is not easily controlled by the user, as it depends non-trivially on the tuning parameters of the selected algorithm. A new concept is proposed here, where the share of exploitation moves over the total number of iterations is regulated by a feedback control law, to achieve a user-defined set-point. This concept is applied to the recently proposed Set Membership Global Optimization (SMGO) technique, resulting in a modified algorithm. Additional computational improvements are presented as well, and the resulting approach is extensively tested and compared with other methods. The statistical tests indicate that the new algorithm has better iteration-based optimization performance than the original one, at the same time shortening the computational times by around one order of magnitude. \u00a9 2024 AACC.<\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('441','tp_abstract')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_441\" style=\"display:none;\"><div class=\"tp_links_entry\"><ul class=\"tp_pub_list\"><li><i class=\"fas fa-globe\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85204500773&amp;doi=10.23919%2fACC60939.2024.10644762&amp;partnerID=40&amp;md5=038d82e90119804327bf4fed9ae5971e\" title=\"https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85204500773&amp;doi=10.23919[...]\" target=\"_blank\">https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85204500773&amp;doi=10.23919[...]<\/a><\/li><li><i class=\"ai ai-doi\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/dx.doi.org\/10.23919\/ACC60939.2024.10644762\" title=\"Follow DOI:10.23919\/ACC60939.2024.10644762\" target=\"_blank\">doi:10.23919\/ACC60939.2024.10644762<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('441','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_conference\"><div class=\"tp_pub_number\">14.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Frigo, Luca;  Lauricella, Marco;  Fagiano, Lorenzo<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('453','tp_links')\" style=\"cursor:pointer;\">Data-driven modeling and quality prediction of clinker production in a cement plant<\/a> <span class=\"tp_pub_type tp_  conference\">Conference<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_year\">2024<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_abstract_link\"><a id=\"tp_abstract_sh_453\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('453','tp_abstract')\" title=\"Show abstract\" style=\"cursor:pointer;\">Abstract<\/a><\/span> | <span class=\"tp_resource_link\"><a id=\"tp_links_sh_453\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('453','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_453\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('453','tp_bibtex')\" title=\"Visualizza BibTeX\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_453\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@conference{Frigo2024464,<br \/>\r\ntitle = {Data-driven modeling and quality prediction of clinker production in a cement plant},<br \/>\r\nauthor = {Luca Frigo and Marco Lauricella and Lorenzo Fagiano},<br \/>\r\nurl = {https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85204793664&doi=10.1109%2fCCTA60707.2024.10666547&partnerID=40&md5=401135c620b4589c5bf15dfa6119cd8a},<br \/>\r\ndoi = {10.1109\/CCTA60707.2024.10666547},<br \/>\r\nyear  = {2024},<br \/>\r\ndate = {2024-01-01},<br \/>\r\njournal = {2024 IEEE Conference on Control Technology and Applications, CCTA 2024},<br \/>\r\npages = {464 \u2013 470},<br \/>\r\nabstract = {The problem of deriving a model to predict the clinker quality in a cement production plant is considered. The process has a highly complex and nonlinear dynamic behavior, making physics-based first-principle modelling ineffective. A data-driven approach is thus proposed, to obtain an input-output model able to represent the overall system dynamics and to estimate the quality key performance indicators (KPIs). The approach combines a dynamic linear model, to estimate the evolution of the main process variables, with a static nonlinear regression model, to infer the clinker quality KPIs. The parameters of the dynamic model are estimated recursively on-line in a Moving Horizon Estimation fashion, to adapt to time-varying conditions such as the (unmeasured and uncertain) fuel mix. Real-world data collected on a European cement plant are used both to develop the approach and to test its effectiveness. \u00a9 2024 IEEE.},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {conference}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('453','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_abstract\" id=\"tp_abstract_453\" style=\"display:none;\"><div class=\"tp_abstract_entry\">The problem of deriving a model to predict the clinker quality in a cement production plant is considered. The process has a highly complex and nonlinear dynamic behavior, making physics-based first-principle modelling ineffective. A data-driven approach is thus proposed, to obtain an input-output model able to represent the overall system dynamics and to estimate the quality key performance indicators (KPIs). The approach combines a dynamic linear model, to estimate the evolution of the main process variables, with a static nonlinear regression model, to infer the clinker quality KPIs. The parameters of the dynamic model are estimated recursively on-line in a Moving Horizon Estimation fashion, to adapt to time-varying conditions such as the (unmeasured and uncertain) fuel mix. Real-world data collected on a European cement plant are used both to develop the approach and to test its effectiveness. \u00a9 2024 IEEE.<\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('453','tp_abstract')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_453\" style=\"display:none;\"><div class=\"tp_links_entry\"><ul class=\"tp_pub_list\"><li><i class=\"fas fa-globe\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85204793664&amp;doi=10.1109%2fCCTA60707.2024.10666547&amp;partnerID=40&amp;md5=401135c620b4589c5bf15dfa6119cd8a\" title=\"https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85204793664&amp;doi=10.1109%[...]\" target=\"_blank\">https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85204793664&amp;doi=10.1109%[...]<\/a><\/li><li><i class=\"ai ai-doi\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/dx.doi.org\/10.1109\/CCTA60707.2024.10666547\" title=\"Follow DOI:10.1109\/CCTA60707.2024.10666547\" target=\"_blank\">doi:10.1109\/CCTA60707.2024.10666547<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('453','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_conference\"><div class=\"tp_pub_number\">15.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Cecchin, Leonardo;  Trachte, Adrian;  Fagiano, Lorenzo;  Diehl, Moritz<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('454','tp_links')\" style=\"cursor:pointer;\">Real-time prediction of human-generated reference signals for advanced digging control<\/a> <span class=\"tp_pub_type tp_  conference\">Conference<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_year\">2024<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_abstract_link\"><a id=\"tp_abstract_sh_454\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('454','tp_abstract')\" title=\"Show abstract\" style=\"cursor:pointer;\">Abstract<\/a><\/span> | <span class=\"tp_resource_link\"><a id=\"tp_links_sh_454\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('454','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_454\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('454','tp_bibtex')\" title=\"Visualizza BibTeX\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_454\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@conference{Cecchin2024496,<br \/>\r\ntitle = {Real-time prediction of human-generated reference signals for advanced digging control},<br \/>\r\nauthor = {Leonardo Cecchin and Adrian Trachte and Lorenzo Fagiano and Moritz Diehl},<br \/>\r\nurl = {https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85208267527&doi=10.1109%2fCASE59546.2024.10711371&partnerID=40&md5=c1efd1a75d0e4a4314ec741dffa8d98d},<br \/>\r\ndoi = {10.1109\/CASE59546.2024.10711371},<br \/>\r\nyear  = {2024},<br \/>\r\ndate = {2024-01-01},<br \/>\r\njournal = {IEEE International Conference on Automation Science and Engineering},<br \/>\r\npages = {496 \u2013 501},<br \/>\r\nabstract = {In the realm of excavator control, advanced techniques, such as Model Predictive Control (MPC) and two-degrees-of-freedom structures (feedforward plus feedback), proved to have great potential for enhancing efficiency and performance. These methods rely on the knowledge of future reference, which is often pre-defined, to optimize the system behavior as a function of it. However, this assumption fails in applications where a human operator chooses the reference at runtime, such as in the case of non-autonomous digging operations. To cope with this problem, we study different approaches to use the collected data of human-generated reference signals to learn a predictive model of the operator commands. The considered methods are function approximation techniques based on Kriging, Set-Membership, and LSTM Neural Networks. We summarize the principles and the implementation of each method, and compare their performance using an experimental data-set of operations from a real-world excavator, where four operator-defined reference signals are predicted. \u00a9 2024 IEEE.},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {conference}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('454','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_abstract\" id=\"tp_abstract_454\" style=\"display:none;\"><div class=\"tp_abstract_entry\">In the realm of excavator control, advanced techniques, such as Model Predictive Control (MPC) and two-degrees-of-freedom structures (feedforward plus feedback), proved to have great potential for enhancing efficiency and performance. These methods rely on the knowledge of future reference, which is often pre-defined, to optimize the system behavior as a function of it. However, this assumption fails in applications where a human operator chooses the reference at runtime, such as in the case of non-autonomous digging operations. To cope with this problem, we study different approaches to use the collected data of human-generated reference signals to learn a predictive model of the operator commands. The considered methods are function approximation techniques based on Kriging, Set-Membership, and LSTM Neural Networks. We summarize the principles and the implementation of each method, and compare their performance using an experimental data-set of operations from a real-world excavator, where four operator-defined reference signals are predicted. \u00a9 2024 IEEE.<\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('454','tp_abstract')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_454\" style=\"display:none;\"><div class=\"tp_links_entry\"><ul class=\"tp_pub_list\"><li><i class=\"fas fa-globe\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85208267527&amp;doi=10.1109%2fCASE59546.2024.10711371&amp;partnerID=40&amp;md5=c1efd1a75d0e4a4314ec741dffa8d98d\" title=\"https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85208267527&amp;doi=10.1109%[...]\" target=\"_blank\">https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85208267527&amp;doi=10.1109%[...]<\/a><\/li><li><i class=\"ai ai-doi\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/dx.doi.org\/10.1109\/CASE59546.2024.10711371\" title=\"Follow DOI:10.1109\/CASE59546.2024.10711371\" target=\"_blank\">doi:10.1109\/CASE59546.2024.10711371<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('454','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_conference\"><div class=\"tp_pub_number\">16.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Cupo, Alessandro;  Cecchin, Leonardo;  Demir, Ozan;  Fagiano, Lorenzo<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('457','tp_links')\" style=\"cursor:pointer;\">Energy-Optimal Trajectory Planning for Semi-Autonomous Hydraulic Excavators<\/a> <span class=\"tp_pub_type tp_  conference\">Conference<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_volume\">vol. 58, <\/span><span class=\"tp_pub_additional_number\">no 28, <\/span><span class=\"tp_pub_additional_year\">2024<\/span><span class=\"tp_pub_additional_note\">, (All Open Access, Gold Open Access)<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_abstract_link\"><a id=\"tp_abstract_sh_457\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('457','tp_abstract')\" title=\"Show abstract\" style=\"cursor:pointer;\">Abstract<\/a><\/span> | <span class=\"tp_resource_link\"><a id=\"tp_links_sh_457\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('457','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_457\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('457','tp_bibtex')\" title=\"Visualizza BibTeX\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_457\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@conference{Cupo2024450,<br \/>\r\ntitle = {Energy-Optimal Trajectory Planning for Semi-Autonomous Hydraulic Excavators},<br \/>\r\nauthor = {Alessandro Cupo and Leonardo Cecchin and Ozan Demir and Lorenzo Fagiano},<br \/>\r\nurl = {https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85218012405&doi=10.1016%2fj.ifacol.2025.01.087&partnerID=40&md5=db01ed60ccb89f612cdb4e670e3d99b3},<br \/>\r\ndoi = {10.1016\/j.ifacol.2025.01.087},<br \/>\r\nyear  = {2024},<br \/>\r\ndate = {2024-01-01},<br \/>\r\njournal = {IFAC-PapersOnLine},<br \/>\r\nvolume = {58},<br \/>\r\nnumber = {28},<br \/>\r\npages = {450 \u2013 455},<br \/>\r\nabstract = {An optimal trajectory planning approach for hydraulic excavator arms is presented, where the goal is to create trajectories that trade-off energy consumption and completion time. We develop a physics-based model of the excavator, which describes both the dynamics and the hydraulic system's behavior. Further investigation of the Optimal Control Problem, used to create the trajectory, allows for discussion regarding the trade-off between power and time recovering a wide range of solutions based on the designer's choice. Lastly, the problem is extended to include obstacle-avoidance constraints, creating a collision-free and efficient path. \u00a9 2024 The Authors.},<br \/>\r\nnote = {All Open Access, Gold Open Access},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {conference}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('457','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_abstract\" id=\"tp_abstract_457\" style=\"display:none;\"><div class=\"tp_abstract_entry\">An optimal trajectory planning approach for hydraulic excavator arms is presented, where the goal is to create trajectories that trade-off energy consumption and completion time. We develop a physics-based model of the excavator, which describes both the dynamics and the hydraulic system's behavior. Further investigation of the Optimal Control Problem, used to create the trajectory, allows for discussion regarding the trade-off between power and time recovering a wide range of solutions based on the designer's choice. Lastly, the problem is extended to include obstacle-avoidance constraints, creating a collision-free and efficient path. \u00a9 2024 The Authors.<\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('457','tp_abstract')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_457\" style=\"display:none;\"><div class=\"tp_links_entry\"><ul class=\"tp_pub_list\"><li><i class=\"fas fa-globe\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85218012405&amp;doi=10.1016%2fj.ifacol.2025.01.087&amp;partnerID=40&amp;md5=db01ed60ccb89f612cdb4e670e3d99b3\" title=\"https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85218012405&amp;doi=10.1016%[...]\" target=\"_blank\">https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85218012405&amp;doi=10.1016%[...]<\/a><\/li><li><i class=\"ai ai-doi\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/dx.doi.org\/10.1016\/j.ifacol.2025.01.087\" title=\"Follow DOI:10.1016\/j.ifacol.2025.01.087\" target=\"_blank\">doi:10.1016\/j.ifacol.2025.01.087<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('457','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_conference\"><div class=\"tp_pub_number\">17.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Leonesio, Marco;  Fagiano, Lorenzo<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('464','tp_links')\" style=\"cursor:pointer;\">Scalable Approximate Optimization of Objective Functions Represented by Random Forests<\/a> <span class=\"tp_pub_type tp_  conference\">Conference<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_year\">2024<\/span><span class=\"tp_pub_additional_note\">, (All Open Access, Green Open Access)<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_abstract_link\"><a id=\"tp_abstract_sh_464\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('464','tp_abstract')\" title=\"Show abstract\" style=\"cursor:pointer;\">Abstract<\/a><\/span> | <span class=\"tp_resource_link\"><a id=\"tp_links_sh_464\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('464','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_464\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('464','tp_bibtex')\" title=\"Visualizza BibTeX\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_464\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@conference{Leonesio2024494,<br \/>\r\ntitle = {Scalable Approximate Optimization of Objective Functions Represented by Random Forests},<br \/>\r\nauthor = {Marco Leonesio and Lorenzo Fagiano},<br \/>\r\nurl = {https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85198225941&doi=10.1109%2fMED61351.2024.10566222&partnerID=40&md5=18267e2690b0b795293f396febcf1460},<br \/>\r\ndoi = {10.1109\/MED61351.2024.10566222},<br \/>\r\nyear  = {2024},<br \/>\r\ndate = {2024-01-01},<br \/>\r\njournal = {2024 32nd Mediterranean Conference on Control and Automation, MED 2024},<br \/>\r\npages = {494 \u2013 499},<br \/>\r\nabstract = {The problem of global optimization of an objective function represented by a Random Forest (RF) is considered. A method to obtain an approximate solution at low computational complexity is proposed, resorting to the inherent structure of an RF, which is a non-parametric model that partitions the feature space in convex polytopes according to the training data. The approach selects the optimal solution inside the polytopes corresponding to the best data points. It is shown that the proposed approximate method is significantly more efficient, thus applicable at large scale, than extensive global search algorithms, such as gridding and Mixed Integer Linear Programming (MILP), which in turn provide exact solutions. The efficiency and sub-optimality of the approach are evaluated on RFs trained on a dataset generated by sampling a bivariate, discontinuous and non-convex benchmark function from the literature. \u00a9 2024 IEEE.},<br \/>\r\nnote = {All Open Access, Green Open Access},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {conference}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('464','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_abstract\" id=\"tp_abstract_464\" style=\"display:none;\"><div class=\"tp_abstract_entry\">The problem of global optimization of an objective function represented by a Random Forest (RF) is considered. A method to obtain an approximate solution at low computational complexity is proposed, resorting to the inherent structure of an RF, which is a non-parametric model that partitions the feature space in convex polytopes according to the training data. The approach selects the optimal solution inside the polytopes corresponding to the best data points. It is shown that the proposed approximate method is significantly more efficient, thus applicable at large scale, than extensive global search algorithms, such as gridding and Mixed Integer Linear Programming (MILP), which in turn provide exact solutions. The efficiency and sub-optimality of the approach are evaluated on RFs trained on a dataset generated by sampling a bivariate, discontinuous and non-convex benchmark function from the literature. \u00a9 2024 IEEE.<\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('464','tp_abstract')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_464\" style=\"display:none;\"><div class=\"tp_links_entry\"><ul class=\"tp_pub_list\"><li><i class=\"fas fa-globe\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85198225941&amp;doi=10.1109%2fMED61351.2024.10566222&amp;partnerID=40&amp;md5=18267e2690b0b795293f396febcf1460\" title=\"https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85198225941&amp;doi=10.1109%[...]\" target=\"_blank\">https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85198225941&amp;doi=10.1109%[...]<\/a><\/li><li><i class=\"ai ai-doi\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/dx.doi.org\/10.1109\/MED61351.2024.10566222\" title=\"Follow DOI:10.1109\/MED61351.2024.10566222\" target=\"_blank\">doi:10.1109\/MED61351.2024.10566222<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('464','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_article\"><div class=\"tp_pub_number\">18.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Mohammed, Tareg;  Oland, Espen;  Fagiano, Lorenzo<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('482','tp_links')\" style=\"cursor:pointer;\">Fault Tolerant Flight Control for the Traction Phase of Pumping Airborne Wind Energy Systems<\/a> <span class=\"tp_pub_type tp_  article\">Journal Article<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_in\">In: <\/span><span class=\"tp_pub_additional_journal\">International Journal of Control, Automation and Systems, <\/span><span class=\"tp_pub_additional_volume\">vol. 22, <\/span><span class=\"tp_pub_additional_number\">no 8, <\/span><span class=\"tp_pub_additional_pages\">pp. 2428 \u2013 2443, <\/span><span class=\"tp_pub_additional_year\">2024<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_abstract_link\"><a id=\"tp_abstract_sh_482\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('482','tp_abstract')\" title=\"Show abstract\" style=\"cursor:pointer;\">Abstract<\/a><\/span> | <span class=\"tp_resource_link\"><a id=\"tp_links_sh_482\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('482','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_482\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('482','tp_bibtex')\" title=\"Visualizza BibTeX\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_482\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@article{Mohammed20242428,<br \/>\r\ntitle = {Fault Tolerant Flight Control for the Traction Phase of Pumping Airborne Wind Energy Systems},<br \/>\r\nauthor = {Tareg Mohammed and Espen Oland and Lorenzo Fagiano},<br \/>\r\nurl = {https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85197271366&doi=10.1007%2fs12555-023-0588-z&partnerID=40&md5=b620f461021d1b226be111de27809217},<br \/>\r\ndoi = {10.1007\/s12555-023-0588-z},<br \/>\r\nyear  = {2024},<br \/>\r\ndate = {2024-01-01},<br \/>\r\njournal = {International Journal of Control, Automation and Systems},<br \/>\r\nvolume = {22},<br \/>\r\nnumber = {8},<br \/>\r\npages = {2428 \u2013 2443},<br \/>\r\nabstract = {A fault-tolerant control approach is proposed, for a pumping airborne wind energy system (AWES) comprising a tethered fixed-wing aircraft with integrated propellers for vertical take-off and landing (VTOL). First, the flight control design for the traction phase of the system, when the tethered aircraft has to fly in loops using the rudder, is presented. Then, the presence of the propellers, that are normally not used in the traction phase, is exploited to obtain a fault tolerant controller in case of rudder malfunctioning. The approach detects a possible discrete control surface fault and compensates for the loss in actuation by using the VTOL system. A sophisticated model of the system is used to analyse the performance of the proposed technique. The main finding is that the approach is able to handle abrupt rudder faults with high tolerance. \u00a9 ICROS, KIEE and Springer 2024.},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {article}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('482','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_abstract\" id=\"tp_abstract_482\" style=\"display:none;\"><div class=\"tp_abstract_entry\">A fault-tolerant control approach is proposed, for a pumping airborne wind energy system (AWES) comprising a tethered fixed-wing aircraft with integrated propellers for vertical take-off and landing (VTOL). First, the flight control design for the traction phase of the system, when the tethered aircraft has to fly in loops using the rudder, is presented. Then, the presence of the propellers, that are normally not used in the traction phase, is exploited to obtain a fault tolerant controller in case of rudder malfunctioning. The approach detects a possible discrete control surface fault and compensates for the loss in actuation by using the VTOL system. A sophisticated model of the system is used to analyse the performance of the proposed technique. The main finding is that the approach is able to handle abrupt rudder faults with high tolerance. \u00a9 ICROS, KIEE and Springer 2024.<\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('482','tp_abstract')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_482\" style=\"display:none;\"><div class=\"tp_links_entry\"><ul class=\"tp_pub_list\"><li><i class=\"fas fa-globe\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85197271366&amp;doi=10.1007%2fs12555-023-0588-z&amp;partnerID=40&amp;md5=b620f461021d1b226be111de27809217\" title=\"https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85197271366&amp;doi=10.1007%[...]\" target=\"_blank\">https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85197271366&amp;doi=10.1007%[...]<\/a><\/li><li><i class=\"ai ai-doi\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/dx.doi.org\/10.1007\/s12555-023-0588-z\" title=\"Follow DOI:10.1007\/s12555-023-0588-z\" target=\"_blank\">doi:10.1007\/s12555-023-0588-z<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('482','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_conference\"><div class=\"tp_pub_number\">19.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Santis, Sonia De;  Boffadossi, Roberto;  Fagiano, Lorenzo<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('396','tp_links')\" style=\"cursor:pointer;\">Automatic Routing Reconfiguration for Fault Tolerance in Smart Manufacturing Plants<\/a> <span class=\"tp_pub_type tp_  conference\">Conference<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_volume\">vol. 56, <\/span><span class=\"tp_pub_additional_number\">no 2, <\/span><span class=\"tp_pub_additional_year\">2023<\/span><span class=\"tp_pub_additional_note\">, (All Open Access, Gold Open Access, Green Open Access)<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_abstract_link\"><a id=\"tp_abstract_sh_396\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('396','tp_abstract')\" title=\"Show abstract\" style=\"cursor:pointer;\">Abstract<\/a><\/span> | <span class=\"tp_resource_link\"><a id=\"tp_links_sh_396\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('396','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_396\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('396','tp_bibtex')\" title=\"Visualizza BibTeX\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_396\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@conference{DeSantis20235655,<br \/>\r\ntitle = {Automatic Routing Reconfiguration for Fault Tolerance in Smart Manufacturing Plants},<br \/>\r\nauthor = {Sonia De Santis and Roberto Boffadossi and Lorenzo Fagiano},<br \/>\r\nurl = {https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85184960526&doi=10.1016%2fj.ifacol.2023.10.489&partnerID=40&md5=0093f439e43045577de1b3fbc67906d6},<br \/>\r\ndoi = {10.1016\/j.ifacol.2023.10.489},<br \/>\r\nyear  = {2023},<br \/>\r\ndate = {2023-01-01},<br \/>\r\njournal = {IFAC-PapersOnLine},<br \/>\r\nvolume = {56},<br \/>\r\nnumber = {2},<br \/>\r\npages = {5655 \u2013 5660},<br \/>\r\nabstract = {This paper focuses on the parts routing problem in a reconfigurable manufacturing plant, in presence of potential faults and uncertainty on the job scheduling and duration. The plant is modeled as a directed graph, where the nodes represent either transportation modules or machines, and the edges represent the allowed transitions between adjacent nodes. The parts move across the plant along predefined sequences of nodes, therefore the system state tracks the progress of the parts along such sequences and the control inputs are the transitions to be activated to command the parts movement. Provided the sequences, the proposed method automatically generates feedback control rules for deadlock avoidance, which are employed by a path following strategy to compute the suitable control inputs, complying with given temporal-logic constraints and avoiding deadlock states. Additionally, the approach is extended to deal with faults affecting the transportation modules via the selection of new feasible sequences and the online reconfiguration of the system state. Finally, the proposed approach is tested in high-fidelity simulations, showing high computational efficiency and throughput. Copyright \u00a9 2023 The Authors. This is an open access article under the CC BY-NC-ND license (https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/)},<br \/>\r\nnote = {All Open Access, Gold Open Access, Green Open Access},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {conference}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('396','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_abstract\" id=\"tp_abstract_396\" style=\"display:none;\"><div class=\"tp_abstract_entry\">This paper focuses on the parts routing problem in a reconfigurable manufacturing plant, in presence of potential faults and uncertainty on the job scheduling and duration. The plant is modeled as a directed graph, where the nodes represent either transportation modules or machines, and the edges represent the allowed transitions between adjacent nodes. The parts move across the plant along predefined sequences of nodes, therefore the system state tracks the progress of the parts along such sequences and the control inputs are the transitions to be activated to command the parts movement. Provided the sequences, the proposed method automatically generates feedback control rules for deadlock avoidance, which are employed by a path following strategy to compute the suitable control inputs, complying with given temporal-logic constraints and avoiding deadlock states. Additionally, the approach is extended to deal with faults affecting the transportation modules via the selection of new feasible sequences and the online reconfiguration of the system state. Finally, the proposed approach is tested in high-fidelity simulations, showing high computational efficiency and throughput. Copyright \u00a9 2023 The Authors. This is an open access article under the CC BY-NC-ND license (https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/)<\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('396','tp_abstract')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_396\" style=\"display:none;\"><div class=\"tp_links_entry\"><ul class=\"tp_pub_list\"><li><i class=\"fas fa-globe\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85184960526&amp;doi=10.1016%2fj.ifacol.2023.10.489&amp;partnerID=40&amp;md5=0093f439e43045577de1b3fbc67906d6\" title=\"https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85184960526&amp;doi=10.1016%[...]\" target=\"_blank\">https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85184960526&amp;doi=10.1016%[...]<\/a><\/li><li><i class=\"ai ai-doi\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/dx.doi.org\/10.1016\/j.ifacol.2023.10.489\" title=\"Follow DOI:10.1016\/j.ifacol.2023.10.489\" target=\"_blank\">doi:10.1016\/j.ifacol.2023.10.489<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('396','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_conference\"><div class=\"tp_pub_number\">20.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Saccani, Danilo;  Fagiano, Lorenzo;  Zeilinger, Melanie N.;  Carron, Andrea<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('417','tp_links')\" style=\"cursor:pointer;\">Model Predictive Control for Multi-Agent Systems Under Limited Communication and Time-Varying Network Topology<\/a> <span class=\"tp_pub_type tp_  conference\">Conference<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_year\">2023<\/span><span class=\"tp_pub_additional_note\">, (All Open Access, Green Open Access)<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_abstract_link\"><a id=\"tp_abstract_sh_417\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('417','tp_abstract')\" title=\"Show abstract\" style=\"cursor:pointer;\">Abstract<\/a><\/span> | <span class=\"tp_resource_link\"><a id=\"tp_links_sh_417\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('417','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_417\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('417','tp_bibtex')\" title=\"Visualizza BibTeX\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_417\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@conference{Saccani20233764,<br \/>\r\ntitle = {Model Predictive Control for Multi-Agent Systems Under Limited Communication and Time-Varying Network Topology},<br \/>\r\nauthor = {Danilo Saccani and Lorenzo Fagiano and Melanie N. Zeilinger and Andrea Carron},<br \/>\r\nurl = {https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85184806455&doi=10.1109%2fCDC49753.2023.10383790&partnerID=40&md5=66c064044a2820178ecdc142a4cab67d},<br \/>\r\ndoi = {10.1109\/CDC49753.2023.10383790},<br \/>\r\nyear  = {2023},<br \/>\r\ndate = {2023-01-01},<br \/>\r\njournal = {Proceedings of the IEEE Conference on Decision and Control},<br \/>\r\npages = {3764 \u2013 3769},<br \/>\r\nabstract = {In control system networks, reconfiguration of the controller when agents are leaving or joining the network is still an open challenge, in particular when operation constraints that depend on each agent's behavior must be met. Drawing our motivation from mobile robot swarms, in this paper, we address this problem by optimizing individual agent performance while guaranteeing persistent constraint satisfaction in presence of bounded communication range and time-varying network topology. The approach we propose is a model predictive control (MPC) formulation, building on multi-trajectory MPC (mt-MPC) concepts. To enable plug and play operations when the system is in closed-loop without the need of a request, the proposed MPC scheme predicts two different state trajectories in the same finite horizon optimal control problem. One trajectory drives the system to the desired target, assuming that the network topology will not change in the prediction horizon, while the second one ensures constraint satisfaction assuming a worst-case scenario in terms of new agents joining the network in the planning horizon. Recursive feasibility and stability of the closed-loop system during plug and play operations are shown. The approach effectiveness is illustrated with a numerical simulation. \u00a9 2023 IEEE.},<br \/>\r\nnote = {All Open Access, Green Open Access},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {conference}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('417','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_abstract\" id=\"tp_abstract_417\" style=\"display:none;\"><div class=\"tp_abstract_entry\">In control system networks, reconfiguration of the controller when agents are leaving or joining the network is still an open challenge, in particular when operation constraints that depend on each agent's behavior must be met. Drawing our motivation from mobile robot swarms, in this paper, we address this problem by optimizing individual agent performance while guaranteeing persistent constraint satisfaction in presence of bounded communication range and time-varying network topology. The approach we propose is a model predictive control (MPC) formulation, building on multi-trajectory MPC (mt-MPC) concepts. To enable plug and play operations when the system is in closed-loop without the need of a request, the proposed MPC scheme predicts two different state trajectories in the same finite horizon optimal control problem. One trajectory drives the system to the desired target, assuming that the network topology will not change in the prediction horizon, while the second one ensures constraint satisfaction assuming a worst-case scenario in terms of new agents joining the network in the planning horizon. Recursive feasibility and stability of the closed-loop system during plug and play operations are shown. The approach effectiveness is illustrated with a numerical simulation. \u00a9 2023 IEEE.<\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('417','tp_abstract')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_417\" style=\"display:none;\"><div class=\"tp_links_entry\"><ul class=\"tp_pub_list\"><li><i class=\"fas fa-globe\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85184806455&amp;doi=10.1109%2fCDC49753.2023.10383790&amp;partnerID=40&amp;md5=66c064044a2820178ecdc142a4cab67d\" title=\"https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85184806455&amp;doi=10.1109%[...]\" target=\"_blank\">https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85184806455&amp;doi=10.1109%[...]<\/a><\/li><li><i class=\"ai ai-doi\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/dx.doi.org\/10.1109\/CDC49753.2023.10383790\" title=\"Follow DOI:10.1109\/CDC49753.2023.10383790\" target=\"_blank\">doi:10.1109\/CDC49753.2023.10383790<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('417','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><\/div><div class=\"tablenav\"><div class=\"tablenav-pages\"><span class=\"displaying-num\">186 dati<\/span> <a class=\"page-numbers button disabled\">&laquo;<\/a> <a class=\"page-numbers button disabled\">&lsaquo;<\/a> 1 di 10 <a href=\"https:\/\/www.sas-lab.deib.polimi.it\/it\/?page_id=153&amp;limit=2&amp;tgid=&amp;yr=&amp;type=&amp;usr=&amp;auth=&amp;tsr=\" title=\"Prossima pagina\" class=\"page-numbers button\">&rsaquo;<\/a> <a href=\"https:\/\/www.sas-lab.deib.polimi.it\/it\/?page_id=153&amp;limit=10&amp;tgid=&amp;yr=&amp;type=&amp;usr=&amp;auth=&amp;tsr=\" title=\"last page\" class=\"page-numbers button\">&raquo;<\/a> <\/div><\/div><\/div><\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<\/div>",
        "protected": false
    },
    "excerpt": {
        "rendered": "<p>Publications<\/p>",
        "protected": false
    },
    "author": 2,
    "featured_media": 0,
    "parent": 0,
    "menu_order": 0,
    "comment_status": "closed",
    "ping_status": "closed",
    "template": "",
    "meta": {
        "footnotes": ""
    },
    "class_list": [
        "post-153",
        "page",
        "type-page",
        "status-publish"
    ],
    "_links": {
        "self": [
            {
                "href": "https:\/\/www.sas-lab.deib.polimi.it\/it\/index.php?rest_route=\/wp\/v2\/pages\/153",
                "targetHints": {
                    "allow": [
                        "GET"
                    ]
                }
            }
        ],
        "collection": [
            {
                "href": "https:\/\/www.sas-lab.deib.polimi.it\/it\/index.php?rest_route=\/wp\/v2\/pages"
            }
        ],
        "about": [
            {
                "href": "https:\/\/www.sas-lab.deib.polimi.it\/it\/index.php?rest_route=\/wp\/v2\/types\/page"
            }
        ],
        "author": [
            {
                "embeddable": true,
                "href": "https:\/\/www.sas-lab.deib.polimi.it\/it\/index.php?rest_route=\/wp\/v2\/users\/2"
            }
        ],
        "replies": [
            {
                "embeddable": true,
                "href": "https:\/\/www.sas-lab.deib.polimi.it\/it\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=153"
            }
        ],
        "version-history": [
            {
                "count": 25,
                "href": "https:\/\/www.sas-lab.deib.polimi.it\/it\/index.php?rest_route=\/wp\/v2\/pages\/153\/revisions"
            }
        ],
        "predecessor-version": [
            {
                "id": 1548,
                "href": "https:\/\/www.sas-lab.deib.polimi.it\/it\/index.php?rest_route=\/wp\/v2\/pages\/153\/revisions\/1548"
            }
        ],
        "wp:attachment": [
            {
                "href": "https:\/\/www.sas-lab.deib.polimi.it\/it\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=153"
            }
        ],
        "curies": [
            {
                "name": "wp",
                "href": "https:\/\/api.w.org\/{rel}",
                "templated": true
            }
        ]
    }
}