Demo Data from EDBT 2026 / reviewers in the wild / expert
Felix Frank
dblp:187/8489
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2022
0000-0002-7224-5838ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 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 · 92% Optimization for machine learning · 8% |
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 › robot learning
movement primitives |
0.6 | 1 | 2022 | Constrained Probabilistic Movement Primitives for Robot Trajectory Adaptation · IEEE Trans. Robotics 2022 |
Robotics › Motion planning and robot control › robot learning › movement primitives
probabilistic movement primitives |
0.6 | 1 | 2022 | Constrained Probabilistic Movement Primitives for Robot Trajectory Adaptation · IEEE Trans. Robotics 2022 |
Robotics › Motion planning and robot control
robot learning |
0.6 | 1 | 2022 | Constrained Probabilistic Movement Primitives for Robot Trajectory Adaptation · IEEE Trans. Robotics 2022 |
Machine learning › Optimization for machine learning
constrained optimization |
0.2 | 1 | 2022 | Constrained Probabilistic Movement Primitives for Robot Trajectory Adaptation · IEEE Trans. Robotics 2022 |
Robotics › Motion planning and robot control › trajectory planning
trajectory adaptation |
0.2 | 1 | 2022 | Constrained Probabilistic Movement Primitives for Robot Trajectory Adaptation · IEEE Trans. Robotics 2022 |
Methods — techniques the papers use, named apart from their topics
kullback-leibler divergence · 0.6constrained optimization · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Constrained Probabilistic Movement Primitives for Robot Trajectory AdaptationabstractPlacing robotsoutside controlled conditions requires versatile movement representations that allow robots to learn new tasks and adapt them to environmental changes. The introduction of obstacles or the placement of additional robots in the workspace and the modification of the joint range due to faults or range-of-motion constraints are typical cases, where the adaptation capabilities play a key role for safely performing the robot’s task. Probabilistic movement primitives (ProMPs) have been proposed for representing adaptable movement skills, which are modeled as Gaussian distributions over trajectories. These are analytically tractable and can be learned from a small number of demonstrations. However, both the original ProMP formulation and the subsequent approaches only provide solutions to specific movement adaptation problems, e.g., obstacle avoidance, and a generic, unifying, probabilistic approach to adaptation is missing. In this article, we develop a generic probabilistic framework for adapting ProMPs. We unify previous adaptation techniques, for example, various types of obstacle avoidance, via-points, and mutual avoidance, in one single framework and combine them to solve complex robotic problems. Additionally, we derive novel adaptation techniques such as temporally unbound via-points and mutual avoidance. We formulate adaptation as a constrained optimization problem, where we minimize the Kullback–Leibler divergence between the adapted distribution and the distribution of the original primitive,while we constrain the probability mass associated with undesired trajectories to be low. We demonstrate our approach on several adaptation problems on simulated planar robot arms and seven-degree-of-freedom Franka Emika robots in a dual-robot-arm setting. Felix Frank, Alexandros Paraschos, Patrick van der Smagt, Botond Cseke |
IEEE Trans. Robotics | 1 |