Teams of robots in additive manufacturing: a review
Additive manufacturing (AM) is a key enabler and technological pillar of the fourth industrial
revolution (Industry 4.0) as it increases productivity and improves resource efficiency …
revolution (Industry 4.0) as it increases productivity and improves resource efficiency …
[PDF][PDF] Research challenges and opportunities in multi-agent path finding and multi-agent pickup and delivery problems
Recent years have shown a large increase in applications and research of problems that
include moving a fleet of physical robots. One particular application that is currently a multi …
include moving a fleet of physical robots. One particular application that is currently a multi …
Optimal multirobot path planning on graphs: Complete algorithms and effective heuristics
J Yu, SM LaValle - IEEE Transactions on Robotics, 2016 - ieeexplore.ieee.org
We study optimal multirobot path planning on graphs (MPP) over four minimization
objectives: the makespan (last arrival time), the maximum (single-robot traveled) distance …
objectives: the makespan (last arrival time), the maximum (single-robot traveled) distance …
[HTML][HTML] Subdimensional expansion for multirobot path planning
Planning optimal paths for large numbers of robots is computationally expensive. In this
paper, we introduce a new framework for multirobot path planning called subdimensional …
paper, we introduce a new framework for multirobot path planning called subdimensional …
Long-horizon multi-robot rearrangement planning for construction assembly
Robotic construction assembly planning aims to find feasible assembly sequences as well
as the corresponding robot-paths and can be seen as a special case of task and motion …
as the corresponding robot-paths and can be seen as a special case of task and motion …
Group-based distributed auction algorithms for multi-robot task assignment
This paper studies the multi-robot task assignment problem in which a fleet of dispersed
robots needs to efficiently transport a set of dynamically appearing packages from their initial …
robots needs to efficiently transport a set of dynamically appearing packages from their initial …
M*: A complete multirobot path planning algorithm with performance bounds
Multirobot path planning is difficult because the full configuration space of the system grows
exponentially with the number of robots. Planning in the joint configuration space of a set of …
exponentially with the number of robots. Planning in the joint configuration space of a set of …
Planning optimal paths for multiple robots on graphs
J Yu, SM LaValle - 2013 IEEE International Conference on …, 2013 - ieeexplore.ieee.org
In this paper, we study the problem of optimal multi-robot path planning (MPP) on graphs.
We propose two multiflow based integer linear programming (ILP) models that compute …
We propose two multiflow based integer linear programming (ILP) models that compute …
[PDF][PDF] Push and swap: Fast cooperative path-finding with completeness guarantees
Cooperative path-finding can be abstracted as computing non-colliding paths for multiple
agents between their start and goal locations on a graph. This paper proposes a fast …
agents between their start and goal locations on a graph. This paper proposes a fast …
Multi-agent path planning and network flow
J Yu, SM LaValle - Algorithmic Foundations of Robotics X: Proceedings of …, 2013 - Springer
This paper connects multi-agent path planning on graphs (roadmaps) to network flow
problems, showing that the former can be reduced to the latter, therefore enabling the …
problems, showing that the former can be reduced to the latter, therefore enabling the …