Name
Abstract | ||
|---|---|---|
We consider the following motion-planning problem: we are given \mbim unit discs in a simple polygon with \mbin vertices, each at their own start position, and we want to move the discs to a given set of \mbim target positions. Contrary to the standard (labeled) version of the problem, each disc is allowed to be moved to any target position, as long as in the end every target position is occupied.... |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/TASE.2015.2470096 | IEEE Transactions on Automation Science and Engineering |
Keywords | DocType | Volume |
Collision avoidance,Motion planning,Multi-robot systems,Computational geometry | Journal | 12 |
Issue | ISSN | Citations |
4 | 1545-5955 | 8 |
PageRank | References | Authors |
0.55 | 29 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Aviv Adler | 1 | 10 | 1.99 |
| Mark De Berg | 2 | 1497 | 153.24 |
| Dan Halperin | 3 | 1291 | 105.20 |
| Kiril Solovey | 4 | 71 | 10.30 |