Asynchronous Dynamic Programming

Asynchronous Dynamic Programming is a dynamic programming method that diverges from traditional iterative approaches by updating state values in an arbitrary, non-systematic order without requiring full sweeps over the state space, thereby enabling more flexible and efficient convergence in sequential decision-making problems.

14

Publications

844

Citations

29

Authors

18

Institutions

Publications per year

2017–2026

3

Authors

29

  1. WJ
    Weikuan Jia

    Shandong Normal University, China

    2 publications · 54 citations

    2

    h-index

  2. DP
    Dimitri P. Bertsekas

    Massachusetts Institute of Technology, United States

    2 publications · 249 citations

    2

    h-index

  3. XZ
    Xingyu Zhao

    Tianjin University, China

    2 publications · 54 citations

    2

    h-index

  4. SD
    Shifei Ding

    China University of Mining and Technology, China

    2 publications · 54 citations

    2

    h-index

  5. TS
    Tongfeng Sun

    China University of Mining and Technology, China

    1 publications · 19 citations

    1

    h-index

1–5 of 29

Venues

  1. Applied Intelligence

    2 publications · 54 citations

    2

    h-index

  2. Mathematics of Operations Research

    1 publications · 59 citations

    1

    h-index

  3. 1

    h-index

  4. Neurocomputing

    1 publications · 10 citations

    1

    h-index

  5. UCL Discovery (University College London)

    Repository · 1 publications · 16 citations

    1

    h-index

1–5