Pebbles in Motion Polynomial Algorithms for Multi-Agent Path Planning Problems Supervisor: Author: - Automated planning and scheduling - Document - PDFSEARCH.IO

First Page	Meta Content
	Pebbles in Motion Polynomial Algorithms for Multi-Agent Path Planning Problems Supervisor: Author: Add to Reading List Document Date: 2013-01-07 17:29:29 Open Document File Size: 535,41 KB Share Result on Facebook Company Creative Commons / Wilson / / / Facility University of Basel / / IndustryTerm polynomial-time algorithm / / Organization Department of Mathematics and Computer Science / University of Basel / / Person Daniel Kornhauser / Malte Helmert Submitted / Problems Supervisor / / Position central planner / / ProgrammingLanguage R / / Technology 4.3 Algorithms / artificial intelligence / 4.2 Algorithms / Swap algorithm / hardly describing algorithms / polynomial-time algorithm / / SocialTag Automated planning and scheduling Pebble motion problems Tree decomposition Algorithm Graph pebbling Graph coloring Graph theory Mathematics Theoretical computer science

Pebbles in Motion Polynomial Algorithms for Multi-Agent Path Planning Problems Supervisor: Author:Add to Reading List