SearcharxivSearch

arXiv subjects

Davide Buoso

Publications and source records attributed to Davide Buoso.

At least 19 recordsLinked to original sources

GORDON: Graph-based Object-centric Rewards for Decomposition of Long-Horizon Manipulation

Learning long-horizon manipulation skills with reinforcement learning remains challenging due to the complexity of reward design, the limited guidance of sparse rewards, and the high cost of manual subtask annotation. Visual demonstrations can provide supervision for reward learning, but rewards learned from raw pixels can be brittle and sensitive to visual variation, background appearance, and robot motion. In this work, we propose GORDON, a graph-based object-centric reward learning framework that learns dense rewards from action-free video demonstrations. Each visual scene is represented as a graph of detected objects and spatial relations, and a graph neural network is trained in a self-supervised manner to embed these graphs into a task-aligned latent space. To align the representation with semantic task progress, we introduce an activity-aware weighted pooling mechanism that emphasizes task-relevant objects while masking robot-dominated motion. The dense reward is then computed as distances in the learned latent space of the current state to demonstrated goal configurations, providing a measure of task progress. In long-horizon tasks, the temporal profile of this reward reveals stage-wise object-state transitions, enabling automatic subtask discovery without manual segmentation. The discovered segments are then used to train subtask-specific rewards and specialized policies that are composed sequentially. Experiments on seven manipulation tasks on MAGICAL and ManiSkill3 benchmarks show that our object-centric reward improves reinforcement learning in short-horizon settings and enables successful policy learning in complex long-horizon tasks through automatic decomposition, achieving an average success rate of 74.4% across the long-horizon tasks (on average approximately +35 p.p. vs. best learned baseline and approximately +25 p.p. vs. oracle).

cs.RO

Fixed External Cameras as Common Prior Maps for Active 3D Scene Graph Generation

Commonly available prior information, such as BIM models, floor plans, and remote sensing images, can provide valuable geometric and semantic context for autonomous robotic systems. In this paper, we treat observations from fixed external RGB cameras as Common Prior Maps (CPMs): wide-field views of the environment that initialize a semantic and geometric scene prior before any robot motion begins. We present an RGB-only framework for active, incremental 3D scene graph (3DSG) generation that seamlessly fuses observations from both onboard robot cameras and fixed external cameras within a single hardware-agnostic pipeline. By relying solely on RGB observations processed by a feed-forward 3D reconstruction model, the system treats all cameras - onboard or external - identically, requiring no hardware modifications. A graph-based active semantic exploration framework then directly leverages the partial scene graph to guide the robot toward regions of high semantic uncertainty, progressively completing and refining the prior. Experiments demonstrate that bootstrapping the scene graph with even a single external camera increases initial object recall by up to +79%, and that the richer context of the prior significantly improves the efficiency of subsequent active exploration.

cs.RO

RGB-only Active 3D Scene Graph Generation for Indoor Mobile Robots

Current approaches to 3D scene graph generation rely on dedicated depth sensors, such as LiDAR or RGB-D cameras, for metric 3D reconstruction. This limits deployment to specialized robotic platforms and excludes settings where only RGB cameras are available, such as fixed external infrastructure. Existing pipelines also typically operate on passively collected observation trajectories, rather than selecting viewpoints based on the partially built scene representation, and therefore fail to effectively exploit the semantic and spatial information encoded within the graph during exploration. This paper presents a fully visual framework for the active, incremental construction of 3D scene graphs from RGB input only, addressing both limitations. The proposed approach unifies perception and planning around a shared structured representation that captures object semantics, 3D geometry, relational context, and information from multiple viewpoints. Because the framework is hardware-agnostic and relies only on RGB observations, it can incorporate inputs from both onboard robot cameras and fixed external cameras within the same representation. Experiments on the Replica dataset show that the RGB-only pipeline achieves F1-score parity with baselines using ground-truth depth. Active exploration experiments on ReplicaCAD further show that semantic-driven viewpoint selection detects more than twice as many objects as a geometric frontier-based baseline under the same exploration budget. Finally, the external-camera setting demonstrates that complementary RGB views can effectively bootstrap the scene graph and improve contextual understanding at no additional exploration cost.

cs.RO

GAP: Geometric Anchor Pre-training for Data-Efficient Visuomotor Learning of Manipulation Tasks

