Zobrazeno 1 - 10
of 7 250
pro vyhledávání: '"A Pitz"'
In-hand manipulation with multi-fingered hands is a challenging problem that recently became feasible with the advent of deep reinforcement learning methods. While most contributions to the task brought improvements in robustness and generalization,
Externí odkaz:
http://arxiv.org/abs/2411.13148
Autor:
Pitz, Max, Stegemann, Jacob
In 1960, Nash-Williams proved his strong orientation theorem that every finite graph has an orientation in which the number of directed paths between any two vertices is at least half the number of undirected paths between them (rounded down). Nash-W
Externí odkaz:
http://arxiv.org/abs/2409.10378
In this work we investigate the properties of neutron stars admixed with selfinteracting scalar bosonic dark matter. The dark matter interaction is described by a generalized $\phi^n$ power-law potential. We perform a stability analysis of these two-
Externí odkaz:
http://arxiv.org/abs/2408.13157
Autor:
Lewen, Jan, Pargmann, Max, Cherti, Mehdi, Jitsev, Jenia, Pitz-Paal, Robert, Quinto, Daniel Maldonado
Concentrating Solar Power (CSP) plants play a crucial role in the global transition towards sustainable energy. A key factor in ensuring the safe and efficient operation of CSP plants is the distribution of concentrated flux density on the receiver.
Externí odkaz:
http://arxiv.org/abs/2408.10802
Reorienting diverse objects with a multi-fingered hand is a challenging task. Current methods in robotic in-hand manipulation are either object-specific or require permanent supervision of the object state from visual sensors. This is far from human
Externí odkaz:
http://arxiv.org/abs/2407.18834
Kriz and Thomas showed that every (finite or infinite) graph of tree-width $k \in \mathbb{N}$ admits a lean tree-decomposition of width $k$. We discuss a number of counterexamples demonstrating the limits of possible generalisations of their result t
Externí odkaz:
http://arxiv.org/abs/2405.06755
We prove that every graph which admits a tree-decomposition into finite parts has a rooted tree-decomposition into finite parts that is linked, tight and componental. As an application, we obtain that every graph without half-grid minor has a lean tr
Externí odkaz:
http://arxiv.org/abs/2405.06753
Autor:
Bowler, Nathan, Pitz, Max
We present an elementary construction of an uncountably chromatic graph without uncountable, infinitely connected subgraphs.
Comment: 3 pages; V2 corrects a mistake in the last line of the proof
Comment: 3 pages; V2 corrects a mistake in the last line of the proof
Externí odkaz:
http://arxiv.org/abs/2402.05984
This paper identifies and addresses the problems with naively combining (reinforcement) learning-based controllers and state estimators for robotic in-hand manipulation. Specifically, we tackle the challenging task of purely tactile, goal-conditioned
Externí odkaz:
http://arxiv.org/abs/2311.04060
Publikováno v:
European Journal of Combinatorics (2024)
Nash-Williams proved in 1960 that a finite graph admits a $k$-arc-connected orientation if and only if it is $2k$-edge-connected, and conjectured that the same result should hold for all infinite graphs, too. Progress on Nash-Williams's problem was m
Externí odkaz:
http://arxiv.org/abs/2310.03601