arXiv subjects

Jiahe Cao

Publications and source records attributed to Jiahe Cao.

6 recordsLinked to original sources

arXiv2026

BIG-CBF: Behavior-Imagination-Guided Control Barrier Function with Shared Uncertainty for Mobile Robot Navigation

Control barrier functions (CBFs) provide a mathematically grounded framework for enforcing local collision-avoidance constraints in autonomous mobile robots, commonly through optimization-based safety filters. However, a minimum-intervention CBF filter lacks task-level maneuver awareness and may fail to select a productive avoidance direction when multiple distinct maneuvers are locally viable, leading to safe but stalled behavior in geometrically ambiguous environments. This paper presents BIG-CBF, Behavior-Imagination-Guided Control Barrier Function with shared uncertainty, a two-rate navigation architecture that separates low-rate maneuver selection from high-rate safety filtering. Over a short horizon, six closed-loop feedback behaviors are imagined and evaluated using analytic CBF compatibility together with a lightweight objective accounting for task progress, freezing, smoothness, and switching. To reduce planning-execution mismatch, the imagination and execution layers share consistent uncertainty sources for relative-motion delay, obstacle prediction, zero-order-hold motion, and command-execution residuals, while a hard CBF remains the final safety authority. In a 3,600-episode comparative benchmark across nine scenarios, BIG-CBF achieves the highest overall task success rate of 99.78% while substantially reducing downstream CBF intervention. On a physical omnidirectional robot with onboard Jetson Orin Nano computation, BIG-CBF completes all 15 evaluation runs without a recorded contact event. Matched hardware comparisons against the non-shared variant further show lower CBF intervention energy and activation frequency, supporting improved consistency between maneuver selection and safety-critical execution.

cs.RO↗

arXiv2026

PIER-Flow: Physics-Informed Efficient Rectified Flow for Real-Time Mobile Robot Navigation

Autonomous navigation in dense and highly dynamic environments requires both physically feasible control and low-latency replanning. Optimization-based methods such as Model Predictive Control (MPC) explicitly handle robot kinematics and safety constraints, but repeated nonlinear optimization can limit real-time responsiveness. Deterministic behavior-cloning policies enable efficient inference but may fail to represent multimodal avoidance behaviors, whereas diffusion policies capture multimodality at the cost of time-consuming iterative denoising. We propose PIER-Flow (Physics-Informed Efficient Rectified Flow), a lightweight navigation policy for mobile robots. By distilling an MPC expert into a continuous-time Ordinary Differential Equation (ODE), PIER-Flow achieves single-step action generation through parallel latent sampling and lightweight feasibility selection. We introduce a physics-informed training objective to enforce kinematic consistency, paired with an asynchronous action chunking architecture for robust sim-to-real deployment. Extensive simulations demonstrate that PIER-Flow achieves a 98.85\% success rate and zero collisions, with an average inference of $\sim$1.29 ms, which accelerates planning by 37.2$\times$ compared to MPC and over 800$\times$ against standard diffusion models. Crucially, real-world deployment on a resource-constrained edge computer further achieves an approximately stable inference latency of $\sim$5.3 ms, avoiding the latency spikes and freezing events observed with planning baselines.

cs.RO↗

arXiv2026

Enhanced Loading of a Molecular Magneto-Optical Trap

Molecular magneto-optical traps (MOTs) typically capture orders of magnitude fewer particles than their atomic counterparts due in part to their significantly lower capture velocities. Here, we employ a Stochastic Schrödinger Equation Monte Carlo approach to model a CaF DC MOT to understand the factors limiting capture velocity. We provide physical intuition into the mechanisms that affect capture velocity and identify important parameters and general strategies to improve it. In addition, we point out a loss mechanism intrinsic to molecular MOTs and determine parameter regimes that should be avoided experimentally. We benchmark our simulations against a CaF DC MOT and experimentally implement the improvements predicted by our model. In doing so, we demonstrate a molecular MOT with 1.5 million trapped molecules. This represents an eight-fold improvement and is an important step toward achieving quantum degeneracy with laser cooled molecules.

physics.atom-ph↗

arXiv2026

EdgeServing: Deadline-Aware Multi-DNN Serving at the Edge

As edge computing expands, serving multiple deep neural network (DNN) models on a single shared GPU has become a common yet challenging scenario, where each scheduling decision affects the tail latency of all concurrent queues. Existing schedulers rely on local heuristics and fail to capture this global impact, while GPU spatial-sharing approaches sacrifice latency predictability. In this paper, we propose EdgeServing, a deadline-aware multi-DNN serving system for edge devices. EdgeServing adopts time-division GPU sharing with early-exit inference for high inference predictability, and introduces a stability score to quantify how each candidate scheduling decision impacts the future queue status. At runtime, it cohesively selects the model, exit point, and batch size to minimize predicted system-wide SLO impact. Experimental results on multiple hardware platforms show that EdgeServing consistently outperforms representative baselines in both SLO violation ratio and P95 latency, enabled by early-exit mechanism, which expands the scheduling action space under tight latency constraints.

cs.DC↗

arXiv2025

Infrastructure Sensor-enabled Vehicle Data Generation using Multi-Sensor Fusion for Proactive Safety Applications at Work Zone

Infrastructure-based sensing and real-time trajectory generation show promise for improving safety in high-risk roadway segments such as work zones, yet practical deployments are hindered by perspective distortion, complex geometry, occlusions, and costs. This study tackles these barriers by integrating roadside camera and LiDAR sensors into a cosimulation environment to develop a scalable, cost-effective vehicle detection and localization framework, and employing a Kalman Filter-based late fusion strategy to enhance trajectory consistency and accuracy. In simulation, the fusion algorithm reduced longitudinal error by up to 70 percent compared to individual sensors while preserving lateral accuracy within 1 to 3 meters. Field validation in an active work zone, using LiDAR, a radar-camera rig, and RTK-GPS as ground truth, demonstrated that the fused trajectories closely match real vehicle paths, even when single-sensor data are intermittent or degraded. These results confirm that KF based sensor fusion can reliably compensate for individual sensor limitations, providing precise and robust vehicle tracking capabilities. Our approach thus offers a practical pathway to deploy infrastructure-enabled multi-sensor systems for proactive safety measures in complex traffic environments.

cs.CV↗

arXiv2024

CAVE: Crowdsourcing Passing-By Vehicles for Reliable In-Vehicle Edge Computing

In-vehicle edge computing is a much anticipated paradigm to serve ever-increasing computation demands originated from the ego vehicle, such as passenger entertainments. In this paper, we explore the unique idea of crowdsourcing passing-by vehicles to augment computing of the ego vehicle. The challenges lie in the high dynamics of passing-by vehicles, time-correlated task computation, and the stringent requirement of computing reliability for individual user tasks. To this end, we formulate an optimization problem to minimize the end-to-end latency by optimizing the task assignment and resource allocation of user tasks. To address the complex problem, we propose a new algorithm (named CAVE) with multiple key designs. We build an end-to-end network and compute simulator and conduct extensive simulation to evaluate the performance of the proposed algorithm.

cs.NI↗