44 search results - page 1 / 9 » Maximum thick paths in static and dynamic environments |
COMPGEOM
2008
ACM
13 years 7 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
HPDC
1999
IEEE
13 years 9 months ago
1999
IEEE
This paper reports on the architecture and design of Starfish, an environment for executing dynamic (and static) MPI-2 programs on a cluster of workstations. Starfish is unique in ...
ICRA
2006
IEEE
13 years 11 months ago
2006
IEEE
— We present an efficient, anytime method for path planning in dynamic environments. Current approaches to planning in such domains either assume that the environment is static ...
IROS
2006
IEEE
13 years 11 months ago
2006
IEEE
— This paper presents work on sensor-based motion planning in initially unknown dynamic environments. Motion detection and modeling are combined with a smooth navigation function...
ICALP
1998
Springer
13 years 9 months ago
1998
Springer
Interval Routing Schemes (IRS for short) have been extensively investigated in the past years with special emphasis on shortest paths. Besides their theoretical interest, IRS have...