Demo Data from EDBT 2026 / reviewers in the wild / expert
Henry Charlesworth
dblp:225/7801
· DBLP profile ↗
2ranked-venue papers
2as 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 · 2 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
2 papers |
Reinforcement learning · 50% Motion planning and robot control · 32% Robot manipulation · 14% |
Topics — the 9 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Robotics › Robot manipulation
dexterous manipulation |
0.5 | 1 | 2021 | Solving Challenging Dexterous Manipulation Tasks With Trajectory Optimisation and Reinforcement Learning · ICML 2021 |
Robotics › Motion planning and robot control › robot learning › robotic reinforcement learning
reinforcement learning for manipulation |
0.5 | 1 | 2021 | Solving Challenging Dexterous Manipulation Tasks With Trajectory Optimisation and Reinforcement Learning · ICML 2021 |
Robotics › Motion planning and robot control
trajectory optimization |
0.5 | 1 | 2021 | Solving Challenging Dexterous Manipulation Tasks With Trajectory Optimisation and Reinforcement Learning · ICML 2021 |
Machine learning › Reinforcement learning › model-based reinforcement learning
model-based planning |
0.4 | 1 | 2020 | PlanGAN: Model-based Planning With Sparse Rewards and Multiple Goals · NeurIPS 2020 |
Machine learning › Reinforcement learning
model-based reinforcement learning |
0.4 | 1 | 2020 | PlanGAN: Model-based Planning With Sparse Rewards and Multiple Goals · NeurIPS 2020 |
Machine learning › Reinforcement learning › goal-conditioned reinforcement learning
multi-goal reinforcement learning |
0.4 | 1 | 2020 | PlanGAN: Model-based Planning With Sparse Rewards and Multiple Goals · NeurIPS 2020 |
Machine learning › Reinforcement learning
sparse reward reinforcement learning |
0.4 | 1 | 2020 | PlanGAN: Model-based Planning With Sparse Rewards and Multiple Goals · NeurIPS 2020 |
Machine learning › Generative modeling
conditional generative model |
0.1 | 1 | 2020 | PlanGAN: Model-based Planning With Sparse Rewards and Multiple Goals · NeurIPS 2020 |
Robotics › Motion planning and robot control
trajectory planning |
0.1 | 1 | 2020 | PlanGAN: Model-based Planning With Sparse Rewards and Multiple Goals · NeurIPS 2020 |
Methods — techniques the papers use, named apart from their topics
trajectory optimization · 0.5off-policy reinforcement learning · 0.5hindsight experience replay · 0.4generative adversarial network · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | Solving Challenging Dexterous Manipulation Tasks With Trajectory Optimisation and Reinforcement LearningabstractTraining agents to autonomously control anthropomorphic robotic hands has the potential to lead to systems capable of performing a multitude of complex manipulation tasks in unstructured and uncertain environments. In this work, we first introduce a suite of challenging simulated manipulation tasks where current reinforcement learning and trajectory optimisation techniques perform poorly. These include environments where two simulated hands have to pass or throw objects between each other, as well as an environment where the agent must learn to spin a long pen between its fingers. We then introduce a simple trajectory optimisation algorithm that performs significantly better than existing methods on these environments. Finally, on the most challenging “PenSpin" task, we combine sub-optimal demonstrations generated through trajectory optimisation with off-policy reinforcement learning, obtaining performance that far exceeds either of these approaches individually. Videos of all of our results are available at: https://dexterous-manipulation.github.io Henry Charlesworth, Giovanni Montana |
ICML | 1 |
| 2020 | PlanGAN: Model-based Planning With Sparse Rewards and Multiple GoalsabstractLearning with sparse rewards remains a significant challenge in reinforcement learning (RL), especially when the aim is to train a policy capable of achieving multiple different goals. To date, the most successful approaches for dealing with multi-goal, sparse reward environments have been model-free RL algorithms. In this work we propose PlanGAN, a model-based algorithm specifically designed for solving multi-goal tasks in environments with sparse rewards. Our method builds on the fact that any trajectory of experience collected by an agent contains useful information about how to achieve the goals observed during that trajectory. We use this to train an ensemble of conditional generative models (GANs) to generate plausible trajectories that lead the agent from its current state towards a specified goal. We then combine these imagined trajectories into a novel planning algorithm in order to achieve the desired goal as efficiently as possible. The performance of PlanGAN has been tested on a number of robotic navigation/manipulation tasks in comparison with a range of model-free reinforcement learning baselines, including Hindsight Experience Replay. Our studies indicate that PlanGAN can achieve comparable performance whilst being around 4-8 times more sample efficient. Henry Charlesworth, Giovanni Montana |
NeurIPS | 1 |