33 citations · 215 across the 36 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2013★ 12 cited
A Linear Time Algorithm for the Feasibility of Pebble Motion on Graphs
Jingjin Yu
Given a connected, undirected, simple graph and pebbles labeled , a configuration of these pebbles is an injective map assigning the pebbles…
cs.DS2012★ 1 cited
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…
cs.DS2012★ 27 cited
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…