arXiv subjects

Wei Xiao

Publications and source records attributed to Wei Xiao.

At least 73 records · Page 4Linked to original sources

arXiv2025

Suppression of heading errors in Bell-Bloom optically pumped free-induction-decay alkali-metal atomic magnetometers

Heading errors of atomic magnetometers refer to the dependence of measurement results on the sensor orientation with respect to the external magnetic field. There are three main sources of such errors: the light shift effect, the linear nuclear-spin Zeeman effect, and the nonlinear Zeeman effect. In this work, we suppress the former two effects by using the Bell-Bloom optical pumping method and probe the atomic signals while the pumping beam is off, and focus on the heading error induced by nonlinear Zeeman effect while the sensor operates in the geomagnetic field range. We demonstrate several schemes to suppress this remaining heading error within 1 nT using a single magnetometer or a comagnetometer. In the magnetometer system, two schemes are developed to average out the horizontal atomic polarization in space or in time, respectively. In the comagnetometer system, we combine the simultaneously measured Larmor frequencies of two different kinds of alkali atoms to either suppress the heading error or extract the orientation of the pumping beam relative to the bias field.

physics.atom-ph↗

arXiv2025

EIQP: Execution-time-certified and Infeasibility-detecting QP Solver

Solving real-time quadratic programming (QP) is a ubiquitous task in control engineering, such as in model predictive control and control barrier function-based QP. In such real-time scenarios, certifying that the employed QP algorithm can either return a solution within a predefined level of optimality or detect QP infeasibility before the predefined sampling time is a pressing requirement. This article considers convex QP (including linear programming) and adopts its homogeneous formulation to achieve infeasibility detection. Exploiting this homogeneous formulation, this article proposes a novel infeasible interior-point method (IPM) algorithm with the best theoretical $O(\sqrt{n})$ iteration complexity that feasible IPM algorithms enjoy. The iteration complexity is proved to be \textit{exact} (rather than an upper bound), \textit{simple to calculate}, and \textit{data independent}, with the value $\left\lceil\frac{\log(\frac{n+1}ε)}{-\log(1-\frac{0.414213}{\sqrt{n+1}})}\right\rceil$ (where $n$ and $ε$ denote the number of constraints and the predefined optimality level, respectively), making it appealing to certify the execution time of online time-varying convex QPs. The proposed algorithm is simple to implement without requiring a line search procedure (uses the full Newton step), and its C-code implementation (offering MATLAB, Julia, and Python interfaces) and numerical examples are publicly available at https://github.com/liangwu2019/EIQP.

eess.SY↗

arXiv2025

Ultrahigh interfacial thermal conductance for cooling gallium oxide electronics using cubic boron arsenide

Gallium oxide (Ga$_2$O$_3$) has attracted significant interest for its unique potential especially in power electronics. However, its low and anisotropic thermal conductivity poses a major challenge for heat dissipation. Here, we explore an effective cooling strategy centering on the heterogeneous integration of $β$-Ga$_2$O$_3$ devices with cubic boron arsenide (cBAs), an emerging material with an ultrahigh thermal conductivity $κ$ of ~1300 Wm$^{-1}$K$^{-1}$. Machine-learned potentials for representative $β$-Ga$_2$O$_3$/cBAs interfaces are trained, enabling accurate and efficient calculation of the interfacial thermal conductance $G$ via nonequilibrium molecular dynamics. At 300 K, remarkable $G$ values of 749$\pm$33 MWm$^{-2}$K$^{-1}$ and 824$\pm$35 MWm$^{-2}$K$^{-1}$ are predicted for Ga-As and O-B bonding across the interface, respectively, which are primarily attributed to the well-matched phonon density of states considering the similar Debye temperatures of $β$-Ga$_2$O$_3$ and cBAs. Moreover, finite-element simulations directly show a notable device temperature reduction when comparing cBAs with other substrates. The simultaneously ultrahigh $κ$ and $G$ highlight cBAs as an ideal substrate for Ga$_2$O$_3$ electronics.

cond-mat.mtrl-sci↗

arXiv2024

Associated varieties of minimal highest weight modules

