10 citations · 44 across the 13 of their papers we have counts for
13 papers
An algorithm with improved complexity for pebble motion/multi-agent path finding on trees
Stefano Ardizzoni, Irene Saccani, Luca Consolini +2
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 widel…
Fix and Bound: An efficient approach for solving large-scale quadratic programming problems with box constraints
Marco Locatelli, Veronica Piccialli, Antonio M. Sudoso
In this paper, we propose a branch-and-bound algorithm for solving nonconvex quadratic programming problems with box constraints (BoxQP). Our approach combines existing tools, such…
Constrained Multi-Agent Path Finding on Directed Graphs
Stefano Ardizzoni, Luca Consolini, Marco Locatelli +1
We discuss C-MP and C-MAPF, generalizations of the classical Motion Planning (MP) and Multi-Agent Path Finding (MAPF) problems on a directed graph G. Namely, we enforce an upper bo…
Multi-Agent Path Finding on Strongly Connected Digraphs: feasibility and solution algorithms
Stefano Ardizzoni, Irene Saccani, Luca Consolini +1
On an assigned graph, the problem of Multi-Agent Pathfinding (MAPF) consists in finding paths for multiple agents, avoiding collisions. Finding the minimum-length solution is known…
The Bounded Acceleration Shortest Path problem: complexity and solution algorithms
Stefano Ardizzoni, Luca Consolini, Mattia Laurini +1
The purpose of this work is to introduce and characterize the Bounded Acceleration Shortest Path (BASP) problem, a generalization of the Shortest Path (SP) problem. This problem is…
Sharp and fast bounds for the Celis-Dennis-Tapia problem
Luca Consolini, Marco Locatelli
In the Celis-Dennis-Tapia (CDT) problem a quadratic function is minimized over a region defined by two strictly convex quadratic constraints. In this paper we re-derive a necessary…
KKT-based primal-dual exactness conditions for the Shor relaxation
M. Locatelli
In this work we present some exactness conditions for the Shor relaxation of diagonal QCQPs, which extend the conditions introduced in different recent papers about the same topic.…
Partitioned Least Squares
Roberto Esposito, Mattia Cerrato, Marco Locatelli
In this paper we propose a variant of the linear least squares model allowing practitioners to partition the input features into groups of variables that they require to contribute…
Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems
Giampaolo Liuzzi, Marco Locatelli, Veronica Piccialli +1
In this paper we address game theory problems arising in the context of network security. In traditional game theory problems, given a defender and an attacker, one searches for mi…
A Second-Order Lower Bound for Globally Optimal 2D Registration
Luca Consolini, Mattia Laurini, Marco Locatelli +1
The problem of planar registration consists in finding the transformation that better aligns two point sets. In our setting, the search domain is the set of planar rigid transforma…
Graph-based algorithms for the efficient solution of a class of optimization problems
Luca Consolini, Mattia Laurini, Marco Locatelli
In this paper, we address a class of specially structured problems that include speed planning, for mobile robots and robotic manipulators, and dynamic programming. We develop two…
A solution of the minimum-time velocity planning problem based on lattice theory
Luca Consolini, Mattia Laurini, Marco Locatelli +1
For a vehicle on an assigned path, we find the minimum-time speed law that satisfies kinematic and dynamic constraints, related to maximum speed and maximum tangential and transver…
A fast speed planning algorithm for robotic manipulators
Luca Consolini, Marco Locatelli, Andrea Minari +2
We consider the speed planning problem for a robotic manipulator. In particular, we present an algorithm for finding the time-optimal speed law along an assigned path that satisfie…