Learning visuomotor policies from scarce expert demonstrations remains a core challenge in robotic manipulation. A primary hurdle lies in distilling high-dimensional RGB representations into control-relevant geometry without overfitting. While using frozen pre-trained Vision Foundation Models (VFMs) improves data efficiency, it also shifts most task adaptation onto a small spatial pooling module, which can latch onto task-irrelevant shortcuts and lose geometric grounding when finetuned with few data samples. More broadly, pre-trained visual representations used for policy learning have been observed to struggle under even minor scene perturbations, highlighting the need for robustness-oriented inductive biases. We propose Geometric Anchor Pre-training (GAP), a simple, action-free warm-up stage that regularizes the spatial adapter before downstream imitation learning. GAP pre-trains the pooling layer on a lightweight simulated proxy task where object masks are available at no cost, encouraging the adapter to produce keypoints that lie on the object, cover its spatial extent, and remain sharp and repeatable over time. This yields stable geometric anchors that provide a reliable coordinate interface for few-shot policy learning, while keeping the VFM frozen. We evaluate GAP on RoboMimic and ManiSkill under severe data scarcity (15-50 demonstrations) and domain shift. A simple adapter regularized with GAP consistently outperforms stronger attention-based poolers and end-to-end fine-tuning, achieving 62% success on RoboMimic Can with 15 demonstrations (+16% over AFA), 63% on the long-horizon high-precision Tool Hang task with 50 demonstrations, and 61% on ManiSkill StackCube with 30 demonstrations (+11% over full fine-tuning). The proxy stage is lightweight and fully decoupled from downstream tasks, making it practical to reuse across environments and manipulation skills.

cs.RO

On the eigenvalues of the biharmonic operator on annuli

We show that the fundamental tone of the bilaplacian with Dirichlet or Navier boundary conditions on radially symmetric domains is always simple in dimension $N\ge3$. In dimension $N=2$ we show that it is simple if the inner radius is big enough.

math.AP

Sharp inequalities and asymptotics for polyharmonic eigenvalues

We study eigenvalues of general scalar Dirichlet polyharmonic problems in domains in $\mathbb R^{d}$. We first prove a number of inequalities satisfied by the eigenvalues on general domains, depending on the relations between the orders of the operators involved. We then obtain several estimates for these eigenvalues, yielding their growth as a function of these orders. For the problem in the ball we derive the general form of eigenfunctions together with the equations satisfied by the corresponding eigenvalues, and obtain several bounds for the first eigenvalue. In the case of the polyharmonic operator of order $2m$ we derive precise bounds yielding the first two terms in the asymptotic expansion for the first normalised eigenvalue as $m$ grows to infinity. These results allow us to obtain the order of growth for the $k^{\rm th}$ polyharmonic eigenvalue on general domains.

math.AP

Spectral convergence for the Reissner-Mindlin system in arbitrary dimension

We establish the convergence of the resolvent of the Reissner-Mindlin system in any dimension $N \geq 2$, with any of the physically relevant boundary conditions, to the resolvent of the biharmonic operator with suitably defined boundary conditions in the vanishing thickness limit. Moreover, given a thin domain $Ω_δ$ in ${\mathbb R}^N$ with $1 \leq d < N$ thin directions, we prove that the resolvent of the Reissner-Mindlin system with free boundary conditions converges to the resolvent of a suitably defined Reissner-Mindlin system in the limiting domain $Ω\subset {\mathbb{R}}^{N-d}$ as $δ\to 0^+$. In both cases, the convergence is in operator norm, implying therefore the convergence of all the eigenvalues and spectral projections. In the thin domain case, we formulate a conjecture on the rate of convergence in terms of $δ$, which is verified in the case of the cylinder $Ω\times B_d(0, δ)$.

math.AP

Select2Plan: Training-Free ICL-Based Planning through VQA and Memory Retrieval

This study explores the potential of off-the-shelf Vision-Language Models (VLMs) for high-level robot planning in the context of autonomous navigation. Indeed, while most of existing learning-based approaches for path planning require extensive task-specific training/fine-tuning, we demonstrate how such training can be avoided for most practical cases. To do this, we introduce Select2Plan (S2P), a novel training-free framework for high-level robot planning which completely eliminates the need for fine-tuning or specialised training. By leveraging structured Visual Question-Answering (VQA) and In-Context Learning (ICL), our approach drastically reduces the need for data collection, requiring a fraction of the task-specific data typically used by trained models, or even relying only on online data. Our method facilitates the effective use of a generally trained VLM in a flexible and cost-efficient way, and does not require additional sensing except for a simple monocular camera. We demonstrate its adaptability across various scene types, context sources, and sensing setups. We evaluate our approach in two distinct scenarios: traditional First-Person View (FPV) and infrastructure-driven Third-Person View (TPV) navigation, demonstrating the flexibility and simplicity of our method. Our technique significantly enhances the navigational capabilities of a baseline VLM of approximately 50% in TPV scenario, and is comparable to trained models in the FPV one, with as few as 20 demonstrations.

cs.RO

Semiclassical estimates for eigenvalue means of Laplacians on spheres

We compute three-term semiclassical asymptotic expansions of counting functions and Riesz-means of the eigenvalues of the Laplacian on spheres and hemispheres, for both Dirichlet and Neumann boundary conditions. Specifically for Riesz-means we prove upper and lower bounds involving asymptotically sharp shift terms, and we extend them to domains of $\mathbb S^d$. We also prove a Berezin-Li-Yau inequality for domains contained in the hemisphere $\mathbb S^2_+$. Moreover, we consider polyharmonic operators for which we prove analogous results that highlight the role of dimension for Pólya-type inequalities. Finally, we provide sum rules for Laplacian eigenvalues on spheres and compact two-point homogeneous spaces.

