Luca Consolini
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Luca Consolini has a total of 83 co-authors. Here are the top co-authors by number of shared publications:
Mario Tosques
Department of Information Engineering, University of Parma, Via Usberti 181/A, 43124, Italy
20 shared publications- Marco Locatelli
Dipartimento di Ingegneria e Architettura, University of Parma, Parma, Italy
18 shared publications - Mattia Laurini
Department of Engineering and Architecture, University of Parma, Parma, Italy
11 shared publications - Mario Tosques
Dipartimento di Ingegneria Civile, Via Usberti 181/A, 43100 Parma, Italy
10 shared publications - Domenico Prattichizzo
University of Siena
9 shared publications Manfredi Maggiore
Department of Electrical and Computer Engineering, University of Toronto, 10 King's College Road, Ontario, M5S 3G4, Canada
9 shared publications
Latest Publications
- Open Access
- 4 November 2026
- Published by Elsevier in Control Engineering Practice
- Vol. 179
Minimum-time anti-sloshing motion planning for an open axisymmetric container transported by a 3-DOF planar motor
- 4 November 2026
- Published by Elsevier in Control Engineering Practice
- Vol. 179
Open AccessMinimum-time anti-sloshing motion planning for an open axisymmetric container transported by a 3-DOF planar motor
- 28 July 2026
- Published by Elsevier in Transportation Research Part A: Policy and Practice
- Vol. 212
Optimizing cycling network design in the city of Parma
- 28 July 2026
- Published by Elsevier in Transportation Research Part A: Policy and Practice
- Vol. 212
Optimizing cycling network design in the city of Parma
- Open Access
- 27 April 2026
- Published by Springer Nature in Journal of Global Optimization
- Vol. 95 (2) , 359-381
Exactness conditions for the dual Lagrangian bound of separable quadratically constrained quadratic programming problems
In this paper we consider nonconvex diagonal Quadratically Constrained Quadratic Programming (QCQP) problems, where at least one constraint is strictly convex. A lower bound for such problems can be computed through a Lagrangian relaxation, where all constraints, except the strictly convex constraint, are moved into the objective function, suitably weighted by a vector of Lagrange multipliers. The search for the best (largest) Lagrangian bound leads to the definition of the dual Lagrangian problem. The aim of this paper is to provide sufficient as well as necessary and sufficient conditions under which exactness of the dual Lagrangian bound (i.e., the equivalence of its optimal value with the optimal value of the original nonconvex problem) is guaranteed. Some of these conditions are based on the solution of linear feasibility problems defined over the space of the Lagrange multipliers, some others on the solution of convex problems over the same space. We specialize the results proved for general diagonal QCQPs to the special case where the constraints are linear, ball and reverse ball constraints, i.e., the Hessian matrices of the constraint quadratic functions are null matrices (linear constraints), identity matrices (ball constraints), and the opposite of identity matrices (reverse ball constraints). We show that in this special case the conditions can be evaluated much more efficiently. Finally, we perform experiments over random instances to identify relevant factors which affect both exactness of the dual Lagrangian bound and the ability of detecting such exactness through the proposed sufficient conditions.
- 27 April 2026
- Published by Springer Nature in Journal of Global Optimization
- Vol. 95 (2) , 359-381
Open AccessExactness conditions for the dual Lagrangian bound of separable quadratically constrained quadratic programming problems
In this paper we consider nonconvex diagonal Quadratically Constrained Quadratic Programming (QCQP) problems, where at least one constraint is strictly convex. A lower bound for such problems can be computed through a Lagrangian relaxation, where all constraints, except the strictly convex constraint, are moved into the objective function, suitably weighted by a vector of Lagrange multipliers. The search for the best (largest) Lagrangian bound leads to the definition of the dual Lagrangian problem. The aim of this paper is to provide sufficient as well as necessary and sufficient conditions under which exactness of the dual Lagrangian bound (i.e., the equivalence of its optimal value with the optimal value of the original nonconvex problem) is guaranteed. Some of these conditions are based on the solution of linear feasibility problems defined over the space of the Lagrange multipliers, some others on the solution of convex problems over the same space. We specialize the results proved for general diagonal QCQPs to the special case where the constraints are linear, ball and reverse ball constraints, i.e., the Hessian matrices of the constraint quadratic functions are null matrices (linear constraints), identity matrices (ball constraints), and the opposite of identity matrices (reverse ball constraints). We show that in this special case the conditions can be evaluated much more efficiently. Finally, we perform experiments over random instances to identify relevant factors which affect both exactness of the dual Lagrangian bound and the ability of detecting such exactness through the proposed sufficient conditions.
- 11 October 2025
- Published by Springer Nature
- p. 169-181
Probabilistic Branch-and-Bound for Clusterwise Linear Regression
- 11 October 2025
- Published by Springer Nature
- p. 169-181
Probabilistic Branch-and-Bound for Clusterwise Linear Regression
- Open Access
- 3 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 745-750
Optimized Feedforward Control for the Co-Administration of Propofol and Remifentanil for Induction of Hypnosis in General Anesthesia
General anesthesia is a crucial component of invasive medical procedures. Our primary focus is the optimization of the simultaneous infusion of propofol and remifentanil during induction. In particular, we compute a feedforward infusion rate that minimizes the time for bringing the Bispectral Index (BIS) value below an assigned threshold, while ensuring that the BIS remains above an assigned minimum value. We consider a two-drug model, that takes into account the synergistic effect of the two drugs. Due to the expression of the Hill function, the constraint of maintaining the BIS in a given interval is non-convex. We propose a convex tightening to formulate the overall optimal control task as a convex optimization problem. Through simulation experiments, we show that this hybrid feedforward-feedback strategy quickly achieves the BIS target, while maintaining safe and clinically acceptable infusion rates.
- 3 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 745-750
Open AccessOptimized Feedforward Control for the Co-Administration of Propofol and Remifentanil for Induction of Hypnosis in General Anesthesia
General anesthesia is a crucial component of invasive medical procedures. Our primary focus is the optimization of the simultaneous infusion of propofol and remifentanil during induction. In particular, we compute a feedforward infusion rate that minimizes the time for bringing the Bispectral Index (BIS) value below an assigned threshold, while ensuring that the BIS remains above an assigned minimum value. We consider a two-drug model, that takes into account the synergistic effect of the two drugs. Due to the expression of the Hill function, the constraint of maintaining the BIS in a given interval is non-convex. We propose a convex tightening to formulate the overall optimal control task as a convex optimization problem. Through simulation experiments, we show that this hybrid feedforward-feedback strategy quickly achieves the BIS target, while maintaining safe and clinically acceptable infusion rates.
- 1 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 21 (4) , 5280-5296
A Dynamic Programming Approach for Cooperative Pallet-Loading Manipulators
- 1 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 21 (4) , 5280-5296
A Dynamic Programming Approach for Cooperative Pallet-Loading Manipulators
- Open Access
- 9 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 8, 580-585
Human-Imitating Control of Depth of Hypnosis Combining MPC and Event-Based PID Strategies
In this paper we propose a human-imitating control methodology for the Depth-of-Hypnosys (DoH) in total intravenous anesthesia (TIVA) where the bispectral index (BIS) is used as process variable. The method suitably combines a move-blocking model predictive controller (MPC) that minimizes the time-to-target when the BIS value is not in the required range and an event-based Proportional-Integral-Derivative (PID) controller that provides a strong filtering action when the DoH is satisfactory. A fast induction is achieved and awareness episodes are avoided with a control action that is piecewise constant so that it mimics the behavior of the anesthesiologist and is more likely to be accepted in the clinical practice.
- 9 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 8, 580-585
Open AccessHuman-Imitating Control of Depth of Hypnosis Combining MPC and Event-Based PID Strategies
In this paper we propose a human-imitating control methodology for the Depth-of-Hypnosys (DoH) in total intravenous anesthesia (TIVA) where the bispectral index (BIS) is used as process variable. The method suitably combines a move-blocking model predictive controller (MPC) that minimizes the time-to-target when the BIS value is not in the required range and an event-based Proportional-Integral-Derivative (PID) controller that provides a strong filtering action when the DoH is satisfactory. A fast induction is achieved and awareness episodes are avoided with a control action that is piecewise constant so that it mimics the behavior of the anesthesiologist and is more likely to be accepted in the clinical practice.
- Open Access
An algorithm with improved complexity for pebble motion/multi-agent path finding on trees
The pebble motion on trees (PMT) problem consists in finding a feasible sequence of moves that repositions a set of pebbles to assigned target vertices. This problem has been widely studied because, in many cases, the more general Multi-Agent path finding (MAPF) problem on graphs can be reduced to PMT. We propose a simple and easy to implement procedure, which finds solutions of length O(knc + n^2), where n is the number of nodes, $k$ is the number of pebbles, and c the maximum length of corridors in the tree. This complexity result is more detailed than the current best known result O(n^3), which is equal to our result in the worst case, but does not capture the dependency on c and k.Open AccessAn algorithm with improved complexity for pebble motion/multi-agent path finding on trees
The pebble motion on trees (PMT) problem consists in finding a feasible sequence of moves that repositions a set of pebbles to assigned target vertices. This problem has been widely studied because, in many cases, the more general Multi-Agent path finding (MAPF) problem on graphs can be reduced to PMT. We propose a simple and easy to implement procedure, which finds solutions of length O(knc + n^2), where n is the number of nodes, $k$ is the number of pebbles, and c the maximum length of corridors in the tree. This complexity result is more detailed than the current best known result O(n^3), which is equal to our result in the worst case, but does not capture the dependency on c and k.