696 search results - page 80 / 140 » Planning for Network-Aware Paths |
93
Voted
IPPS
1998
IEEE
15 years 5 months ago
1998
IEEE
Abstract. Finding paths in high-dimensional gemetric spaces is a provably hard problem. Recently, a general randomized planning scheme has emerged as an e ective approach to solve ...
79
Voted
AAAI
2010
15 years 2 months ago
2010
We consider the stochastic variant of the Canadian Traveler's Problem, a path planning problem where adverse weather can cause some roads to be untraversable. The agent does ...
98
Voted
NIPS
1993
15 years 2 months ago
1993
Parti-game is a new algorithm for learning feasible trajectories to goal regions in high dimensionalcontinuousstate-spaces. In high dimensions it is essential that learningdoes not...
131
Voted
AROBOTS
2011
14 years 7 months ago
2011
Abstract— Many applications require teams of robots to cooperatively execute complex tasks. Among these domains are those where successful coordination solutions must respect con...
190
click to vote
ICDE
2007
IEEE
16 years 2 months ago
2007
IEEE
There has been a great deal of work in recent years on processing and optimizing queries against XML data. Typically in these previous works, schema information is not considered,...