Let $\mathfrak{g}$ be a complex simple Lie algebra. A simple $\mathfrak{g}$-module is called minimal if the associated variety of its annihilator ideal coincides with the closure of the minimal nilpotent coadjoint orbit. The main result of this paper is a classification of minimal highest weight modules for $\\mathfrak{g}$. This classification extends the work of Joseph, which focused on categorizing minimal highest weight modules annihilated by completely prime ideals. Furthermore, we have determined the associated varieties of these modules. In other words, we have identified all possible weak quantizations of minimal orbital varieties.

math.RT↗

arXiv2024

Optical Flow Matters: an Empirical Comparative Study on Fusing Monocular Extracted Modalities for Better Steering

Autonomous vehicle navigation is a key challenge in artificial intelligence, requiring robust and accurate decision-making processes. This research introduces a new end-to-end method that exploits multimodal information from a single monocular camera to improve the steering predictions for self-driving cars. Unlike conventional models that require several sensors which can be costly and complex or rely exclusively on RGB images that may not be robust enough under different conditions, our model significantly improves vehicle steering prediction performance from a single visual sensor. By focusing on the fusion of RGB imagery with depth completion information or optical flow data, we propose a comprehensive framework that integrates these modalities through both early and hybrid fusion techniques. We use three distinct neural network models to implement our approach: Convolution Neural Network - Neutral Circuit Policy (CNN-NCP) , Variational Auto Encoder - Long Short-Term Memory (VAE-LSTM) , and Neural Circuit Policy architecture VAE-NCP. By incorporating optical flow into the decision-making process, our method significantly advances autonomous navigation. Empirical results from our comparative study using Boston driving data show that our model, which integrates image and motion information, is robust and reliable. It outperforms state-of-the-art approaches that do not use optical flow, reducing the steering estimation error by 31%. This demonstrates the potential of optical flow data, combined with advanced neural network architectures (a CNN-based structure for fusing data and a Recurrence-based network for inferring a command from latent space), to enhance the performance of autonomous vehicles steering estimation.

cs.CV↗

arXiv2024

Feasibility-Guaranteed Safety-Critical Control with Applications to Heterogeneous Platoons

This paper studies safety and feasibility guarantees for systems with tight control bounds. It has been shown that stabilizing an affine control system while optimizing a quadratic cost and satisfying state and control constraints can be mapped to a sequence of Quadratic Programs (QPs) using Control Barrier Functions (CBF) and Control Lyapunov Functions (CLF). One of the main challenges in this method is that the QP could easily become infeasible under safety constraints of high relative degree, especially under tight control bounds. Recent work focused on deriving sufficient conditions for guaranteeing feasibility. The existing results are case-dependent. In this paper, we consider the general case. We define a feasibility constraint and propose a new type of CBF to enforce it. Our method guarantees the feasibility of the above mentioned QPs, while satisfying safety requirements. We demonstrate the proposed method on an Adaptive Cruise Control (ACC) problem for a heterogeneous platoon with tight control bounds, and compare our method to existing CBF-CLF approaches. The results show that our proposed approach can generate gradually transitioned control (without abrupt changes) with guaranteed feasibility and safety.

math.OC↗

arXiv2024

Auxiliary-Variable Adaptive Control Lyapunov Barrier Functions for Spatio-Temporally Constrained Safety-Critical Applications

Recent work has shown that stabilizing an affine control system while optimizing a quadratic cost subject to state and control constraints can be mapped to a sequence of Quadratic Programs (QPs) using Control Barrier Functions (CBFs) and Control Lyapunov Functions (CLFs). One of the main challenges in this method is that the QPs could easily become infeasible under safety and spatio-temporal constraints with tight control bounds. In our own recent work, we defined Auxiliary-Variable Adaptive CBFs (AVCBFs) to improve the feasibility of the CBF-based QP, while avoiding extensive parameter tuning. In this paper, we consider spatio-temporal constraints as finite-time reachability requirements. In order to satisfy these requirements, we generalize AVCBFs to Auxiliary-Variable Adaptive Control Lyapunov Barrier Functions (AVCLBFs) that work for systems and constraints with arbitrary relative degrees. We show that our method has fewer conflicts with safety and input constraints, and outperforms the state of the art in term of adaptivity and feasibility in solving the QP. We illustrate our approach on an optimal control problem for a unicycle.

