Back to Results
First PageMeta Content
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

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


Open Document

File Size: 272,68 KB

Share Result on Facebook

City

Urbana / New York / /

Company

3SAT / Cyberphysical Systems / /

/

Facility

Computer Engineering University of Illinois / Computer Science University of Illinois / Massachusetts Institute of Technology / /

IndustryTerm

distance optimal solution / finding time optimal solutions / transportation / polynomial time optimal solutions / arbitrary solution / time optimal solution / minimum total distance solution / minimum makespan solution / feasible solutions / /

Organization

University of Illinois / National Science Foundation / Laboratory for Computer Science / Association for the Advancement / Massachusetts Institute of Technology / Graphs∗ Jingjin Yu Steven M. LaValle Department of Electrical / /

Person

Sam Loyd / /

/

Position

xm pm / Prime Minister / c2 pm / natural model for multi-robot path planning / left end / /

ProvinceOrState

Illinois / Massachusetts / /

PublishedMedium

American Journal of Mathematics / Journal of Symbolic Computation / Journal of Artificial Intelligence Research / /

Technology

artificial intelligence / /

URL

www.aaai.org / /

SocialTag