Structure and Intractability of Optimal Multi-Robot Path Planning on Graphs∗ Jingjin Yu Steven M. LaValle Department of Electrical and Computer Engineering

First Page		Document Content
Date: 2014-02-07 08:36:04 Mathematical optimization Complexity classes Operations research Network theory Shortest path problem Robot Optimization problem Job shop scheduling NP Theoretical computer science Computational complexity theory Applied mathematics		Structure and Intractability of Optimal Multi-Robot Path Planning on Graphs∗ Jingjin Yu Steven M. LaValle Department of Electrical and Computer Engineering Add to Reading List Source URL: msl.cs.uiuc.edu Download Document from Source Website File Size: 272,68 KB Share Document on Facebook

	The Complexity of Safety Stock Placement in General-Network Supply Chains Ekaterina Lesnaia, Iuliu Vasilescu, and Stephen C. Graves MIT Abstract— We consider the optimization problem of safety DocID: 1xThh - View Document
	Deadline-Aware Multipath Communication: An Optimization Problem Laurent Chuat∗ , Adrian Perrig∗ , Yih-Chun Hu† of Computer Science, ETH Zurich, Switzerland † Department of Electrical and Computer Engineering, Uni DocID: 1xTc0 - View Document
	Combined Optimization and Reinforcement Learning for Manipulation Skills Peter Englert and Marc Toussaint Machine Learning & Robotics Lab University of Stuttgart, Germany Abstract—This work addresses the problem of how DocID: 1vjBp - View Document
	The Quadratic Assignment Problem in Code Optimization for a Simple Universal Turing Machine DocID: 1uZDW - View Document
	Formulating an Optimization Problem DocID: 1uSM0 - View Document