α-min: A Compact Approximate Solver For Finite-Horizon POMDPs

No abstract is available for this paper.

• Publication year

  2015

• Venue

  International Joint Conference on Artificial Intelligence

• Publication date

  2015-07-25

• Fields of study

  Computer Science, Environmental Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Frontiers inEcology and the Environment Why do we map threats ? Linking threat mapping with actions to make better conservation decisions

  2015cited by this paper
• Concepts of combinatorial optimization

  2014cited by this paper
• Which States Matter? An Application of an Intelligent Discretization Method to Solve a Continuous POMDP in Conservation Biology

  2012cited by this paper
• Finding Approximate POMDP solutions Through Belief Compression

  2011influential reference
• Optimally managing under imperfect detection: A method for plant invasions

  2011cited by this paper
• Closing the Gap: Improved Bounds on Optimal POMDP Solutions

  2011influential reference
• General rules for managing and surveying networks of pests, diseases, and endangered species

  2011cited by this paper
• Allocating conservation resources between areas where persistence of a species is uncertain.

  2011cited by this paper
• Nonapproximability Results for Partially Observable Markov Decision Processes

  2011cited by this paper
• Markov Decision Processes In Artificial Intelligence

  2009influential reference
• SARSOP: Efficient Point-Based POMDP Planning by Approximating Optimally Reachable Belief Spaces

  2008influential reference
• When to stop managing or surveying cryptic threatened species

  2008cited by this paper
• Anytime Point-Based Approximations for Large POMDPs

  2006cited by this paper
• Assessing the viability of tiger subpopulations in a fragmented landscape

  2006influential reference
• Prioritizing Point-Based POMDP Solvers

  2006cited by this paper
• VDCBPI: an Approximate Scalable Algorithm for Large POMDPs

  2004influential reference
• On the undecidability of probabilistic planning and related stochastic optimization problems

  2003cited by this paper
• Bounded Finite State Controllers

  2003cited by this paper
• Âóùöòòð Óó Öøø¬ Blockin

  2000cited by this paper
• Finite-memory control of partially observable systems

  1998cited by this paper
• Efficient dynamic-programming updates in partially observable Markov decision processes

  1995cited by this paper
• The Complexity of Markov Decision Processes

  1987cited by this paper
• The ellipsoid method and its consequences in combinatorial optimization

  1981cited by this paper
• The Optimal Control of Partially Observable Markov Processes over a Finite Horizon

  1973cited by this paper
• Optimal control of Markov processes with incomplete state information

  1965cited by this paper
• Dynamic Programming

  1957cited by this paper
• Noname manuscript No. (will be inserted by the editor) A Survey of Point-Based POMDP Solvers

  year unknowncited by this paper

• When should we use non-stationary adaptive management? A value of information analysis

  2026influential citation
• K-N-MOMDPs: Towards Interpretable Solutions for Adaptive Management

  2021cites this paper
• A primer on partially observable Markov decision processes (POMDPs)

  2021cites this paper
• Integer Programing for Weakly Coupled Stochastic Dynamic Programs with Partial Information

  2020cites this paper
• Solving K-MDPs

  2020cites this paper
• A Shiny r app to solve the problem of when to stop managing or surveying species under imperfect detection

  2020cites this paper
• Planning under Uncertainty in Constrained and Partially Observable Environments

  2019cites this paper
• Point-Based Value Iteration for Finite-Horizon POMDPs

  2019cites this paper
• Bootstrapping LPs in Value Iteration for Multi-Objective and Partially Observable MDPs

  2018cites this paper
• Sur les traces du futur : entre comprendre et predire

  2018cites this paper
• Three New Algorithms to Solve N-POMDPs

  2017influential citation
• Accelerated Vector Pruning for Optimal POMDP Solvers

  2017cites this paper
• Three New Algorithms to Solve N-POMDPs Yann Dujardin

  2017influential citation
• Time series semi-Markov decision process with variable costs for maintenance planning

  2016cites this paper
• State-Dependent Resource Harvesting with Lagged Information about System States

  2016cites this paper
• Optimization methods to solve adaptive management problems

  2016cites this paper
• Solving multi-objective optimization problems in conservation with the reference point method

  2016cites this paper