math.OC↗

arXiv2024

Time-optimal Flight in Cluttered Environments via Safe Reinforcement Learning

This paper addresses the problem of guiding a quadrotor through a predefined sequence of waypoints in cluttered environments, aiming to minimize the flight time while avoiding collisions. Previous approaches either suffer from prolonged computational time caused by solving complex non-convex optimization problems or are limited by the inherent smoothness of polynomial trajectory representations, thereby restricting the flexibility of movement. In this work, we present a safe reinforcement learning approach for autonomous drone racing with time-optimal flight in cluttered environments. The reinforcement learning policy, trained using safety and terminal rewards specifically designed to enforce near time-optimal and collision-free flight, outperforms current state-of-the-art algorithms. Additionally, experimental results demonstrate the efficacy of the proposed approach in achieving both minimum flight time and obstacle avoidance objectives in complex environments, with a commendable $66.7\%$ success rate in unseen, challenging settings.

cs.RO↗

arXiv2024

ABNet: Attention BarrierNet for Safe and Scalable Robot Learning

Safe learning is central to AI-enabled robots where a single failure may lead to catastrophic results. Barrier-based method is one of the dominant approaches for safe robot learning. However, this method is not scalable, hard to train, and tends to generate unstable signals under noisy inputs that are challenging to be deployed for robots. To address these challenges, we propose a novel Attention BarrierNet (ABNet) that is scalable to build larger foundational safe models in an incremental manner. Each head of BarrierNet in the ABNet could learn safe robot control policies from different features and focus on specific part of the observation. In this way, we do not need to one-shotly construct a large model for complex tasks, which significantly facilitates the training of the model while ensuring its stable output. Most importantly, we can still formally prove the safety guarantees of the ABNet. We demonstrate the strength of ABNet in 2D robot obstacle avoidance, safe robot manipulation, and vision-based end-to-end autonomous driving, with results showing much better robustness and guarantees over existing models.

cs.LG↗

arXiv2024

An explicit characterization of socular simple modules of $\mathfrak{sl}(n,\mathbb{C})$

Let $\mathfrak{g}$ be a simple complex Lie algebra with a Cartan subalgebra $\mathfrak{h}$. We fix a standard parabolic subalgebra $\mathfrak{p}\supset \mathfrak{h}$. The socular simple modules play an important role in the parabolic versions of category $\mathcal{O}^{\mathfrak{p}}$. From Irving's work, we know that these modules are just those modules with largest possible Gelfand-Kirillov dimension in $\mathcal{O}^{\mathfrak{p}}$. In this article, we will give an explicit characterization for these modules of $\mathfrak{sl}(n,\mathbb{C})$. Our characterization is given in the information of the corresponding highest weight and Young tableau.

math.RT↗

arXiv2024

Auxiliary-Variable Adaptive Control Barrier Functions for Safety Critical Systems

This paper studies safety guarantees for systems with time-varying control bounds. It has been shown that optimizing quadratic costs subject to state and control constraints can be reduced to a sequence of Quadratic Programs (QPs) using Control Barrier Functions (CBFs). One of the main challenges in this method is that the CBF-based QP could easily become infeasible under tight control bounds, especially when the control bounds are time-varying. The recently proposed adaptive CBFs have addressed such infeasibility issues, but require extensive and non-trivial hyperparameter tuning for the CBF-based QP and may introduce overshooting control near the boundaries of safe sets. To address these issues, we propose a new type of adaptive CBFs called Auxiliary-Variable Adaptive CBFs (AVCBFs). Specifically, we introduce an auxiliary variable that multiplies each CBF itself, and define dynamics for the auxiliary variable to adapt it in constructing the corresponding CBF constraint. In this way, we can improve the feasibility of the CBF-based QP while avoiding extensive parameter tuning with non-overshooting control since the formulation is identical to classical CBF methods. We demonstrate the advantages of using AVCBFs and compare them with existing techniques on an Adaptive Cruise Control (ACC) problem with time-varying control bounds.

