25 search results - page 5 / 5 » Shortest path amidst disc obstacles is computable |
ICRA
2009
IEEE
13 years 11 months ago
2009
IEEE
— We consider the problem of tracking multiple agents moving amongst obstacles, using multiple cameras. Given an environment with obstacles, and many people moving through it, we...
WSC
2004
13 years 6 months ago
2004
Routing table storage demands pose a significant obstacle for large-scale network simulation. On-demand computation of routes can alleviate those problems for models that do not r...
SIGMOD
2009
ACM
14 years 5 months ago
2009
ACM
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
CCCG
2008
13 years 6 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...
ICNP
2005
IEEE
13 years 10 months ago
2005
IEEE
Routing in mobile ad hoc networks remains as a challenging problem given the limited wireless bandwidth, users’ mobility and potentially large scale. Recently, there has been a ...