Back to Results
First PageMeta Content
Routing algorithms / Network theory / Shortest path problem / Distance / Matching / Edge disjoint shortest pair algorithm / Hopcroft–Karp algorithm / Mathematics / Graph theory / Theoretical computer science


Shortest Path Set Induced Vertex Ordering and its Application to Distributed Distance Optimal Formation Path Planning and Control on Graphs Jingjin Yu Steven M. LaValle
Add to Reading List

Document Date: 2014-02-07 08:36:04

Open Document

File Size: 318,88 KB

Share Result on Facebook

City

Berlin / Cambridge / O RDERING / Urbana / /

Company

J. Lin A. S. / SIAM Journal / ACM/Springer Mobile Networks / Autonomous Systems / Vertex / Cyberphysical Systems / Artificial Intelligence Laboratory / /

Country

United States / /

/

Facility

University of Illinois / Massachusetts Institute of Technology / /

IndustryTerm

resolution complete algorithm / natural scheduling algorithm / local communication protocol / multiagent systems / multi-agent systems / wireless communication capabilities / multi-agent formation path planning algorithm / real world applications / multi-agent networks / large / communication protocol / distributed planning algorithm / distributed scheduling algorithm / mobile robot networks / overall algorithm / graph network / memoryless point convergence algorithm / algorithmic solutions / /

Organization

University of Illinois / National Science Foundation / Department of Computer Science / Massachusetts Institute of Technology / /

Person

Steven M. LaValle / /

/

ProvinceOrState

Illinois / Massachusetts / /

Technology

LAN / local communication protocol / overall algorithm / Java / 11 Algorithm / partially distributed scheduling algorithm / multi-agent formation path planning algorithm / distributed planning algorithm / 10 Algorithm / communication protocol / natural scheduling algorithm / Distributed memoryless point convergence algorithm / simulation / scheduling algorithm / distributed scheduling algorithm / /

URL

http /

SocialTag