2796 search results - page 17 / 560 » The coolest path problem |
100
click to vote
ICRA
2010
IEEE
14 years 10 months ago
2010
IEEE
— A central problem of applications dealing with virtual environments is planning a collision-free path for a character. Since environments and their characters are growing more ...
IROS
2006
IEEE
15 years 5 months ago
2006
IEEE
— This paper describes a unique approach of applying a pattern classification technique to robot path planning. A collision-free path connecting a start and a goal point provide...
ICRA
2007
IEEE
15 years 6 months ago
2007
IEEE
— A central problem in robotics is planning a collision-free path for a moving object in an environment with obstacles. Contemporary applications require a path planner that is f...
STOC
2007
ACM
16 years 2 days ago
2007
ACM
In the all-pairs bottleneck paths (APBP) problem (a.k.a. allpairs maximum capacity paths), one is given a directed graph with real non-negative capacities on its edges and is aske...
STACS
2010
Springer
15 years 6 months ago
2010
Springer
Testing whether there is an induced path in a graph spanning k given vertices is already NP-complete in general graphs when k = 3. We show how to solve this problem in polynomial t...