Abstract | ||
---|---|---|
In sequential decision making, heuristic search algorithms allow exploiting both the initial situation and an admissible heuristic to efficiently search for an optimal solution, often for planning purposes. Such algorithms exist for problems with uncertain dynamics, partial observability, multiple criteria, or multiple collaborating agents. In this article, we look at two-player zero-sum stochasti... |
Year | DOI | Venue |
---|---|---|
2021 | 10.1109/TG.2020.3005214 | IEEE Transactions on Games |
Keywords | DocType | Volume |
Games,Game theory,Convergence,Heuristic algorithms,Trajectory,Markov processes,Planning | Journal | 13 |
Issue | ISSN | Citations |
3 | 2475-1502 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Olivier Buffet | 1 | 258 | 26.77 |
Jilles Steeve Dibangoye | 2 | 123 | 12.76 |
Abdallah Saffidine | 3 | 126 | 19.72 |
Thomas Vincent | 4 | 320 | 27.52 |