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

Michael Lutter

dblp:234/2522 · DBLP profile ↗
← Back
6ranked-venue papers
5as first author
4since 2021 · last 2023
0000-0002-9019-6769ORCID · corroborated

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

Artificial intelligence and machine learning · 6 · 5 first-author · 4 since 2021Systems, architecture and hardware · 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
5 papers
Reinforcement learning · 75% Motion planning and robot control · 9% 3D vision · 8%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
model-based reinforcement learning
1.222023
Diminishing Return of Value Expansion Methods in Model-Based Reinforcement Learning · ICLR 2023
Differentiable Physics Models for Real-world Offline Model-based Reinforcement Learning · ICRA 2021
Machine learning › Reinforcement learning › dynamic programming
value iteration
1.222023
Continuous-Time Fitted Value Iteration for Robust Policies · IEEE Trans. Pattern Anal. Mach. Intell. 2023
Value Iteration in Continuous Actions, States and Time · ICML 2021
Machine learning › Reinforcement learning
robust reinforcement learning
0.712023
Continuous-Time Fitted Value Iteration for Robust Policies · IEEE Trans. Pattern Anal. Mach. Intell. 2023
Machine learning › Reinforcement learning › model-based reinforcement learning
value expansion
0.712023
Diminishing Return of Value Expansion Methods in Model-Based Reinforcement Learning · ICLR 2023
Machine learning › Reinforcement learning
continuous control
0.512021
Value Iteration in Continuous Actions, States and Time · ICML 2021
Computer vision › 3D vision › physical simulation
differentiable physics
0.512021
Differentiable Physics Models for Real-world Offline Model-based Reinforcement Learning · ICRA 2021
Machine learning › Reinforcement learning › offline reinforcement learning
model-based offline reinforcement learning
0.512021
Differentiable Physics Models for Real-world Offline Model-based Reinforcement Learning · ICRA 2021
Robotics › Motion planning and robot control › robot dynamics
lagrangian dynamics
0.412019
Deep Lagrangian Networks: Using Physics as Model Prior for Deep Learning · ICLR (Poster) 2019
Machine learning › Deep learning architectures and training
physics-informed neural network
0.412019
Deep Lagrangian Networks: Using Physics as Model Prior for Deep Learning · ICLR (Poster) 2019
Robotics › Motion planning and robot control
robot control
0.212023
Continuous-Time Fitted Value Iteration for Robust Policies · IEEE Trans. Pattern Anal. Mach. Intell. 2023

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

