Computing pareto optimal coordinations on roadmaps

Robert Ghrist, Jason M. O'Kane, Steven M. LaValle
International Journal of Robotics Research
24(11):997-1010
November 2005

Abstract

We consider coordination of multiple robots in a common environment, each robot having its own (distinct) roadmap. Our primary contribution is a classification of and exact algorithm for computing vector-valued -- or Pareto -- optima for collision-free coordination. We indicate the utility of new geometric techniques from CAT(0) geometry and give an argument that curvature bounds are the key distinguishing feature between systems for which the classification is finite and for those in which it is not.

Download

BibTeX

@article{GhrOKaLav05,
  author       = {Robert Ghrist and Jason M. O'Kane and Steven M. LaValle},
  title        = {{Computing pareto optimal coordinations on roadmaps}},
  journal      = {International Journal of Robotics Research},
  volume       = {24},
  month        = {November},
  number       = {11},
  pages        = {997-1010},
  year	       = {2005}
}

O'Kane's home page
O'Kane's publication list

Wed Sep 20 09:19:46 EDT 2017