An approximation based approach for dynamic stochastic shortest path problems

被引：0
|
作者：
Zhou Changyin [1 ]
机构：
[1] Shandong Univ Sci & Technol, Coll Informat Sci & Engn, Qingdao, Peoples R China
来源：
THIRD INTERNATIONAL CONFERENCE ON GENETIC AND EVOLUTIONARY COMPUTING | 2009年
关键词：
dynamic stochastic shortest path; approximation approach; convergence; CONVEX FUNCTION; EXPECTATION; NETWORKS;
D O I：
10.1109/WGEC.2009.62
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In this paper the dynamic stochastic shortest path (DSSP) problems is proposed. The bounds for DSSP problems with continuous arc costs is investigated. An approximation based approach to solution of DSSP problems is suggested. The convergence of the approximation approach is proved.
引用
收藏
页码：108 / 111
页数：4
相关论文
共 50 条
  • [1] Shortest path problems on stochastic graphs: a neuro dynamic programming approach
    Baglietto, M
    Battistelli, G
    Vitali, F
    Zoppoli, R
    42ND IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-6, PROCEEDINGS, 2003, : 6187 - 6193
  • [2] Iterative methods for dynamic stochastic shortest path problems
    Cheung, RK
    NAVAL RESEARCH LOGISTICS, 1998, 45 (08) : 769 - 789
  • [3] Regret Bounds for Stochastic Shortest Path Problems with Linear Function Approximation
    Vial, Daniel
    Parulekar, Advait
    Shakkottai, Sanjay
    Srikant, R.
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 162, 2022,
  • [4] The BAO* algorithm for stochastic Shortest Path Problems with Dynamic Learning
    Aksakalli, Vural
    PROCEEDINGS OF THE 46TH IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-14, 2007, : 2460 - 2465
  • [5] Dynamic Project Expediting: A Stochastic Shortest-Path Approach
    Bertazzi, Luca
    Mogre, Riccardo
    Trichakis, Nikolaos
    MANAGEMENT SCIENCE, 2023, : 3748 - 3768
  • [6] Dynamic Project Expediting: A Stochastic Shortest-Path Approach
    Bertazzi, Luca
    Mogre, Riccardo
    Trichakis, Nikolaos
    MANAGEMENT SCIENCE, 2024, 70 (06) : 3748 - 3768
  • [7] Stochastic shortest path problems with recourse
    Polychronopoulos, GH
    Tsitsiklis, JN
    NETWORKS, 1996, 27 (02) : 133 - 143
  • [8] Dynamic shortest path in stochastic dynamic networks
    Azaron, A
    Kianfar, F
    IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY, 2002, 26 (B1): : 93 - 106
  • [9] Dynamic stochastic shortest path algorithm
    Zhang Shui-Jian
    Liu Xue-Jun
    Yang Yang
    ACTA PHYSICA SINICA, 2012, 61 (16)
  • [10] On partially observed Stochastic shortest path problems
    Patek, SD
    PROCEEDINGS OF THE 40TH IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-5, 2001, : 5050 - 5055
12345