fitted value iteration · 1.2value expansion · 0.7hamilton-jacobi-isaacs equation · 0.7hamilton-jacobi-bellman equation · 0.7parameter identification · 0.5dynamic programming · 0.5differentiable physics · 0.5automatic differentiation · 0.5deep lagrangian networks · 0.4
YearPublicationVenuePosition
2023 Diminishing Return of Value Expansion Methods in Model-Based Reinforcement Learning
Daniel Palenicek, Michael Lutter, Jan Peters 0001
ICLR2
2023 Continuous-Time Fitted Value Iteration for Robust Policies
abstract
Solving the Hamilton-Jacobi-Bellman equation is important in many domains including control, robotics and economics. Especially for continuous control, solving this differential equation and its extension the Hamilton-Jacobi-Isaacs equation, is important as it yields the optimal policy that achieves the maximum reward on a give task. In the case of the Hamilton-Jacobi-Isaacs equation, which includes an adversary controlling the environment and minimizing the reward, the obtained policy is also robust to perturbations of the dynamics. In this paper we propose continuous fitted value iteration (cFVI) and robust fitted value iteration (rFVI). These algorithms leverage the non-linear control-affine dynamics and separable state and action reward of many continuous control problems to derive the optimal policy and optimal adversary in closed form. This analytic expression simplifies the differential equations and enables us to solve for the optimal value function using value iteration for continuous actions and states as well as the adversarial case. Notably, the resulting algorithms do not require discretization of states or actions. We apply the resulting algorithms to the Furuta pendulum and cartpole. We show that both algorithms obtain the optimal policy. The robustness Sim2Real experiments on the physical systems show that the policies successfully achieve the task in the real-world. When changing the masses of the pendulum, we observe that robust value iteration is more robust compared to deep reinforcement learning algorithm and the non-robust version of the algorithm. Videos of the experiments are shown at https://sites.google.com/view/rfvi.
Michael Lutter, Boris Belousov, Shie Mannor, Dieter Fox, Animesh Garg, Jan Peters 0001
IEEE Trans. Pattern Anal. Mach. Intell.1
2021 Value Iteration in Continuous Actions, States and Time
abstract
Classical value iteration approaches are not applicable to environments with continuous states and actions. For such environments the states and actions must be discretized, which leads to an exponential increase in computational complexity. In this paper, we propose continuous fitted value iteration (cFVI). This algorithm enables dynamic programming for continuous states and actions with a known dynamics model. Exploiting the continuous time formulation, the optimal policy can be derived for non-linear control-affine dynamics. This closed-form solution enables the efficient extension of value iteration to continuous environments. We show in non-linear control experiments that the dynamic programming solution obtains the same quantitative performance as deep reinforcement learning methods in simulation but excels when transferred to the physical system.The policy obtained by cFVI is more robust to changes in the dynamics despite using only a deterministic model and without explicitly incorporating robustness in the optimization
Michael Lutter, Shie Mannor, Jan Peters 0001, Dieter Fox, Animesh Garg
ICML1
2021 Differentiable Physics Models for Real-world Offline Model-based Reinforcement Learning
abstract
A limitation of model-based reinforcement learning (MBRL) is the exploitation of errors in the learned models. Blackbox models can fit complex dynamics with high fidelity, but their behavior is undefined outside of the data distribution. Physics-based models are better at extrapolating, due to the general validity of their informed structure, but underfit in the real world due to the presence of unmodeled phenomena. In this work, we demonstrate experimentally that for the offline model-based reinforcement learning setting, physics-based models can be beneficial compared to high-capacity function approximators if the mechanical structure is known. Physics-based models can learn to perform the ball in a cup (BiC) task on a physical manipulator using only 4 minutes of sampled data using offline MBRL. We find that black-box models consistently produce unviable policies for BiC as all predicted trajectories diverge to physically impossible state, despite having access to more data than the physics-based model. In addition, we generalize the approach of physics parameter identification from modeling holonomic multi-body systems to systems with nonholonomic dynamics using end-to-end automatic differentiation.Videos: https://sites.google.com/view/ball-in-a-cup-in-4-minutes/
Michael Lutter, Johannes Silberbauer, Joe Watson, Jan Peters 0001
ICRA1
2019 Deep Lagrangian Networks: Using Physics as Model Prior for Deep Learning
Michael Lutter, Christian Ritter, Jan Peters 0001
ICLR (Poster)1
2019 Deep Lagrangian Networks for end-to-end learning of energy-based control for under-actuated systems
abstract
Applying Deep Learning to control has a lot of potential for enabling the intelligent design of robot control laws. Unfortunately common deep learning approaches to control, such as deep reinforcement learning, require an unrealistic amount of interaction with the real system, do not yield any performance guarantees, and do not make good use of extensive insights from control theory. In particular, common black-box approaches - that abandon all insight from control - are not suitable for complex robot systems. We propose a deep control approach as a bridge between the solid theoretical foundations of energy-based control and the flexibility of deep learning. To accomplish this goal, we extend Deep Lagrangian Networks (DeLaN) to not only adhere to Lagrangian Mechanics but also ensure conservation of energy and passivity of the learned representation. This novel extension is embedded within a energy control law to control under-actuated systems. The resulting DeLaN for energy control (DeLaN 4EC) is the first model learning approach using generic function approximation that is capable of learning energy control because existing approaches cannot learn the system energies directly. DeLaN 4EC exhibits excellent real-time control on the physical Furuta pendulum and learns to swing-up the pendulum while the control law using system identification does not.
Michael Lutter, Kim Listmann, Jan Peters 0001
IROS1