math.OC↗

arXiv2024

Safe Control for Soft-Rigid Robots with Self-Contact using Control Barrier Functions

Incorporating both flexible and rigid components in robot designs offers a unique solution to the limitations of traditional rigid robotics by enabling both compliance and strength. This paper explores the challenges and solutions for controlling soft-rigid hybrid robots, particularly addressing the issue of self-contact. Conventional control methods prioritize precise state tracking, inadvertently increasing the system's overall stiffness, which is not always desirable in interactions with the environment or within the robot itself. To address this, we investigate the application of Control Barrier Functions (CBFs) and High Order CBFs to manage self-contact scenarios in serially connected soft-rigid hybrid robots. Through an analysis based on Piecewise Constant Curvature (PCC) kinematics, we establish CBFs within a classical control framework for self-contact dynamics. Our methodology is rigorously evaluated in both simulation environments and physical hardware systems. The findings demonstrate that our proposed control strategy effectively regulates self-contact in soft-rigid hybrid robotic systems, marking a significant advancement in the field of robotics.

cs.RO↗

arXiv2024

Secure Control of Connected and Automated Vehicles Using Trust-Aware Robust Event-Triggered Control Barrier Functions

We address the security of a network of Connected and Automated Vehicles (CAVs) cooperating to safely navigate through a conflict area (e.g., traffic intersections, merging roadways, roundabouts). Previous studies have shown that such a network can be targeted by adversarial attacks causing traffic jams or safety violations ending in collisions. We focus on attacks targeting the V2X communication network used to share vehicle data and consider as well uncertainties due to noise in sensor measurements and communication channels. To combat these, motivated by recent work on the safe control of CAVs, we propose a trust-aware robust event-triggered decentralized control and coordination framework that can provably guarantee safety. We maintain a trust metric for each vehicle in the network computed based on their behavior and used to balance the tradeoff between conservativeness (when deeming every vehicle as untrustworthy) and guaranteed safety and security. It is important to highlight that our framework is invariant to the specific choice of the trust framework. Based on this framework, we propose an attack detection and mitigation scheme which has twofold benefits: (i) the trust framework is immune to false positives, and (ii) it provably guarantees safety against false positive cases. We use extensive simulations (in SUMO and CARLA) to validate the theoretical guarantees and demonstrate the efficacy of our proposed scheme to detect and mitigate adversarial attacks.

eess.SY↗

arXiv2024

Learning Hybrid Policies for MPC with Application to Drone Flight in Unknown Dynamic Environments

In recent years, drones have found increased applications in a wide array of real-world tasks. Model predictive control (MPC) has emerged as a practical method for drone flight control, owing to its robustness against modeling errors/uncertainties and external disturbances. However, MPC's sensitivity to manually tuned parameters can lead to rapid performance degradation when faced with unknown environmental dynamics. This paper addresses the challenge of controlling a drone as it traverses a swinging gate characterized by unknown dynamics. This paper introduces a parameterized MPC approach named hyMPC that leverages high-level decision variables to adapt to uncertain environmental conditions. To derive these decision variables, a novel policy search framework aimed at training a high-level Gaussian policy is presented. Subsequently, we harness the power of neural network policies, trained on data gathered through the repeated execution of the Gaussian policy, to provide real-time decision variables. The effectiveness of hyMPC is validated through numerical simulations, achieving a 100\% success rate in 20 drone flight tests traversing a swinging gate, demonstrating its capability to achieve safe and precise flight with limited prior knowledge of environmental dynamics.

cs.RO↗

arXiv2024

Exotic Spin-dependent Energy-level Shift Noise Induced by Thermal Motion

