Demo Data from EDBT 2026 / reviewers in the wild / expert
Tara G. Martin
dblp:117/4981
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2012
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1Graphics, computer vision, multimedia, augmented reality and games · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Planning, search and constraint satisfaction · 75% Reinforcement learning · 25% | |
| Theoretical computer science
1 paper |
Computational complexity · 100% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning
markov decision process |
0.1 | 1 | 2012 | MOMDPs: A Solution for Modelling Adaptive Management Problems · AAAI 2012 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › planning under uncertainty › partially observable markov decision process
mixed observability markov decision process |
0.1 | 1 | 2012 | MOMDPs: A Solution for Modelling Adaptive Management Problems · AAAI 2012 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › planning under uncertainty
partially observable markov decision process |
0.1 | 1 | 2012 | MOMDPs: A Solution for Modelling Adaptive Management Problems · AAAI 2012 |
Computational complexity › complexity classes › PSPACE
PSPACE-completeness |
0.0 | 1 | 2012 | MOMDPs: A Solution for Modelling Adaptive Management Problems · AAAI 2012 |
Methods — techniques the papers use, named apart from their topics
value iteration · 0.3belief update · 0.3backup operator · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2012 | MOMDPs: A Solution for Modelling Adaptive Management ProblemsabstractIn conservation biology and natural resource management, adaptive management is an iterative process of improving management by reducing uncertainty via monitoring. Adaptive management is the principal tool for conserving endangered species under global change, yet adaptive management problems suffer from a poor suite of solution methods. The common approach used to solve an adaptive management problem is to assume the system state is known and the system dynamics can be one of a set of pre-defined models. The solution method used is unsatisfactory, employing value iteration on a discretized belief MDP which restricts the study to very small problems. We show how to overcome this limitation by modelling an adaptive management problem as a restricted Mixed Observability MDP called hidden model MDP (hmMDP). We demonstrate how to simplify the value function, the backup operator and the belief update computation. We show that, although a simplified case of POMDPs, hm-MDPs are PSPACE-complete in the finite-horizon case. We illustrate the use of this model to manage a population of the threatened Gouldian finch, a bird species endemic to Northern Australia. Our simple modelling approach is an important step towards efficient algorithms for solving adaptive management problems. Iadine Chades, Josie Carwardine, Tara G. Martin, Samuel Nicol, Régis Sabbadin, Olivier Buffet |
AAAI | 3 |