Back to Results
First PageMeta Content
Theoretical computer science / Mathematical optimization / Network theory / Operations research / Motion planning / Shortest path problem / Visibility graph / Dynamic programming / Pareto efficiency / Mathematics / Applied mathematics / Graph theory


CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Exact Pareto-Optimal Coordination of Two Translating Polygonal Robots on a Cyclic Roadmap Hamidreza Chitsaz∗
Add to Reading List

Document Date: 2008-10-29 00:00:23

Open Document

File Size: 207,61 KB

Share Result on Facebook

City

New Orleans / Berlin / Osaka / New York / /

Country

Japan / /

/

Facility

University of South Carolina / University of Illinois / /

IndustryTerm

approximation algorithm / feasible solution / shortest path algorithm / car-like robots / travel time / shortest path algorithms / coordination algorithm / acyclic algorithm / /

Organization

University of Illinois / University of South Carolina / National Science Foundation / Department of Computer Science / Department of Computer Science and Engineering / /

Person

Jeff Erickson / /

ProvinceOrState

South Carolina / Illinois / Louisiana / New York / /

Technology

acyclic algorithm / 4 Algorithm / approximation algorithm / O. Our algorithm / shortest path algorithm / shortest path algorithms / previous acyclic algorithm / coordination algorithm / CAT / /

SocialTag