loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (CIMCA'06)
Risk Averse Shortest Path Planning in Uncertain Domains
Sydney Australia
November 28-December 01
ISBN: 0-7695-2731-0
Wilhelm Dangelmaier, University of Paderborn, Germany
Benjamin Klopper, University of Paderborn, Germany
Jens Wienstroer, University of Paderborn, Germany
Andre Doring, University of Paderborn, Germany
Real world problems, e.g. from transport domain, are typically non-deterministic and uncertain. Although there are some approaches, which try to forecast uncertain parameters like travel time, the uncertainty is rarely included in the planning process. In this paper a probabilistic forecasting method for travel time in a railway network is introduced which considers the dependencies between decisions during the planning process. The information provided by forecasting is used to develop a risk averse shortest path algorithm which minimizes the risk of delay.
Citation:
Wilhelm Dangelmaier, Benjamin Klopper, Jens Wienstroer, Andre Doring, "Risk Averse Shortest Path Planning in Uncertain Domains," cimca, pp.115, International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (CIMCA'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.