math.SP

Bulk-Boundary eigenvalues for Bilaplacian problems

We initiate the study of a bulk-boundary eigenvalue problem for the Bilaplacian with a particular third order boundary condition that arises from the study of dynamical boundary conditions for the Cahn-Hilliard equation. First we consider continuity properties under parameter variation (in which the parameter also affects the domain of definition of the operator). Then we look at the ball and the annulus geometries (together with the punctured ball), obtaining the eigenvalues as solutions of a precise equation involving special functions. An interesting outcome of our analysis in the annulus case is the presence of a bifurcation from the zero eigenvalue depending on the size of the annulus.

math.AP

Semiclassical bounds for spectra of biharmonic operators

We provide complementary semiclassical bounds for the Riesz means $R_1(z)$ of the eigenvalues of various biharmonic operators, with a second term in the expected power of $z$. The method we discuss makes use of the averaged variational principle (AVP), and yields two-sided bounds for individual eigenvalues, which are semiclassically sharp. The AVP also yields comparisons with Riesz means of different operators, in particular Laplacians.

math.SP

On the spectral asymptotics for the buckling problem

We provide a direct proof of Weyl's law for the buckling eigenvalues of the biharmonic operator on a wide class of domains of $\mathbb R^d$ including bounded Lipschitz domains. The proof relies on asymptotically sharp lower and upper bounds that we develop for the Riesz mean $R_2(z)$. Lower bounds are obtained by making use of the so-called "averaged variational principle". Upper bounds are obtained in the spirit of Berezin-Li-Yau. Moreover, we state a conjecture for the second term in Weyl's law and prove its correctness in two special cases: balls in $\mathbb R^d$ and bounded intervals in $\mathbb R$.

math.SP

The Bilaplacian with Robin boundary conditions

We introduce Robin boundary conditions for biharmonic operators, which are a model for elastically supported plates and are closely related to the study of spaces of traces of Sobolev functions. We study the dependence of the operator, its eigenvalues, and eigenfunctions on the Robin parameters. We show in particular that when the parameters go to plus infinity the Robin problem converges to other biharmonic problems, and obtain estimates on the rate of divergence when the parameters go to minus infinity. We also analyse the dependence of the operator on smooth perturbations of the domain, computing the shape derivatives of the eigenvalues and giving a characterisation for critical domains under volume and perimeter constraints. We include a number of open problems arising in the context of our results.

math.AP

The buckling eigenvalue problem in the annulus

We consider the buckling eigenvalue problem for a clamped plate in the annulus. We identify the first eigenvalue in dependence of the inner radius, and study the number of nodal domains of the corresponding eigenfunctions. Moreover, in order to investigate the asymptotic behavior of eigenvalues and eigenfunctions as the inner radius approaches the outer one, we provide an analytical study of the buckling problem in rectangles with mixed boundary conditions.

math.SP

A Minimaxmax Problem for Improving the Torsional Stability of Rectangular Plates

We use a gap function in order to compare the torsional performances of different reinforced plates under the action of external forces. Then, we address a shape optimization problem, whose target is to minimize the torsional displacements of the plate: this leads us to set up a minimaxmax problem, which includes a new kind of worst-case optimization. Two kinds of reinforcements are considered: one aims at strengthening the plate, the other aims at weakening the action of the external forces. For both of them, we study the existence of optima within suitable classes of external forces and reinforcements. Our results are complemented with numerical experiments and with a number of open problems and conjectures.

math.AP

A measure of the torsional performances of partially hinged rectangular plates

We introduce a new functional, named gap function, which measures the torsional instability of a partially hinged rectangular plate, aiming to model the deck of a bridge. Then we test the performances of the gap function on a plate subject to two kinds of loads: one modeled by a force concentrating on one of the free edges and one in resonance with the eigenmodes.

math.AP

On the variation of longitudinal and torsional frequencies in a partially hinged rectangular plate

We consider a partially hinged rectangular plate and its normal modes. There are two families of modes, longitudinal and torsional. We study the variation of the corresponding eigenvalues under domain deformations. We investigate the possibility of finding a shape functional able to quantify the torsional instability of the plate, namely how prone is the plate to transform longitudinal oscillations into torsional ones. This functional should obey several rules coming from both theoretical and practical evidences. We show that a simple functional obeying all the required rules does not exist and that the functionals available in literature are not reliable.

math.AP

On the stability of some isoperimetric inequalities for the fundamental tones of free plates

We provide a quantitative version of the isoperimetric inequality for the fundamental tone of a biharmonic Neumann problem. Such an inequality has been recently established by Chasman adapting Weinberger's argument for the corresponding second order problem. Following a scheme introduced by Brasco and Pratelli for the second order case, we prove that a similar quantitative inequality holds also for the biharmonic operator. We also prove the sharpness of both such an inequality and the corresponding one for the biharmonic Steklov problem.

math.SP