Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Elliot Chane-Sane

dblp:296/3654 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
3since 2021 · last 2024
0009-0006-4292-8300ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 3 first-author · 3 since 2021Systems, architecture and hardware · 2 · 2 first-author · 2 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 · 48% Motion planning and robot control · 29% Transfer learning and domain adaptation · 15%

Topics — the 9 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
imitation learning
0.712023
Learning Video-Conditioned Policies for Unseen Manipulation Tasks · ICRA 2023
Robotics › Motion planning and robot control › robot learning
manipulation skill learning
0.712023
Learning Video-Conditioned Policies for Unseen Manipulation Tasks · ICRA 2023
Robotics › Motion planning and robot control › robot learning › robot policy learning
video-conditioned policy learning
0.712023
Learning Video-Conditioned Policies for Unseen Manipulation Tasks · ICRA 2023
Machine learning › Transfer learning and domain adaptation
zero-shot transfer
0.712023
Learning Video-Conditioned Policies for Unseen Manipulation Tasks · ICRA 2023
Machine learning › Reinforcement learning
goal-conditioned reinforcement learning
0.512021
Goal-Conditioned Reinforcement Learning with Imagined Subgoals · ICML 2021
Machine learning › Reinforcement learning
hierarchical reinforcement learning
0.512021
Goal-Conditioned Reinforcement Learning with Imagined Subgoals · ICML 2021
Machine learning › Reinforcement learning › hierarchical reinforcement learning › option discovery
subgoal discovery
0.512021
Goal-Conditioned Reinforcement Learning with Imagined Subgoals · ICML 2021
Robotics › Robot manipulation
human demonstration
0.212023
Learning Video-Conditioned Policies for Unseen Manipulation Tasks · ICRA 2023
Robotics › Robot navigation and mapping
robotic navigation and manipulation
0.112021
Goal-Conditioned Reinforcement Learning with Imagined Subgoals · ICML 2021

Methods — techniques the papers use, named apart from their topics

video embedding · 0.7reinforcement learning · 0.7action recognition · 0.7value function reachability · 0.5imagined subgoals · 0.5KL-constrained policy iteration · 0.5
YearPublicationVenuePosition
2024 CaT: Constraints as Terminations for Legged Locomotion Reinforcement Learning
abstract
Deep Reinforcement Learning (RL) has demonstrated impressive results in solving complex robotic tasks such as quadruped locomotion. Yet, current solvers fail to produce efficient policies respecting hard constraints. In this work, we advocate for integrating constraints into robot learning and present Constraints as Terminations (CaT), a novel constrained RL algorithm. Departing from classical constrained RL formulations, we reformulate constraints through stochastic terminations during policy learning: any violation of a constraint triggers a probability of terminating potential future rewards the RL agent could attain. We propose an algorithmic approach to this formulation, by minimally modifying widely used off-the-shelf RL algorithms in robot learning (such as Proximal Policy Optimization). Our approach leads to excellent constraint adherence without introducing undue complexity and computational overhead, thus mitigating barriers to broader adoption. Through empirical evaluation on the real quadruped robot Solo crossing challenging obstacles, we demonstrate that CaT provides a compelling solution for incorporating constraints into RL frameworks. Videos and code are available at constraints-as-terminations.github.io.
Elliot Chane-Sane, Pierre-Alexandre Leziart, Thomas Flayols, Olivier Stasse, Philippe Souères, Nicolas Mansard
IROS1
2023 Learning Video-Conditioned Policies for Unseen Manipulation Tasks
abstract
The ability to specify robot commands by a non-expert user is critical for building generalist agents capable of solving a large variety of tasks. One convenient way to specify the intended robot goal is by a video of a person demonstrating the target task. While prior work typically aims to imitate human demonstrations performed in robot environments, here we focus on a more realistic and challenging setup with demonstrations recorded in natural and diverse human environments. We propose Video-conditioned Policy learning (ViP), a data-driven approach that maps human demonstrations of previously unseen tasks to robot manipulation skills. To this end, we learn our policy to generate appropriate actions given current scene observations and a video of the target task. To encourage generalization to new tasks, we avoid particular tasks during training and learn our policy from unlabelled robot trajectories and corresponding robot videos. Both robot and human videos in our framework are represented by video embeddings pre-trained for human action recognition. At test time we first translate human videos to robot videos in the common video embedding space, and then use resulting embeddings to condition our policies. Notably, our approach enables robot control by human demonstrations in a zero-shot manner, i.e., without using robot trajectories paired with human instructions during training. We validate our approach on a set of challenging multi-task robot manipulation environments and outperform state of the art. Our method also demonstrates excellent performance in a new challenging zero-shot setup where no paired data is used during training.
Elliot Chane-Sane, Cordelia Schmid, Ivan Laptev
ICRA1
2021 Goal-Conditioned Reinforcement Learning with Imagined Subgoals
abstract
Goal-conditioned reinforcement learning endows an agent with a large variety of skills, but it often struggles to solve tasks that require more temporally extended reasoning. In this work, we propose to incorporate imagined subgoals into policy learning to facilitate learning of complex tasks. Imagined subgoals are predicted by a separate high-level policy, which is trained simultaneously with the policy and its critic. This high-level policy predicts intermediate states halfway to the goal using the value function as a reachability metric. We don’t require the policy to reach these subgoals explicitly. Instead, we use them to define a prior policy, and incorporate this prior into a KL-constrained policy iteration scheme to speed up and regularize learning. Imagined subgoals are used during policy learning, but not during test time, where we only apply the learned policy. We evaluate our approach on complex robotic navigation and manipulation tasks and show that it outperforms existing methods by a large margin.
Elliot Chane-Sane, Cordelia Schmid, Ivan Laptev
ICML1