An anytime algorithm for constrained stochastic shortest path problems with deterministic policies

DOI10.1016/j.artint.2022.103846MaRDI QIDQ6098853

Brian C. Williams, Sungkweon Hong

Publication date: 19 June 2023

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

heuristic searchrisk-bounded planningconstrained stochastic shortest path problem

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Max-min representation of piecewise linear functions
• The gradient projection method with exact line search
• An effective line search for the subgradient method
• An outer approximate subdifferential method for piecewise affine optimization
• Constrained Discounted Markov Decision Processes and Hamiltonian Cycles
• Chance-Constrained Programming
• Planning with Markov Decision Processes: An AI Perspective
• A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning
• Lagrangian relaxation and enumeration for solving constrained shortest-path problems
• A dual algorithm for the constrained shortest path problem
• An Analysis of Stochastic Shortest Path Problems
• Searching for the Multiplier in One-Constraint Optimization Problems
• Finding the K Shortest Loopless Paths in a Network
• A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
• Adjustment of an Inverse Matrix Corresponding to a Change in One Element of a Given Matrix
• An Inverse Matrix Adjustment Arising in Discriminant Analysis
• LAO*: A heuristic search algorithm that finds solutions with loops

This page was built for publication: An anytime algorithm for constrained stochastic shortest path problems with deterministic policies