An anytime algorithm for constrained stochastic shortest path problems with deterministic policies.
Sungkweon HongBrian C. WilliamsPublished in: Artif. Intell. (2023)
Keyphrases
- shortest path problem
- dynamic programming
- optimization algorithm
- learning algorithm
- recognition algorithm
- computational complexity
- experimental evaluation
- single source
- matching algorithm
- combinatorial optimization problems
- shortest path
- detection algorithm
- expectation maximization
- cost function
- k means
- preprocessing
- optimal solution
- constrained problems
- control policy
- solution quality
- search strategy
- convergence rate
- times faster
- ant colony optimization
- linear programming
- simulated annealing
- worst case
- objective function