Demo Data from EDBT 2026 / reviewers in the wild / expert
Daniel Armstrong
dblp:213/1483
· DBLP profile ↗
2ranked-venue papers
1as first author
1since 2021 · last 2021
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-author · 1 since 2021Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1Applied, interdisciplinary, general and emerging computing · 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 |
Motion planning and robot control · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Robotics › Motion planning and robot control
motion planning |
0.5 | 1 | 2021 | AM-RRT*: Informed Sampling-based Planning with Assisting Metric · ICRA 2021 |
Robotics › Motion planning and robot control › motion planning › sampling-based motion planning
RRT |
0.5 | 1 | 2021 | AM-RRT*: Informed Sampling-based Planning with Assisting Metric · ICRA 2021 |
Robotics › Motion planning and robot control › motion planning
sampling-based motion planning |
0.5 | 1 | 2021 | AM-RRT*: Informed Sampling-based Planning with Assisting Metric · ICRA 2021 |
Robotics › Motion planning and robot control › path planning
online path planning |
0.1 | 1 | 2021 | AM-RRT*: Informed Sampling-based Planning with Assisting Metric · ICRA 2021 |
Methods — techniques the papers use, named apart from their topics
targeted rewiring · 0.5diffusion distance · 0.5assisting distance metric · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | AM-RRT*: Informed Sampling-based Planning with Assisting MetricabstractIn this paper, we present a new algorithm that extends RRT* and RT-RRT* for online path planning in complex, dynamic environments. Sampling-based approaches often perform poorly in environments with narrow passages, a feature common to many indoor applications of mobile robots as well as computer games. Our method extends RRT-based sampling methods to enable the use of an assisting distance metric to improve performance in environments with obstacles. This assisting metric, which can be any metric that has better properties than the Euclidean metric when line of sight is blocked, is used in combination with the standard Euclidean metric in such a way that the algorithm can reap benefits from the assisting metric while maintaining the desirable properties of previous RRT variants - namely probabilistic completeness in tree coverage and asymptotic optimality in path length. We also introduce a new method of targeted rewiring, aimed at shortening search times and path lengths in tasks where the goal shifts repeatedly. We demonstrate that our method offers considerable improvements over existing multi-query planners such as RT-RRT* when using diffusion distance as an assisting metric: finding near-optimal paths with a decrease in search time of several orders of magnitude. Experimental results demonstrate our method offers a reduction of 99.5% in planning times and 9.8% in path lengths over RT-RRT* in a variety of environments. Daniel Armstrong, André Jonasson |
ICRA | 1 |
| 2017 | Hybrid.media: High velocity video ingestion in an in-memory scalable analytical polystoreabstractRecent advances in image recognition algorithms are making it possible to query databases for static images which look like a desired target image. This technology is expanding to image recognition within video files as image recognition algorithms advance. Blending the ideas of static image query with video image recognition leads to the subject of our present work. Hybrid.media is our work in progress to ingest video files into an Hybrid In-Memory Polystore Database [Gubanov, 2017], [Podkorytov et al., 2017] and add query support for finding those video files. This work will provide the basis for future work to query videos containing specific items based on content in a video. Mark Simmons, Daniel Armstrong, Dylan Soderman, Michael N. Gubanov |
IEEE BigData | 2 |