An overview of recent progress in the study of distributed multi-agent coordination
This paper reviews some main results and progress in distributed multi-agent coordination,
focusing on papers published in major control systems and robotics journals since 2006 …
focusing on papers published in major control systems and robotics journals since 2006 …
[PDF][PDF] Distributed Intelligence: Overview of the Field and its Application in Multi-Robot Systems.
LE Parker - AAAI fall symposium: regarding the intelligence in …, 2007 - cdn.aaai.org
This paper introduces the concepts of distributed intelligence, outlining the motivations for
studying this field of research. We then classify common systems of distributed intelligence …
studying this field of research. We then classify common systems of distributed intelligence …
Multiple mobile robot systems
Within the context of multiple mobile, and networked robot systems, this chapter explores the
current state of the art. After a brief introduction, we first examine architectures for multirobot …
current state of the art. After a brief introduction, we first examine architectures for multirobot …
Optimal multirobot path planning on graphs: Complete algorithms and effective heuristics
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 …
[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 …
[HTML][HTML] Priority inheritance with backtracking for iterative multi-agent path finding
Abstract In the Multi-Agent Path Finding (MAPF) problem, a set of agents moving on a graph
must reach their own respective destinations without inter-agent collisions. In practical MAPF …
must reach their own respective destinations without inter-agent collisions. In practical MAPF …
Multi-agent path planning and network flow
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 …
Goal assignment and trajectory planning for large teams of interchangeable robots
Abstract This paper presents Goal Assignment and Planning: a computationally tractable,
complete algorithm for generating dynamically feasible trajectories for NN interchangeable …
complete algorithm for generating dynamically feasible trajectories for NN interchangeable …
Centralized path planning for multiple robots: Optimal decoupling into sequential plans.
We develop an algorithm to decouple a multi-robot path planning problem into subproblems
whose solutions can be executed sequentially. Given an external path planner for general …
whose solutions can be executed sequentially. Given an external path planner for general …
Efficient and complete centralized multi-robot path planning
Multi-robot path planning is abstracted as the problem of computing a set of non-colliding
paths on a graph for multiple robots. A naive search of the composite search space …
paths on a graph for multiple robots. A naive search of the composite search space …