Demo Data from VLDB 2026 / reviewers in the wild / expert
Kofi Kwapong
dblp:266/4643
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2Graphics, computer vision, multimedia, augmented reality and games · 1Theory of computation · 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
2 papers |
Planning, search and constraint satisfaction · 87% Multi-agent systems · 6% Motion planning and robot control · 6% |
Topics — the 5 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › plan recognition
goal recognition |
0.4 | 1 | 2020 | Information Shaping for Enhanced Goal Recognition of Partially-Informed Agents · AAAI 2020 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › plan recognition › goal recognition
goal recognition design |
0.4 | 1 | 2020 | Information Shaping for Enhanced Goal Recognition of Partially-Informed Agents · AAAI 2020 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › planning under uncertainty
planning under incomplete information |
0.4 | 1 | 2020 | Reasoning About Plan Robustness Versus Plan Cost for Partially Informed Agents · KR 2020 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › planning under uncertainty
plan robustness |
0.4 | 1 | 2020 | Reasoning About Plan Robustness Versus Plan Cost for Partially Informed Agents · KR 2020 |
Robotics › Motion planning and robot control › motion planning
replanning |
0.1 | 1 | 2020 | Reasoning About Plan Robustness Versus Plan Cost for Partially Informed Agents · KR 2020 |
Methods — techniques the papers use, named apart from their topics
pruning search · 0.4automated planning · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | Information Shaping for Enhanced Goal Recognition of Partially-Informed AgentsabstractWe extend goal recognition design to account for partially informed agents. In particular, we consider a two-agent setting in which one agent, the actor, seeks to achieve a goal but has only incomplete information about the environment. The second agent, the recognizer, has perfect information and aims to recognize the actor's goal from its behavior as quickly as possible. As a one-time offline intervention and with the objective of facilitating the recognition task, the recognizer can selectively reveal information to the actor. The problem of selecting which information to reveal, which we call information shaping, is challenging not only because the space of information shaping options may be large, but also because more information revelation need not make it easier to recognize an agent's goal. We formally define this problem, and suggest a pruning approach for efficiently searching the search space. We demonstrate the effectiveness and efficiency of the suggested method on standard benchmarks. Sarah Keren, Kofi Kwapong, David C. Parkes, Barbara J. Grosz |
AAAI | 3 |
| 2020 | Reasoning About Plan Robustness Versus Plan Cost for Partially Informed AgentsabstractA common approach to planning with partial information is replanning: compute a plan based on assumptions about unknown information and replan if these assumptions are refuted during execution. To date, most planners with incomplete information have been designed to provide guarantees on completeness and soundness for the generated plans. Switching focus to performance, we measure the robustness of a plan, which quantifies the plan’s ability to avoid failure. Given a plan and an agent’s belief, which describes the set of states it deems as possible, robustness counts the number of world states in the belief from which the plan will achieve the goal without the need to replan. We formally describe the trade-off between robustness and plan cost and offer a solver that is guaranteed to produce plans that satisfy a required level of robustness. By evaluating our approach on a set of standard benchmarks, we demonstrate how it can improve the performance of a partially informed agent. Sarah Keren, Sara Bernardini, Kofi Kwapong, David C. Parkes |
KR | 3 |