Sciweavers

204 search results - page 26 / 41
» Solving a Dynamic Real-Life Vehicle Routing Problem
Sort
View
IFIPTCS
2010
13 years 6 months ago
A Game-Theoretic Approach to Routing under Adversarial Conditions
Abstract. We present a game-theoretic framework for modeling and solving routing problems in dynamically changing networks. The model covers the aspects of reactivity and non-termi...
James Gross, Frank G. Radmacher, Wolfgang Thomas
TPDS
2008
124views more  TPDS 2008»
13 years 8 months ago
TROP: A Novel Approximate Link-State Dissemination Framework For Dynamic Survivable Routing in MPLS Networks
In this paper, a novel approximate link-state dissemination framework, called TROP, is proposed for shared backup path protection (SBPP) in Multi-Protocol Label Switching (MPLS) ne...
János Tapolcai, Pin-Han Ho, Anwar Haque
OTM
2007
Springer
14 years 2 months ago
A Novel Overlay Network for a Secure Global Home Agent Dynamic Discovery
Mobile IP and Network Mobility are the IETF proposals to obtain mobility. However, both of them have routing limitations, due to the presence of an entity (Home Agent) in the commu...
Ángel Cuevas, Rubén Cuevas Rum&iacut...
ICRA
2007
IEEE
130views Robotics» more  ICRA 2007»
14 years 2 months ago
Greedy but Safe Replanning under Kinodynamic Constraints
— We consider motion planning problems for a vehicle with kinodynamic constraints, where there is partial knowledge about the environment and replanning is required. We present a...
Kostas E. Bekris, Lydia E. Kavraki
AAAI
2008
13 years 11 months ago
An Efficient Motion Planning Algorithm for Stochastic Dynamic Systems with Constraints on Probability of Failure
When controlling dynamic systems, such as mobile robots in uncertain environments, there is a trade off between risk and reward. For example, a race car can turn a corner faster b...
Masahiro Ono, Brian C. Williams