473 search results - page 58 / 95 » Computing shortest paths with uncertainty |
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constr...
ICTAI
2000
IEEE
15 years 1 months ago
2000
IEEE
Markov Decision Processes (MDP) have been widely used as a framework for planning under uncertainty. They allow to compute optimal sequences of actions in order to achieve a given...
SIGCOMM
1989
ACM
15 years 1 months ago
1989
ACM
The ARPANBT routing metric wasrevised in July 1987,resulting in substantial performance improvements, especially in terms of user delay and effective network capacity. These revis...
ICRA
2006
IEEE
15 years 3 months ago
2006
IEEE
— We propose a novel solution to the problem of inverse kinematics for redundant robotic manipulators for the purposes of goal selection for path planning. We unify the calculati...
ICRA
2010
IEEE
14 years 8 months ago
2010
IEEE
— Planetary surface exploration rovers must accurately and efficiently predict their mobility on natural, rough terrain. Most approaches to mobility prediction assume precise a p...