Pebble motion problems

#	Item
1	Pebbles in Motion Polynomial Algorithms for Multi-Agent Path Planning Problems Supervisor: Author: Add to Reading List Source URL: ai.cs.unibas.ch Language: English - Date: 2013-01-07 17:29:29 Automated planning and scheduling Pebble motion problems Tree decomposition Algorithm Graph pebbling Graph coloring Graph theory Mathematics Theoretical computer science
2	Planning Optimal Paths for Multiple Robots on Graphs Jingjin Yu Steven M. LaValle Abstract— In this paper, we study the problem of optimal Add to Reading List Source URL: msl.cs.uiuc.edu Language: English - Date: 2014-02-07 08:36:04 NP-complete problems Operations research Network theory Maximum flow problem Network flow Shortest path problem Linear programming Pebble motion problems Optimization problem Mathematics Theoretical computer science Computational complexity theory
3	IEEE TRANSACTIONS ON ROBOTICS 1 Evaluating Network Rigidity in Realistic Systems: Decentralization, Asynchronicity, and Parallelization Add to Reading List Source URL: robotics.usc.edu Language: English - Date: 2014-04-15 18:27:27 Graph theory Graph Connectivity Pebble game Routing algorithms Pebble motion problems Mathematics Theoretical computer science Combinatorics