Searching for exotic spin-dependent interactions that beyond the standard model has been of interest for past decades and is crucial for unraveling the mysteries of the universe. Previous laboratory searches primarily focus on searching for either static or modulated energy-level shifts caused by exotic spin-dependent interactions. Here, we introduce a theoretical model based on thermal motion of particles, providing another efficient way to search for exotic spin-dependent interactions. The theoretical model indicates that as the exotic spin-dependent interactions are related with the relative displacements and velocities of atoms, atoms undergoing thermal motion would experience a fluctuating energy-level shift induced by the exotic interactions. Moreover, the resulting exotic energy-level shift noise could be sensed by high-sensitivity instruments. By using the model and taking the high-sensitivity atomic magnetometer as an example, we set the most stringent laboratory experiment constraints on eight different kinds of exotic spin- and velocity-dependent interactions, with five of which at the force range below 1 cm have not been covered previously. Furthermore, this theoretical model can be easily applied in other fields of quantum sensing, such as atomic clocks, atom interferometers and NV-diamond sensors, to further improve the laboratory constraints on exotic spin-dependent interactions.

physics.atom-ph↗

arXiv2023

Interpreting Neural Policies with Disentangled Tree Representations

The advancement of robots, particularly those functioning in complex human-centric environments, relies on control solutions that are driven by machine learning. Understanding how learning-based controllers make decisions is crucial since robots are often safety-critical systems. This urges a formal and quantitative understanding of the explanatory factors in the interpretability of robot learning. In this paper, we aim to study interpretability of compact neural policies through the lens of disentangled representation. We leverage decision trees to obtain factors of variation [1] for disentanglement in robot learning; these encapsulate skills, behaviors, or strategies toward solving tasks. To assess how well networks uncover the underlying task dynamics, we introduce interpretability metrics that measure disentanglement of learned neural dynamics from a concentration of decisions, mutual information and modularity perspective. We showcase the effectiveness of the connection between interpretability and disentanglement consistently across extensive experimental analysis.

cs.LG↗

arXiv2023

Drive Anywhere: Generalizable End-to-end Autonomous Driving with Multi-modal Foundation Models

As autonomous driving technology matures, end-to-end methodologies have emerged as a leading strategy, promising seamless integration from perception to control via deep learning. However, existing systems grapple with challenges such as unexpected open set environments and the complexity of black-box models. At the same time, the evolution of deep learning introduces larger, multimodal foundational models, offering multi-modal visual and textual understanding. In this paper, we harness these multimodal foundation models to enhance the robustness and adaptability of autonomous driving systems, enabling out-of-distribution, end-to-end, multimodal, and more explainable autonomy. Specifically, we present an approach to apply end-to-end open-set (any environment/scene) autonomous driving that is capable of providing driving decisions from representations queryable by image and text. To do so, we introduce a method to extract nuanced spatial (pixel/patch-aligned) features from transformers to enable the encapsulation of both spatial and semantic features. Our approach (i) demonstrates unparalleled results in diverse tests while achieving significantly greater robustness in out-of-distribution situations, and (ii) allows the incorporation of latent space simulation (via text) for improved training (data augmentation via text) and policy debugging. We encourage the reader to check our explainer video at https://www.youtube.com/watch?v=4n-DJf8vXxo&feature=youtu.be and to view the code and demos on our project webpage at https://drive-anywhere.github.io/.

cs.RO↗

arXiv2023

Local Non-Cooperative Games with Principled Player Selection for Scalable Motion Planning

Game-theoretic motion planners are a powerful tool for the control of interactive multi-agent robot systems. Indeed, contrary to predict-then-plan paradigms, game-theoretic planners do not ignore the interactive nature of the problem, and simultaneously predict the behaviour of other agents while considering change in one's policy. This, however, comes at the expense of computational complexity, especially as the number of agents considered grows. In fact, planning with more than a handful of agents can quickly become intractable, disqualifying game-theoretic planners as possible candidates for large scale planning. In this paper, we propose a planning algorithm enabling the use of game-theoretic planners in robot systems with a large number of agents. Our planner is based on the reality of locality of information and thus deploys local games with a selected subset of agents in a receding horizon fashion to plan collision avoiding trajectories. We propose five different principled schemes for selecting game participants and compare their collision avoidance performance. We observe that the use of Control Barrier Functions for priority ranking is a potent solution to the player selection problem for motion planning.

cs.RO↗