An anytime algorithm for constrained stochastic shortest path problems with deterministic policies (Q6098853): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An Analysis of Stochastic Shortest Path Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4264741 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained Discounted Markov Decision Processes and Hamiltonian Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739658 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3856120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LAO*: A heuristic search algorithm that finds solutions with loops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max-min representation of piecewise linear functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An outer approximate subdifferential method for piecewise affine optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The gradient projection method with exact line search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangian relaxation and enumeration for solving constrained shortest-path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching for the Multiplier in One-Constraint Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective line search for the subgradient method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual algorithm for the constrained shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the <i>K</i> Shortest Loopless Paths in a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Procedure for Computing the <i>K</i> Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjustment of an Inverse Matrix Corresponding to a Change in One Element of a Given Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Inverse Matrix Adjustment Arising in Discriminant Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chance-Constrained Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning with Markov Decision Processes: An AI Perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning / rank
 
Normal rank

Latest revision as of 09:00, 1 August 2024

scientific article; zbMATH DE number 7697286
Language Label Description Also known as
English
An anytime algorithm for constrained stochastic shortest path problems with deterministic policies
scientific article; zbMATH DE number 7697286

    Statements

    An anytime algorithm for constrained stochastic shortest path problems with deterministic policies (English)
    0 references
    0 references
    0 references
    19 June 2023
    0 references
    constrained stochastic shortest path problem
    0 references
    risk-bounded planning
    0 references
    heuristic search
    0 references

    Identifiers