2 search results - page 1 / 1 » Exact Pareto-Optimal Coordination of Two Translating Polygon... |
CCCG
2008
13 years 9 months ago
2008
We consider planning optimal collision-free motions of two polygonal robots under translation. Each robot has a reference point that must lie on a given graph, called a roadmap, w...
ALGOSENSORS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We consider the problem of counting the number of indistinguishable targets using a simple binary sensing model. Our setting includes an unknown number of point targets i...