866 search results - page 99 / 174 » On Dynamic Shortest Paths Problems |
ICRA
2002
IEEE
14 years 3 months ago
2002
IEEE
In this paper we present an approach to obstacle avoidance and local path planning for polygonal robots. It decomposes the task into a model stage and a planning stage. The model ...
ICRA
2007
IEEE
14 years 4 months ago
2007
IEEE
— We present a sampling-based path planning and replanning algorithm that produces anytime solutions. Our algorithm tunes the quality of its result based on available search time...
ICRA
2006
IEEE
14 years 4 months ago
2006
IEEE
— We study the problem of generating continuous steering control for robots to completely cover a bounded region over a finite time. First, we pack the area by disks of minimum ...
IEEEPACT
1998
IEEE
14 years 2 months ago
1998
IEEE
Conventional speculative architectures use branch prediction to evaluate the most likely execution path during program execution. However, certain branches are difficult to predic...
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
In order to allow sufficient amount of light into the image sensor, videos captured in poor lighting conditions typically have low frame rate and frame exposure time equals to in...