var bibbase_data = {"data":"\"Loading..\"\n\n
\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n
\n generated by\n \n \"bibbase.org\"\n\n \n
\n \n\n
\n\n \n\n\n
\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n
\n JavaScript\n (easiest)\n
\n \n <script src=\"https://bibbase.org/show?bib=https%3A%2F%2Fapi.zotero.org%2Fgroups%2F4723267%2Fitems%3Fkey%3D08YweqYIT8pOivc6EEeHdsB6%26q%3DFerranti%26format%3Dbibtex%26sort%3Ddate%26limit%3D1000&theme=default&jsonp=1&owner=Ferranti&filter=&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=https%3A%2F%2Fapi.zotero.org%2Fgroups%2F4723267%2Fitems%3Fkey%3D08YweqYIT8pOivc6EEeHdsB6%26q%3DFerranti%26format%3Dbibtex%26sort%3Ddate%26limit%3D1000&theme=default&jsonp=1&owner=Ferranti&filter=\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=https%3A%2F%2Fapi.zotero.org%2Fgroups%2F4723267%2Fitems%3Fkey%3D08YweqYIT8pOivc6EEeHdsB6%26q%3DFerranti%26format%3Dbibtex%26sort%3Ddate%26limit%3D1000&theme=default&jsonp=1&owner=Ferranti&filter=\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\n
\n\n
\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n
\n\n
\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
  2. \n
  3. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n
  4. \n
\n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n 2024\n \n \n (5)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Active Thruster Fault Diagnosis for an Overactuated Autonomous Surface Vessel.\n \n \n \n\n\n \n Tsolakis, A.; Ferranti, L.; and Reppa, V.\n\n\n \n\n\n\n In 12th IFAC Symposium on Fault Detection, Supervision and Safety for Technical Processes (SafeProcess), Ferrara, Italy, June 2024. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{tsolakis_active_2024,\n\taddress = {Ferrara, Italy},\n\ttitle = {Active {Thruster} {Fault} {Diagnosis} for an {Overactuated} {Autonomous} {Surface} {Vessel}},\n\tabstract = {As Autonomous Surface Vessels (ASVs) become increasingly prevalent in marine applications, ensuring their safe operation, in the presence of faults, is crucial to human safety. This paper presents a scheme that encompasses the detection and isolation of actuator faults within ASVs to ensure uninterrupted and safe operation. The method primarily addresses the loss of thruster effectiveness as a specific actuator fault. For fault detection, the proposed method leverages residuals generated by nonlinear observers, coupled with adaptive thresholds, enhancing fault detection accuracy. The active fault isolation strategy employs actuator redundancy to insulate specific system states from faults by dynamically reconfiguring the actuation configuration in response to detected faults. Comprehensive simulation results demonstrate the effectiveness of this methodology across diverse marine traffic scenarios where the ASV needs to perform a collision avoidance maneuver.},\n\tlanguage = {en},\n\tbooktitle = {12th {IFAC} {Symposium} on {Fault} {Detection}, {Supervision} and {Safety} for {Technical} {Processes} ({SafeProcess})},\n\tauthor = {Tsolakis, A. and Ferranti, L. and Reppa, V.},\n\tmonth = jun,\n\tyear = {2024},\n}\n\n
\n
\n\n\n
\n As Autonomous Surface Vessels (ASVs) become increasingly prevalent in marine applications, ensuring their safe operation, in the presence of faults, is crucial to human safety. This paper presents a scheme that encompasses the detection and isolation of actuator faults within ASVs to ensure uninterrupted and safe operation. The method primarily addresses the loss of thruster effectiveness as a specific actuator fault. For fault detection, the proposed method leverages residuals generated by nonlinear observers, coupled with adaptive thresholds, enhancing fault detection accuracy. The active fault isolation strategy employs actuator redundancy to insulate specific system states from faults by dynamically reconfiguring the actuation configuration in response to detected faults. Comprehensive simulation results demonstrate the effectiveness of this methodology across diverse marine traffic scenarios where the ASV needs to perform a collision avoidance maneuver.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Model Predictive Trajectory Optimization and Control for Autonomous Surface Vessels Considering Traffic Rules.\n \n \n \n \n\n\n \n Tsolakis, A.; Negenborn, R. R.; Reppa, V.; and Ferranti, L.\n\n\n \n\n\n\n IEEE Transactions on Intelligent Transportation Systems. February 2024.\n \n\n\n\n
\n\n\n\n \n \n \"ModelPaper\n  \n \n \n \"ModelLink\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 18 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{tsolakis_model_2024,\n\ttitle = {Model {Predictive} {Trajectory} {Optimization} and {Control} for {Autonomous} {Surface} {Vessels} {Considering} {Traffic} {Rules}},\n\turl = {paper=https://r2clab.com/wp-content/uploads/2024/01/Tsolakis_TITS_2024.pdf link=https://ieeexplore.ieee.org/document/10433938},\n\tdoi = {10.1109/TITS.2024.3357284},\n\tabstract = {This paper presents a rule-compliant trajectory optimization method for the guidance and control of Autonomous Surface Vessels. The method builds on Model Predictive Contouring Control and incorporates the International Regulations for Preventing Collisions at Sea relevant to motion planning. We use these rules for traffic situation assessment and to derive traffic-related constraints that are inserted in the optimization problem. Our optimization-based approach enables the formalization of abstract verbal expressions, such as traffic rules, and their incorporation in the trajectory optimization algorithm along with the dynamics and other constraints that dictate the system’s evolution over a sufficiently long planning horizon. The ability to plan considering different types of constraints and the system’s dynamics, over a long horizon in a unified manner, leads to a proactive motion planner that mimics rule-compliant maneuvering behavior, suitable for navigation in mixed-traffic environments. The efficacy and scalability of the derived algorithm are validated in different simulation scenarios, including complex traffic situations with multiple Obstacle Vessels.},\n\tlanguage = {en},\n\tjournal = {IEEE Transactions on Intelligent Transportation Systems},\n\tauthor = {Tsolakis, A. and Negenborn, R. R. and Reppa, V. and Ferranti, L.},\n\tmonth = feb,\n\tyear = {2024},\n\tkeywords = {key\\_collision\\_avoidance, key\\_maritime, key\\_motion\\_planning, key\\_mpc},\n}\n\n
\n
\n\n\n
\n This paper presents a rule-compliant trajectory optimization method for the guidance and control of Autonomous Surface Vessels. The method builds on Model Predictive Contouring Control and incorporates the International Regulations for Preventing Collisions at Sea relevant to motion planning. We use these rules for traffic situation assessment and to derive traffic-related constraints that are inserted in the optimization problem. Our optimization-based approach enables the formalization of abstract verbal expressions, such as traffic rules, and their incorporation in the trajectory optimization algorithm along with the dynamics and other constraints that dictate the system’s evolution over a sufficiently long planning horizon. The ability to plan considering different types of constraints and the system’s dynamics, over a long horizon in a unified manner, leads to a proactive motion planner that mimics rule-compliant maneuvering behavior, suitable for navigation in mixed-traffic environments. The efficacy and scalability of the derived algorithm are validated in different simulation scenarios, including complex traffic situations with multiple Obstacle Vessels.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Contingency Games for Multi-Agent Interaction.\n \n \n \n \n\n\n \n Peters, L.; Bajcsy, A.; Chiu, C.; Fridovich-Keil, D.; Laine, F.; Ferranti, L.; and Alonso-Mora, J.\n\n\n \n\n\n\n IEEE Robotics and Automation Letters, 9(3): 2208–2215. March 2024.\n \n\n\n\n
\n\n\n\n \n \n \"ContingencyPaper\n  \n \n \n \"ContingencyWebsite\n  \n \n \n \"ContingencyRA-L\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{peters_contingency_2024,\n\ttitle = {Contingency {Games} for {Multi}-{Agent} {Interaction}},\n\tvolume = {9},\n\tissn = {2377-3766, 2377-3774},\n\turl = {paper=https://arxiv.org/abs/2304.05483 website=https://lasse-peters.net/pub/contingency-games/ RA-L=https://ieeexplore.ieee.org/document/10400882/},\n\tdoi = {10.1109/LRA.2024.3354548},\n\tabstract = {Contingency planning, wherein an agent generates a set of possible plans conditioned on the outcome of an uncertain event, is an increasingly popular way for robots to act under uncertainty. In this work we take a game-theoretic perspective on contingency planning, tailored to multi-agent scenarios in which a robot’s actions impact the decisions of other agents and vice versa. The resulting contingency game allows the robot to efficiently interact with other agents by generating strategic motion plans conditioned on multiple possible intents for other actors in the scene. Contingency games are parameterized via a scalar variable which represents a future time when intent uncertainty will be resolved. By estimating this parameter online, we construct a game-theoretic motion planner that adapts to changing beliefs while anticipating future certainty. We show that existing variants of game-theoretic planning under uncertainty are readily obtained as special cases of contingency games. Through a series of simulated autonomous driving scenarios, we demonstrate that contingency games close the gap between certainty-equivalent games that commit to a single hypothesis and non-contingent multi-hypothesis games that do not account for future uncertainty reduction.},\n\tlanguage = {en},\n\tnumber = {3},\n\turldate = {2024-01-29},\n\tjournal = {IEEE Robotics and Automation Letters},\n\tauthor = {Peters, L. and Bajcsy, A. and Chiu, C.Y. and Fridovich-Keil, D. and Laine, F. and Ferranti, L. and Alonso-Mora, J.},\n\tmonth = mar,\n\tyear = {2024},\n\tpages = {2208--2215},\n}\n\n
\n
\n\n\n
\n Contingency planning, wherein an agent generates a set of possible plans conditioned on the outcome of an uncertain event, is an increasingly popular way for robots to act under uncertainty. In this work we take a game-theoretic perspective on contingency planning, tailored to multi-agent scenarios in which a robot’s actions impact the decisions of other agents and vice versa. The resulting contingency game allows the robot to efficiently interact with other agents by generating strategic motion plans conditioned on multiple possible intents for other actors in the scene. Contingency games are parameterized via a scalar variable which represents a future time when intent uncertainty will be resolved. By estimating this parameter online, we construct a game-theoretic motion planner that adapts to changing beliefs while anticipating future certainty. We show that existing variants of game-theoretic planning under uncertainty are readily obtained as special cases of contingency games. Through a series of simulated autonomous driving scenarios, we demonstrate that contingency games close the gap between certainty-equivalent games that commit to a single hypothesis and non-contingent multi-hypothesis games that do not account for future uncertainty reduction.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Battery Identification with Cubic Spline and Moving Horizon Estimation for Mobile Robots.\n \n \n \n \n\n\n \n Shokri, M.; Lyons, L.; Pequito, S.; and Ferranti, L.\n\n\n \n\n\n\n IEEE Transactions on Control Systems Technology. 2024.\n \n\n\n\n
\n\n\n\n \n \n \"BatteryPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{shokri_battery_2024,\n\ttitle = {Battery {Identification} with {Cubic} {Spline} and {Moving} {Horizon} {Estimation} for {Mobile} {Robots}},\n\turl = {paper=https://r2clab.com/wp-content/uploads/2024/03/Battery_modeling_and_estimation_TCST_2024.pdf},\n\tdoi = {10.1109/TCST.2024.3380950},\n\tabstract = {We propose a novel approach to track the state of charge (SoC) of batteries in mobile robots to improve their capabilities. The batteries’ status is critical to accomplish their mission, but limited battery life can be a challenge. Our methodology focuses on modeling and estimating the SoC of batteries through system identification and fractional-order models. These models are flexible and can adjust to transient responses, allowing for accurate estimation of battery characteristics. Specifically, we use cubic spline interpolation to obtain the open circuit voltage (OCV) and the different resistors of the battery model. To estimate the SoC, we deploy a novel approach based on the moving horizon estimation (MHE) algorithm, which is suitable for handling poor initial estimation and constraints on the battery model. We consider the constraint on the peak discharging current, which can limit the performance of mobile robots in low-battery mode. We validate our approach by applying system identification and MHE to data from a mobile robot. The results show that our method accurately estimates the SoC despite poor initial values, enabling improved performance for mobile robots.},\n\tlanguage = {en},\n\tjournal = {IEEE Transactions on Control Systems Technology},\n\tauthor = {Shokri, M. and Lyons, L. and Pequito, S. and Ferranti, Laura},\n\tyear = {2024},\n}\n\n
\n
\n\n\n
\n We propose a novel approach to track the state of charge (SoC) of batteries in mobile robots to improve their capabilities. The batteries’ status is critical to accomplish their mission, but limited battery life can be a challenge. Our methodology focuses on modeling and estimating the SoC of batteries through system identification and fractional-order models. These models are flexible and can adjust to transient responses, allowing for accurate estimation of battery characteristics. Specifically, we use cubic spline interpolation to obtain the open circuit voltage (OCV) and the different resistors of the battery model. To estimate the SoC, we deploy a novel approach based on the moving horizon estimation (MHE) algorithm, which is suitable for handling poor initial estimation and constraints on the battery model. We consider the constraint on the peak discharging current, which can limit the performance of mobile robots in low-battery mode. We validate our approach by applying system identification and MHE to data from a mobile robot. The results show that our method accurately estimates the SoC despite poor initial values, enabling improved performance for mobile robots.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n DART: A Compact Platform for Autonomous Driving Research.\n \n \n \n \n\n\n \n Lyons, L.; Niesten, T.; and Ferranti, L.\n\n\n \n\n\n\n 2024.\n \n\n\n\n
\n\n\n\n \n \n \"DART:Paper\n  \n \n \n \"DART:Code\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@misc{lyons_dart_2024,\n\ttitle = {{DART}: {A} {Compact} {Platform} for {Autonomous} {Driving} {Research}},\n\turl = {paper=https://arxiv.org/pdf/2402.07602.pdf code=https://github.com/Lorenzo-Lyons/DART},\n\tabstract = {This paper presents the design of a research platform for autonomous driving applications, the Delft’s Autonomous-driving Robotic Testbed (DART). Our goal was to design a small-scale car-like robot equipped with all the hardware needed for on-board navigation and control while keeping it cost-effective and easy to replicate. To develop DART, we built on an existing off-the-shelf model and augmented its sensor suite to improve its capabilities for control and motion planning tasks. We detail the hardware setup and the system identification challenges to derive the vehicle’s models. Furthermore, we present some use cases where we used DART to test different motion planning applications to show the versatility of the platform. Finally, we provide a git repository with all the details to replicate DART, complete with a simulation environment and the data used for system identification.},\n\tlanguage = {en},\n\tauthor = {Lyons, L. and Niesten, T. and Ferranti, L.},\n\tyear = {2024},\n}\n\n
\n
\n\n\n
\n This paper presents the design of a research platform for autonomous driving applications, the Delft’s Autonomous-driving Robotic Testbed (DART). Our goal was to design a small-scale car-like robot equipped with all the hardware needed for on-board navigation and control while keeping it cost-effective and easy to replicate. To develop DART, we built on an existing off-the-shelf model and augmented its sensor suite to improve its capabilities for control and motion planning tasks. We detail the hardware setup and the system identification challenges to derive the vehicle’s models. Furthermore, we present some use cases where we used DART to test different motion planning applications to show the versatility of the platform. Finally, we provide a git repository with all the details to replicate DART, complete with a simulation environment and the data used for system identification.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2023\n \n \n (7)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Rule-Based Lloyd Algorithm for Multi-Robot Motion Planning and Control with Safety and Convergence Guarantees.\n \n \n \n \n\n\n \n Boldrer, M.; Serra-Gomez, A.; Lyons, L.; Alonso-Mora, J.; and Ferranti, L.\n\n\n \n\n\n\n October 2023.\n arXiv:2310.19511 [cs]\n\n\n\n
\n\n\n\n \n \n \"Rule-BasedPaper\n  \n \n \n \"Rule-BasedVideo\n  \n \n \n \"Rule-BasedCode\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 6 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@misc{boldrer_rule-based_2023,\n\ttitle = {Rule-{Based} {Lloyd} {Algorithm} for {Multi}-{Robot} {Motion} {Planning} and {Control} with {Safety} and {Convergence} {Guarantees}},\n\turl = {paper=http://arxiv.org/abs/2310.19511 video=https://www.youtube.com/watch?v=ZCm-KYHxNG4 code=https://github.com/manuelboldrer/RLB},\n\tabstract = {This paper presents a distributed rule-based Lloyd algorithm (RBL) for multi-robot motion planning and control. The main limitations of the basic Loyd-based algorithm (LB) concern deadlock issues and the failure to address dynamic constraints effectively. Our contribution is twofold. First, we show how RBL is able to provide safety and convergence to the goal region without relying on communication between robots, nor neighbors control inputs, nor synchronization between the robots. We considered both case of holonomic and non-holonomic robots with control inputs saturation. Second, we show that the Lloyd-based algorithm (without rules) can be successfully used as a safety layer for learning-based approaches, leading to nonnegligible benefits. We further prove the soundness, reliability, and scalability of RBL through extensive simulations, an updated comparison with the state of the art, and experimental validations on small-scale car-like robots.},\n\tlanguage = {en},\n\turldate = {2023-11-02},\n\tauthor = {Boldrer, M. and Serra-Gomez, A. and Lyons, L. and Alonso-Mora, J. and Ferranti, L.},\n\tmonth = oct,\n\tyear = {2023},\n\tnote = {arXiv:2310.19511 [cs]},\n\tkeywords = {Computer Science - Robotics, key\\_automotive, key\\_collision\\_avoidance, key\\_control, key\\_motion\\_planning, key\\_mpc},\n}\n\n
\n
\n\n\n
\n This paper presents a distributed rule-based Lloyd algorithm (RBL) for multi-robot motion planning and control. The main limitations of the basic Loyd-based algorithm (LB) concern deadlock issues and the failure to address dynamic constraints effectively. Our contribution is twofold. First, we show how RBL is able to provide safety and convergence to the goal region without relying on communication between robots, nor neighbors control inputs, nor synchronization between the robots. We considered both case of holonomic and non-holonomic robots with control inputs saturation. Second, we show that the Lloyd-based algorithm (without rules) can be successfully used as a safety layer for learning-based approaches, leading to nonnegligible benefits. We further prove the soundness, reliability, and scalability of RBL through extensive simulations, an updated comparison with the state of the art, and experimental validations on small-scale car-like robots.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Optimization-based Fault Mitigation for Safe Automated Driving.\n \n \n \n \n\n\n \n Lodder, N,; van der Ploeg, C.; Ferranti, L.; and Silvas, E.\n\n\n \n\n\n\n In IFAC World Congress, Japan, 2023. \n \n\n\n\n
\n\n\n\n \n \n \"Optimization-basedPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{lodder_n_optimization-based_2023,\n\taddress = {Japan},\n\ttitle = {Optimization-based {Fault} {Mitigation} for {Safe} {Automated} {Driving}},\n\turl = {paper=https://arxiv.org/pdf/2303.18165.pdf},\n\tabstract = {With increased developments and interest in cooperative driving and higher levels of automation (SAE level 3+), the need for safety systems that are capable to monitor system health and maintain safe operations in faulty scenarios is increasing. A variety of faults or failures could occur, and there exists a high variety of ways to respond to such events. Once a fault or failure is detected, there is a need to classify its severity and decide on appropriate and safe mitigating actions. To provide a solution to this mitigation challenge, in this paper a functional-safety architecture is proposed and an optimization-based mitigation algorithm is introduced. This algorithm uses nonlinear model predictive control (NMPC) to bring a vehicle, suffering from a severe fault, such as a power steering failure, to a safe-state. The internal model of the NMPC uses the information from the fault detection, isolation and\nidentification to optimize the tracking performance of the controller, showcasing the need of the proposed architecture. Given a string of ACC vehicles, our results demonstrate a variety of tactical decisionmaking approaches that a fault-affected vehicle could employ to manage any faults. Furthermore,\nwe show the potential for improving the safety of the affected vehicle as well as the effect of these approaches on the duration of the manoeuvre.},\n\tbooktitle = {{IFAC} {World} {Congress}},\n\tauthor = {{Lodder, N,} and {van der Ploeg, C.} and {Ferranti, L.} and {Silvas, E.}},\n\tyear = {2023},\n\tkeywords = {key\\_automotive, key\\_control, key\\_fault\\_tolerant, key\\_mpc},\n}\n\n
\n
\n\n\n
\n With increased developments and interest in cooperative driving and higher levels of automation (SAE level 3+), the need for safety systems that are capable to monitor system health and maintain safe operations in faulty scenarios is increasing. A variety of faults or failures could occur, and there exists a high variety of ways to respond to such events. Once a fault or failure is detected, there is a need to classify its severity and decide on appropriate and safe mitigating actions. To provide a solution to this mitigation challenge, in this paper a functional-safety architecture is proposed and an optimization-based mitigation algorithm is introduced. This algorithm uses nonlinear model predictive control (NMPC) to bring a vehicle, suffering from a severe fault, such as a power steering failure, to a safe-state. The internal model of the NMPC uses the information from the fault detection, isolation and identification to optimize the tracking performance of the controller, showcasing the need of the proposed architecture. Given a string of ACC vehicles, our results demonstrate a variety of tactical decisionmaking approaches that a fault-affected vehicle could employ to manage any faults. Furthermore, we show the potential for improving the safety of the affected vehicle as well as the effect of these approaches on the duration of the manoeuvre.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Scenario-Based Motion Planning with Bounded Probability of Collision.\n \n \n \n \n\n\n \n de Groot, O.; Ferranti, L.; Gavrila, D. M.; and Alonso-Mora, J.\n\n\n \n\n\n\n 2023.\n \n\n\n\n
\n\n\n\n \n \n \"Scenario-BasedPaper\n  \n \n \n \"Scenario-BasedVideo\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@misc{de_groot_scenario-based_2023,\n\ttitle = {Scenario-{Based} {Motion} {Planning} with {Bounded} {Probability} of {Collision}},\n\turl = {paper=https://arxiv.org/pdf/2307.01070.pdf video=https://www.youtube.com/watch?v=-rqoTICmEO4},\n\tabstract = {Robots will increasingly operate near humans that introduce uncertainties in the motion planning problem due to their complex nature. Typically, chance constraints are introduced in the planner to optimize performance while guaranteeing probabilistic safety. However, existing methods do not consider the actual probability of collision for the planned trajectory, but rather its marginalization, that is, the independent collision probabilities for each planning step and/or dynamic obstacle, resulting in conservative trajectories. To address this issue, we introduce a novel real-time capable method termed Safe Horizon MPC, that explicitly constrains the joint probability of collision with all obstacles over the duration of the motion plan. This is achieved by reformulating the chance-constrained planning problem using scenario optimization and predictive control. Our method is less conservative than state-of-the-art approaches, applicable to arbitrary probability distributions of the obstacles' trajectories, computationally tractable and scalable. We demonstrate our proposed approach using a mobile robot and an autonomous vehicle in an environment shared with humans},\n\tauthor = {de Groot, O. and Ferranti, L. and Gavrila, D. M. and Alonso-Mora, J.},\n\tyear = {2023},\n\tkeywords = {key\\_collision\\_avoidance, key\\_control, key\\_motion\\_planning, key\\_mpc},\n}\n\n
\n
\n\n\n
\n Robots will increasingly operate near humans that introduce uncertainties in the motion planning problem due to their complex nature. Typically, chance constraints are introduced in the planner to optimize performance while guaranteeing probabilistic safety. However, existing methods do not consider the actual probability of collision for the planned trajectory, but rather its marginalization, that is, the independent collision probabilities for each planning step and/or dynamic obstacle, resulting in conservative trajectories. To address this issue, we introduce a novel real-time capable method termed Safe Horizon MPC, that explicitly constrains the joint probability of collision with all obstacles over the duration of the motion plan. This is achieved by reformulating the chance-constrained planning problem using scenario optimization and predictive control. Our method is less conservative than state-of-the-art approaches, applicable to arbitrary probability distributions of the obstacles' trajectories, computationally tractable and scalable. We demonstrate our proposed approach using a mobile robot and an autonomous vehicle in an environment shared with humans\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Globally Guided Trajectory Planning in Dynamic Environments.\n \n \n \n \n\n\n \n de Groot, O.; Ferranti, L.; Gavrila, D. M.; and Alonso-Mora, J.\n\n\n \n\n\n\n In 2023 IEEE International Conference on Robotics and Automation (ICRA), London, UK, 2023. \n \n\n\n\n
\n\n\n\n \n \n \"GloballyPaper\n  \n \n \n \"GloballyVideo\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{de_groot_o_globally_2023,\n\taddress = {London, UK},\n\ttitle = {Globally {Guided} {Trajectory} {Planning} in {Dynamic} {Environments}},\n\turl = {paper=https://r2clab.com/wp-content/uploads/2023/03/ICRA2023_homotopy-3.pdf video=https://www.youtube.com/watch?v=tkRbsAuSTrA},\n\tabstract = {Navigating mobile robots through environments shared with humans is challenging. From the perspective of the robot, humans are dynamic obstacles that must be avoided. These obstacles make the collision-free space nonconvex, which leads to two distinct passing behaviors per obstacle (passing left or right). For local planners, such as receding-horizon trajectory optimization, each behavior presents a local optimum in which the planner can get stuck. This may result in slow or unsafe motion even when a better plan exists. In this work, we identify trajectories for multiple locally optimal driving\nbehaviors, by considering their topology. This identification is made consistent over successive iterations by propagating the\ntopology information. The most suitable high-level trajectory\nguides a local optimization-based planner, resulting in fast and\nsafe motion plans.We validate the proposed planner on a mobile\nrobot in simulation and real-world experiments.},\n\tbooktitle = {2023 {IEEE} {International} {Conference} on {Robotics} and {Automation} ({ICRA})},\n\tauthor = {{de Groot, O.} and {Ferranti, L.} and {Gavrila, D. M.} and {Alonso-Mora, J.}},\n\tyear = {2023},\n\tkeywords = {key\\_collision\\_avoidance, key\\_motion\\_planning, key\\_mpc},\n}\n\n
\n
\n\n\n
\n Navigating mobile robots through environments shared with humans is challenging. From the perspective of the robot, humans are dynamic obstacles that must be avoided. These obstacles make the collision-free space nonconvex, which leads to two distinct passing behaviors per obstacle (passing left or right). For local planners, such as receding-horizon trajectory optimization, each behavior presents a local optimum in which the planner can get stuck. This may result in slow or unsafe motion even when a better plan exists. In this work, we identify trajectories for multiple locally optimal driving behaviors, by considering their topology. This identification is made consistent over successive iterations by propagating the topology information. The most suitable high-level trajectory guides a local optimization-based planner, resulting in fast and safe motion plans.We validate the proposed planner on a mobile robot in simulation and real-world experiments.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Learning Players' Objectives in Continuous Dynamic Games from Partial State Observations.\n \n \n \n \n\n\n \n Peters, L.; Rubies-Royo, Vicenç; Tomlin, C. J; Ferranti, L.; Alonso-Mora, J.; Stachniss, C.; and Fridovich-Keil, D\n\n\n \n\n\n\n International Journal of Robotics Research. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"LearningPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{peters_l_learning_2023,\n\ttitle = {Learning {Players}' {Objectives} in {Continuous} {Dynamic} {Games} from {Partial} {State} {Observations}},\n\turl = {paper=https://arxiv.org/pdf/2302.01999.pdf},\n\tabstract = {Robots deployed to the real world must be able to interact with other agents in their environment. Dynamic game theory provides a powerful mathematical framework for modeling scenarios in which agents have individual objectives and interactions evolve over time. However, a key limitation of such techniques is that they require a-priori knowledge of all players' objectives. In this work, we address this issue by proposing a novel method for learning players' objectives in continuous dynamic games from noise-corrupted, partial state observations. Our approach learns objectives by coupling the estimation of unknown cost parameters of each player with inference of unobserved states and inputs through Nash equilibrium constraints. By coupling past state estimates with future state predictions, our approach is amenable to simultaneous online learning and prediction in receding horizon fashion. We demonstrate our method in several simulated traffic scenarios in which we recover players' preferences for, e.g., desired travel speed and collision-avoidance behavior. Results show that our method reliably estimates game-theoretic models from noise-corrupted data that closely matches ground-truth objectives, consistently outperforming state-of-the-art approaches.},\n\tjournal = {International Journal of Robotics Research},\n\tauthor = {{Peters, L.} and {Rubies-Royo, Vicenç} and {Tomlin, C. J} and {Ferranti, L.} and {Alonso-Mora, J.} and Stachniss, C. and Fridovich-Keil, D},\n\tyear = {2023},\n}\n\n
\n
\n\n\n
\n Robots deployed to the real world must be able to interact with other agents in their environment. Dynamic game theory provides a powerful mathematical framework for modeling scenarios in which agents have individual objectives and interactions evolve over time. However, a key limitation of such techniques is that they require a-priori knowledge of all players' objectives. In this work, we address this issue by proposing a novel method for learning players' objectives in continuous dynamic games from noise-corrupted, partial state observations. Our approach learns objectives by coupling the estimation of unknown cost parameters of each player with inference of unobserved states and inputs through Nash equilibrium constraints. By coupling past state estimates with future state predictions, our approach is amenable to simultaneous online learning and prediction in receding horizon fashion. We demonstrate our method in several simulated traffic scenarios in which we recover players' preferences for, e.g., desired travel speed and collision-avoidance behavior. Results show that our method reliably estimates game-theoretic models from noise-corrupted data that closely matches ground-truth objectives, consistently outperforming state-of-the-art approaches.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n EValueAction: a proposal for policy evaluation in simulation to support interactive imitation learning.\n \n \n \n \n\n\n \n Sibona, F.; Luijkx, J.; van der Heijden, B.; Ferranti, L.; and Indri, M.\n\n\n \n\n\n\n In IEEE INDIN 2023, 2023. \n \n\n\n\n
\n\n\n\n \n \n \"EValueAction:Paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{sibona_evalueaction_2023,\n\ttitle = {{EValueAction}: a proposal for policy evaluation in simulation to support interactive imitation learning},\n\turl = {paper=https://r2clab.com/wp-content/uploads/2023/06/Paper_EVA_2023_acks.pdf},\n\tabstract = {The up-and-coming concept of Industry 5.0 foresees\nhuman-centric flexible production lines, where collaborative\nrobots support human workforce. In order to allow a seamless\ncollaboration between intelligent robots and human workers,\ndesigning solutions for non-expert users is crucial. Learning from\ndemonstration emerged as the enabling approach to address such\na problem. However, more focus should be put on finding safe\nsolutions which optimize the cost associated with the demonstrations\ncollection process. This paper introduces a preliminary outline\nof a system, namely EValueAction (EVA), designed to assist\nthe human in the process of collecting interactive demonstrations\ntaking advantage of simulation to safely avoid failures. A policy\nis pre-trained with human-demonstrations and, where needed,\nnew informative data are interactively gathered and aggregated\nto iteratively improve the initial policy. A trial case study further\nreinforces the relevance of the work by demonstrating the crucial\nrole of informative demonstrations for generalization.},\n\tbooktitle = {{IEEE} {INDIN} 2023},\n\tauthor = {Sibona, F. and Luijkx, J. and van der Heijden, B. and Ferranti, L. and Indri, M.},\n\tyear = {2023},\n}\n\n
\n
\n\n\n
\n The up-and-coming concept of Industry 5.0 foresees human-centric flexible production lines, where collaborative robots support human workforce. In order to allow a seamless collaboration between intelligent robots and human workers, designing solutions for non-expert users is crucial. Learning from demonstration emerged as the enabling approach to address such a problem. However, more focus should be put on finding safe solutions which optimize the cost associated with the demonstrations collection process. This paper introduces a preliminary outline of a system, namely EValueAction (EVA), designed to assist the human in the process of collecting interactive demonstrations taking advantage of simulation to safely avoid failures. A policy is pre-trained with human-demonstrations and, where needed, new informative data are interactively gathered and aggregated to iteratively improve the initial policy. A trial case study further reinforces the relevance of the work by demonstrating the crucial role of informative demonstrations for generalization.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Curvature-Aware Model Predictive Contouring Control.\n \n \n \n \n\n\n \n Lyons, L.; and Ferranti, L.\n\n\n \n\n\n\n In 2023 IEEE International Conference on Robotics and Automation (ICRA), 2023. \n \n\n\n\n
\n\n\n\n \n \n \"Curvature-AwarePaper\n  \n \n \n \"Curvature-AwareVideo\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 19 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{lyons_l_curvature-aware_2023,\n\ttitle = {Curvature-{Aware} {Model} {Predictive} {Contouring} {Control}},\n\turl = {paper=https://r2clab.com/wp-content/uploads/2023/02/Lyons_ICRA_2023.pdf  video=https://www.youtube.com/watch?v=6-E3I99D2sc},\n\tabstract = {We present a novel Curvature-Aware Model Predictive Contouring Control (CA-MPCC) formulation for mobile\nrobotics motion planning. Our method aims at generalizing\nthe traditional contouring control formulation derived from\nmachining to autonomous driving applications. The proposed\ncontroller is able of handling sharp curvatures in the reference\npath while subject to non-linear constraints, such as lane\nboundaries and dynamic obstacle collision avoidance. Compared to a standard MPCC formulation, our method improves\nthe reliability of the path-following algorithm and simplifies the\ntuning, while preserving real-time capabilities. We validate our\nfindings in both simulations and experiments on a scaled-down\ncar-like robot.},\n\tbooktitle = {2023 {IEEE} {International} {Conference} on {Robotics} and {Automation} ({ICRA})},\n\tauthor = {{Lyons, L.} and {Ferranti, L.}},\n\tyear = {2023},\n\tkeywords = {key\\_automotive, key\\_collision\\_avoidance, key\\_motion\\_planning, key\\_mpc},\n}\n\n
\n
\n\n\n
\n We present a novel Curvature-Aware Model Predictive Contouring Control (CA-MPCC) formulation for mobile robotics motion planning. Our method aims at generalizing the traditional contouring control formulation derived from machining to autonomous driving applications. The proposed controller is able of handling sharp curvatures in the reference path while subject to non-linear constraints, such as lane boundaries and dynamic obstacle collision avoidance. Compared to a standard MPCC formulation, our method improves the reliability of the path-following algorithm and simplifies the tuning, while preserving real-time capabilities. We validate our findings in both simulations and experiments on a scaled-down car-like robot.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2022\n \n \n (5)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n PARTNR: Pick and place Ambiguity Resolving by Trustworthy iNteractive leaRning.\n \n \n \n \n\n\n \n Luijkx, J.; Ajanovic, Z.; Ferranti, L.; and Kober, J.\n\n\n \n\n\n\n In NeurIPS Workshop on Robot Learning, November 2022. \n \n\n\n\n
\n\n\n\n \n \n \"PARTNR:Paper\n  \n \n \n \"PARTNR:Video\n  \n \n \n \"PARTNR:Website\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 5 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{luijkx_j_partnr_2022,\n\ttitle = {{PARTNR}: {Pick} and place {Ambiguity} {Resolving} by {Trustworthy} {iNteractive} {leaRning}},\n\turl = {paper=https://arxiv.org/pdf/2211.08304.pdf, video=https://www.youtube.com/watch?v=q8S2Ua41Lik, website=https://partnr-learn.github.io/},\n\tabstract = {Several recent works show impressive results in mapping language-based human\ncommands and image scene observations to direct robot executable policies (e.g.,\npick and place poses). However, these approaches do not consider the uncertainty\nof the trained policy and simply always execute actions suggested by the current\npolicy as the most probable ones. This makes them vulnerable to domain shift and\ninefficient in the number of required demonstrations. We extend previous works\nand present the PARTNR algorithm that can detect ambiguities in the trained policy\nby analyzing multiple modalities in the pick and place poses using topological\nanalysis. PARTNR employs an adaptive, sensitivity-based, gating function that\ndecides if additional user demonstrations are required. User demonstrations are\naggregated to the dataset and used for subsequent training. In this way, the policy\ncan adapt promptly to domain shift and it can minimize the number of required\ndemonstrations for a well-trained policy. The adaptive threshold enables to achieve\nthe user-acceptable level of ambiguity to execute the policy autonomously and in\nturn, increase the trustworthiness of our system. We demonstrate the performance\nof PARTNR in a table-top pick and place task.},\n\tbooktitle = {{NeurIPS} {Workshop} on {Robot} {Learning}},\n\tauthor = {{Luijkx, J.} and {Ajanovic, Z.} and {Ferranti, L.} and {Kober, J.}},\n\tmonth = nov,\n\tyear = {2022},\n\tkeywords = {key\\_manipulator, key\\_robot\\_learning},\n}\n\n
\n
\n\n\n
\n Several recent works show impressive results in mapping language-based human commands and image scene observations to direct robot executable policies (e.g., pick and place poses). However, these approaches do not consider the uncertainty of the trained policy and simply always execute actions suggested by the current policy as the most probable ones. This makes them vulnerable to domain shift and inefficient in the number of required demonstrations. We extend previous works and present the PARTNR algorithm that can detect ambiguities in the trained policy by analyzing multiple modalities in the pick and place poses using topological analysis. PARTNR employs an adaptive, sensitivity-based, gating function that decides if additional user demonstrations are required. User demonstrations are aggregated to the dataset and used for subsequent training. In this way, the policy can adapt promptly to domain shift and it can minimize the number of required demonstrations for a well-trained policy. The adaptive threshold enables to achieve the user-acceptable level of ambiguity to execute the policy autonomously and in turn, increase the trustworthiness of our system. We demonstrate the performance of PARTNR in a table-top pick and place task.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Time-inverted Kuramoto Model Meets Lissajous Curves: Multi-Robot Persistent Monitoring and Target Detection.\n \n \n \n \n\n\n \n Manuel Boldrer; Lorenzo Lyons; Luigi Palopoli; Daniele Fontanelli; and Laura Ferranti\n\n\n \n\n\n\n IEEE Robotics and Automation Letters. November 2022.\n \n\n\n\n
\n\n\n\n \n \n \"Time-invertedPaper\n  \n \n \n \"Time-invertedVideo\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 17 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{manuel_boldrer_time-inverted_2022,\n\ttitle = {Time-inverted {Kuramoto} {Model} {Meets} {Lissajous} {Curves}: {Multi}-{Robot} {Persistent} {Monitoring} and {Target} {Detection}},\n\turl = {paper=https://r2clab.com/wp-content/uploads/2022/11/Kuramoto_Lissajous_final.pdf video=https://www.youtube.com/watch?v=pMJR5q4jNSs},\n\tabstract = {This work proposes a distributed strategy to achieve\nboth persistent monitoring and target detection in a rectangular\nand obstacle-free environment. Each robot has to repeatedly\nfollow a smooth trajectory and avoid collisions with other robots.\nTo achieve this goal, we rely on the time-inverted Kuramoto\ndynamics and the use of Lissajous curves. We analyze the\nresiliency of the system to perturbations or temporary failures,\nand we validate our approach through both simulations and\nexperiments on real robotic platforms. In the latter, we adopt\nModel Predictive Contouring Control as a low level controller to\nminimize the tracking error while accounting for the robots’\ndynamical constraints and the control inputs saturation. The\nresults obtained in the experiments are in accordance with the\nsimulations},\n\tjournal = {IEEE Robotics and Automation Letters},\n\tauthor = {{Manuel Boldrer} and {Lorenzo Lyons} and {Luigi Palopoli} and {Daniele Fontanelli} and {Laura Ferranti}},\n\tmonth = nov,\n\tyear = {2022},\n\tkeywords = {key\\_automotive, key\\_control, key\\_experiments, key\\_mpc},\n}\n\n
\n
\n\n\n
\n This work proposes a distributed strategy to achieve both persistent monitoring and target detection in a rectangular and obstacle-free environment. Each robot has to repeatedly follow a smooth trajectory and avoid collisions with other robots. To achieve this goal, we rely on the time-inverted Kuramoto dynamics and the use of Lissajous curves. We analyze the resiliency of the system to perturbations or temporary failures, and we validate our approach through both simulations and experiments on real robotic platforms. In the latter, we adopt Model Predictive Contouring Control as a low level controller to minimize the tracking error while accounting for the robots’ dynamical constraints and the control inputs saturation. The results obtained in the experiments are in accordance with the simulations\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Distributed Nonlinear Trajectory Optimization for Multi-robot Motion Planning.\n \n \n \n \n\n\n \n Ferranti, L.; Lyons, L.; Negenborn, R.R.; Keviczky, T.; and Alonso-Mora, J.\n\n\n \n\n\n\n IEEE Transactions on Control Systems Technology. September 2022.\n \n\n\n\n
\n\n\n\n \n \n \"DistributedPaper\n  \n \n \n \"DistributedVideo\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 14 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{ferranti_distributed_2022,\n\ttitle = {Distributed {Nonlinear} {Trajectory} {Optimization} for {Multi}-robot {Motion} {Planning}},\n\turl = {paper=https://r2clab.com/wp-content/uploads/2022/10/tcsc_v2_ferranti-copy-1.pdf video=https://www.youtube.com/watch?v=o2W2OhNf5yc},\n\tdoi = {10.1109/TCST.2022.3211130},\n\tabstract = {This work presents a method for multi-robot\ncoordination based on a novel distributed nonlinear model\npredictive control formulation for trajectory optimization\nand its modified version to mitigate the effects of packet\nlosses and delays in the communication among the robots.\nOur algorithms consider that each robot is equipped with\nan on-board computation unit to solve a local control\nproblem and communicate with neighboring autonomous\nrobots via a wireless network. The difference between the\ntwo proposed methods is in the way the robots exchange\ninformation to coordinate. The information exchange can\noccur in a (i) synchronous or (ii) asynchronous fashion. By\nrelying on the theory of the nonconvex alternating direction\nmethod of multipliers, we show that the proposed solutions\nconverge to a (local) solution of the centralized problem.\nFor both algorithms, the communication exchange\npreserves the safety of the robots, that is, collisions\nwith neighboring autonomous robots are prevented. The\nproposed approaches can be applied to various multi-robot\nscenarios and robot models. In this work, we assess our\nmethods, both in simulation and with experiments, for the\ncoordination of a team of autonomous vehicles in (a) an\nunsupervised intersection crossing and (b) a platooning\nscenarios.},\n\tjournal = {IEEE Transactions on Control Systems Technology},\n\tauthor = {Ferranti, L. and {Lyons, L.} and {Negenborn, R.R.} and {Keviczky, T.} and {Alonso-Mora, J.}},\n\tmonth = sep,\n\tyear = {2022},\n\tkeywords = {key\\_automotive, key\\_co, key\\_collision\\_avoidance, key\\_motion\\_planning, key\\_mpc, key\\_multirobot},\n}\n\n
\n
\n\n\n
\n This work presents a method for multi-robot coordination based on a novel distributed nonlinear model predictive control formulation for trajectory optimization and its modified version to mitigate the effects of packet losses and delays in the communication among the robots. Our algorithms consider that each robot is equipped with an on-board computation unit to solve a local control problem and communicate with neighboring autonomous robots via a wireless network. The difference between the two proposed methods is in the way the robots exchange information to coordinate. The information exchange can occur in a (i) synchronous or (ii) asynchronous fashion. By relying on the theory of the nonconvex alternating direction method of multipliers, we show that the proposed solutions converge to a (local) solution of the centralized problem. For both algorithms, the communication exchange preserves the safety of the robots, that is, collisions with neighboring autonomous robots are prevented. The proposed approaches can be applied to various multi-robot scenarios and robot models. In this work, we assess our methods, both in simulation and with experiments, for the coordination of a team of autonomous vehicles in (a) an unsupervised intersection crossing and (b) a platooning scenarios.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Where to Look Next: Learning Viewpoint Recommendations for Informative Trajectory Planning.\n \n \n \n \n\n\n \n Lodel, M.; Brito, B.; Serra-Gómez, A.; Ferranti, L.; Babuška, R.; and Alonso-Mora, J.\n\n\n \n\n\n\n March 2022.\n Accepted for publication in the Proc. of ICRA 2022\n\n\n\n
\n\n\n\n \n \n \"WherePaper\n  \n \n \n \"WhereVideo\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 14 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@misc{lodel_where_2022,\n\ttitle = {Where to {Look} {Next}: {Learning} {Viewpoint} {Recommendations} for {Informative} {Trajectory} {Planning}},\n\tshorttitle = {Where to {Look} {Next}},\n\turl = {paper=http://arxiv.org/abs/2203.02381 video=https://www.youtube.com/watch?v=qxabfC9I66k},\n\tpublisher = {arXiv},\n\tauthor = {Lodel, M. and Brito, B. and Serra-Gómez, A. and Ferranti, L. and Babuška, R. and Alonso-Mora, J.},\n\tmonth = mar,\n\tyear = {2022},\n\tnote = {Accepted for publication in the Proc. of ICRA 2022},\n\tkeywords = {key\\_drones, key\\_exploration, key\\_mpc, key\\_reinforcement\\_learning, type\\_conference},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Learning Mixed Strategies in Trajectory Games.\n \n \n \n \n\n\n \n Peters, L.; Fridovich-Keil, D.; Ferranti, L.; Stachniss, C.; Alonso-Mora, J.; and Laine, F.\n\n\n \n\n\n\n In Robotics: Science and Systems (RSS), 2022. \n Accepted for publication in the Proc. of RSS 2022\n\n\n\n
\n\n\n\n \n \n \"LearningPaper\n  \n \n \n \"LearningVideo\n  \n \n \n \"LearningWebsite\n  \n \n \n \"LearningTalk\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{peters_learning_2022,\n\ttitle = {Learning {Mixed} {Strategies} in {Trajectory} {Games}},\n\turl = {paper=http://arxiv.org/abs/2205.00291 video=https://www.youtube.com/watch?v=gT52cKH9pvg website=https://lasse-peters.net/pub/lifted-games/ talk=https://www.youtube.com/watch?v=gT52cKH9pvg},\n\tabstract = {In multi-agent settings, game theory is a natural framework for describing the strategic interactions of agents whose objectives depend upon one another’s behavior. Trajectory games capture these complex effects by design. In competitive settings, this makes them a more faithful interaction model than traditional “predict then plan” approaches. However, current game-theoretic planning methods have important limitations. In this work, we propose two main contributions. First, we introduce an offline training phase which reduces the online computational burden of solving trajectory games. Second, we formulate a lifted game which allows players to optimize multiple candidate trajectories in unison and thereby construct more competitive “mixed” strategies. We validate our approach on a number of experiments using the pursuit-evasion game “tag.”},\n\tbooktitle = {Robotics: {Science} and {Systems} ({RSS})},\n\tauthor = {Peters, L. and Fridovich-Keil, D. and Ferranti, L. and Stachniss, C. and Alonso-Mora, J. and Laine, F.},\n\tyear = {2022},\n\tnote = {Accepted for publication in the Proc. of RSS 2022},\n\tkeywords = {key\\_game\\_theory, key\\_multirobot, type\\_conference},\n}\n\n
\n
\n\n\n
\n In multi-agent settings, game theory is a natural framework for describing the strategic interactions of agents whose objectives depend upon one another’s behavior. Trajectory games capture these complex effects by design. In competitive settings, this makes them a more faithful interaction model than traditional “predict then plan” approaches. However, current game-theoretic planning methods have important limitations. In this work, we propose two main contributions. First, we introduce an offline training phase which reduces the online computational burden of solving trajectory games. Second, we formulate a lifted game which allows players to optimize multiple candidate trajectories in unison and thereby construct more competitive “mixed” strategies. We validate our approach on a number of experiments using the pursuit-evasion game “tag.”\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2021\n \n \n (4)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n DeepKoCo: Efficient latent planning with a task-relevant Koopman representation.\n \n \n \n \n\n\n \n van der Heijden, B.; Ferranti, L.; Kober, J.; and Babuska, R.\n\n\n \n\n\n\n In 2021 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pages 183–189, Prague, Czech Republic, September 2021. IEEE\n \n\n\n\n
\n\n\n\n \n \n \"DeepKoCo:Paper\n  \n \n \n \"DeepKoCo:Video\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 6 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{van_der_heijden_deepkoco_2021,\n\taddress = {Prague, Czech Republic},\n\ttitle = {{DeepKoCo}: {Efficient} latent planning with a task-relevant {Koopman} representation},\n\turl = {paper=https://ieeexplore.ieee.org/document/9636408/ video=https://youtu.be/YyopLDu7xIo},\n\tdoi = {10.1109/IROS51168.2021.9636408},\n\tbooktitle = {2021 {IEEE}/{RSJ} {International} {Conference} on {Intelligent} {Robots} and {Systems} ({IROS})},\n\tpublisher = {IEEE},\n\tauthor = {van der Heijden, B. and Ferranti, L. and Kober, J. and Babuska, R.},\n\tmonth = sep,\n\tyear = {2021},\n\tkeywords = {key\\_reinforcement\\_learning, key\\_representation\\_learning, type\\_conference},\n\tpages = {183--189},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Active Safety System for Semi-Autonomous Teleoperated Vehicles.\n \n \n \n \n\n\n \n Saparia, S.; Schimpe, A.; and Ferranti, L.\n\n\n \n\n\n\n In 2021 IEEE Intelligent Vehicles Symposium Workshops (IV Workshops), pages 141–147, Nagoya, Japan, July 2021. IEEE\n \n\n\n\n
\n\n\n\n \n \n \"ActivePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{saparia_active_2021,\n\taddress = {Nagoya, Japan},\n\ttitle = {Active {Safety} {System} for {Semi}-{Autonomous} {Teleoperated} {Vehicles}},\n\turl = {https://ieeexplore.ieee.org/document/9669239/},\n\tdoi = {10.1109/IVWorkshops54471.2021.9669239},\n\tbooktitle = {2021 {IEEE} {Intelligent} {Vehicles} {Symposium} {Workshops} ({IV} {Workshops})},\n\tpublisher = {IEEE},\n\tauthor = {Saparia, S. and Schimpe, A. and Ferranti, L.},\n\tmonth = jul,\n\tyear = {2021},\n\tkeywords = {key\\_automotive, key\\_mpc, key\\_teleoperation, type\\_conference},\n\tpages = {141--147},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Scenario-Based Trajectory Optimization in Uncertain Dynamic Environments.\n \n \n \n \n\n\n \n de Groot, O.; Brito, B.; Ferranti, L.; Gavrila, D. M.; and Alonso-Mora, J.\n\n\n \n\n\n\n IEEE Robotics and Automation Letters, 6(3): 5389–5396. July 2021.\n \n\n\n\n
\n\n\n\n \n \n \"Scenario-BasedPaper\n  \n \n \n \"Scenario-BasedVideo\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 5 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{de_groot_scenario-based_2021,\n\ttitle = {Scenario-{Based} {Trajectory} {Optimization} in {Uncertain} {Dynamic} {Environments}},\n\tvolume = {6},\n\turl = {paper=https://ieeexplore.ieee.org/document/9410362/ video=https://www.youtube.com/watch?v=YONmA4EGmtI},\n\tdoi = {10.1109/LRA.2021.3074866},\n\tnumber = {3},\n\tjournal = {IEEE Robotics and Automation Letters},\n\tauthor = {de Groot, O. and Brito, B. and Ferranti, L. and Gavrila, D. M. and Alonso-Mora, J.},\n\tmonth = jul,\n\tyear = {2021},\n\tkeywords = {key\\_collision\\_avoidance, key\\_motion\\_planning, key\\_mpc, key\\_scenario\\_optimization, type\\_journal},\n\tpages = {5389--5396},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Integrated nonlinear model predictive control for automated driving.\n \n \n \n \n\n\n \n Chowdhri, N.; Ferranti, L.; Iribarren, F. S.; and Shyrokau, B.\n\n\n \n\n\n\n Control Engineering Practice, 106: 104654. January 2021.\n Feature Paper of Control Engineering Practice for June 2022\n\n\n\n
\n\n\n\n \n \n \"IntegratedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{chowdhri_integrated_2021,\n\ttitle = {Integrated nonlinear model predictive control for automated driving},\n\tvolume = {106},\n\turl = {https://linkinghub.elsevier.com/retrieve/pii/S0967066120302240},\n\tdoi = {10.1016/j.conengprac.2020.104654},\n\tlanguage = {en},\n\tjournal = {Control Engineering Practice},\n\tauthor = {Chowdhri, N. and Ferranti, L. and Iribarren, F. S. and Shyrokau, B.},\n\tmonth = jan,\n\tyear = {2021},\n\tnote = {Feature Paper of Control Engineering Practice for June 2022},\n\tkeywords = {key\\_automotive, key\\_evasive, key\\_mpc, type\\_journal},\n\tpages = {104654},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2020\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n A Distributed Multi-Robot Coordination Algorithm for Navigation in Tight Environments.\n \n \n \n \n\n\n \n Firoozi, R.; Ferranti, L.; Zhang, X.; Nejadnik, S.; and Borrelli, F.\n\n\n \n\n\n\n June 2020.\n arXiv:2006.11492 [cs]\n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@misc{firoozi_distributed_2020,\n\ttitle = {A {Distributed} {Multi}-{Robot} {Coordination} {Algorithm} for {Navigation} in {Tight} {Environments}},\n\turl = {http://arxiv.org/abs/2006.11492},\n\tpublisher = {arXiv},\n\tauthor = {Firoozi, R. and Ferranti, L. and Zhang, X. and Nejadnik, S. and Borrelli, F.},\n\tmonth = jun,\n\tyear = {2020},\n\tnote = {arXiv:2006.11492 [cs]},\n\tkeywords = {key\\_collision\\_avoidance, key\\_motion\\_planning, key\\_mpc, key\\_robotics, key\\_splitting, type\\_arxiv},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Survey on Wheel Slip Control Design Strategies, Evaluation and Application to Antilock Braking Systems.\n \n \n \n \n\n\n \n Pretagostini, F.; Ferranti, L.; Berardo, G.; Ivanov, V.; and Shyrokau, B.\n\n\n \n\n\n\n IEEE Access, 8: 10951–10970. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"SurveyPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{pretagostini_survey_2020,\n\ttitle = {Survey on {Wheel} {Slip} {Control} {Design} {Strategies}, {Evaluation} and {Application} to {Antilock} {Braking} {Systems}},\n\tvolume = {8},\n\turl = {https://ieeexplore.ieee.org/document/8955905/},\n\tdoi = {10.1109/ACCESS.2020.2965644},\n\tjournal = {IEEE Access},\n\tauthor = {Pretagostini, F. and Ferranti, L. and Berardo, G. and Ivanov, V. and Shyrokau, B.},\n\tyear = {2020},\n\tkeywords = {key\\_automotive, key\\_control, key\\_mpc, key\\_review, type\\_journal},\n\tpages = {10951--10970},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2019\n \n \n (5)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Fault‐tolerant reference generation for model predictive control with active diagnosis of elevator jamming faults.\n \n \n \n \n\n\n \n Ferranti, L.; Wan, Y.; and Keviczky, T.\n\n\n \n\n\n\n International Journal of Robust and Nonlinear Control, 29(16): 5412–5428. November 2019.\n \n\n\n\n
\n\n\n\n \n \n \"Fault‐tolerantPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{ferranti_faulttolerant_2019,\n\ttitle = {Fault‐tolerant reference generation for model predictive control with active diagnosis of elevator jamming faults},\n\tvolume = {29},\n\turl = {https://onlinelibrary.wiley.com/doi/10.1002/rnc.4063},\n\tdoi = {10.1002/rnc.4063},\n\tlanguage = {en},\n\tnumber = {16},\n\tjournal = {International Journal of Robust and Nonlinear Control},\n\tauthor = {Ferranti, L. and Wan, Y. and Keviczky, T.},\n\tmonth = nov,\n\tyear = {2019},\n\tkeywords = {key\\_aerospace, key\\_fault\\_tolerant, key\\_mpc, type\\_journal},\n\tpages = {5412--5428},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Model Predictive Contouring Control for Collision Avoidance in Unstructured Dynamic Environments.\n \n \n \n \n\n\n \n Brito, B.; Floor, B.; Ferranti, L.; and Alonso-Mora, J.\n\n\n \n\n\n\n IEEE Robotics and Automation Letters, 4(4): 4459–4466. October 2019.\n \n\n\n\n
\n\n\n\n \n \n \"ModelPaper\n  \n \n \n \"ModelVideo\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 7 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{brito_model_2019,\n\ttitle = {Model {Predictive} {Contouring} {Control} for {Collision} {Avoidance} in {Unstructured} {Dynamic} {Environments}},\n\tvolume = {4},\n\turl = {paper=https://ieeexplore.ieee.org/document/8768044/ video=https://www.youtube.com/watch?v=crGTsiiilHo},\n\tdoi = {10.1109/LRA.2019.2929976},\n\tnumber = {4},\n\tjournal = {IEEE Robotics and Automation Letters},\n\tauthor = {Brito, B. and Floor, B. and Ferranti, L. and Alonso-Mora, J.},\n\tmonth = oct,\n\tyear = {2019},\n\tkeywords = {key\\_collision\\_avoidance, key\\_motion\\_planning, key\\_mpc, key\\_robotics, type\\_journal},\n\tpages = {4459--4466},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n SafeVRU: A Research Platform for the Interaction of Self-Driving Vehicles with Vulnerable Road Users.\n \n \n \n \n\n\n \n Ferranti, L.; Brito, B.; Pool, E.; Zheng, Y.; Ensing, R. M.; Happee, R.; Shyrokau, B.; Kooij, J. F. P.; Alonso-Mora, J.; and Gavrila, D. M.\n\n\n \n\n\n\n In 2019 IEEE Intelligent Vehicles Symposium (IV), pages 1660–1666, Paris, France, June 2019. IEEE\n \n\n\n\n
\n\n\n\n \n \n \"SafeVRU:Paper\n  \n \n \n \"SafeVRU:Demo\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{ferranti_safevru_2019,\n\taddress = {Paris, France},\n\ttitle = {{SafeVRU}: {A} {Research} {Platform} for the {Interaction} of {Self}-{Driving} {Vehicles} with {Vulnerable} {Road} {Users}},\n\turl = {paper=https://ieeexplore.ieee.org/document/8813899/ demo=https://www.youtube.com/watch?v=iISdbfPsR9g},\n\tdoi = {10.1109/IVS.2019.8813899},\n\tbooktitle = {2019 {IEEE} {Intelligent} {Vehicles} {Symposium} ({IV})},\n\tpublisher = {IEEE},\n\tauthor = {Ferranti, L. and Brito, B. and Pool, E. and Zheng, Y. and Ensing, R. M. and Happee, R. and Shyrokau, B. and Kooij, J. F. P. and Alonso-Mora, J. and Gavrila, D. M.},\n\tmonth = jun,\n\tyear = {2019},\n\tkeywords = {key\\_automotive, key\\_experiments, key\\_motion\\_planning, key\\_mpc, key\\_perception, type\\_conference},\n\tpages = {1660--1666},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Distributed Multi-Robot Formation Splitting and Merging in Dynamic Environments.\n \n \n \n \n\n\n \n Zhu, H.; Juhl, J.; Ferranti, L.; and Alonso-Mora, J.\n\n\n \n\n\n\n In 2019 International Conference on Robotics and Automation (ICRA), pages 9080–9086, Montreal, QC, Canada, May 2019. IEEE\n Best paper award in Multi-Robot Systems\n\n\n\n
\n\n\n\n \n \n \"DistributedPaper\n  \n \n \n \"DistributedVideo\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{zhu_distributed_2019,\n\taddress = {Montreal, QC, Canada},\n\ttitle = {Distributed {Multi}-{Robot} {Formation} {Splitting} and {Merging} in {Dynamic} {Environments}},\n\turl = {paper=https://ieeexplore.ieee.org/document/8793765/ video=https://www.youtube.com/watch?v=Kx14E98Iqng},\n\tdoi = {10.1109/ICRA.2019.8793765},\n\tbooktitle = {2019 {International} {Conference} on {Robotics} and {Automation} ({ICRA})},\n\tpublisher = {IEEE},\n\tauthor = {Zhu, H. and Juhl, J. and Ferranti, L. and Alonso-Mora, J.},\n\tmonth = may,\n\tyear = {2019},\n\tnote = {Best paper award in Multi-Robot Systems},\n\tkeywords = {key\\_collision\\_avoidance, key\\_formation\\_control, key\\_motion\\_planning, key\\_multirobot, type\\_conference},\n\tpages = {9080--9086},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n SVR-AMA: An Asynchronous Alternating Minimization Algorithm With Variance Reduction for Model Predictive Control Applications.\n \n \n \n \n\n\n \n Ferranti, L.; Pu, Y.; Jones, C. N.; and Keviczky, T.\n\n\n \n\n\n\n IEEE Transactions on Automatic Control, 64(5): 1800–1815. May 2019.\n \n\n\n\n
\n\n\n\n \n \n \"SVR-AMA:Paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{ferranti_svr-ama_2019,\n\ttitle = {{SVR}-{AMA}: {An} {Asynchronous} {Alternating} {Minimization} {Algorithm} {With} {Variance} {Reduction} for {Model} {Predictive} {Control} {Applications}},\n\tvolume = {64},\n\tshorttitle = {{SVR}-{AMA}},\n\turl = {https://ieeexplore.ieee.org/document/8392438/},\n\tdoi = {10.1109/TAC.2018.2849566},\n\tnumber = {5},\n\tjournal = {IEEE Transactions on Automatic Control},\n\tauthor = {Ferranti, L. and Pu, Y. and Jones, C. N. and Keviczky, T.},\n\tmonth = may,\n\tyear = {2019},\n\tkeywords = {key\\_aerospace, key\\_mpc, key\\_splitting, type\\_journal},\n\tpages = {1800--1815},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2018\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Coordination of Multiple Vessels Via Distributed Nonlinear Model Predictive Control.\n \n \n \n \n\n\n \n Ferranti, L.; Negenborn, R. R.; Keviczky, T.; and Alonso-Mora, J.\n\n\n \n\n\n\n In 2018 European Control Conference (ECC), pages 2523–2528, Limassol, June 2018. IEEE\n \n\n\n\n
\n\n\n\n \n \n \"CoordinationPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{ferranti_coordination_2018,\n\taddress = {Limassol},\n\ttitle = {Coordination of {Multiple} {Vessels} {Via} {Distributed} {Nonlinear} {Model} {Predictive} {Control}},\n\turl = {https://ieeexplore.ieee.org/document/8550178/},\n\tdoi = {10.23919/ECC.2018.8550178},\n\tbooktitle = {2018 {European} {Control} {Conference} ({ECC})},\n\tpublisher = {IEEE},\n\tauthor = {Ferranti, L. and Negenborn, R. R. and Keviczky, T. and Alonso-Mora, J.},\n\tmonth = jun,\n\tyear = {2018},\n\tkeywords = {key\\_collision\\_avoidance, key\\_maritime, key\\_motion\\_planning, key\\_multirobot, key\\_splitting, type\\_conference},\n\tpages = {2523--2528},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2017\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Operator-Splitting and Gradient Methods for Real-Time Predictive Flight Control Design.\n \n \n \n \n\n\n \n Ferranti, L.; and Keviczky, T.\n\n\n \n\n\n\n Journal of Guidance, Control, and Dynamics, 40(2): 265–277. February 2017.\n \n\n\n\n
\n\n\n\n \n \n \"Operator-SplittingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{ferranti_operator-splitting_2017,\n\ttitle = {Operator-{Splitting} and {Gradient} {Methods} for {Real}-{Time} {Predictive} {Flight} {Control} {Design}},\n\tvolume = {40},\n\tissn = {0731-5090, 1533-3884},\n\turl = {https://arc.aiaa.org/doi/10.2514/1.G000288},\n\tdoi = {10.2514/1.G000288},\n\tlanguage = {en},\n\tnumber = {2},\n\tjournal = {Journal of Guidance, Control, and Dynamics},\n\tauthor = {Ferranti, L. and Keviczky, T.},\n\tmonth = feb,\n\tyear = {2017},\n\tkeywords = {key\\_aerospace, key\\_mpc, key\\_splitting, type\\_journal},\n\tpages = {265--277},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Online Optimization-Based Predictive Flight Control Using First-Order Methods.\n \n \n \n \n\n\n \n Ferranti, L.\n\n\n \n\n\n\n Ph.D. Thesis, Delft University of Technology, 2017.\n \n\n\n\n
\n\n\n\n \n \n \"OnlinePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@phdthesis{ferranti_online_2017,\n\ttitle = {Online {Optimization}-{Based} {Predictive} {Flight} {Control} {Using} {First}-{Order} {Methods}},\n\turl = {http://resolver.tudelft.nl/uuid:786608c2-38ce-4dbc-97d2-8a26080829ba},\n\tschool = {Delft University of Technology},\n\tauthor = {Ferranti, L.},\n\tyear = {2017},\n\tkeywords = {key\\_aerospace, key\\_dual\\_gradient\\_descent, key\\_mpc, key\\_splitting},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2016\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Constrained LQR using online decomposition techniques.\n \n \n \n \n\n\n \n Ferranti, L.; Stathopoulos, G.; Jones, C. N.; and Keviczky, T.\n\n\n \n\n\n\n In 2016 IEEE 55th Conference on Decision and Control (CDC), pages 2339–2344, Las Vegas, NV, USA, December 2016. IEEE\n \n\n\n\n
\n\n\n\n \n \n \"ConstrainedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{ferranti_constrained_2016,\n\taddress = {Las Vegas, NV, USA},\n\ttitle = {Constrained {LQR} using online decomposition techniques},\n\turl = {http://ieeexplore.ieee.org/document/7798612/},\n\tdoi = {10.1109/CDC.2016.7798612},\n\tbooktitle = {2016 {IEEE} 55th {Conference} on {Decision} and {Control} ({CDC})},\n\tpublisher = {IEEE},\n\tauthor = {Ferranti, L. and Stathopoulos, G. and Jones, C. N. and Keviczky, T.},\n\tmonth = dec,\n\tyear = {2016},\n\tkeywords = {key\\_mpc, key\\_splitting, type\\_conference},\n\tpages = {2339--2344},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Asynchronous splitting design for Model Predictive Control.\n \n \n \n \n\n\n \n Ferranti, L.; Pu, Y.; Jones, C. N.; and Keviczky, T.\n\n\n \n\n\n\n In 2016 IEEE 55th Conference on Decision and Control (CDC), pages 2345–2350, Las Vegas, NV, USA, December 2016. IEEE\n \n\n\n\n
\n\n\n\n \n \n \"AsynchronousPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{ferranti_asynchronous_2016,\n\taddress = {Las Vegas, NV, USA},\n\ttitle = {Asynchronous splitting design for {Model} {Predictive} {Control}},\n\turl = {http://ieeexplore.ieee.org/document/7798613/},\n\tdoi = {10.1109/CDC.2016.7798613},\n\tbooktitle = {2016 {IEEE} 55th {Conference} on {Decision} and {Control} ({CDC})},\n\tpublisher = {IEEE},\n\tauthor = {Ferranti, L. and Pu, Y. and Jones, C. N. and Keviczky, T.},\n\tmonth = dec,\n\tyear = {2016},\n\tkeywords = {key\\_aerospace, key\\_mpc, key\\_splitting, type\\_conference},\n\tpages = {2345--2350},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n MPC design for the longitudinal motion of a passenger aircraft based on operator-splitting and fast-gradient methods.\n \n \n \n \n\n\n \n Ferranti, L.; and Keviczky, T.\n\n\n \n\n\n\n In 2016 European Control Conference (ECC), pages 1562–1567, Aalborg, Denmark, June 2016. IEEE\n \n\n\n\n
\n\n\n\n \n \n \"MPCPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{ferranti_mpc_2016,\n\taddress = {Aalborg, Denmark},\n\ttitle = {{MPC} design for the longitudinal motion of a passenger aircraft based on operator-splitting and fast-gradient methods},\n\turl = {http://ieeexplore.ieee.org/document/7810513/},\n\tdoi = {10.1109/ECC.2016.7810513},\n\tbooktitle = {2016 {European} {Control} {Conference} ({ECC})},\n\tpublisher = {IEEE},\n\tauthor = {Ferranti, Laura and Keviczky, Tamas},\n\tmonth = jun,\n\tyear = {2016},\n\tkeywords = {key\\_aerospace, key\\_dual\\_gradient\\_descent, key\\_mpc, type\\_conference},\n\tpages = {1562--1567},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2015\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n A parallel dual fast gradient method for MPC applications.\n \n \n \n \n\n\n \n Ferranti, L.; and Keviczky, T.\n\n\n \n\n\n\n In 2015 54th IEEE Conference on Decision and Control (CDC), pages 2406–2413, Osaka, December 2015. IEEE\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{ferranti_parallel_2015,\n\taddress = {Osaka},\n\ttitle = {A parallel dual fast gradient method for {MPC} applications},\n\turl = {http://ieeexplore.ieee.org/document/7402568/},\n\tdoi = {10.1109/CDC.2015.7402568},\n\tbooktitle = {2015 54th {IEEE} {Conference} on {Decision} and {Control} ({CDC})},\n\tpublisher = {IEEE},\n\tauthor = {Ferranti, L. and Keviczky, T.},\n\tmonth = dec,\n\tyear = {2015},\n\tkeywords = {key\\_aerospace, key\\_control, key\\_mpc, key\\_splitting, type\\_conference},\n\tpages = {2406--2413},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n An adaptive constraint tightening approach to linear model predictive control based on approximation algorithms for optimization.\n \n \n \n \n\n\n \n Necoara, I.; Ferranti, L.; and Keviczky, T.\n\n\n \n\n\n\n Optimal Control Applications and Methods, 36(5): 648–666. September 2015.\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{necoara_adaptive_2015,\n\ttitle = {An adaptive constraint tightening approach to linear model predictive control based on approximation algorithms for optimization},\n\tvolume = {36},\n\tissn = {01432087},\n\turl = {https://onlinelibrary.wiley.com/doi/10.1002/oca.2121},\n\tdoi = {10.1002/oca.2121},\n\tnumber = {5},\n\tjournal = {Optimal Control Applications and Methods},\n\tauthor = {Necoara, Ion and Ferranti, Laura and Keviczky, Tamás},\n\tmonth = sep,\n\tyear = {2015},\n\tkeywords = {key\\_aerospace, key\\_dual\\_gradient\\_descent, key\\_mpc, type\\_journal},\n\tpages = {648--666},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Predictive Flight Control with Active Diagnosis and Reconfiguration for Actuator Jamming.\n \n \n \n \n\n\n \n Ferranti, L.; Wan, Y.; and Keviczky, T.\n\n\n \n\n\n\n IFAC-PapersOnLine, 48(23): 166–171. 2015.\n \n\n\n\n
\n\n\n\n \n \n \"PredictivePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{ferranti_predictive_2015,\n\ttitle = {Predictive {Flight} {Control} with {Active} {Diagnosis} and {Reconfiguration} for {Actuator} {Jamming}},\n\tvolume = {48},\n\turl = {https://linkinghub.elsevier.com/retrieve/pii/S2405896315025628},\n\tdoi = {10.1016/j.ifacol.2015.11.278},\n\tlanguage = {en},\n\tnumber = {23},\n\tjournal = {IFAC-PapersOnLine},\n\tauthor = {Ferranti, L. and Wan, Y. and Keviczky, T.},\n\tyear = {2015},\n\tkeywords = {key\\_aerospace, key\\_fault\\_tolerant, key\\_mpc, type\\_conference},\n\tpages = {166--171},\n}\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n\n\n \n\n \n \n \n \n\n
\n"}; document.write(bibbase_data.data);