33 citations · 215 across the 36 of their papers we have counts for
5 papers · 1 filter
Pebble Motion on Graphs with Rotations: Efficient Feasibility Tests and Planning Algorithms
Jingjin Yu, Daniela Rus
We study the problem of planning paths for distinguishable pebbles (robots) residing on the vertices of an -vertex connected graph with . A pebble may move from a v…
Shortest Path Set Induced Vertex Ordering and its Application to Distributed Distance Optimal Multi-agent Formation Path Planning
Jingjin Yu
For the task of moving a group of indistinguishable agents on a connected graph with unit edge lengths into an arbitrary goal formation, it was previously shown that distance optim…
Multi-agent Path Planning and Network Flow
Jingjin Yu, Steven M. LaValle
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 applicatio…
Planning Optimal Paths for Multiple Robots on Graphs
Jingjin Yu, Steven M. LaValle
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 computes minim…
Distance Optimal Formation Control on Graphs with a Tight Convergence Time Guarantee
Jingjin Yu, Steven M. LaValle
For the task of moving a set of indistinguishable agents on a connected graph with unit edge distance to an arbitrary set of goal vertices, free of collisions, we propose a fast di…