Demo Data from EDBT 2026 / reviewers in the wild / expert
Johannes Löhr
dblp:116/9286
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2014
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author
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 · 100% |
Topics — the 1 heaviest of 3, 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 › hybrid planning
mixed discrete-continuous planning |
0.1 | 1 | 2014 | Symbolic Domain Predictive Control · AAAI 2014 |
Methods — techniques the papers use, named apart from their topics
symbolic state propagation · 0.2reachability analysis · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2014 | Symbolic Domain Predictive ControlabstractPlanning-based methods to guide switched hybrid systems from an initial state into a desired goal region opens an interesting field for control. The idea of the Domain Predictive Control (DPC) approach is to generate input signals affecting both the numerical states and the modes of the system by stringing together atomic actions to a logically consistent plan. However, the existing DPC approach is restricted in the sense that a discrete and pre-defined input signal is required for each action. In this paper, we extend the approach to deal with symbolic states. This allows for the propagation of reachable regions of the state space emerging from actions with inputs that can be arbitrarily chosen within specified input bounds. This symbolic extension enables the applicability of DPC to systems with bounded inputs sets and increases its robustness due to the implicitly reduced search space. Moreover, precise numeric goal states instead of goal regions become reachable. Johannes Löhr, Martin Wehrle, Maria Fox 0001, Bernhard Nebel |
AAAI | 1 |