EDBT 2026 Demo / reviewers in the wild / expert
Jaak J. Uudmae
dblp:178/8569
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2016
—ORCID · none
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 · 39% Robot navigation and mapping · 30% Multi-agent systems · 30% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › planning under uncertainty
partially observable markov decision process |
0.2 | 1 | 2016 | Target Surveillance in Adversarial Environments Using POMDPs · AAAI 2016 |
Robotics › Robot navigation and mapping
target monitoring |
0.2 | 1 | 2016 | Target Surveillance in Adversarial Environments Using POMDPs · AAAI 2016 |
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 | 2016 | Target Surveillance in Adversarial Environments Using POMDPs · AAAI 2016 |
Methods — techniques the papers use, named apart from their topics
level-k policy · 0.2MOMDP · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2016 | Target Surveillance in Adversarial Environments Using POMDPsabstractThis paper introduces an extension of the target surveillance problem in which the surveillance agent is exposed to an adversarial ballistic threat. The problem is formulated as a mixed observability Markov decision process (MOMDP), which is a factored variant of the partially observable Markov decision process, to account for state and dynamic uncertainties. The control policy resulting from solving the MOMDP aims to optimize the frequency of target observations and minimize exposure to the ballistic threat. The adversary’s behavior is modeled with a level-k policy, which is used to construct the state transition of the MOMDP. The approach is empirically evaluated against a MOMDP adversary and against a human opponent in a target surveillance computer game. The empirical results demonstrate that, on average, level 3 MOMDP policies outperform lower level reasoning policies as well as human players. Maxim Egorov, Mykel J. Kochenderfer, Jaak J. Uudmae |
AAAI | 3 |