Multi-Mode Pinching-Antenna Systems: Mode Selection or Mode Combining?

This letter proposes and evaluates two operating protocols, mode selection and mode combining, for multi-mode pinching-antenna systems to maximize sum rate in multi-user downlink communications via a jointly optimized PSO-KKT algorithm, demonstrating that mode combining offers superior spectral efficiency while mode selection provides a low-complexity alternative with comparable performance.

Xiaoxia Xu, Xidong Mu, Yuanwei Liu, Arumugam Nallanathan2026-03-10💻 cs

R2F: Repurposing Ray Frontiers for LLM-free Object Navigation

The paper proposes R2F, an LLM-free framework for zero-shot open-vocabulary object navigation that repurposes ray frontiers as direction-conditioned semantic hypotheses to achieve competitive performance with real-time execution, eliminating the latency and computational overhead of iterative large-model queries.

Francesco Argenziano, John Mark Alexis Marcelo, Michele Brienza, Abdel Hakim Drid, Emanuele Musumeci, Daniele Nardi, Domenico D. Bloisi, Vincenzo Suriani2026-03-10💻 cs

LAR-MoE: Latent-Aligned Routing for Mixture of Experts in Robotic Imitation Learning

LAR-MoE is a two-stage framework that decouples unsupervised skill discovery from policy learning by regularizing expert routing to align with a learned latent representation, enabling robots to achieve high success rates in heterogeneous manipulation tasks without requiring manual skill annotations.

Ariel Rodriguez, Chenpan Li, Lorenzo Mazza, Rayan Younis, Ortrun Hellig, Sebastian Bodenstedt, Martin Wagner, Stefanie Speidel2026-03-10💻 cs

An Open-Source Robotics Research Platform for Autonomous Laparoscopic Surgery

This paper introduces an open-source, robot-agnostic surgical robotics platform featuring a deterministic, closed-form RCM controller and full-stack ROS integration, which achieves sub-millimeter precision and expert-level trajectory smoothness in autonomous laparoscopic tasks across phantom, ex vivo, and in vivo porcine models.

Ariel Rodriguez, Lorenzo Mazza, Martin Lelis, Rayan Younis, Sebastian Bodenstedt, Martin Wagner, Stefanie Speidel2026-03-10💻 cs

Spherical-GOF: Geometry-Aware Panoramic Gaussian Opacity Fields for 3D Scene Reconstruction

Spherical-GOF is a novel geometry-aware panoramic rendering framework that extends Gaussian Opacity Fields to spherical ray space, achieving superior geometric consistency and photometric quality in 3D scene reconstruction by introducing efficient spherical culling and adaptive filtering to overcome the limitations of existing perspective-based adaptations.

Zhe Yang, Guoqiang Zhao, Sheng Wu, Kai Luo, Kailun Yang2026-03-10💻 cs

OccTrack360: 4D Panoptic Occupancy Tracking from Surround-View Fisheye Cameras

This paper introduces OccTrack360, a new benchmark for 4D panoptic occupancy tracking from surround-view fisheye cameras featuring long, diverse sequences and principled voxel visibility annotations, alongside the proposed Focus on Sphere Occ (FoSOcc) framework that effectively addresses fisheye distortion and localization challenges to establish a strong baseline for future research.

Yongzhi Lin, Kai Luo, Yuanfan Zheng, Hao Shi, Mengfei Duan, Yang Liu, Kailun Yang2026-03-10💻 cs

RetroAgent: From Solving to Evolving via Retrospective Dual Intrinsic Feedback

RetroAgent is an online reinforcement learning framework that enables LLM-based agents to evolve through a hindsight self-reflection mechanism generating dual intrinsic feedback—numerical progress tracking and retrievable language lessons via a novel SimUtil-UCB strategy—thereby achieving state-of-the-art performance and superior generalization on complex interactive tasks compared to existing methods.

Xiaoying Zhang, Zichen Liu, Yipeng Zhang, Xia Hu, Wenqi Shao2026-03-10💻 cs

PRISM: Streaming Human Motion Generation with Per-Joint Latent Decomposition

PRISM introduces a streaming human motion generation framework that employs a joint-factorized latent space and noise-free condition injection within a single foundation model to overcome representation entanglement and error accumulation, thereby unifying text-to-motion, pose-conditioned, and long-horizon sequential synthesis with state-of-the-art performance.

Zeyu Ling, Qing Shuai, Teng Zhang, Shiyang Li, Bo Han, Changqing Zou2026-03-10💻 cs

Weakly Supervised Teacher-Student Framework with Progressive Pseudo-mask Refinement for Gland Segmentation

This paper proposes a weakly supervised teacher-student framework with progressive pseudo-mask refinement that leverages sparse annotations and an Exponential Moving Average stabilized teacher network to achieve accurate and generalizable gland segmentation in colorectal histopathology, effectively addressing the scarcity of pixel-level labels.

Hikmat Khan, Wei Chen, Muhammad Khalid Khan Niazi2026-03-10💻 cs

Carbon-aware Market Participation for Building Energy Management Systems

This paper proposes a unified, real-time carbon-aware building energy management system that integrates a Transformer-based forecasting model with a mixed-integer linear program to co-optimize grid imports, storage, and flexible demand across day-ahead and real-time markets, achieving a 22.5% emission reduction with only a 1.7% cost increase.

Young-ho Cho, Mohamad Chehade, Fatima Al-Janahi, Sol Lim, Javad Mohammadi, Hao Zhu2026-03-10💻 cs

Cybersecurity AI: Hacking Consumer Robots in the AI Era

This paper demonstrates that Generative AI tools, specifically the open-source CAI framework, have fundamentally disrupted consumer robot cybersecurity by automating the discovery of critical vulnerabilities across diverse devices like lawnmowers, exoskeletons, and window cleaners, thereby exposing a dangerous asymmetry between democratized offensive capabilities and lagging defensive measures.

Víctor Mayoral-Vilches, Unai Ayucar-Carbajo, Olivier Laflamme, Ruikai Peng, María Sanz-Gómez, Francesco Balassone, Lucas Apa, Endika Gil-Uriarte2026-03-10💻 cs

A note on approximating the average degree of bounded arboricity graphs

This paper presents a simplified and fully analyzed sublinear-time algorithm that achieves a (1+ε)(1+\varepsilon)-approximation of the average degree in bounded arboricity graphs using O(ε2α/d)O(\varepsilon^{-2}\alpha/d) queries, thereby recovering logarithmic factors lost in previous work and offering a modified version with O(ε2n/d)O(\varepsilon^{-2}\sqrt{n/d}) query complexity.

Talya Eden, C. Seshadhri2026-03-10💻 cs