154 search results - page 1 / 31 » Anytime search in dynamic graphs |
AI
2008
Springer
13 years 4 months ago
2008
Springer
ICRA
2007
IEEE
13 years 11 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...
UAI
2004
13 years 6 months ago
2004
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
ESOA
2006
13 years 8 months ago
2006
Hierarchical clustering is used widely to organize data and search for patterns. Previous algorithms assume that the body of data being clustered is fixed while the algorithm runs...
ICRA
2006
IEEE
13 years 10 months ago
2006
IEEE
Abstract— Probabilistic roadmaps (PRM) have been demonstrated to be very promising for planning paths for robots with high degrees of freedom in complex 3D workspaces. In this pa...