Planning Optimal Paths for Multiple Robots on Graphs Jingjin Yu Steven M. LaValle Abstract— In this paper, we study the problem of optimal

First Page		Document Content
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		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 Download Document from Source Website File Size: 481,58 KB Share Document on Facebook

	Resistive Network Optimal Power Flow: Uniqueness and Algorithms Chee Wei Tan, Senior Member, IEEE, Desmond W. H. Cai, Student Member, IEEE and Xin Lou Abstract—The optimal power flow (OPF) problem minimizes the power l DocID: 1vid6 - View Document
	Introduction Network similarity problem Results Acknowledgements Spectra of the Spike Flow Graphs of Recurrent DocID: 1veQT - View Document
	An Arrow-Hurwicz-Uzawa Type Flow as Least Squares Solver for Network Linear Equations Yang Liu, Christian Lageman, Brian D. O. Anderson, and Guodong Shi∗ arXiv:1701.03908v1 [cs.SY] 14 Jan 2017 DocID: 1uJ5N - View Document
	Pipe Network Hand-in Assignment 1 Flow in Water Pipe Network DocID: 1uInK - View Document
	Inductive Intrusion Detection in Flow-Based Network Data using One-Class Support Vector Machines Philipp Winter DocID: 1uIen - View Document