41 results on '"Tateo, Davide"'
Search Results
2. Energy-based Contact Planning under Uncertainty for Robot Air Hockey
- Author
-
Jankowski, Julius, Marić, Ante, Liu, Puze, Tateo, Davide, Peters, Jan, and Calinon, Sylvain
- Subjects
Computer Science - Robotics - Abstract
Planning robot contact often requires reasoning over a horizon to anticipate outcomes, making such planning problems computationally expensive. In this letter, we propose a learning framework for efficient contact planning in real-time subject to uncertain contact dynamics. We implement our approach for the example task of robot air hockey. Based on a learned stochastic model of puck dynamics, we formulate contact planning for shooting actions as a stochastic optimal control problem with a chance constraint on hitting the goal. To achieve online re-planning capabilities, we propose to train an energy-based model to generate optimal shooting plans in real time. The performance of the trained policy is validated %in experiments both in simulation and on a real-robot setup. Furthermore, our approach was tested in a competitive setting as part of the NeurIPS 2023 Robot Air Hockey Challenge., Comment: This work has been submitted to the IEEE Robotics & Automation Letters for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible
- Published
- 2024
3. ROS-LLM: A ROS framework for embodied AI with task feedback and structured reasoning
- Author
-
Mower, Christopher E., Wan, Yuhui, Yu, Hongzhan, Grosnit, Antoine, Gonzalez-Billandon, Jonas, Zimmer, Matthieu, Wang, Jinlong, Zhang, Xinyu, Zhao, Yao, Zhai, Anbang, Liu, Puze, Palenicek, Daniel, Tateo, Davide, Cadena, Cesar, Hutter, Marco, Peters, Jan, Tian, Guangjian, Zhuang, Yuzheng, Shao, Kun, Quan, Xingyue, Hao, Jianye, Wang, Jun, and Bou-Ammar, Haitham
- Subjects
Computer Science - Robotics ,Computer Science - Artificial Intelligence - Abstract
We present a framework for intuitive robot programming by non-experts, leveraging natural language prompts and contextual information from the Robot Operating System (ROS). Our system integrates large language models (LLMs), enabling non-experts to articulate task requirements to the system through a chat interface. Key features of the framework include: integration of ROS with an AI agent connected to a plethora of open-source and commercial LLMs, automatic extraction of a behavior from the LLM output and execution of ROS actions/services, support for three behavior modes (sequence, behavior tree, state machine), imitation learning for adding new robot actions to the library of possible actions, and LLM reflection via human and environment feedback. Extensive experiments validate the framework, showcasing robustness, scalability, and versatility in diverse scenarios, including long-horizon tasks, tabletop rearrangements, and remote supervisory control. To facilitate the adoption of our framework and support the reproduction of our results, we have made our code open-source. You can access it at: https://github.com/huawei-noah/HEBO/tree/master/ROSLLM., Comment: This document contains 26 pages and 13 figures
- Published
- 2024
4. Safe Reinforcement Learning on the Constraint Manifold: Theory and Applications
- Author
-
Liu, Puze, Bou-Ammar, Haitham, Peters, Jan, and Tateo, Davide
- Subjects
Computer Science - Robotics ,Computer Science - Machine Learning - Abstract
Integrating learning-based techniques, especially reinforcement learning, into robotics is promising for solving complex problems in unstructured environments. However, most existing approaches are trained in well-tuned simulators and subsequently deployed on real robots without online fine-tuning. In this setting, the simulation's realism seriously impacts the deployment's success rate. Instead, learning with real-world interaction data offers a promising alternative: not only eliminates the need for a fine-tuned simulator but also applies to a broader range of tasks where accurate modeling is unfeasible. One major problem for on-robot reinforcement learning is ensuring safety, as uncontrolled exploration can cause catastrophic damage to the robot or the environment. Indeed, safety specifications, often represented as constraints, can be complex and non-linear, making safety challenging to guarantee in learning systems. In this paper, we show how we can impose complex safety constraints on learning-based robotics systems in a principled manner, both from theoretical and practical points of view. Our approach is based on the concept of the Constraint Manifold, representing the set of safe robot configurations. Exploiting differential geometry techniques, i.e., the tangent space, we can construct a safe action space, allowing learning agents to sample arbitrary actions while ensuring safety. We demonstrate the method's effectiveness in a real-world Robot Air Hockey task, showing that our method can handle high-dimensional tasks with complex constraints. Videos of the real robot experiments are available on the project website (https://puzeliu.github.io/TRO-ATACOM)., Comment: 19 pages; sumitted to IEEE Transactions on Robotics
- Published
- 2024
5. Towards Transferring Tactile-based Continuous Force Control Policies from Simulation to Robot
- Author
-
Lach, Luca, Haschke, Robert, Tateo, Davide, Peters, Jan, Ritter, Helge, Borràs, Júlia, and Torras, Carme
- Subjects
Computer Science - Robotics ,Computer Science - Artificial Intelligence - Abstract
The advent of tactile sensors in robotics has sparked many ideas on how robots can leverage direct contact measurements of their environment interactions to improve manipulation tasks. An important line of research in this regard is that of grasp force control, which aims to manipulate objects safely by limiting the amount of force exerted on the object. While prior works have either hand-modeled their force controllers, employed model-based approaches, or have not shown sim-to-real transfer, we propose a model-free deep reinforcement learning approach trained in simulation and then transferred to the robot without further fine-tuning. We therefore present a simulation environment that produces realistic normal forces, which we use to train continuous force control policies. An evaluation in which we compare against a baseline and perform an ablation study shows that our approach outperforms the hand-modeled baseline and that our proposed inductive bias and domain randomization facilitate sim-to-real transfer. Code, models, and supplementary videos are available on https://sites.google.com/view/rl-force-ctrl
- Published
- 2023
6. Time-Efficient Reinforcement Learning with Stochastic Stateful Policies
- Author
-
Al-Hafez, Firas, Zhao, Guoping, Peters, Jan, and Tateo, Davide
- Subjects
Computer Science - Machine Learning - Abstract
Stateful policies play an important role in reinforcement learning, such as handling partially observable environments, enhancing robustness, or imposing an inductive bias directly into the policy structure. The conventional method for training stateful policies is Backpropagation Through Time (BPTT), which comes with significant drawbacks, such as slow training due to sequential gradient propagation and the occurrence of vanishing or exploding gradients. The gradient is often truncated to address these issues, resulting in a biased policy update. We present a novel approach for training stateful policies by decomposing the latter into a stochastic internal state kernel and a stateless policy, jointly optimized by following the stateful policy gradient. We introduce different versions of the stateful policy gradient theorem, enabling us to easily instantiate stateful variants of popular reinforcement learning and imitation learning algorithms. Furthermore, we provide a theoretical analysis of our new gradient estimator and compare it with BPTT. We evaluate our approach on complex continuous control tasks, e.g., humanoid locomotion, and demonstrate that our gradient estimator scales effectively with task complexity while offering a faster and simpler alternative to BPTT.
- Published
- 2023
7. LocoMuJoCo: A Comprehensive Imitation Learning Benchmark for Locomotion
- Author
-
Al-Hafez, Firas, Zhao, Guoping, Peters, Jan, and Tateo, Davide
- Subjects
Computer Science - Machine Learning ,Computer Science - Robotics - Abstract
Imitation Learning (IL) holds great promise for enabling agile locomotion in embodied agents. However, many existing locomotion benchmarks primarily focus on simplified toy tasks, often failing to capture the complexity of real-world scenarios and steering research toward unrealistic domains. To advance research in IL for locomotion, we present a novel benchmark designed to facilitate rigorous evaluation and comparison of IL algorithms. This benchmark encompasses a diverse set of environments, including quadrupeds, bipeds, and musculoskeletal human models, each accompanied by comprehensive datasets, such as real noisy motion capture data, ground truth expert data, and ground truth sub-optimal data, enabling evaluation across a spectrum of difficulty levels. To increase the robustness of learned agents, we provide an easy interface for dynamics randomization and offer a wide range of partially observable tasks to train agents across different embodiments. Finally, we provide handcrafted metrics for each task and ship our benchmark with state-of-the-art baseline algorithms to ease evaluation and enable fast benchmarking., Comment: https://github.com/robfiras/loco-mujoco
- Published
- 2023
8. LS-IQ: Implicit Reward Regularization for Inverse Reinforcement Learning
- Author
-
Al-Hafez, Firas, Tateo, Davide, Arenz, Oleg, Zhao, Guoping, and Peters, Jan
- Subjects
Computer Science - Machine Learning ,Computer Science - Artificial Intelligence ,Computer Science - Robotics - Abstract
Recent methods for imitation learning directly learn a $Q$-function using an implicit reward formulation rather than an explicit reward function. However, these methods generally require implicit reward regularization to improve stability and often mistreat absorbing states. Previous works show that a squared norm regularization on the implicit reward function is effective, but do not provide a theoretical analysis of the resulting properties of the algorithms. In this work, we show that using this regularizer under a mixture distribution of the policy and the expert provides a particularly illuminating perspective: the original objective can be understood as squared Bellman error minimization, and the corresponding optimization problem minimizes a bounded $\chi^2$-Divergence between the expert and the mixture distribution. This perspective allows us to address instabilities and properly treat absorbing states. We show that our method, Least Squares Inverse Q-Learning (LS-IQ), outperforms state-of-the-art algorithms, particularly in environments with absorbing states. Finally, we propose to use an inverse dynamics model to learn from observations only. Using this approach, we retain performance in settings where no expert actions are available.
- Published
- 2023
9. Fast Kinodynamic Planning on the Constraint Manifold with Deep Neural Networks
- Author
-
Kicki, Piotr, Liu, Puze, Tateo, Davide, Bou-Ammar, Haitham, Walas, Krzysztof, Skrzypczyński, Piotr, and Peters, Jan
- Subjects
Computer Science - Robotics ,Computer Science - Artificial Intelligence ,I.2.9 ,I.2.6 - Abstract
Motion planning is a mature area of research in robotics with many well-established methods based on optimization or sampling the state space, suitable for solving kinematic motion planning. However, when dynamic motions under constraints are needed and computation time is limited, fast kinodynamic planning on the constraint manifold is indispensable. In recent years, learning-based solutions have become alternatives to classical approaches, but they still lack comprehensive handling of complex constraints, such as planning on a lower-dimensional manifold of the task space while considering the robot's dynamics. This paper introduces a novel learning-to-plan framework that exploits the concept of constraint manifold, including dynamics, and neural planning methods. Our approach generates plans satisfying an arbitrary set of constraints and computes them in a short constant time, namely the inference time of a neural network. This allows the robot to plan and replan reactively, making our approach suitable for dynamic environments. We validate our approach on two simulated tasks and in a demanding real-world scenario, where we use a Kuka LBR Iiwa 14 robotic arm to perform the hitting movement in robotic Air Hockey.
- Published
- 2023
10. Learning-based Design and Control for Quadrupedal Robots with Parallel-Elastic Actuators
- Author
-
Bjelonic, Filip, Lee, Joonho, Arm, Philip, Sako, Dhionis, Tateo, Davide, Peters, Jan, and Hutter, Marco
- Subjects
Computer Science - Robotics - Abstract
Parallel-elastic joints can improve the efficiency and strength of robots by assisting the actuators with additional torques. For these benefits to be realized, a spring needs to be carefully designed. However, designing robots is an iterative and tedious process, often relying on intuition and heuristics. We introduce a design optimization framework that allows us to co-optimize a parallel elastic knee joint and locomotion controller for quadrupedal robots with minimal human intuition. We design a parallel elastic joint and optimize its parameters with respect to the efficiency in a model-free fashion. In the first step, we train a design-conditioned policy using model-free Reinforcement Learning, capable of controlling the quadruped in the predefined range of design parameters. Afterwards, we use Bayesian Optimization to find the best design using the policy. We use this framework to optimize the parallel-elastic spring parameters for the knee of our quadrupedal robot ANYmal together with the optimal controller. We evaluate the optimized design and controller in real-world experiments over various terrains. Our results show that the new system improves the torque-square efficiency of the robot by 33% compared to the baseline and reduces maximum joint torque by 30% without compromising tracking performance. The improved design resulted in 11% longer operation time on flat terrain.
- Published
- 2023
- Full Text
- View/download PDF
11. Safe Reinforcement Learning of Dynamic High-Dimensional Robotic Tasks: Navigation, Manipulation, Interaction
- Author
-
Liu, Puze, Zhang, Kuo, Tateo, Davide, Jauhri, Snehal, Hu, Zhiyuan, Peters, Jan, and Chalvatzaki, Georgia
- Subjects
Computer Science - Robotics ,Computer Science - Machine Learning - Abstract
Safety is a crucial property of every robotic platform: any control policy should always comply with actuator limits and avoid collisions with the environment and humans. In reinforcement learning, safety is even more fundamental for exploring an environment without causing any damage. While there are many proposed solutions to the safe exploration problem, only a few of them can deal with the complexity of the real world. This paper introduces a new formulation of safe exploration for reinforcement learning of various robotic tasks. Our approach applies to a wide class of robotic platforms and enforces safety even under complex collision constraints learned from data by exploring the tangent space of the constraint manifold. Our proposed approach achieves state-of-the-art performance in simulated high-dimensional and dynamic tasks while avoiding collisions with the environment. We show safe real-world deployment of our learned controller on a TIAGo++ robot, achieving remarkable performance in manipulation and human-robot interaction tasks., Comment: 6 pages
- Published
- 2022
12. Object Structural Points Representation for Graph-based Semantic Monocular Localization and Mapping
- Author
-
Tateo, Davide, Cucci, Davide Antonio, Matteucci, Matteo, and Bonarini, Andrea
- Subjects
Computer Science - Computer Vision and Pattern Recognition - Abstract
Efficient object level representation for monocular semantic simultaneous localization and mapping (SLAM) still lacks a widely accepted solution. In this paper, we propose the use of an efficient representation, based on structural points, for the geometry of objects to be used as landmarks in a monocular semantic SLAM system based on the pose-graph formulation. In particular, an inverse depth parametrization is proposed for the landmark nodes in the pose-graph to store object position, orientation and size/scale. The proposed formulation is general and it can be applied to different geometries; in this paper we focus on indoor environments where human-made artifacts commonly share a planar rectangular shape, e.g., windows, doors, cabinets, etc. The approach can be easily extended to urban scenarios where similar shapes exists as well. Experiments in simulation show good performance, particularly in object geometry reconstruction., Comment: submitted to IROS 2015 (rejected)
- Published
- 2022
13. Dimensionality Reduction and Prioritized Exploration for Policy Search
- Author
-
Memmel, Marius, Liu, Puze, Tateo, Davide, and Peters, Jan
- Subjects
Computer Science - Machine Learning - Abstract
Black-box policy optimization is a class of reinforcement learning algorithms that explores and updates the policies at the parameter level. This class of algorithms is widely applied in robotics with movement primitives or non-differentiable policies. Furthermore, these approaches are particularly relevant where exploration at the action level could cause actuator damage or other safety issues. However, Black-box optimization does not scale well with the increasing dimensionality of the policy, leading to high demand for samples, which are expensive to obtain in real-world systems. In many practical applications, policy parameters do not contribute equally to the return. Identifying the most relevant parameters allows to narrow down the exploration and speed up the learning. Furthermore, updating only the effective parameters requires fewer samples, improving the scalability of the method. We present a novel method to prioritize the exploration of effective parameters and cope with full covariance matrix updates. Our algorithm learns faster than recent approaches and requires fewer samples to achieve state-of-the-art results. To select the effective parameters, we consider both the Pearson correlation coefficient and the Mutual Information. We showcase the capabilities of our approach on the Relative Entropy Policy Search algorithm in several simulated environments, including robotics simulations. Code is available at https://git.ias.informatik.tu-darmstadt.de/ias\_code/aistats2022/dr-creps}{git.ias.informatik.tu-darmstadt.de/ias\_code/aistats2022/dr-creps., Comment: The 25th International Conference on Artificial Intelligence and Statistics (AISTATS)
- Published
- 2022
14. Regularized Deep Signed Distance Fields for Reactive Motion Generation
- Author
-
Liu, Puze, Zhang, Kuo, Tateo, Davide, Jauhri, Snehal, Peters, Jan, and Chalvatzaki, Georgia
- Subjects
Computer Science - Robotics ,Computer Science - Machine Learning - Abstract
Autonomous robots should operate in real-world dynamic environments and collaborate with humans in tight spaces. A key component for allowing robots to leave structured lab and manufacturing settings is their ability to evaluate online and real-time collisions with the world around them. Distance-based constraints are fundamental for enabling robots to plan their actions and act safely, protecting both humans and their hardware. However, different applications require different distance resolutions, leading to various heuristic approaches for measuring distance fields w.r.t. obstacles, which are computationally expensive and hinder their application in dynamic obstacle avoidance use-cases. We propose Regularized Deep Signed Distance Fields (ReDSDF), a single neural implicit function that can compute smooth distance fields at any scale, with fine-grained resolution over high-dimensional manifolds and articulated bodies like humans, thanks to our effective data generation and a simple inductive bias during training. We demonstrate the effectiveness of our approach in representative simulated tasks for whole-body control (WBC) and safe Human-Robot Interaction (HRI) in shared workspaces. Finally, we provide proof of concept of a real-world application in a HRI handover task with a mobile manipulator robot., Comment: Accepted at 2022 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2022)
- Published
- 2022
15. Learning Stable Vector Fields on Lie Groups
- Author
-
Urain, Julen, Tateo, Davide, and Peters, Jan
- Subjects
Computer Science - Robotics ,Computer Science - Machine Learning - Abstract
Learning robot motions from demonstration requires models able to specify vector fields for the full robot pose when the task is defined in operational space. Recent advances in reactive motion generation have shown that learning adaptive, reactive, smooth, and stable vector fields is possible. However, these approaches define vector fields on a flat Euclidean manifold, while representing vector fields for orientations requires modeling the dynamics in non-Euclidean manifolds, such as Lie Groups. In this paper, we present a novel vector field model that can guarantee most of the properties of previous approaches i.e., stability, smoothness, and reactivity beyond the Euclidean space. In the experimental evaluation, we show the performance of our proposed vector field model to learn stable vector fields for full robot poses as SE(2) and SE(3) in both simulated and real robotics tasks., Comment: ICRA RA-L preprint
- Published
- 2021
16. An Empirical Analysis of Measure-Valued Derivatives for Policy Gradients
- Author
-
Carvalho, João, Tateo, Davide, Muratore, Fabio, and Peters, Jan
- Subjects
Computer Science - Machine Learning ,Computer Science - Artificial Intelligence - Abstract
Reinforcement learning methods for robotics are increasingly successful due to the constant development of better policy gradient techniques. A precise (low variance) and accurate (low bias) gradient estimator is crucial to face increasingly complex tasks. Traditional policy gradient algorithms use the likelihood-ratio trick, which is known to produce unbiased but high variance estimates. More modern approaches exploit the reparametrization trick, which gives lower variance gradient estimates but requires differentiable value function approximators. In this work, we study a different type of stochastic gradient estimator: the Measure-Valued Derivative. This estimator is unbiased, has low variance, and can be used with differentiable and non-differentiable function approximators. We empirically evaluate this estimator in the actor-critic policy gradient setting and show that it can reach comparable performance with methods based on the likelihood-ratio or reparametrization tricks, both in low and high-dimensional action spaces.
- Published
- 2021
17. Efficient and Reactive Planning for High Speed Robot Air Hockey
- Author
-
Liu, Puze, Tateo, Davide, Bou-Ammar, Haitham, and Peters, Jan
- Subjects
Computer Science - Robotics - Abstract
Highly dynamic robotic tasks require high-speed and reactive robots. These tasks are particularly challenging due to the physical constraints, hardware limitations, and the high uncertainty of dynamics and sensor measures. To face these issues, it's crucial to design robotics agents that generate precise and fast trajectories and react immediately to environmental changes. Air hockey is an example of this kind of task. Due to the environment's characteristics, it is possible to formalize the problem and derive clean mathematical solutions. For these reasons, this environment is perfect for pushing to the limit the performance of currently available general-purpose robotic manipulators. Using two Kuka Iiwa 14, we show how to design a policy for general-purpose robotic manipulators for the air hockey game. We demonstrate that a real robot arm can perform fast-hitting movements and that the two robots can play against each other on a medium-size air hockey table in simulation., Comment: 2021 IEEE/RJS International Conference on Intelligent RObots and Systems (IROS)
- Published
- 2021
18. Structured Policy Representation: Imposing Stability in arbitrarily conditioned dynamic systems
- Author
-
Urain, Julen, Tateo, Davide, Ren, Tianyu, and Peters, Jan
- Subjects
Computer Science - Robotics ,Computer Science - Machine Learning - Abstract
We present a new family of deep neural network-based dynamic systems. The presented dynamics are globally stable and can be conditioned with an arbitrary context state. We show how these dynamics can be used as structured robot policies. Global stability is one of the most important and straightforward inductive biases as it allows us to impose reasonable behaviors outside the region of the demonstrations., Comment: Presented in NeurIPS 2020, 3rd Robot Learning Workshop. Stability, Few-Shot Learning, Deep Dynamic Systems
- Published
- 2020
19. ImitationFlow: Learning Deep Stable Stochastic Dynamic Systems by Normalizing Flows
- Author
-
Urain, Julen, Ginesi, Michelle, Tateo, Davide, and Peters, Jan
- Subjects
Computer Science - Machine Learning ,Computer Science - Robotics - Abstract
We introduce ImitationFlow, a novel Deep generative model that allows learning complex globally stable, stochastic, nonlinear dynamics. Our approach extends the Normalizing Flows framework to learn stable Stochastic Differential Equations. We prove the Lyapunov stability for a class of Stochastic Differential Equations and we propose a learning algorithm to learn them from a set of demonstrated trajectories. Our model extends the set of stable dynamical systems that can be represented by state-of-the-art approaches, eliminates the Gaussian assumption on the demonstrations, and outperforms the previous algorithms in terms of representation accuracy. We show the effectiveness of our method with both standard datasets and a real robot experiment., Comment: 7pages, 7 figures, IROS 2020
- Published
- 2020
20. Continuous Action Reinforcement Learning from a Mixture of Interpretable Experts
- Author
-
Akrour, Riad, Tateo, Davide, and Peters, Jan
- Subjects
Computer Science - Machine Learning ,Statistics - Machine Learning - Abstract
Reinforcement learning (RL) has demonstrated its ability to solve high dimensional tasks by leveraging non-linear function approximators. However, these successes are mostly achieved by 'black-box' policies in simulated domains. When deploying RL to the real world, several concerns regarding the use of a 'black-box' policy might be raised. In order to make the learned policies more transparent, we propose in this paper a policy iteration scheme that retains a complex function approximator for its internal value predictions but constrains the policy to have a concise, hierarchical, and human-readable structure, based on a mixture of interpretable experts. Each expert selects a primitive action according to a distance to a prototypical state. A key design decision to keep such experts interpretable is to select the prototypical states from trajectory data. The main technical contribution of the paper is to address the challenges introduced by this non-differentiable prototypical state selection procedure. Experimentally, we show that our proposed algorithm can learn compelling policies on continuous action deep RL benchmarks, matching the performance of neural network based policies, but returning policies that are more amenable to human inspection than neural network or linear-in-feature policies.
- Published
- 2020
21. MushroomRL: Simplifying Reinforcement Learning Research
- Author
-
D'Eramo, Carlo, Tateo, Davide, Bonarini, Andrea, Restelli, Marcello, and Peters, Jan
- Subjects
Computer Science - Machine Learning ,Statistics - Machine Learning - Abstract
MushroomRL is an open-source Python library developed to simplify the process of implementing and running Reinforcement Learning (RL) experiments. Compared to other available libraries, MushroomRL has been created with the purpose of providing a comprehensive and flexible framework to minimize the effort in implementing and testing novel RL methodologies. Indeed, the architecture of MushroomRL is built in such a way that every component of an RL problem is already provided, and most of the time users can only focus on the implementation of their own algorithms and experiments. The result is a library from which RL researchers can significantly benefit in the critical phase of the empirical analysis of their works. MushroomRL stable code, tutorials and documentation can be found at https://github.com/MushroomRL/mushroom-rl., Comment: Under revision to JMLR
- Published
- 2020
22. Long-Term Visitation Value for Deep Exploration in Sparse Reward Reinforcement Learning
- Author
-
Parisi, Simone, Tateo, Davide, Hensel, Maximilian, D'Eramo, Carlo, Peters, Jan, and Pajarinen, Joni
- Subjects
Computer Science - Machine Learning ,Statistics - Machine Learning - Abstract
Reinforcement learning with sparse rewards is still an open challenge. Classic methods rely on getting feedback via extrinsic rewards to train the agent, and in situations where this occurs very rarely the agent learns slowly or cannot learn at all. Similarly, if the agent receives also rewards that create suboptimal modes of the objective function, it will likely prematurely stop exploring. More recent methods add auxiliary intrinsic rewards to encourage exploration. However, auxiliary rewards lead to a non-stationary target for the Q-function. In this paper, we present a novel approach that (1) plans exploration actions far into the future by using a long-term visitation count, and (2) decouples exploration and exploitation by learning a separate function assessing the exploration value of the actions. Contrary to existing methods which use models of reward and dynamics, our approach is off-policy and model-free. We further propose new tabular environments for benchmarking exploration in reinforcement learning. Empirical results on classic and novel benchmarks show that the proposed approach outperforms existing methods in environments with sparse rewards, especially in the presence of rewards that create suboptimal modes of the objective function. Results also suggest that our approach scales gracefully with the size of the environment. Source code is available at https://github.com/sparisi/visit-value-explore
- Published
- 2019
- Full Text
- View/download PDF
23. Safe Reinforcement Learning of Dynamic High-Dimensional Robotic Tasks: Navigation, Manipulation, Interaction
- Author
-
Liu, Puze, primary, Zhang, Kuo, additional, Tateo, Davide, additional, Jauhri, Snehal, additional, Hu, Zhiyuan, additional, Peters, Jan, additional, and Chalvatzaki, Georgia, additional
- Published
- 2023
- Full Text
- View/download PDF
24. Learning-Based Design and Control for Quadrupedal Robots With Parallel-Elastic Actuators
- Author
-
Bjelonic, Filip, primary, Lee, Joonho, additional, Arm, Philip, additional, Sako, Dhionis, additional, Tateo, Davide, additional, Peters, Jan, additional, and Hutter, Marco, additional
- Published
- 2023
- Full Text
- View/download PDF
25. Fast Kinodynamic Planning on the Constraint Manifold With Deep Neural Networks
- Author
-
Kicki, Piotr, Liu, Puze, Tateo, Davide, Bou-Ammar, Haitham, Walas, Krzysztof, Skrzypczynski, Piotr, and Peters, Jan
- Abstract
Motion planning is a mature area of research in robotics with many well-established methods based on optimization or sampling the state space, suitable for solving kinematic motion planning. However, when dynamic motions under constraints are needed and computation time is limited, fast kinodynamic planning on the constraint manifold is indispensable. In recent years, learning-based solutions have become alternatives to classical approaches, but they still lack comprehensive handling of complex constraints, such as planning on a lower dimensional manifold of the task space while considering the robot's dynamics. This article introduces a novel learning-to-plan framework that exploits the concept of constraint manifold, including dynamics, and neural planning methods. Our approach generates plans satisfying an arbitrary set of constraints and computes them in a short constant time, namely the inference time of a neural network. This allows the robot to plan and replan reactively, making our approach suitable for dynamic environments. We validate our approach on two simulated tasks and in a demanding real-world scenario, where we use a Kuka LBR Iiwa 14 robotic arm to perform the hitting movement in robotic air hockey.
- Published
- 2024
- Full Text
- View/download PDF
26. Fast Kinodynamic Planning on the Constraint Manifold With Deep Neural Networks
- Author
-
Kicki, Piotr, primary, Liu, Puze, additional, Tateo, Davide, additional, Bou-Ammar, Haitham, additional, Walas, Krzysztof, additional, Skrzypczyński, Piotr, additional, and Peters, Jan, additional
- Published
- 2023
- Full Text
- View/download PDF
27. Regularized Deep Signed Distance Fields for Reactive Motion Generation
- Author
-
Liu, Puze, primary, Zhang, Kuo, additional, Tateo, Davide, additional, Jauhri, Snehal, additional, Peters, Jan, additional, and Chalvatzaki, Georgia, additional
- Published
- 2022
- Full Text
- View/download PDF
28. Learning Stable Vector Fields on Lie Groups
- Author
-
Urain, Julen, primary, Tateo, Davide, additional, and Peters, Jan, additional
- Published
- 2022
- Full Text
- View/download PDF
29. Long-Term Visitation Value for Deep Exploration in Sparse-Reward Reinforcement Learning
- Author
-
Parisi, Simone, primary, Tateo, Davide, additional, Hensel, Maximilian, additional, D’Eramo, Carlo, additional, Peters, Jan, additional, and Pajarinen, Joni, additional
- Published
- 2022
- Full Text
- View/download PDF
30. Efficient and Reactive Planning for High Speed Robot Air Hockey
- Author
-
Liu, Puze, primary, Tateo, Davide, additional, Bou-Ammar, Haitham, additional, and Peters, Jan, additional
- Published
- 2021
- Full Text
- View/download PDF
31. Continuous Action Reinforcement Learning From a Mixture of Interpretable Experts.
- Author
-
Akrour, Riad, Tateo, Davide, and Peters, Jan
- Subjects
- *
ACTIVE learning , *NONLINEAR functions , *MACHINE learning , *REINFORCEMENT learning , *APPROXIMATION algorithms - Abstract
Reinforcement learning (RL) has demonstrated its ability to solve high dimensional tasks by leveraging non-linear function approximators. However, these successes are mostly achieved by ’black-box’ policies in simulated domains. When deploying RL to the real world, several concerns regarding the use of a ’black-box’ policy might be raised. In order to make the learned policies more transparent, we propose in this paper a policy iteration scheme that retains a complex function approximator for its internal value predictions but constrains the policy to have a concise, hierarchical, and human-readable structure, based on a mixture of interpretable experts. Each expert selects a primitive action according to a distance to a prototypical state. A key design decision to keep such experts interpretable is to select the prototypical states from trajectory data. The main technical contribution of the paper is to address the challenges introduced by this non-differentiable prototypical state selection procedure. Experimentally, we show that our proposed algorithm can learn compelling policies on continuous action deep RL benchmarks, matching the performance of neural network based policies, but returning policies that are more amenable to human inspection than neural network or linear-in-feature policies. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
32. An Empirical Analysis of Measure-Valued Derivatives for Policy Gradients
- Author
-
Carvalho, Joao, primary, Tateo, Davide, additional, Muratore, Fabio, additional, and Peters, Jan, additional
- Published
- 2021
- Full Text
- View/download PDF
33. Structured Policy Representation. Stability in arbitrarily conditioned dynamic systems
- Author
-
Urain, Julen, Tateo, Davide, Tianyu Ren, and Peters, Jan
- Subjects
GeneralLiterature_MISCELLANEOUS - Abstract
The poster presents a new family ofdeep neural network-based dynamic systems and how these dynamics can be used as structured robot policies.Additionally, the poster details the concept ofglobal stability, as one of the most important and straightforward inductive biases which allows to impose reasonable behaviours outside the region of the demonstrations. In the work, a novel set ofConditional Invertible Neural Networkswere developed. Invertible neural networks are a special type of networks that allow to compute the inverse and thus, we exploited this property to learn globally stable conditioned dynamics. The developed networks were applied forImitation Learningproblems. In our work, we presented a toy-task in which a limit cycle vector field was adapted given a phase variable, a 2D obstacle avoidance task, in which the robot should arrive to a target while avoiding a set of possible obstacles and finally, a robot learning task, in which the robot should learn how to pour in a randomly position pot from data. The obtained results would be exploited inSharework EU project. A software module on primitives learning is dedicated to developing new movement primitives that will allow to model both human and robot movements for human motion prediction or robot motion control.
- Published
- 2020
- Full Text
- View/download PDF
34. Continuous Action Reinforcement Learning from a Mixture of Interpretable Experts
- Author
-
Akrour, Riad, primary, Tateo, Davide, additional, and Peters, Jan, additional
- Published
- 2021
- Full Text
- View/download PDF
35. ImitationFlow: Learning Deep Stable Stochastic Dynamic Systems by Normalizing Flows
- Author
-
Urain, Julen, primary, Ginesi, Michele, additional, Tateo, Davide, additional, and Peters, Jan, additional
- Published
- 2020
- Full Text
- View/download PDF
36. Graph-Based Design of Hierarchical Reinforcement Learning Agents
- Author
-
Tateo, Davide, primary, Erdenlig, Idil Su, additional, and Bonarini, Andrea, additional
- Published
- 2019
- Full Text
- View/download PDF
37. A Sampling-Based Algorithm for Planning Smooth Nonholonomic Paths
- Author
-
Beretta, Carolina, primary, Brizzolari, Cecilia, additional, Tateo, Davide, additional, Riva, Alessandro, additional, and Amigoni, Francesco, additional
- Published
- 2019
- Full Text
- View/download PDF
38. MushroomRL: Simplifying Reinforcement Learning Research.
- Author
-
D'Eramo, Carlo, Tateo, Davide, Bonarini, Andrea, Restelli, Marcello, and Peters, Jan
- Subjects
- *
REINFORCEMENT learning , *PYTHON programming language , *ALGORITHMS - Abstract
MushroomRL is an open-source Python library developed to simplify the process of implementing and running Reinforcement Learning (RL) experiments. Compared to other available libraries, MushroomRL has been created with the purpose of providing a comprehensive and flexible framework to minimize the eort in implementing and testing novel RL methodologies. The architecture of MushroomRL is built in such a way that every component of a typical RL experiment is already provided, and most of the time users can only focus on the implementation of their own algorithms. MushroomRL is accompanied by a benchmarking suite collecting experimental results of state-of-the-art deep RL algorithms, and allowing to benchmark new ones. The result is a library from which RL researchers can signicantly benet in the critical phase of the empirical analysis of their works. MushroomRL stable code, tutorials, and documentation can be found at https://github.com/MushroomRL/mushroom-rl. [ABSTRACT FROM AUTHOR]
- Published
- 2021
39. Multiagent Connected Path Planning: PSPACE-Completeness and How to Deal With It
- Author
-
Tateo, Davide, primary, Banfi, Jacopo, additional, Riva, Alessandro, additional, Amigoni, Francesco, additional, and Bonarini, Andrea, additional
- Published
- 2018
- Full Text
- View/download PDF
40. Exploiting structure and uncertainty of Bellman updates in Markov decision processes
- Author
-
Tateo, Davide, primary, D'Eramo, Carlo, additional, Nuara, Alessandro, additional, Restelli, Marcello, additional, and Bonarini, Andrea, additional
- Published
- 2017
- Full Text
- View/download PDF
41. Gradient-based minimization for multi-expert Inverse Reinforcement Learning
- Author
-
Tateo, Davide, primary, Pirotta, Matteo, additional, Restelli, Marcello, additional, and Bonarini, Andrea, additional
- Published
- 2017
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.