1986 search results - page 87 / 398 » Path Separability of Graphs |
111
Voted
ICRA
2006
IEEE
15 years 8 months ago
2006
IEEE
— Mobile robot localization and navigation requires a map - the robot’s internal representation of the environment. A common problem is that path planning becomes very ineffic...
AIPS
2000
15 years 3 months ago
2000
Classical propositional STRIPSplanning is nothing but the searchfor a path in the state-transition graph induced by the operators in the planning problem. Whatmakes the problem ha...
117
click to vote
APPROX
2010
Springer
15 years 3 months ago
2010
Springer
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...
102
click to vote
AAAI
2004
15 years 3 months ago
2004
In this paper we introduce and study Shortest Path Discovery (SPD) problems, a generalization of shortest path problems: In SPD one is given a directed edgeweighted graph and the ...
122
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
We present a general framework to model strategic aspects and stable and fair resource allocations in networks via variants and generalizations of path coalitional games. In these ...