Victor Klemm

Victor Klemm

Auto-generated profile, based on publicly available information

Victor Klemm

ETH Zurich

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 May 2019
Verified
Conference Paper
Closed access
VKVictor Klemm
Victor Klemm
AMAlessandro Morra
Alessandro Morra
CSCiro Salzmann
Ciro Salzmann
FTFlorian Tschopp
Florian Tschopp
KBKaren Bodie
Karen Bodie
RSRoland Siegwart
Roland Siegwart

9 March 2020 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
VKVictor Klemm
Victor Klemm
AMAlessandro Morra
Alessandro Morra
LGLionel Gulich
Lionel Gulich
DMDominik Mannhart
Dominik Mannhart
DRDavid Rohr
David Rohr
RSRoland Siegwart
Roland Siegwart
We present a hierarchical whole-body controller leveraging the full rigid body dynamics of the wheeled bipedal robot Ascento. We derive closed-form expressions for the dynamics of its kinematic loops in a way that readily generalizes to more complex systems. The rolling constraint is incorporated using a compact analytic solution based on rotation matrices. The non-minimum phase balancing dynamics are accounted for by including a linear-quadratic regulator as a motion task. Robustness when driving curves is increased by regulating the lean angle as a function of the zero-moment point. The proposed controller is computationally lightweight and significantly extends the rough-terrain capabilities and robustness of the system, as we demonstrate in several experiments.

20 October 2023 in IEEE Transactions on Robotics
Verified
Journal Article
Closed access
VKVictor Klemm
Victor Klemm
YVYvain de Viragh
Yvain de Viragh
DRDavid Rohr
David Rohr
RSRoland Siegwart
Roland Siegwart
MTMarco Tognon
Marco Tognon
Recent years have seen a steady rise in the abilities of wheeled–legged balancing robots. Yet, their use is still severely restricted by the lack of efficient control algorithms for overcoming obstacles such as stairs. We take a considerable step toward closing this gap by presenting a fast trajectory optimizer for generating trajectories over a large class of challenging terrains. By limiting the underlying modeling to the planar, nonlinear rigid-body dynamics and subdividing the terrain into contact-phases, a tractable nonlinear programming problem is obtained. The model explicitly accounts for contact switches and impacts, traction limits, and actuation bounds. By introducing an arc-length-related parametrization, the trajectories are rendered inherently contact constraint-consistent. We apply our method to the specific case of the wheeled bipedal robot Ascento , for which we derive closed-form expressions of the dynamics equations, including the kinematic loops. To track the trajectories, we propose a simple LQR-based controller. The approach is validated in real-world experiments where we show the execution of trajectories for traversing steps, driving up ramps, jumping, standing up, and driving up entire stairways. To the best of our knowledge, enabling the latter by means of trajectory optimization (TO) is a novelty for wheeled–legged robots.


29 June 2026 in The International Journal of Robotics Research
Verified
Journal Article
Closed access
KQKaixian Qu
Kaixian Qu
HWHan Wang
Han Wang
VKVictor Klemm
Victor Klemm
CCCesar Cadena
Cesar Cadena
MHMarco Hutter
Marco Hutter
Active perception is a fundamental problem in autonomous robotics in which the robot must decide where to move and what to sense in order to obtain the most informative observations for accomplishing its mission. Existing approaches either solve a computationally expensive traveling salesman problem over heuristically selected informative nodes, or adopt a more efficient but overly constrained shortest path tree formulation. To address these limitations, we explore beam search algorithms as scalable alternatives. While the standard beam search provides scalability by preserving the top- B paths at each depth level, it is prone to local optima and exhibits parameter sensitivity. Our first contribution is a node-wise beam search (NBS) algorithm, which maintains top- B candidates per node to enable more effective exploration of the solution space. Systematic benchmarking on graphs shows that NBS consistently outperforms other baselines and maintains strong performance even at low beam widths. As a second contribution, we integrate the concept of frontiers into the path selection criterion, introducing the expected gain metric, which better balances exploration and exploitation compared to existing alternatives. Our third contribution proposes the rapidly-exploring random annulus graph (RRAG), a novel graph construction method that preserves full orientation sampling and ensures connectivity in cluttered environments through a fallback local sampling-based planner. Extensive experiments demonstrate that NBS combined with RRAG achieves the highest performance across all three representative active perception tasks, outperforming state-of-the-art algorithms by at least 20% in one or more tasks. We further validate the approach on real robotic platforms in different scenarios. Project page: https://efficient-beam-search.github.io/

1 January 2026 in IEEE Transactions on Robotics
Verified
Journal Article
Closed access
CZChong Zhang
Chong Zhang
VKVictor Klemm
Victor Klemm
FYFan Yang
Fan Yang
MHMarco Hutter
Marco Hutter