{"id":159,"date":"2021-07-31T14:49:10","date_gmt":"2021-07-31T14:49:10","guid":{"rendered":"https:\/\/elo-x.eu\/?page_id=159"},"modified":"2021-08-01T14:31:46","modified_gmt":"2021-08-01T14:31:46","slug":"publications","status":"publish","type":"page","link":"https:\/\/elo-x.eu\/?page_id=159","title":{"rendered":"Publications"},"content":{"rendered":"\t\t<div data-elementor-type=\"wp-page\" data-elementor-id=\"159\" class=\"elementor elementor-159\">\n\t\t\t\t\t\t<section class=\"elementor-section elementor-top-section elementor-element elementor-element-cb7d818 elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"cb7d818\" data-element_type=\"section\" data-e-type=\"section\">\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-53a3404\" data-id=\"53a3404\" 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-b7ad645 elementor-widget elementor-widget-heading\" data-id=\"b7ad645\" 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<h2 class=\"elementor-heading-title elementor-size-default\">Publications<\/h2>\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-76e4712 my-divider elementor-widget-divider--view-line elementor-widget elementor-widget-divider\" data-id=\"76e4712\" data-element_type=\"widget\" data-e-type=\"widget\" data-widget_type=\"divider.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t<div class=\"elementor-divider\">\n\t\t\t<span class=\"elementor-divider-separator\">\n\t\t\t\t\t\t<\/span>\n\t\t<\/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<section class=\"elementor-section elementor-top-section elementor-element elementor-element-ae75a81 elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"ae75a81\" data-element_type=\"section\" data-e-type=\"section\">\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-8793359\" data-id=\"8793359\" 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-9e5b036 publication-list elementor-widget elementor-widget-shortcode\" data-id=\"9e5b036\" 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\"><a name=\"tppubs\" id=\"tppubs\"><\/a><div class=\"tp_search_input\"><input type=\"hidden\" name=\"p\" id=\"page_id\" value=\"159\"\/><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=\"All years\" name=\"yr\" id=\"yr\" tabindex=\"2\">\r\n                   <option value=\"\">All years<\/option>\r\n                   <option value=\"2025\" >2025<\/option><option value=\"2024\" >2024<\/option><option value=\"2023\" >2023<\/option><option value=\"2022\" >2022<\/option>\r\n                <\/select><select class=\"block\" title=\"All authors\" name=\"auth\" id=\"auth\" tabindex=\"5\">\r\n                   <option value=\"\">All authors<\/option>\r\n                   <option value=\"82\" > Abbasi-Esfeden, Ramin<\/option><option value=\"24\" > Acerbo, Flavia Sofia<\/option><option value=\"20\" > Allamaa, Jean Pierre<\/option><option value=\"42\" > Alonso-Mora, Javier<\/option><option value=\"154\" > Arcari, Elena<\/option><option value=\"46\" > Asprion, Jonas<\/option><option value=\"40\" > Auweraer, Herman Van<\/option><option value=\"116\" > Azad, Seyed Mahdi Basiri<\/option><option value=\"13\" > Balocco, Jacopo<\/option><option value=\"36\" > Baumg\u00e4rtner, Katrin<\/option><option value=\"86\" > Bella, Alessio La<\/option><option value=\"74\" > Bemporad, Alberto<\/option><option value=\"73\" > Bernardini, Daniele<\/option><option value=\"144\" > Bernhard, Julian<\/option><option value=\"47\" > Bodard, Alexander<\/option><option value=\"32\" > Boedecker, Joschka<\/option><option value=\"16\" > Bonassi, Fabio<\/option><option value=\"106\" > Bos, Mathis<\/option><option value=\"54\" > Bourkhissi, Lahcen El<\/option><option value=\"143\" > Brosseit, Julien<\/option><option value=\"101\" > Burgard, Wolfram<\/option><option value=\"93\" > B\u00fcrger, Adrian<\/option><option value=\"58\" > Carron, Andrea<\/option><option value=\"38\" > Cecchin, Leonardo<\/option><option value=\"65\" > Cevher, Volkan<\/option><option value=\"140\" > Chen, Hong<\/option><option value=\"142\" > Clausen, Diego Fernandez<\/option><option value=\"50\" > Coppens, Peter<\/option><option value=\"148\" > Cupo, Alessandro<\/option><option value=\"108\" > Decr\u00e9, Wilm<\/option><option value=\"123\" > Deekshith, Umashankar<\/option><option value=\"149\" > Demir, Ozan<\/option><option value=\"15\" > Diehl, Moritz<\/option><option value=\"137\" > Dong, Shiying<\/option><option value=\"91\" > Duijkeren, Niels<\/option><option value=\"133\" >van Duijkeren, Niels<\/option><option value=\"145\" > Esterle, Klemens<\/option><option value=\"39\" > Fagiano, Lorenzo<\/option><option value=\"17\" > Farina, Marcello<\/option><option value=\"64\" > Fercoq, Olivier<\/option><option value=\"88\" > Frey, Jonathan<\/option><option value=\"139\" > Gao, Bingzhao<\/option><option value=\"90\" > Gao, Yunfan<\/option><option value=\"102\" > Gering, Stefan<\/option><option value=\"11\" > Ghezzi, Andrea<\/option><option value=\"109\" > Gillis, Joris<\/option><option value=\"67\" >cois Glineur, Franc<\/option><option value=\"151\" > Gottardini, Andrea<\/option><option value=\"34\" > Gu, Yunjie<\/option><option value=\"138\" > Harzer, Jakob<\/option><option value=\"112\" > Hennig, Philipp<\/option><option value=\"51\" > Hermans, Ben<\/option><option value=\"96\" > Hoffman, Jasper<\/option><option value=\"134\" > Houska, Boris<\/option><option value=\"53\" > Ionescu, Tudor C.<\/option><option value=\"81\" > Jones, Colin<\/option><option value=\"147\" > Karg, Michael<\/option><option value=\"122\" > Kaski, Samuel<\/option><option value=\"68\" > Katriniok, Alexander<\/option><option value=\"85\" > Kessler, Nicolas<\/option><option value=\"35\" > Kim, Tae-Kyun<\/option><option value=\"114\" > K\u00f6hler, Johannes<\/option><option value=\"132\" > Krause, Andreas<\/option><option value=\"56\" > Lahr, Amon<\/option><option value=\"63\" > Latafat, Puya<\/option><option value=\"60\" > Laude, Emanuel<\/option><option value=\"113\" > Leeman, Antoine P.<\/option><option value=\"97\" > Li, Chuxuan<\/option><option value=\"120\" > Li, Yang<\/option><option value=\"80\" > Listov, Petr<\/option><option value=\"72\" > L\u00f8wenstein, Kristoffer Fink<\/option><option value=\"118\" > Lucia, Sergio<\/option><option value=\"115\" > Mamedov, Shamil<\/option><option value=\"103\" > Manderla, Maximilian<\/option><option value=\"14\" > Manzoni, Vincenzo<\/option><option value=\"141\" > McAllister, Robert D<\/option><option value=\"69\" > Meissen, Christopher<\/option><option value=\"12\" > Messerer, Florian<\/option><option value=\"119\" > Meza, Gonzalo<\/option><option value=\"48\" > Moran, Ruairi<\/option><option value=\"150\" > Msaad, Salim<\/option><option value=\"126\" > Muntwiler, Simon<\/option><option value=\"128\" > N\u00e4f, Joshua<\/option><option value=\"55\" > Necoara, Ion<\/option><option value=\"84\" > Nurkanovic, Armin<\/option><option value=\"117\" > Ohtsuka, Toshiyuki<\/option><option value=\"121\" > Pan, Wei<\/option><option value=\"87\" > Panzani, Giulio<\/option><option value=\"61\" > Pas, Pieter<\/option><option value=\"21\" > Patrinos, Panagiotis<\/option><option value=\"62\" > Pethick, Thomas<\/option><option value=\"152\" > Plancher, Brian<\/option><option value=\"127\" > Plate, Christoph<\/option><option value=\"89\" > Pozharskiy, Anton<\/option><option value=\"131\" > Prajapat, Manish<\/option><option value=\"27\" > Reiter, Rudolf<\/option><option value=\"66\" > Rotaru, Teodor<\/option><option value=\"75\" > Roy, Wim Van<\/option><option value=\"37\" > Saccani, Danilo<\/option><option value=\"95\" > Sager, Sebastian<\/option><option value=\"153\" > Scampicchio, Anna<\/option><option value=\"19\" > Scattolini, Riccardo<\/option><option value=\"111\" > Schmidt, Nathanael Bosch Jonathan<\/option><option value=\"28\" > Schratter, Markus<\/option><option value=\"136\" > Schulz, Felix<\/option><option value=\"44\" > Schuurmans, Mathijs<\/option><option value=\"124\" > Shengchao, Yan<\/option><option value=\"130\" > Siehl, Pascal<\/option><option value=\"45\" > Simpson, L\u00e9o<\/option><option value=\"23\" > Son, Tong Duy<\/option><option value=\"49\" > Sopasakis, Pantelis<\/option><option value=\"71\" > Stella, Lorenzo<\/option><option value=\"25\" > Swevers, Jan<\/option><option value=\"52\" > Themelis, Andreas<\/option><option value=\"104\" > Trachte, Adrian<\/option><option value=\"110\" > Tronarp, Filip<\/option><option value=\"70\" > Tseng, H. Eric<\/option><option value=\"26\" > Tuytelaars, Tinne<\/option><option value=\"107\" > Vandewal, Bastiaan<\/option><option value=\"41\" > Voogd, Kevin<\/option><option value=\"129\" > Wabersich, Kim P.<\/option><option value=\"31\" > Wang, Jianhong<\/option><option value=\"33\" > Wang, Jinxin<\/option><option value=\"43\" > Wang, Renzi<\/option><option value=\"92\" > Wang, Yizhen<\/option><option value=\"29\" > Watzenig, Daniel<\/option><option value=\"146\" > Werling, Moritz<\/option><option value=\"18\" > Xie, Jing<\/option><option value=\"99\" > Yan, Schengchao<\/option><option value=\"135\" > Yang, Shaohui<\/option><option value=\"57\" > Zanelli, Andrea<\/option><option value=\"94\" > Zeile, Clemens<\/option><option value=\"59\" > Zeilinger, Melanie N.<\/option><option value=\"100\" > Zhang, Baohe<\/option><option value=\"125\" > Zhang, Bohe<\/option><option value=\"105\" > Zhang, Shuhao<\/option><option value=\"30\" > Zhang, Yuan<\/option><option value=\"98\" > Zhou, Guyue<\/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><\/form><div class=\"tablenav\"><div class=\"tablenav-pages\"><span class=\"displaying-num\">115 entries<\/span> <a class=\"page-numbers button disabled\">&laquo;<\/a> <a class=\"page-numbers button disabled\">&lsaquo;<\/a> 1 of 6 <a href=\"https:\/\/elo-x.eu\/?page_id=159&amp;limit=2&amp;tgid=&amp;yr=&amp;type=&amp;usr=&amp;auth=&amp;tsr=\" title=\"next page\" class=\"page-numbers button\">&rsaquo;<\/a> <a href=\"https:\/\/elo-x.eu\/?page_id=159&amp;limit=6&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_workingpaper\"><div class=\"tp_pub_number\">1.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Gottardini, Andrea;  Cecchin, Leonardo;  Demir, Ozan;  Fagiano, Lorenzo<\/p><p class=\"tp_pub_title\">Data-Driven Nonlinear Model Predictive Control for Grading Functions for Excavators <span class=\"tp_pub_type tp_  workingpaper\">Working paper<\/span> <span class=\"tp_pub_label_status forthcoming\">Forthcoming<\/span><\/p><p class=\"tp_pub_additional\">Forthcoming.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_abstract_link\"><a id=\"tp_abstract_sh_113\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('113','tp_abstract')\" title=\"Show abstract\" style=\"cursor:pointer;\">Abstract<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_113\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('113','tp_bibtex')\" title=\"Show BibTeX entry\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_113\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@workingpaper{gottardini_data-driven_2025,<br \/>\r\ntitle = {Data-Driven Nonlinear Model Predictive Control for Grading Functions for Excavators},<br \/>\r\nauthor = {Andrea Gottardini and Leonardo Cecchin and Ozan Demir and Lorenzo Fagiano},<br \/>\r\nyear  = {2025},<br \/>\r\ndate = {2025-12-31},<br \/>\r\nabstract = {Hydraulic excavators are essential construc-<br \/>\r\ntion machines widely utilized for ground shaping tasks,<br \/>\r\nsuch as horizontal leveling and creating sloped surfaces.<br \/>\r\nThese operations require a high degree of precision, which<br \/>\r\ncan be challenging for unskilled workers.<br \/>\r\nThe implementation of automation in hydraulic machin-<br \/>\r\nery has the potential to significantly enhance productivity<br \/>\r\nby improving accuracy and reducing reliance on highly<br \/>\r\ntrained labor. However, the control of hydraulic systems is<br \/>\r\ncomplicated by strong nonlinearities and variability among<br \/>\r\nmachines, making the design of effective controllers a sig-<br \/>\r\nnificant challenge.<br \/>\r\nIn this paper, we propose a data-driven Model Predictive<br \/>\r\nControl (MPC) system, initially developed for trajectory<br \/>\r\ntracking and subsequently adapted for a path following<br \/>\r\napproach. This adaptation is crucial because the trajectory<br \/>\r\ntracking method relies on open-loop references, using a<br \/>\r\npredefined speed profile that does not account for the<br \/>\r\ndynamics of the hydraulic excavator, potentially leading to<br \/>\r\ndifficult-to-follow trajectories.<br \/>\r\nThe prediction model used in the MPC is based on Linear<br \/>\r\nLocal Neuro-Fuzzy Models, trained with the LOcal LInear<br \/>\r\nMOdel Tree (LOLIMOT) algorithm, while the linear parame-<br \/>\r\nters are refined using the Simulation Error Method (SEM).<br \/>\r\nThe proposed control system was rigorously tested on<br \/>\r\na JCB Hydradig 110W following a comprehensive data<br \/>\r\ncollection campaign to obtain the necessary data for the<br \/>\r\ndata-driven model of the hydraulic cylinders.<br \/>\r\nResults, evaluated using metrics such as root mean<br \/>\r\nsquare error (RMSE) between the actual and reference<br \/>\r\npaths, maximum error, and standard deviation (indicating<br \/>\r\noscillations during motion), demonstrate that our approach<br \/>\r\noutperforms previous data-driven feed-forward controllers,<br \/>\r\nhighlighting its efficacy in enhancing hydraulic automation.},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {forthcoming},<br \/>\r\ntppubtype = {workingpaper}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('113','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_abstract\" id=\"tp_abstract_113\" style=\"display:none;\"><div class=\"tp_abstract_entry\">Hydraulic excavators are essential construc-<br \/>\r\ntion machines widely utilized for ground shaping tasks,<br \/>\r\nsuch as horizontal leveling and creating sloped surfaces.<br \/>\r\nThese operations require a high degree of precision, which<br \/>\r\ncan be challenging for unskilled workers.<br \/>\r\nThe implementation of automation in hydraulic machin-<br \/>\r\nery has the potential to significantly enhance productivity<br \/>\r\nby improving accuracy and reducing reliance on highly<br \/>\r\ntrained labor. However, the control of hydraulic systems is<br \/>\r\ncomplicated by strong nonlinearities and variability among<br \/>\r\nmachines, making the design of effective controllers a sig-<br \/>\r\nnificant challenge.<br \/>\r\nIn this paper, we propose a data-driven Model Predictive<br \/>\r\nControl (MPC) system, initially developed for trajectory<br \/>\r\ntracking and subsequently adapted for a path following<br \/>\r\napproach. This adaptation is crucial because the trajectory<br \/>\r\ntracking method relies on open-loop references, using a<br \/>\r\npredefined speed profile that does not account for the<br \/>\r\ndynamics of the hydraulic excavator, potentially leading to<br \/>\r\ndifficult-to-follow trajectories.<br \/>\r\nThe prediction model used in the MPC is based on Linear<br \/>\r\nLocal Neuro-Fuzzy Models, trained with the LOcal LInear<br \/>\r\nMOdel Tree (LOLIMOT) algorithm, while the linear parame-<br \/>\r\nters are refined using the Simulation Error Method (SEM).<br \/>\r\nThe proposed control system was rigorously tested on<br \/>\r\na JCB Hydradig 110W following a comprehensive data<br \/>\r\ncollection campaign to obtain the necessary data for the<br \/>\r\ndata-driven model of the hydraulic cylinders.<br \/>\r\nResults, evaluated using metrics such as root mean<br \/>\r\nsquare error (RMSE) between the actual and reference<br \/>\r\npaths, maximum error, and standard deviation (indicating<br \/>\r\noscillations during motion), demonstrate that our approach<br \/>\r\noutperforms previous data-driven feed-forward controllers,<br \/>\r\nhighlighting its efficacy in enhancing hydraulic automation.<\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('113','tp_abstract')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_inproceedings\"><div class=\"tp_pub_number\">2.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Msaad, Salim;  Cecchin, Leonardo;  Demir, Ozan;  Fagiano, Lorenzo<\/p><p class=\"tp_pub_title\">Data-Driven Model Predictive Control of an Hydraulic Excavator via Local Model Networks <span class=\"tp_pub_type tp_  inproceedings\">Proceedings Article<\/span> <span class=\"tp_pub_label_status forthcoming\">Forthcoming<\/span><\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_in\">In: <\/span><span class=\"tp_pub_additional_publisher\">2025 American Control Conference (ACC), <\/span>Forthcoming.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_abstract_link\"><a id=\"tp_abstract_sh_112\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('112','tp_abstract')\" title=\"Show abstract\" style=\"cursor:pointer;\">Abstract<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_112\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('112','tp_bibtex')\" title=\"Show BibTeX entry\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_112\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@inproceedings{msaad_data-driven_2025,<br \/>\r\ntitle = {Data-Driven Model Predictive Control of an Hydraulic Excavator via Local Model Networks},<br \/>\r\nauthor = {Salim Msaad and Leonardo Cecchin and Ozan Demir and Lorenzo Fagiano},<br \/>\r\nyear  = {2025},<br \/>\r\ndate = {2025-07-01},<br \/>\r\nurldate = {2025-07-01},<br \/>\r\npublisher = {2025 American Control Conference (ACC)},<br \/>\r\nabstract = {A novel solution to control an hydraulic excavator during grading tasks is proposed, featuring a Model Predictive Controller designed using Local Model Networks (LMNs), i.e. linear time-invariant dynamic models averaged by nonlinear static functions. The Local Linear Models Tree (LoLiMoT) algorithm is employed to derive an LMN from experimental data of a real excavator. Then, a nonlinear MPC law is designed and implemented on the excavator\u2019s embedded control system. To further improve the computational efficiency, a time-varying MPC law is designed as well, where the LMN is linearized in real-time using the previously computed optimal trajectory. Experimental results, conducted with the excavator in realworld conditions, show the effectiveness of both approaches in achieving performance comparable to state-of-the-art solutions, while utilizing a more compact dataset and without the need of the hydraulic cylinders\u2019 pressure measurement.},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {forthcoming},<br \/>\r\ntppubtype = {inproceedings}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('112','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_abstract\" id=\"tp_abstract_112\" style=\"display:none;\"><div class=\"tp_abstract_entry\">A novel solution to control an hydraulic excavator during grading tasks is proposed, featuring a Model Predictive Controller designed using Local Model Networks (LMNs), i.e. linear time-invariant dynamic models averaged by nonlinear static functions. The Local Linear Models Tree (LoLiMoT) algorithm is employed to derive an LMN from experimental data of a real excavator. Then, a nonlinear MPC law is designed and implemented on the excavator\u2019s embedded control system. To further improve the computational efficiency, a time-varying MPC law is designed as well, where the LMN is linearized in real-time using the previously computed optimal trajectory. Experimental results, conducted with the excavator in realworld conditions, show the effectiveness of both approaches in achieving performance comparable to state-of-the-art solutions, while utilizing a more compact dataset and without the need of the hydraulic cylinders\u2019 pressure measurement.<\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('112','tp_abstract')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_workingpaper\"><div class=\"tp_pub_number\">3.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Allamaa, Jean Pierre;  Patrinos, Panagiotis;  Son, Tong Duy<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('125','tp_links')\" style=\"cursor:pointer;\">ExAMPC: the Data-Driven Explainable and Approximate NMPC with Physical Insights<\/a> <span class=\"tp_pub_type tp_  workingpaper\">Working paper<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_year\">2025<\/span><span class=\"tp_pub_additional_note\">, (Submitted for possible publication in IEEE)<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_abstract_link\"><a id=\"tp_abstract_sh_125\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('125','tp_abstract')\" title=\"Show abstract\" style=\"cursor:pointer;\">Abstract<\/a><\/span> | <span class=\"tp_resource_link\"><a id=\"tp_links_sh_125\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('125','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_125\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('125','tp_bibtex')\" title=\"Show BibTeX entry\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_125\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@workingpaper{allamaa2025exampc,<br \/>\r\ntitle = {ExAMPC: the Data-Driven Explainable and Approximate NMPC with Physical Insights},<br \/>\r\nauthor = {Jean Pierre Allamaa and Panagiotis Patrinos and Tong Duy Son},<br \/>\r\nurl = {https:\/\/arxiv.org\/abs\/2503.00654},<br \/>\r\nyear  = {2025},<br \/>\r\ndate = {2025-06-18},<br \/>\r\nabstract = {Amidst the surge in the use of Artificial Intelligence (AI) for control purposes, classical and model-based control methods maintain their popularity due to their transparency and deterministic nature. However, advanced controllers like Nonlinear Model Predictive Control (NMPC), despite proven capabilities, face adoption challenges due to their computational complexity and unpredictable closed-loop performance in complex validation systems. This paper introduces ExAMPC, a methodology bridging classical control and explainable AI by augmenting the NMPC with data-driven insights to improve the trustworthiness and reveal the optimization solution and closed-loop performance's sensitivities to physical variables and system parameters. By employing a low-order spline embedding to reduce the open-loop trajectory dimensionality by over 95%, and integrating it with SHAP and Symbolic Regression from eXplainable AI (XAI) for an approximate NMPC, we enable intuitive physical insights into the NMPC's optimization routine. The prediction accuracy of the approximate NMPC is enhanced through physics-inspired continuous-time constraints penalties, reducing the predicted continuous trajectory violations by 93%. ExAMPC enables accurate forecasting of the NMPC's computational requirements with explainable insights on worst-case scenarios. Experimental validation on automated valet parking and autonomous racing with lap-time optimization NMPC, demonstrates the methodology's practical effectiveness in real-world applications.},<br \/>\r\nnote = {Submitted for possible publication in IEEE},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {workingpaper}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('125','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_abstract\" id=\"tp_abstract_125\" style=\"display:none;\"><div class=\"tp_abstract_entry\">Amidst the surge in the use of Artificial Intelligence (AI) for control purposes, classical and model-based control methods maintain their popularity due to their transparency and deterministic nature. However, advanced controllers like Nonlinear Model Predictive Control (NMPC), despite proven capabilities, face adoption challenges due to their computational complexity and unpredictable closed-loop performance in complex validation systems. This paper introduces ExAMPC, a methodology bridging classical control and explainable AI by augmenting the NMPC with data-driven insights to improve the trustworthiness and reveal the optimization solution and closed-loop performance's sensitivities to physical variables and system parameters. By employing a low-order spline embedding to reduce the open-loop trajectory dimensionality by over 95%, and integrating it with SHAP and Symbolic Regression from eXplainable AI (XAI) for an approximate NMPC, we enable intuitive physical insights into the NMPC's optimization routine. The prediction accuracy of the approximate NMPC is enhanced through physics-inspired continuous-time constraints penalties, reducing the predicted continuous trajectory violations by 93%. ExAMPC enables accurate forecasting of the NMPC's computational requirements with explainable insights on worst-case scenarios. Experimental validation on automated valet parking and autonomous racing with lap-time optimization NMPC, demonstrates the methodology's practical effectiveness in real-world applications.<\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('125','tp_abstract')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_125\" style=\"display:none;\"><div class=\"tp_links_entry\"><ul class=\"tp_pub_list\"><li><i class=\"ai ai-arxiv\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/arxiv.org\/abs\/2503.00654\" title=\"https:\/\/arxiv.org\/abs\/2503.00654\" target=\"_blank\">https:\/\/arxiv.org\/abs\/2503.00654<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('125','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_workingpaper\"><div class=\"tp_pub_number\">4.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Lahr, Amon;  K\u00f6hler, Johannes;  Scampicchio, Anna;  Zeilinger, Melanie N.<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('126','tp_links')\" style=\"cursor:pointer;\">Optimal Kernel Regression Bounds under Energy-Bounded Noise<\/a> <span class=\"tp_pub_type tp_  workingpaper\">Working paper<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_year\">2025<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_abstract_link\"><a id=\"tp_abstract_sh_126\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('126','tp_abstract')\" title=\"Show abstract\" style=\"cursor:pointer;\">Abstract<\/a><\/span> | <span class=\"tp_resource_link\"><a id=\"tp_links_sh_126\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('126','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_126\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('126','tp_bibtex')\" title=\"Show BibTeX entry\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_126\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@workingpaper{lahr_optimal_2025,<br \/>\r\ntitle = {Optimal Kernel Regression Bounds under Energy-Bounded Noise},<br \/>\r\nauthor = {Amon Lahr and Johannes K\u00f6hler and Anna Scampicchio and Melanie N. Zeilinger},<br \/>\r\ndoi = {10.48550\/arXiv.2505.22235},<br \/>\r\nyear  = {2025},<br \/>\r\ndate = {2025-05-28},<br \/>\r\nabstract = {Non-conservative uncertainty bounds are key for both assessing an estimation algorithm's accuracy and in view of downstream tasks, such as its deployment in safety-critical contexts. In this paper, we derive a tight, non-asymptotic uncertainty bound for kernel-based estimation, which can also handle correlated noise sequences. Its computation relies on a mild norm-boundedness assumption on the unknown function and the noise, returning the worst-case function realization within the hypothesis class at an arbitrary query input location. The value of this function is shown to be given in terms of the posterior mean and covariance of a Gaussian process for an optimal choice of the measurement noise covariance. By rigorously analyzing the proposed approach and comparing it with other results in the literature, we show its effectiveness in returning tight and easy-to-compute bounds for kernel-based estimates.},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {workingpaper}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('126','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_abstract\" id=\"tp_abstract_126\" style=\"display:none;\"><div class=\"tp_abstract_entry\">Non-conservative uncertainty bounds are key for both assessing an estimation algorithm's accuracy and in view of downstream tasks, such as its deployment in safety-critical contexts. In this paper, we derive a tight, non-asymptotic uncertainty bound for kernel-based estimation, which can also handle correlated noise sequences. Its computation relies on a mild norm-boundedness assumption on the unknown function and the noise, returning the worst-case function realization within the hypothesis class at an arbitrary query input location. The value of this function is shown to be given in terms of the posterior mean and covariance of a Gaussian process for an optimal choice of the measurement noise covariance. By rigorously analyzing the proposed approach and comparing it with other results in the literature, we show its effectiveness in returning tight and easy-to-compute bounds for kernel-based estimates.<\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('126','tp_abstract')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_126\" style=\"display:none;\"><div class=\"tp_links_entry\"><ul class=\"tp_pub_list\"><li><i class=\"ai ai-doi\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/dx.doi.org\/10.48550\/arXiv.2505.22235\" title=\"Follow DOI:10.48550\/arXiv.2505.22235\" target=\"_blank\">doi:10.48550\/arXiv.2505.22235<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('126','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_workingpaper\"><div class=\"tp_pub_number\">5.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Prajapat, Manish;  K\u00f6hler, Johannes;  Lahr, Amon;  Krause, Andreas;  Zeilinger, Melanie N.<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('127','tp_links')\" style=\"cursor:pointer;\">Finite-Sample-Based Reachability for Safe Control with Gaussian Process Dynamics<\/a> <span class=\"tp_pub_type tp_  workingpaper\">Working paper<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_year\">2025<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_abstract_link\"><a id=\"tp_abstract_sh_127\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('127','tp_abstract')\" title=\"Show abstract\" style=\"cursor:pointer;\">Abstract<\/a><\/span> | <span class=\"tp_resource_link\"><a id=\"tp_links_sh_127\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('127','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_127\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('127','tp_bibtex')\" title=\"Show BibTeX entry\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_127\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@workingpaper{prajapat_finite_sample_based_2025,<br \/>\r\ntitle = {Finite-Sample-Based Reachability for Safe Control with Gaussian Process Dynamics},<br \/>\r\nauthor = {Manish Prajapat and Johannes K\u00f6hler and Amon Lahr and Andreas Krause and Melanie N. Zeilinger},<br \/>\r\ndoi = {10.48550\/arXiv.2505.07594},<br \/>\r\nyear  = {2025},<br \/>\r\ndate = {2025-05-12},<br \/>\r\nabstract = {Gaussian Process (GP) regression is shown to be effective for learning unknown dynamics, enabling efficient and safetyaware control strategies across diverse applications. However, existing GP-based model predictive control (GP-MPC) methods either rely on approximations, thus lacking guarantees, or are overly conservative, which limits their practical utility. To close this gap, we present a sampling-based framework that efficiently propagates the model\u2019s epistemic uncertainty while avoiding conservatism. We establish a novel sample complexity result that enables the construction of a reachable set using a finite number of dynamics functions sampled from the GP posterior. Building on this, we design a sampling-based GP-MPC scheme that is recursively feasible and guarantees closed-loop safety and stability with high probability. Finally, we showcase the effectiveness of our method on two numerical examples, highlighting accurate reachable set over-approximation and safe closed-loop performance.},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {workingpaper}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('127','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_abstract\" id=\"tp_abstract_127\" style=\"display:none;\"><div class=\"tp_abstract_entry\">Gaussian Process (GP) regression is shown to be effective for learning unknown dynamics, enabling efficient and safetyaware control strategies across diverse applications. However, existing GP-based model predictive control (GP-MPC) methods either rely on approximations, thus lacking guarantees, or are overly conservative, which limits their practical utility. To close this gap, we present a sampling-based framework that efficiently propagates the model\u2019s epistemic uncertainty while avoiding conservatism. We establish a novel sample complexity result that enables the construction of a reachable set using a finite number of dynamics functions sampled from the GP posterior. Building on this, we design a sampling-based GP-MPC scheme that is recursively feasible and guarantees closed-loop safety and stability with high probability. Finally, we showcase the effectiveness of our method on two numerical examples, highlighting accurate reachable set over-approximation and safe closed-loop performance.<\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('127','tp_abstract')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_127\" style=\"display:none;\"><div class=\"tp_links_entry\"><ul class=\"tp_pub_list\"><li><i class=\"ai ai-doi\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/dx.doi.org\/10.48550\/arXiv.2505.07594\" title=\"Follow DOI:10.48550\/arXiv.2505.07594\" target=\"_blank\">doi:10.48550\/arXiv.2505.07594<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('127','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_workingpaper\"><div class=\"tp_pub_number\">6.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Wang, Renzi;  Schuurmans, Mathijs;  Patrinos, Panagiotis<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('124','tp_links')\" style=\"cursor:pointer;\">Risk-Sensitive Model Predictive Control for Interaction-Aware Planning--A Sequential Convexification Algorithm<\/a> <span class=\"tp_pub_type tp_  workingpaper\">Working paper<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_year\">2025<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_abstract_link\"><a id=\"tp_abstract_sh_124\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('124','tp_abstract')\" title=\"Show abstract\" style=\"cursor:pointer;\">Abstract<\/a><\/span> | <span class=\"tp_resource_link\"><a id=\"tp_links_sh_124\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('124','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_124\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('124','tp_bibtex')\" title=\"Show BibTeX entry\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_124\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@workingpaper{wang2025risk,<br \/>\r\ntitle = {Risk-Sensitive Model Predictive Control for Interaction-Aware Planning--A Sequential Convexification Algorithm},<br \/>\r\nauthor = {Renzi Wang and Mathijs Schuurmans and Panagiotis Patrinos},<br \/>\r\nurl = {https:\/\/doi.org\/10.48550\/arXiv.2503.14328},<br \/>\r\nyear  = {2025},<br \/>\r\ndate = {2025-03-18},<br \/>\r\nabstract = {This paper considers risk-sensitive model predictive control for stochastic systems with a decision-dependent distribution. This class of systems is commonly found in human-robot interaction scenarios. We derive computationally tractable convex upper bounds to both the objective function, and to frequently used penalty terms for collision avoidance, allowing us to efficiently solve the generally nonconvex optimal control problem as a sequence of convex problems. Simulations of a robot navigating a corridor demonstrate the effectiveness and the computational advantage of the proposed approach.},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {workingpaper}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('124','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_abstract\" id=\"tp_abstract_124\" style=\"display:none;\"><div class=\"tp_abstract_entry\">This paper considers risk-sensitive model predictive control for stochastic systems with a decision-dependent distribution. This class of systems is commonly found in human-robot interaction scenarios. We derive computationally tractable convex upper bounds to both the objective function, and to frequently used penalty terms for collision avoidance, allowing us to efficiently solve the generally nonconvex optimal control problem as a sequence of convex problems. Simulations of a robot navigating a corridor demonstrate the effectiveness and the computational advantage of the proposed approach.<\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('124','tp_abstract')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_124\" 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:\/\/doi.org\/10.48550\/arXiv.2503.14328\" title=\"https:\/\/doi.org\/10.48550\/arXiv.2503.14328\" target=\"_blank\">https:\/\/doi.org\/10.48550\/arXiv.2503.14328<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('124','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_inproceedings\"><div class=\"tp_pub_number\">7.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Yang, Shaohui;  Ohtsuka, Toshiyuki;  Jones, Colin<\/p><p class=\"tp_pub_title\">Brunovsky Riccati Recursion for Linear Model Predictive Control <span class=\"tp_pub_type tp_  inproceedings\">Proceedings Article<\/span> <span class=\"tp_pub_label_status forthcoming\">Forthcoming<\/span><\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_in\">In: <\/span>Forthcoming.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_121\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('121','tp_bibtex')\" title=\"Show BibTeX entry\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_121\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@inproceedings{yang2025brunovsky,<br \/>\r\ntitle = {Brunovsky Riccati Recursion for Linear Model Predictive Control},<br \/>\r\nauthor = {Shaohui Yang and Toshiyuki Ohtsuka and Colin Jones },<br \/>\r\nyear  = {2025},<br \/>\r\ndate = {2025-02-14},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {forthcoming},<br \/>\r\ntppubtype = {inproceedings}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('121','tp_bibtex')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_workingpaper\"><div class=\"tp_pub_number\">8.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Yang, Shaohui;  Ohtsuka, Toshiyuki;  Plancher, Brian;  Jones, Colin<\/p><p class=\"tp_pub_title\">Polynomial and Parallelizable Preconditioning of Linear Systems for Model Predictive Control and Beyond <span class=\"tp_pub_type tp_  workingpaper\">Working paper<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_year\">2025<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_122\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('122','tp_bibtex')\" title=\"Show BibTeX entry\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_122\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@workingpaper{yang2025polynomial,<br \/>\r\ntitle = {Polynomial and Parallelizable Preconditioning of Linear Systems for Model Predictive Control and Beyond},<br \/>\r\nauthor = {Shaohui Yang and Toshiyuki Ohtsuka and Brian Plancher and Colin Jones},<br \/>\r\nyear  = {2025},<br \/>\r\ndate = {2025-02-14},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {workingpaper}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('122','tp_bibtex')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_workingpaper\"><div class=\"tp_pub_number\">9.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Yang, Shaohui;  Jones, Colin<\/p><p class=\"tp_pub_title\">Enhanced Numerical Techniques and Efficient Implementation for Brunovsky Form-Based Linear Model Predictive Control <span class=\"tp_pub_type tp_  workingpaper\">Working paper<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_year\">2025<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_123\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('123','tp_bibtex')\" title=\"Show BibTeX entry\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_123\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@workingpaper{yang2025enhanced,<br \/>\r\ntitle = {Enhanced Numerical Techniques and Efficient Implementation for Brunovsky Form-Based Linear Model Predictive Control},<br \/>\r\nauthor = {Shaohui Yang and Colin Jones },<br \/>\r\nyear  = {2025},<br \/>\r\ndate = {2025-02-14},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {workingpaper}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('123','tp_bibtex')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_workingpaper\"><div class=\"tp_pub_number\">10.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Scampicchio, Anna;  Arcari, Elena;  Lahr, Amon;  Zeilinger, Melanie N.<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('128','tp_links')\" style=\"cursor:pointer;\">Gaussian Processes for Dynamics Learning in Model Predictive Control<\/a> <span class=\"tp_pub_type tp_  workingpaper\">Working paper<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_year\">2025<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_abstract_link\"><a id=\"tp_abstract_sh_128\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('128','tp_abstract')\" title=\"Show abstract\" style=\"cursor:pointer;\">Abstract<\/a><\/span> | <span class=\"tp_resource_link\"><a id=\"tp_links_sh_128\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('128','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_128\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('128','tp_bibtex')\" title=\"Show BibTeX entry\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_128\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@workingpaper{scampicchio_gaussian_2025,<br \/>\r\ntitle = {Gaussian Processes for Dynamics Learning in Model Predictive Control},<br \/>\r\nauthor = {Anna Scampicchio and Elena Arcari and Amon Lahr and Melanie N. Zeilinger},<br \/>\r\ndoi = {10.48550\/arXiv.2502.02310},<br \/>\r\nyear  = {2025},<br \/>\r\ndate = {2025-02-04},<br \/>\r\nabstract = {Due to its state-of-the-art estimation performance complemented by rigorous and non-conservative uncertainty bounds, Gaussian process regression is a popular tool for enhancing dynamical system models and coping with their inaccuracies. This has enabled a plethora of successful implementations of Gaussian process-based model predictive control in a variety of applications over the last years. However, despite its evident practical effectiveness, there are still many open questions when attempting to analyze the associated optimal control problem theoretically and to exploit the full potential of Gaussian process regression in view of safe learning-based control.},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {workingpaper}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('128','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_abstract\" id=\"tp_abstract_128\" style=\"display:none;\"><div class=\"tp_abstract_entry\">Due to its state-of-the-art estimation performance complemented by rigorous and non-conservative uncertainty bounds, Gaussian process regression is a popular tool for enhancing dynamical system models and coping with their inaccuracies. This has enabled a plethora of successful implementations of Gaussian process-based model predictive control in a variety of applications over the last years. However, despite its evident practical effectiveness, there are still many open questions when attempting to analyze the associated optimal control problem theoretically and to exploit the full potential of Gaussian process regression in view of safe learning-based control.<\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('128','tp_abstract')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_128\" style=\"display:none;\"><div class=\"tp_links_entry\"><ul class=\"tp_pub_list\"><li><i class=\"ai ai-doi\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/dx.doi.org\/10.48550\/arXiv.2502.02310\" title=\"Follow DOI:10.48550\/arXiv.2502.02310\" target=\"_blank\">doi:10.48550\/arXiv.2502.02310<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('128','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_workingpaper\"><div class=\"tp_pub_number\">11.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Zhang, Shuhao;  Swevers, Jan<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('120','tp_links')\" style=\"cursor:pointer;\">Robustified Time-optimal Point-to-point Motion Planning and Control under Uncertainty<\/a> <span class=\"tp_pub_type tp_  workingpaper\">Working paper<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_year\">2025<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_abstract_link\"><a id=\"tp_abstract_sh_120\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('120','tp_abstract')\" title=\"Show abstract\" style=\"cursor:pointer;\">Abstract<\/a><\/span> | <span class=\"tp_resource_link\"><a id=\"tp_links_sh_120\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('120','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_120\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('120','tp_bibtex')\" title=\"Show BibTeX entry\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_120\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@workingpaper{zhang2025robustified,<br \/>\r\ntitle = {Robustified Time-optimal Point-to-point Motion Planning and Control under Uncertainty},<br \/>\r\nauthor = {Shuhao Zhang and Jan Swevers },<br \/>\r\ndoi = {https:\/\/doi.org\/10.48550\/arXiv.2501.14526},<br \/>\r\nyear  = {2025},<br \/>\r\ndate = {2025-01-24},<br \/>\r\nabstract = {This paper proposes a novel approach to formulate time-optimal point-to-point motion planning and control under uncertainty. The approach defines a robustified two-stage Optimal Control Problem (OCP), in which stage 1, with a fixed time grid, is seamlessly stitched with stage 2, which features a variable time grid. Stage 1 optimizes not only the nominal trajectory, but also feedback gains and corresponding state covariances, which robustify constraints in both stages. The outcome is a minimized uncertainty in stage 1 and a minimized total motion time for stage 2, both contributing to the time optimality and safety of the total motion. A timely replanning strategy is employed to handle changes in constraints and maintain feasibility, while a tailored iterative algorithm is proposed for efficient, real-time OCP execution.},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {workingpaper}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('120','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_abstract\" id=\"tp_abstract_120\" style=\"display:none;\"><div class=\"tp_abstract_entry\">This paper proposes a novel approach to formulate time-optimal point-to-point motion planning and control under uncertainty. The approach defines a robustified two-stage Optimal Control Problem (OCP), in which stage 1, with a fixed time grid, is seamlessly stitched with stage 2, which features a variable time grid. Stage 1 optimizes not only the nominal trajectory, but also feedback gains and corresponding state covariances, which robustify constraints in both stages. The outcome is a minimized uncertainty in stage 1 and a minimized total motion time for stage 2, both contributing to the time optimality and safety of the total motion. A timely replanning strategy is employed to handle changes in constraints and maintain feasibility, while a tailored iterative algorithm is proposed for efficient, real-time OCP execution.<\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('120','tp_abstract')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_120\" style=\"display:none;\"><div class=\"tp_links_entry\"><ul class=\"tp_pub_list\"><li><i class=\"ai ai-doi\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/dx.doi.org\/https:\/\/doi.org\/10.48550\/arXiv.2501.14526\" title=\"Follow DOI:https:\/\/doi.org\/10.48550\/arXiv.2501.14526\" target=\"_blank\">doi:https:\/\/doi.org\/10.48550\/arXiv.2501.14526<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('120','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_workingpaper\"><div class=\"tp_pub_number\">12.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Abbasi-Esfeden, Ramin;  Nurkanovic, Armin;  Diehl, Moritz;  Patrinos, Panagiotis;  Swevers, Jan<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('99','tp_links')\" style=\"cursor:pointer;\">An Efficient Mixed-Integer Formulation and an Iterative Method for Optimal Control of Switched Systems Under Dwell Time Constraints<\/a> <span class=\"tp_pub_type tp_  workingpaper\">Working paper<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_year\">2025<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_abstract_link\"><a id=\"tp_abstract_sh_99\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('99','tp_abstract')\" title=\"Show abstract\" style=\"cursor:pointer;\">Abstract<\/a><\/span> | <span class=\"tp_resource_link\"><a id=\"tp_links_sh_99\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('99','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_99\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('99','tp_bibtex')\" title=\"Show BibTeX entry\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_99\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@workingpaper{abbasiesfeden2025efficientmixedintegerformulationiterative,<br \/>\r\ntitle = {An Efficient Mixed-Integer Formulation and an Iterative Method for Optimal Control of Switched Systems Under Dwell Time Constraints},<br \/>\r\nauthor = {Ramin Abbasi-Esfeden and Armin Nurkanovic and Moritz Diehl and Panagiotis Patrinos and Jan Swevers},<br \/>\r\nurl = {https:\/\/arxiv.org\/abs\/2501.05158},<br \/>\r\nyear  = {2025},<br \/>\r\ndate = {2025-01-09},<br \/>\r\nabstract = {This paper presents an efficient Mixed-Integer Nonlinear Programming (MINLP) formulation for systems with discrete control inputs under dwell time constraints. By viewing such systems as a switched system, the problem is decomposed into a Sequence Optimization (SO) and a Switching Time Optimization (STO) -- the former providing the sequence of the switched system, and the latter calculating the optimal switching times. By limiting the feasible set of SO to subsequences of a master sequence, this formulation requires a small number of binary variables, independent of the number of time discretization nodes. This enables the proposed formulation to provide solutions efficiently, even for large numbers of time discretization nodes. To provide even faster solutions, an iterative algorithm is introduced to heuristically solve STO and SO. The proposed approaches are then showcased on four different switched systems and results demonstrate the efficiency of the MINLP formulation and the iterative algorithm.},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {workingpaper}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('99','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_abstract\" id=\"tp_abstract_99\" style=\"display:none;\"><div class=\"tp_abstract_entry\">This paper presents an efficient Mixed-Integer Nonlinear Programming (MINLP) formulation for systems with discrete control inputs under dwell time constraints. By viewing such systems as a switched system, the problem is decomposed into a Sequence Optimization (SO) and a Switching Time Optimization (STO) -- the former providing the sequence of the switched system, and the latter calculating the optimal switching times. By limiting the feasible set of SO to subsequences of a master sequence, this formulation requires a small number of binary variables, independent of the number of time discretization nodes. This enables the proposed formulation to provide solutions efficiently, even for large numbers of time discretization nodes. To provide even faster solutions, an iterative algorithm is introduced to heuristically solve STO and SO. The proposed approaches are then showcased on four different switched systems and results demonstrate the efficiency of the MINLP formulation and the iterative algorithm.<\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('99','tp_abstract')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_99\" style=\"display:none;\"><div class=\"tp_links_entry\"><ul class=\"tp_pub_list\"><li><i class=\"ai ai-arxiv\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/arxiv.org\/abs\/2501.05158\" title=\"https:\/\/arxiv.org\/abs\/2501.05158\" target=\"_blank\">https:\/\/arxiv.org\/abs\/2501.05158<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('99','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_article\"><div class=\"tp_pub_number\">13.<\/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('118','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_year\">2025<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_abstract_link\"><a id=\"tp_abstract_sh_118\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('118','tp_abstract')\" title=\"Show abstract\" style=\"cursor:pointer;\">Abstract<\/a><\/span> | <span class=\"tp_resource_link\"><a id=\"tp_links_sh_118\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('118','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_118\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('118','tp_bibtex')\" title=\"Show BibTeX entry\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_118\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@article{kessler2024gain,<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:\/\/onlinelibrary.wiley.com\/doi\/full\/10.1002\/rnc.7784},<br \/>\r\ndoi = {https:\/\/doi.org\/10.1002\/rnc.7784},<br \/>\r\nyear  = {2025},<br \/>\r\ndate = {2025-01-07},<br \/>\r\njournal = {International Journal of Robust and Nonlinear Control},<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 rev{bounded deviations around} the found trajectory can be much more involved.<br \/>\r\nAn approach that does not require high online computational power and is well-accepted in industry is gain-scheduling.<br \/>\r\nThe results presented here pertain to the rev{boundedness} guarantees and rev{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 rev{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 rev{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 be used also to check\/assess the rev{boundedness} properties obtained with an existing gain-scheduled law.<br \/>\r\nThe 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.},<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('118','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_abstract\" id=\"tp_abstract_118\" 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 rev{bounded deviations around} the found trajectory can be much more involved.<br \/>\r\nAn approach that does not require high online computational power and is well-accepted in industry is gain-scheduling.<br \/>\r\nThe results presented here pertain to the rev{boundedness} guarantees and rev{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 rev{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 rev{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 be used also to check\/assess the rev{boundedness} properties obtained with an existing gain-scheduled law.<br \/>\r\nThe 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.<\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('118','tp_abstract')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_118\" 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:\/\/onlinelibrary.wiley.com\/doi\/full\/10.1002\/rnc.7784\" title=\"https:\/\/onlinelibrary.wiley.com\/doi\/full\/10.1002\/rnc.7784\" target=\"_blank\">https:\/\/onlinelibrary.wiley.com\/doi\/full\/10.1002\/rnc.7784<\/a><\/li><li><i class=\"ai ai-doi\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/dx.doi.org\/https:\/\/doi.org\/10.1002\/rnc.7784\" title=\"Follow DOI:https:\/\/doi.org\/10.1002\/rnc.7784\" target=\"_blank\">doi:https:\/\/doi.org\/10.1002\/rnc.7784<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('118','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_workingpaper\"><div class=\"tp_pub_number\">14.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Abbasi-Esfeden, Ramin;  Plate, Christoph;  Sager, Sebastian;  Swevers, Jan<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('93','tp_links')\" style=\"cursor:pointer;\">Dynamic Programming for Mixed Integer Optimal Control Problems with Dwell Time Constraints<\/a> <span class=\"tp_pub_type tp_  workingpaper\">Working paper<\/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_93\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('93','tp_abstract')\" title=\"Show abstract\" style=\"cursor:pointer;\">Abstract<\/a><\/span> | <span class=\"tp_resource_link\"><a id=\"tp_links_sh_93\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('93','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_93\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('93','tp_bibtex')\" title=\"Show BibTeX entry\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_93\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@workingpaper{AbbasiEsfeden2024,<br \/>\r\ntitle = {Dynamic Programming for Mixed Integer Optimal Control Problems with Dwell Time Constraints},<br \/>\r\nauthor = {Ramin Abbasi-Esfeden and Christoph Plate and Sebastian Sager and Jan Swevers},<br \/>\r\nurl = {http:\/\/dx.doi.org\/10.2139\/ssrn.5043263},<br \/>\r\ndoi = {10.2139\/ssrn.5043263},<br \/>\r\nyear  = {2024},<br \/>\r\ndate = {2024-12-17},<br \/>\r\njournal = {Elsevier BV},<br \/>\r\nabstract = {This paper introduces Dynamic Programming (DP) as a method for solving the Combinatorial Integral Approximation (CIA) problem within the CIA decomposition approach for Mixed-Integer Optimal Control Problems (MIOCPs). Additionally, we incorporate general dwell time constraints into the DP framework. The proposed method is tested on three MIOCPs with a minimum dwell time constraint, and its performance is compared to the usage of the state-of-the-art general purpose solver GuRoBi (MILP) and to the tailored branch-and-bound (BnB) solver from the pycombina package. The results show that DP is more computationally efficient, and its flexible cost-to-go function formulation makes it suitable for handling cases where simple approximations of the relaxed solution are insufficient.},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {workingpaper}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('93','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_abstract\" id=\"tp_abstract_93\" style=\"display:none;\"><div class=\"tp_abstract_entry\">This paper introduces Dynamic Programming (DP) as a method for solving the Combinatorial Integral Approximation (CIA) problem within the CIA decomposition approach for Mixed-Integer Optimal Control Problems (MIOCPs). Additionally, we incorporate general dwell time constraints into the DP framework. The proposed method is tested on three MIOCPs with a minimum dwell time constraint, and its performance is compared to the usage of the state-of-the-art general purpose solver GuRoBi (MILP) and to the tailored branch-and-bound (BnB) solver from the pycombina package. The results show that DP is more computationally efficient, and its flexible cost-to-go function formulation makes it suitable for handling cases where simple approximations of the relaxed solution are insufficient.<\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('93','tp_abstract')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_93\" 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=\"http:\/\/dx.doi.org\/10.2139\/ssrn.5043263\" title=\"http:\/\/dx.doi.org\/10.2139\/ssrn.5043263\" target=\"_blank\">http:\/\/dx.doi.org\/10.2139\/ssrn.5043263<\/a><\/li><li><i class=\"ai ai-doi\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/dx.doi.org\/10.2139\/ssrn.5043263\" title=\"Follow DOI:10.2139\/ssrn.5043263\" target=\"_blank\">doi:10.2139\/ssrn.5043263<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('93','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_inproceedings\"><div class=\"tp_pub_number\">15.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Prajapat, Manish;  Lahr, Amon;  K\u00f6hler, Johannes;  Krause, Andreas;  Zeilinger, Melanie N.<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('96','tp_links')\" style=\"cursor:pointer;\">Towards Safe and Tractable Gaussian Process-Based MPC: Efficient Sampling within a Sequential Quadratic Programming Framework<\/a> <span class=\"tp_pub_type tp_  inproceedings\">Proceedings Article<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_in\">In: <\/span><span class=\"tp_pub_additional_booktitle\">2024 IEEE 63rd Conference on Decision and Control CDC, <\/span><span class=\"tp_pub_additional_pages\">pp. 7458-7465, <\/span><span class=\"tp_pub_additional_publisher\">IEEE, <\/span><span class=\"tp_pub_additional_address\">Milan, Italy, <\/span><span class=\"tp_pub_additional_year\">2024<\/span>, <span class=\"tp_pub_additional_isbn\">ISBN: 9798350316339<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_abstract_link\"><a id=\"tp_abstract_sh_96\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('96','tp_abstract')\" title=\"Show abstract\" style=\"cursor:pointer;\">Abstract<\/a><\/span> | <span class=\"tp_resource_link\"><a id=\"tp_links_sh_96\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('96','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_96\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('96','tp_bibtex')\" title=\"Show BibTeX entry\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_96\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@inproceedings{prajapat_towards_2024,<br \/>\r\ntitle = {Towards Safe and Tractable Gaussian Process-Based MPC: Efficient Sampling within a Sequential Quadratic Programming Framework},<br \/>\r\nauthor = {Manish Prajapat and Amon Lahr and Johannes K\u00f6hler and Andreas Krause and Melanie N. Zeilinger},<br \/>\r\ndoi = {10.1109\/CDC56724.2024.10886350},<br \/>\r\nisbn = {9798350316339},<br \/>\r\nyear  = {2024},<br \/>\r\ndate = {2024-12-16},<br \/>\r\nurldate = {2024-09-13},<br \/>\r\nbooktitle = {2024 IEEE 63rd Conference on Decision and Control CDC},<br \/>\r\npages = {7458-7465},<br \/>\r\npublisher = {IEEE},<br \/>\r\naddress = {Milan, Italy},<br \/>\r\nabstract = {Learning uncertain dynamics models using Gaussian process (GP) regression has been demonstrated to enable high-performance and safety-aware control strategies for challenging real-world applications. Yet, for computational tractability, most approaches for Gaussian process-based model predictive control (GP-MPC) are based on approximations of the reachable set that are either overly conservative or impede the controller\u2019s safety guarantees. To address these challenges, we propose a robust GP-MPC formulation that guarantees constraint satisfaction with high probability. For its tractable implementation, we propose a sampling-based GPMPC approach that iteratively generates consistent dynamics samples from the GP within a sequential quadratic programming framework. We highlight the improved reachable set approximation compared to existing methods, as well as realtime feasible computation times, using two numerical examples.},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {inproceedings}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('96','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_abstract\" id=\"tp_abstract_96\" style=\"display:none;\"><div class=\"tp_abstract_entry\">Learning uncertain dynamics models using Gaussian process (GP) regression has been demonstrated to enable high-performance and safety-aware control strategies for challenging real-world applications. Yet, for computational tractability, most approaches for Gaussian process-based model predictive control (GP-MPC) are based on approximations of the reachable set that are either overly conservative or impede the controller\u2019s safety guarantees. To address these challenges, we propose a robust GP-MPC formulation that guarantees constraint satisfaction with high probability. For its tractable implementation, we propose a sampling-based GPMPC approach that iteratively generates consistent dynamics samples from the GP within a sequential quadratic programming framework. We highlight the improved reachable set approximation compared to existing methods, as well as realtime feasible computation times, using two numerical examples.<\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('96','tp_abstract')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_96\" style=\"display:none;\"><div class=\"tp_links_entry\"><ul class=\"tp_pub_list\"><li><i class=\"ai ai-doi\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/dx.doi.org\/10.1109\/CDC56724.2024.10886350\" title=\"Follow DOI:10.1109\/CDC56724.2024.10886350\" target=\"_blank\">doi:10.1109\/CDC56724.2024.10886350<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('96','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_workingpaper\"><div class=\"tp_pub_number\">16.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Lahr, Amon;  N\u00e4f, Joshua;  Wabersich, Kim P.;  Frey, Jonathan;  Siehl, Pascal;  Carron, Andrea;  Diehl, Moritz;  Zeilinger, Melanie N.<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('95','tp_links')\" style=\"cursor:pointer;\">L4acados: Learning-based Models for Acados, Applied to Gaussian Process-Based Predictive Control<\/a> <span class=\"tp_pub_type tp_  workingpaper\">Working paper<\/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_95\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('95','tp_abstract')\" title=\"Show abstract\" style=\"cursor:pointer;\">Abstract<\/a><\/span> | <span class=\"tp_resource_link\"><a id=\"tp_links_sh_95\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('95','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_95\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('95','tp_bibtex')\" title=\"Show BibTeX entry\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_95\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@workingpaper{lahr_l4acados_2024,<br \/>\r\ntitle = {L4acados: Learning-based Models for Acados, Applied to Gaussian Process-Based Predictive Control},<br \/>\r\nauthor = {Amon Lahr and Joshua N\u00e4f and Kim P. Wabersich and Jonathan Frey and Pascal Siehl and Andrea Carron and Moritz Diehl and Melanie N. Zeilinger},<br \/>\r\ndoi = {10.48550\/arXiv.2411.19258},<br \/>\r\nyear  = {2024},<br \/>\r\ndate = {2024-11-28},<br \/>\r\nurldate = {2024-11-28},<br \/>\r\nabstract = {Incorporating learning-based models, such as artificial neural networks or Gaussian processes, into model predictive control (MPC) strategies can significantly improve control performance and online adaptation capabilities for real-world applications. Still, enabling state-of-the-art implementations of learning-based models for MPC is complicated by the challenge of interfacing machine learning frameworks with real-time optimal control software. This work aims at filling this gap by incorporating external sensitivities in sequential quadratic programming solvers for nonlinear optimal control. To this end, we provide L4acados, a general framework for incorporating Python-based residual models in the real-time optimal control software acados. By computing external sensitivities via a user-defined Python module, L4acados enables the implementation of MPC controllers with learning-based residual models in acados, while supporting parallelization of sensitivity computations when preparing the quadratic subproblems. We demonstrate significant speed-ups and superior scaling properties of L4acados compared to available software using a neural-network-based control example. Last, we provide an efficient and modular real-time implementation of Gaussian process-based MPC using L4acados, which is applied to two hardware examples: autonomous miniature racing, as well as motion control of a full-scale autonomous vehicle for an ISO lane change maneuver.},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {workingpaper}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('95','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_abstract\" id=\"tp_abstract_95\" style=\"display:none;\"><div class=\"tp_abstract_entry\">Incorporating learning-based models, such as artificial neural networks or Gaussian processes, into model predictive control (MPC) strategies can significantly improve control performance and online adaptation capabilities for real-world applications. Still, enabling state-of-the-art implementations of learning-based models for MPC is complicated by the challenge of interfacing machine learning frameworks with real-time optimal control software. This work aims at filling this gap by incorporating external sensitivities in sequential quadratic programming solvers for nonlinear optimal control. To this end, we provide L4acados, a general framework for incorporating Python-based residual models in the real-time optimal control software acados. By computing external sensitivities via a user-defined Python module, L4acados enables the implementation of MPC controllers with learning-based residual models in acados, while supporting parallelization of sensitivity computations when preparing the quadratic subproblems. We demonstrate significant speed-ups and superior scaling properties of L4acados compared to available software using a neural-network-based control example. Last, we provide an efficient and modular real-time implementation of Gaussian process-based MPC using L4acados, which is applied to two hardware examples: autonomous miniature racing, as well as motion control of a full-scale autonomous vehicle for an ISO lane change maneuver.<\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('95','tp_abstract')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_95\" style=\"display:none;\"><div class=\"tp_links_entry\"><ul class=\"tp_pub_list\"><li><i class=\"ai ai-doi\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/dx.doi.org\/10.48550\/arXiv.2411.19258\" title=\"Follow DOI:10.48550\/arXiv.2411.19258\" target=\"_blank\">doi:10.48550\/arXiv.2411.19258<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('95','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_article\"><div class=\"tp_pub_number\">17.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Dong, Shiying;  Ghezzi, Andrea;  Harzer, Jakob;  Frey, Jonathan;  Gao, Bingzhao;  Chen, Hong;  Diehl, Moritz<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('105','tp_links')\" style=\"cursor:pointer;\">Real-Time NMPC With Convex--Concave Constraints and Application to Eco-Driving<\/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\">2024<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_abstract_link\"><a id=\"tp_abstract_sh_105\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('105','tp_abstract')\" title=\"Show abstract\" style=\"cursor:pointer;\">Abstract<\/a><\/span> | <span class=\"tp_resource_link\"><a id=\"tp_links_sh_105\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('105','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_105\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('105','tp_bibtex')\" title=\"Show BibTeX entry\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_105\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@article{dong2024real,<br \/>\r\ntitle = {Real-Time NMPC With Convex--Concave Constraints and Application to Eco-Driving},<br \/>\r\nauthor = {Shiying Dong and Andrea Ghezzi and Jakob Harzer and Jonathan Frey and Bingzhao Gao and Hong Chen and Moritz Diehl},<br \/>\r\ndoi = {10.1109\/TCST.2024.3494993},<br \/>\r\nyear  = {2024},<br \/>\r\ndate = {2024-11-15},<br \/>\r\njournal = {IEEE Transactions on Control Systems Technology},<br \/>\r\nabstract = {In this brief, we propose a novel real-time numerical algorithm for solving nonlinear model predictive control (NMPC) with convex\u2013concave constraints, which arise in various practical applications. Instead of requiring full convergence for each problem at every sampling time, the proposed algorithm, called real-time iteration sequential convex programming (RTI-SCP), solves only one convex subproblem but iterates as the problem evolves. Compared with previous methods, the RTI-SCP adopts a more refined approach by linearizing only the concave components of the constraints. It retains and efficiently utilizes all the underlying convex structures, thereby transforming subproblems into structured forms that can be solved using the existing tools. In addition, to the best of our knowledge, the widely investigated eco-driving control strategy for autonomous vehicles is now formulated for the first time into a convex\u2013concave programming problem with strong theoretical properties. Eventually, the experimental results demonstrate that the proposed strategy can improve computational efficiency and overall control performance, and it is suitable for real-time implementation.},<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('105','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_abstract\" id=\"tp_abstract_105\" style=\"display:none;\"><div class=\"tp_abstract_entry\">In this brief, we propose a novel real-time numerical algorithm for solving nonlinear model predictive control (NMPC) with convex\u2013concave constraints, which arise in various practical applications. Instead of requiring full convergence for each problem at every sampling time, the proposed algorithm, called real-time iteration sequential convex programming (RTI-SCP), solves only one convex subproblem but iterates as the problem evolves. Compared with previous methods, the RTI-SCP adopts a more refined approach by linearizing only the concave components of the constraints. It retains and efficiently utilizes all the underlying convex structures, thereby transforming subproblems into structured forms that can be solved using the existing tools. In addition, to the best of our knowledge, the widely investigated eco-driving control strategy for autonomous vehicles is now formulated for the first time into a convex\u2013concave programming problem with strong theoretical properties. Eventually, the experimental results demonstrate that the proposed strategy can improve computational efficiency and overall control performance, and it is suitable for real-time implementation.<\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('105','tp_abstract')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_105\" style=\"display:none;\"><div class=\"tp_links_entry\"><ul class=\"tp_pub_list\"><li><i class=\"ai ai-doi\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/dx.doi.org\/10.1109\/TCST.2024.3494993\" title=\"Follow DOI:10.1109\/TCST.2024.3494993\" target=\"_blank\">doi:10.1109\/TCST.2024.3494993<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('105','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_workingpaper\"><div class=\"tp_pub_number\">18.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Wang, Renzi;  Acerbo, Flavia Sofia;  Son, Tong Duy;  Patrinos, Panagiotis<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('102','tp_links')\" style=\"cursor:pointer;\">Imitation Learning from Observations: An Autoregressive Mixture of Experts Approach<\/a> <span class=\"tp_pub_type tp_  workingpaper\">Working paper<\/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_102\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('102','tp_abstract')\" title=\"Show abstract\" style=\"cursor:pointer;\">Abstract<\/a><\/span> | <span class=\"tp_resource_link\"><a id=\"tp_links_sh_102\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('102','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_102\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('102','tp_bibtex')\" title=\"Show BibTeX entry\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_102\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@workingpaper{wang2024imitation,<br \/>\r\ntitle = {Imitation Learning from Observations: An Autoregressive Mixture of Experts Approach},<br \/>\r\nauthor = {Renzi Wang and Flavia Sofia Acerbo and Tong Duy Son and Panagiotis Patrinos},<br \/>\r\nurl = {https:\/\/doi.org\/10.48550\/arXiv.2411.08232<br \/>\r\n},<br \/>\r\nyear  = {2024},<br \/>\r\ndate = {2024-11-12},<br \/>\r\nabstract = {This paper presents a novel approach to imitation learning from observations, where an autoregressive mixture of experts model is deployed to fit the underlying policy. The parameters of the model are learned via a two-stage framework. By leveraging the existing dynamics knowledge, the first stage of the framework estimates the control input sequences and hence reduces the problem complexity. At the second stage, the policy is learned by solving a regularized maximum-likelihood estimation problem using the estimated control input sequences. We further extend the learning procedure by incorporating a Lyapunov stability constraint to ensure asymptotic stability of the identified model, for accurate multi-step predictions. The effectiveness of the proposed framework is validated using two autonomous driving datasets collected from human demonstrations, demonstrating its practical applicability in modelling complex nonlinear dynamics.},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {workingpaper}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('102','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_abstract\" id=\"tp_abstract_102\" style=\"display:none;\"><div class=\"tp_abstract_entry\">This paper presents a novel approach to imitation learning from observations, where an autoregressive mixture of experts model is deployed to fit the underlying policy. The parameters of the model are learned via a two-stage framework. By leveraging the existing dynamics knowledge, the first stage of the framework estimates the control input sequences and hence reduces the problem complexity. At the second stage, the policy is learned by solving a regularized maximum-likelihood estimation problem using the estimated control input sequences. We further extend the learning procedure by incorporating a Lyapunov stability constraint to ensure asymptotic stability of the identified model, for accurate multi-step predictions. The effectiveness of the proposed framework is validated using two autonomous driving datasets collected from human demonstrations, demonstrating its practical applicability in modelling complex nonlinear dynamics.<\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('102','tp_abstract')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_102\" 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:\/\/doi.org\/10.48550\/arXiv.2411.08232\" title=\"https:\/\/doi.org\/10.48550\/arXiv.2411.08232\" target=\"_blank\">https:\/\/doi.org\/10.48550\/arXiv.2411.08232<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('102','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_inproceedings\"><div class=\"tp_pub_number\">19.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Zhang, Yuan;  Hoffman, Jasper;  Boedecker, Joschka<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('83','tp_links')\" style=\"cursor:pointer;\">UDUC: An Uncertainty-driven Approach for Learning-based Robust Control<\/a> <span class=\"tp_pub_type tp_  inproceedings\">Proceedings Article<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_in\">In: <\/span><span class=\"tp_pub_additional_booktitle\">ECAI 2024 - 27th European Conference on Artificial Intelligence - Including 13th Conference on Prestigious Applications of Intelligent Systems (PAIS 2024), <\/span><span class=\"tp_pub_additional_pages\">pp. 4402-4409, <\/span><span class=\"tp_pub_additional_publisher\">IOS Press, <\/span><span class=\"tp_pub_additional_address\">Santiago de Compostela, Spain, <\/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_83\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('83','tp_abstract')\" title=\"Show abstract\" style=\"cursor:pointer;\">Abstract<\/a><\/span> | <span class=\"tp_resource_link\"><a id=\"tp_links_sh_83\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('83','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_83\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('83','tp_bibtex')\" title=\"Show BibTeX entry\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_83\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@inproceedings{zhang2024uduc,<br \/>\r\ntitle = {UDUC: An Uncertainty-driven Approach for Learning-based Robust Control},<br \/>\r\nauthor = {Yuan Zhang and Jasper Hoffman and Joschka Boedecker},<br \/>\r\nurl = {https:\/\/arxiv.org\/abs\/2405.02598},<br \/>\r\ndoi = {10.3233\/FAIA241018},<br \/>\r\nyear  = {2024},<br \/>\r\ndate = {2024-10-24},<br \/>\r\nurldate = {2024-10-24},<br \/>\r\nbooktitle = {ECAI 2024 - 27th European Conference on Artificial Intelligence - Including 13th Conference on Prestigious Applications of Intelligent Systems (PAIS 2024)},<br \/>\r\nvolume = {392},<br \/>\r\npages = {4402-4409},<br \/>\r\npublisher = {IOS Press},<br \/>\r\naddress = {Santiago de Compostela, Spain},<br \/>\r\nseries = {Frontiers in Artificial Intelligence and Applications},<br \/>\r\nabstract = {Learning-based techniques have become popular in both model predictive control (MPC) and reinforcement learning (RL). Probabilistic ensemble (PE) models offer a promising approach for modelling system dynamics, showcasing the ability to capture uncertainty and scalability in high-dimensional control scenarios. However, PE models are susceptible to mode collapse, resulting in non-robust control when faced with environments slightly different from the training set. In this paper, we introduce the uncertainty-driven robust control (UDUC) loss as an alternative objective for training PE models, drawing inspiration from contrastive learning. We analyze the robustness of the UDUC loss through the lens of robust optimization and evaluate its performance on the challenging real-world reinforcement learning (RWRL) benchmark, which involves significant environmental mismatches between the training and testing environments.},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {inproceedings}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('83','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_abstract\" id=\"tp_abstract_83\" style=\"display:none;\"><div class=\"tp_abstract_entry\">Learning-based techniques have become popular in both model predictive control (MPC) and reinforcement learning (RL). Probabilistic ensemble (PE) models offer a promising approach for modelling system dynamics, showcasing the ability to capture uncertainty and scalability in high-dimensional control scenarios. However, PE models are susceptible to mode collapse, resulting in non-robust control when faced with environments slightly different from the training set. In this paper, we introduce the uncertainty-driven robust control (UDUC) loss as an alternative objective for training PE models, drawing inspiration from contrastive learning. We analyze the robustness of the UDUC loss through the lens of robust optimization and evaluate its performance on the challenging real-world reinforcement learning (RWRL) benchmark, which involves significant environmental mismatches between the training and testing environments.<\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('83','tp_abstract')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_83\" style=\"display:none;\"><div class=\"tp_links_entry\"><ul class=\"tp_pub_list\"><li><i class=\"ai ai-arxiv\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/arxiv.org\/abs\/2405.02598\" title=\"https:\/\/arxiv.org\/abs\/2405.02598\" target=\"_blank\">https:\/\/arxiv.org\/abs\/2405.02598<\/a><\/li><li><i class=\"ai ai-doi\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/dx.doi.org\/10.3233\/FAIA241018\" title=\"Follow DOI:10.3233\/FAIA241018\" target=\"_blank\">doi:10.3233\/FAIA241018<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('83','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_inproceedings\"><div class=\"tp_pub_number\">20.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Acerbo, Flavia Sofia;  Swevers, Jan;  Tuytelaars, Tinne;  Son, Tong Duy<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('100','tp_links')\" style=\"cursor:pointer;\">Driving from Vision through Differentiable Optimal Control<\/a> <span class=\"tp_pub_type tp_  inproceedings\">Proceedings Article<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_in\">In: <\/span><span class=\"tp_pub_additional_booktitle\">2024 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS), <\/span><span class=\"tp_pub_additional_pages\">pp. 2153-0866, <\/span><span class=\"tp_pub_additional_publisher\">IEEE, <\/span><span class=\"tp_pub_additional_address\">Abu Dhabi, United Arab Emirates, <\/span><span class=\"tp_pub_additional_year\">2024<\/span>, <span class=\"tp_pub_additional_isbn\">ISBN: 979-8-3503-7770-5<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_abstract_link\"><a id=\"tp_abstract_sh_100\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('100','tp_abstract')\" title=\"Show abstract\" style=\"cursor:pointer;\">Abstract<\/a><\/span> | <span class=\"tp_resource_link\"><a id=\"tp_links_sh_100\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('100','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_100\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('100','tp_bibtex')\" title=\"Show BibTeX entry\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_100\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@inproceedings{acerbo24drividoc,<br \/>\r\ntitle = {Driving from Vision through Differentiable Optimal Control},<br \/>\r\nauthor = {Flavia Sofia Acerbo and Jan Swevers and Tinne Tuytelaars and Tong Duy Son},<br \/>\r\nurl = {https:\/\/doi.org\/10.48550\/arXiv.2403.15102<br \/>\r\n},<br \/>\r\ndoi = {10.1109\/IROS58592.2024.10802306},<br \/>\r\nisbn = {979-8-3503-7770-5},<br \/>\r\nyear  = {2024},<br \/>\r\ndate = {2024-10-01},<br \/>\r\nbooktitle = {2024 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS)},<br \/>\r\npages = {2153-0866},<br \/>\r\npublisher = {IEEE},<br \/>\r\naddress = {Abu Dhabi, United Arab Emirates},<br \/>\r\nabstract = {This paper proposes DriViDOC: a framework for Driving from Vision through Differentiable Optimal Control, and its application to learn autonomous driving controllers from human demonstrations. DriViDOC combines the automatic inference of relevant features from camera frames with the properties of nonlinear model predictive control (NMPC), such as constraint satisfaction. Our approach leverages the differentiability of parametric NMPC, allowing for end-to-end learning of the driving model from images to control. The model is trained on an offline dataset comprising various human demonstrations collected on a motion-base driving simulator. During online testing, the model demonstrates successful imitation of different driving styles, and the interpreted NMPC parameters provide insights into the achievement of specific driving behaviors. Our experimental results show that DriViDOC outperforms other methods involving NMPC and neural networks, exhibiting an average improvement of 20% in imitation scores.},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {inproceedings}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('100','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_abstract\" id=\"tp_abstract_100\" style=\"display:none;\"><div class=\"tp_abstract_entry\">This paper proposes DriViDOC: a framework for Driving from Vision through Differentiable Optimal Control, and its application to learn autonomous driving controllers from human demonstrations. DriViDOC combines the automatic inference of relevant features from camera frames with the properties of nonlinear model predictive control (NMPC), such as constraint satisfaction. Our approach leverages the differentiability of parametric NMPC, allowing for end-to-end learning of the driving model from images to control. The model is trained on an offline dataset comprising various human demonstrations collected on a motion-base driving simulator. During online testing, the model demonstrates successful imitation of different driving styles, and the interpreted NMPC parameters provide insights into the achievement of specific driving behaviors. Our experimental results show that DriViDOC outperforms other methods involving NMPC and neural networks, exhibiting an average improvement of 20% in imitation scores.<\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('100','tp_abstract')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_100\" 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:\/\/doi.org\/10.48550\/arXiv.2403.15102\" title=\"https:\/\/doi.org\/10.48550\/arXiv.2403.15102\" target=\"_blank\">https:\/\/doi.org\/10.48550\/arXiv.2403.15102<\/a><\/li><li><i class=\"ai ai-doi\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/dx.doi.org\/10.1109\/IROS58592.2024.10802306\" title=\"Follow DOI:10.1109\/IROS58592.2024.10802306\" target=\"_blank\">doi:10.1109\/IROS58592.2024.10802306<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('100','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><\/div><div class=\"tablenav\"><div class=\"tablenav-pages\"><span class=\"displaying-num\">115 entries<\/span> <a class=\"page-numbers button disabled\">&laquo;<\/a> <a class=\"page-numbers button disabled\">&lsaquo;<\/a> 1 of 6 <a href=\"https:\/\/elo-x.eu\/?page_id=159&amp;limit=2&amp;tgid=&amp;yr=&amp;type=&amp;usr=&amp;auth=&amp;tsr=\" title=\"next page\" class=\"page-numbers button\">&rsaquo;<\/a> <a href=\"https:\/\/elo-x.eu\/?page_id=159&amp;limit=6&amp;tgid=&amp;yr=&amp;type=&amp;usr=&amp;auth=&amp;tsr=\" title=\"last page\" class=\"page-numbers button\">&raquo;<\/a> <\/div><\/div><\/div>\n<\/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>\n\t\t","protected":false},"excerpt":{"rendered":"<p>Publications<\/p>\n","protected":false},"author":2,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-159","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/elo-x.eu\/index.php?rest_route=\/wp\/v2\/pages\/159","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/elo-x.eu\/index.php?rest_route=\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/elo-x.eu\/index.php?rest_route=\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/elo-x.eu\/index.php?rest_route=\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/elo-x.eu\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=159"}],"version-history":[{"count":13,"href":"https:\/\/elo-x.eu\/index.php?rest_route=\/wp\/v2\/pages\/159\/revisions"}],"predecessor-version":[{"id":284,"href":"https:\/\/elo-x.eu\/index.php?rest_route=\/wp\/v2\/pages\/159\/revisions\/284"}],"wp:attachment":[{"href":"https:\/\/elo-x.eu\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=159"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}