Demo Data from EDBT 2026 / reviewers in the wild / expert
Samarth Kalluraya
dblp:326/2074
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2023
0000-0001-9942-7562ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
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 |
Motion planning and robot control · 67% Multi-agent systems · 33% | |
| Theoretical computer science
1 paper |
Logic in computer science · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Robotics › Motion planning and robot control
motion planning |
0.7 | 1 | 2023 | Multi-Robot Mission Planning in Dynamic Semantic Environments · ICRA 2023 |
Robotics › Motion planning and robot control › motion planning
multi-robot planning |
0.7 | 1 | 2023 | Multi-Robot Mission Planning in Dynamic Semantic Environments · ICRA 2023 |
Knowledge, reasoning and agents › Multi-agent systems
multi-robot systems |
0.7 | 1 | 2023 | Multi-Robot Mission Planning in Dynamic Semantic Environments · ICRA 2023 |
Logic in computer science › temporal logic
linear temporal logic |
0.2 | 1 | 2023 | Multi-Robot Mission Planning in Dynamic Semantic Environments · ICRA 2023 |
Logic in computer science
temporal logic |
0.2 | 1 | 2023 | Multi-Robot Mission Planning in Dynamic Semantic Environments · ICRA 2023 |
Methods — techniques the papers use, named apart from their topics
sampling-based planning · 1.3linear temporal logic · 1.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Multi-Robot Mission Planning in Dynamic Semantic EnvironmentsabstractThis paper addresses a new semantic multi-robot planning problem in uncertain and dynamic environments. Particularly, the environment is occupied with mobile and uncertain semantic targets. These targets are governed by stochastic dynamics while their current and future positions as well as their semantic labels are uncertain. Our goal is to control mobile sensing robots so that they can accomplish collaborative semantic tasks defined over the uncertain current/future positions and semantic labels of these targets. We express these tasks using Linear Temporal Logic (LTL). We propose a sampling-based approach that explores the robot motion space, the mission specification space, as well as the future configurations of the semantic targets to design optimal paths. These paths are revised online to adapt to uncertain perceptual feedback. To the best of our knowledge, this is the first work that addresses semantic mission planning problems in uncertain and dynamic semantic environments. We provide extensive experiments that demonstrate the efficiency of the proposed method. Samarth Kalluraya, George J. Pappas, Yiannis Kantaros |
ICRA | 1 |
| 2022 | Perception-Based Temporal Logic Planning in Uncertain Semantic MapsabstractIn this article, we address a multi-robot planning problem in environments with partially unknown semantics. The environment is assumed to have a known geometric structure (e.g., walls) and to be occupied by static labeled landmarks with uncertain positions and classes. This modeling approach gives rise to an uncertain semantic map generated by semantic simultaneous localization and mapping algorithms. Our goal is to design control policies for robots equipped with noisy perception systems so that they can accomplish collaborative tasks captured by global temporal logic specifications. To specify missions that account for environmental and perceptual uncertainty, we employ a fragment of linear temporal logic (LTL), called co-safe LTL, defined over perception-based atomic predicates modeling probabilistic satisfaction requirements. The perception-based LTL planning problem gives rise to an optimal control problem, solved by a novel sampling-based algorithm, that generates open-loop control policies that are updated online to adapt to a continuously learned semantic map. We provide extensive experiments to demonstrate the efficiency of the proposed planning architecture. Yiannis Kantaros, Samarth Kalluraya, George J. Pappas |
IEEE Trans. Robotics | 2 |