arXiv subjects

Xiangke Wang

Publications and source records attributed to Xiangke Wang.

At least 19 recordsLinked to original sources

arXiv2026

COFAP: A Universal Framework for COFs Adsorption Prediction through Designed Multi-Modal Extraction and Cross-Modal Synergy

Covalent organic frameworks (COFs) are promising adsorbents for gas adsorption and separation, while identifying the optimal structures among their vast design space requires efficient high-throughput screening. Conventional machine-learning predictors rely heavily on specific gas-related features. However, these features are time-consuming and limit scalability, leading to inefficiency and labor-intensive processes. Herein, a universal COFs adsorption prediction framework (COFAP) is proposed, which can extract multi-modal structural and chemical features through deep learning, and fuse these complementary features via cross-modal attention mechanism. Without relying on explicit gas-specific thermodynamic descriptors, COFAP achieves state-of-the-art prediction performance on the hypoCOFs dataset under the conditions investigated in this study, outperforming existing approaches. Based on COFAP, we also found that high-performing COFs for gas separation concentrate within a narrow range of pore size and surface area. A weight-adjustable prioritization scheme is also developed to enable flexible, application-specific ranking of candidate COFs for researchers. Superior efficiency and accuracy render COFAP directly deployable in crystalline porous materials.

cs.LG↗

arXiv2025

A Plug-and-Play Learning-based IMU Bias Factor for Robust Visual-Inertial Odometry

Accurate and reliable estimation of biases of low-cost Inertial Measurement Units (IMU) is a key factor to maintain the resilience of Visual-Inertial Odometry (VIO), particularly when visual tracking fails in challenging areas. In such cases, bias estimates from the VIO can deviate significantly from the real values because of the insufficient or erroneous vision features, compromising both localization accuracy and system stability. To address this challenge, we propose a novel plug-and-play module featuring the Inertial Prior Network (IPNet), which infers an IMU bias prior by implicitly capturing the motion characteristics of specific platforms. The core idea is inspired intuitively by the observation that different platforms exhibit distinctive motion patterns, while the integration of low-cost IMU measurements suffers from unbounded error that quickly accumulates over time. Therefore, these specific motion patterns can be exploited to infer the underlying IMU bias. In this work, we first directly infer the biases prior only using the raw IMU data using a sliding window approach, eliminating the dependency on recursive bias estimation combining visual features, thus effectively preventing error propagation in challenging areas. Moreover, to compensate for the lack of ground-truth bias in most visual-inertial datasets, we further introduce an iterative method to compute the mean per-sequence IMU bias for network training and release it to benefit society. The framework is trained and evaluated separately on two public datasets and a self-collected dataset. Extensive experiments show that our method significantly improves localization precision and robustness.

cs.CV↗

arXiv2025

A Dual Quaternion Control Law for Formation Control of Multiple 3-D Rigid Bodies

This paper studies the integrated position and attitude control problem for multi-agent systems of 3D rigid bodies. While the state-of-the-art method in [Olfati-Saber and Murray, 2004] established the theoretical foundation for rigid-body formation control, it requires all agents to asymptotically converge to identical positions and attitudes, limiting its applicability in scenarios where distinct desired relative configurations must be maintained. In this paper, we develop a novel dual-quaternion-based framework that generalizes this paradigm. By introducing a unit dual quaternion directed graph (UDQDG) representation, we derive a new control law through the corresponding Laplacian matrix, enabling simultaneous position and attitude coordination while naturally accommodating directed interaction topologies. Leveraging the recent advances in UDQDG spectral theory, we prove global asymptotic convergence to desired relative configurations modulo a right-multiplicative constant and establish an R-linear convergence rate determined by the second smallest eigenvalue of the UDQDG Laplacian. A projected iteration method is proposed to compute the iterative states. Finally, the proposed solution is verified by several numerical experiments.

math.OC↗

arXiv2025

Distributed Framework Construction for Affine Formation Control

In affine formation control problems, the construction of the framework with universal rigidity and affine localizability is a critical prerequisite, but it has not yet been well addressed, especially when additional agents join the formation or link/agent failures emerge. Motivated by this observation, we investigate the problem of constructing affine frameworks in three scenarios, including vertex addition, edge deletion and vertex deletion. Our approach starts from the original affine formation and uses geometric methods to locally adjust the structure of the weighted graph to describe the topology, so that the modified framework maintains the universal rigidity and affine localizability. Notably, the developed strategies only utilize local measurements and exhibit distributed characteristics, laying the foundation for applications in multi-agent systems. To demonstrate the compatibility with affine formation control proposals, we present a case study on affine formation tracking in a multi-UAV formation, demonstrating the effectiveness of our algorithms in constructing eligible frameworks in aforementioned scenarios. Moreover, a comparative simulation is also conducted to highlight the low time complexity of our distributed algorithm relative to the centralized optimization-based method.

eess.SY↗

arXiv2025

Distributed Set-membership Filtering Frameworks For Multi-agent Systems With Absolute and Relative Measurements

In this paper, we focus on the distributed set-membership filtering (SMFing) problem for a multi-agent system with absolute (taken from agents themselves) and relative (taken from neighbors) measurements. In the literature, the relative measurements are difficult to deal with, and the SMFs highly rely on specific set descriptions. As a result, establishing the general distributed SMFing framework having relative measurements is still an open problem. To solve this problem, first, we provide the set description based on uncertain variables determined by the relative measurements between two agents as the foundation. Surprisingly, the accurate description requires only a single calculation step rather than multiple iterations, which can effectively reduce computational complexity. Based on the derived set description, called the uncertain range, we propose two distributed SMFing frameworks: one calculates the joint uncertain range of the agent itself and its neighbors, while the other only computes the marginal uncertain range of each local system. Furthermore, we compare the performance of our proposed two distributed SMFing frameworks and the benchmark -- centralized SMFing framework. A rigorous set analysis reveals that the distributed SMF can be essentially considered as the process of computing the marginal uncertain range to outer bound the projection of the uncertain range obtained by the centralized SMF in the corresponding subspace. Simulation results corroborate the effectiveness of our proposed distributed frameworks and verify our theoretical analysis.

cs.MA↗

arXiv2025

Formation Under Communication Constraints: Control Performance Meets Channel Capacity

In wireless communication-based formation control systems, the control performance is significantly impacted by the channel capacity of each communication link between agents. This relationship, however, remains under-investigated in the existing studies. To address this gap, the formation control problem of classical second-order multi-agent systems with bounded process noises was considered taking into account the channel capacity. More specifically, the model of communication links between agents is first established, based on a new concept -- guaranteed communication region, which characterizes all possible locations for successful message decoding in the present of control-system uncertainty. Furthermore, we rigorously prove that, the guaranteed communication region does not unboundedly increase with the transmission time, which indicates an important trade-off between the guaranteed communication region and the data rate. The fundamental limits of data rate for any desired accuracy are also obtained. Finally, the integrated design to achieve the desired formation accuracy is proposed, where an estimation-based controller and transmit power control strategy are developed.

cs.MA↗

arXiv2024

Toward Scalable Multirobot Control: Fast Policy Learning in Distributed MPC

Distributed model predictive control (DMPC) is promising in achieving optimal cooperative control in multirobot systems (MRS). However, real-time DMPC implementation relies on numerical optimization tools to periodically calculate local control sequences online. This process is computationally demanding and lacks scalability for large-scale, nonlinear MRS. This article proposes a novel distributed learning-based predictive control (DLPC) framework for scalable multirobot control. Unlike conventional DMPC methods that calculate open-loop control sequences, our approach centers around a computationally fast and efficient distributed policy learning algorithm that generates explicit closed-loop DMPC policies for MRS without using numerical solvers. The policy learning is executed incrementally and forward in time in each prediction interval through an online distributed actor-critic implementation. The control policies are successively updated in a receding-horizon manner, enabling fast and efficient policy learning with the closed-loop stability guarantee. The learned control policies could be deployed online to MRS with varying robot scales, enhancing scalability and transferability for large-scale MRS. Furthermore, we extend our methodology to address the multirobot safe learning challenge through a force field-inspired policy learning approach. We validate our approach's effectiveness, scalability, and efficiency through extensive experiments on cooperative tasks of large-scale wheeled robots and multirotor drones. Our results demonstrate the rapid learning and deployment of DMPC policies for MRS with scales up to 10,000 units.

cs.RO↗

arXiv2024

Stability of Linear Set-Membership Filters With Respect to Initial Conditions: An Observation-Information Perspective

The issue of filter stability with respect to (w.r.t.) the initial condition refers to the unreliable filtering process caused by improper prior information of the initial state. This paper focuses on analyzing and resolving the stability issue w.r.t. the initial condition of the classical Set-Membership Filters (SMFs) for linear time-invariance systems, which has not yet been well understood in the literature. To this end, we propose a new concept -- the Observation-Information Tower (OIT), which describes how the measurements affect the estimate in a set-intersection manner without relying on the initial condition. The proposed OIT enables a rigorous stability analysis, a new SMFing framework, as well as an efficient filtering algorithm. Specifically, based on the OIT, explicit necessary and sufficient conditions for stability w.r.t. the initial condition are provided for the classical SMFing framework. Furthermore, the OIT inspires a stability-guaranteed SMFing framework, which fully handles the stability issue w.r.t. the initial condition. Finally, with the OIT-inspired framework, we develop a fast and stable constrained zonotopic SMF, which significantly overcomes the wrapping effect.

eess.SY↗

arXiv2023

Cooperative Filtering with Range Measurements: A Distributed Constrained Zonotopic Method

This article studies the distributed estimation problem of a multi-agent system with bounded absolute and relative range measurements. Parts of the agents are with high-accuracy absolute measurements, which are considered as anchors; the other agents utilize lowaccuracy absolute and relative range measurements, each derives an uncertain range that contains its true state in a distributed manner. Different from previous studies, we design a distributed algorithm to handle the range measurements based on extended constrained zonotopes, which has low computational complexity and high precision. With our proposed algorithm, agents can derive their uncertain range sequentially along the chain topology, such that agents with low-accuracy sensors can benefit from the high-accuracy absolute measurements of anchors and improve the estimation performance. Simulation results corroborate the effectiveness of our proposed algorithm and verify our method can significantly improve the estimation accuracy.

cs.MA↗

arXiv2023

Set-Membership Filtering-Based Cooperative State Estimation for Multi-Agent Systems

In this article, we focus on the cooperative state estimation problem of a multi-agent system. Each agent is equipped with absolute and relative measurements. The purpose of this research is to make each agent generate its own state estimation with only local measurement information and local communication with neighborhood agents using Set Membership Filter(SMF). To handle this problem, we analyzed centralized SMF framework as a benchmark of distributed SMF and propose a finite-horizon method called OIT-Inspired centralized constrained zonotopic algorithm. Moreover, we put forward a distributed Set Membership Filtering(SMFing) framework and develop a distributed constained zonotopic algorithm. Finally, simulation verified our theoretical results, that our proposed algorithms can effectively estimate the state of each agent.

cs.MA↗

arXiv2023

Integrated Design of Cooperative Area Coverage and Target Tracking with Multi-UAV System

This paper systematically studies the cooperative area coverage and target tracking problem of multiple-unmanned aerial vehicles (multi-UAVs). The problem is solved by decomposing into three sub-problems: information fusion, task assignment, and multi-UAV behavior decision-making. Specifically, in the information fusion process, we use the maximum consistency protocol to update the joint estimation states of multi-targets (JESMT) and the area detection information. The area detection information is represented by the equivalent visiting time map (EVTM), which is built based on the detection probability and the actual visiting time of the area. Then, we model the task assignment problem of multi-UAV searching and tracking multi-targets as a network flow model with upper and lower flow bounds. An algorithm named task assignment minimum-cost maximum-flow (TAMM) is proposed. Cooperative behavior decision-making uses Fisher information as the mission reward to obtain the optimal tracking action of the UAV. Furthermore, a coverage behavior decision-making algorithm based on the anti-flocking method is designed for those UAVs assigned the coverage task. Finally, a distributed multi-UAV cooperative area coverage and target tracking algorithm is designed, which integrates information fusion, task assignment, and behavioral decision-making. Numerical and hardware-in-the-loop simulation results show that the proposed method can achieve persistent area coverage and cooperative target tracking.

cs.MA↗

arXiv2023

Augmented Quaternion and Augmented Unit Quaternion Optimization

In this paper, we introduce and explore augmented quaternions and augmented unit quaternions, and present an augmented unit quaternion optimization model. An augmented quaternion consist of a quaternion and a translation vector. The multiplication rule of augmented quaternion is defined. An augmented unit quaternion consists of a unit quaternion and a translation vector. The augmented unit quaternions form a Lie group. By means of augmented unit quaternions, we study the error model and kinematics. Then we formulate two classical problems in robot research, i.e., the hand-eye calibration problem and the simultaneous localization and mapping (SLAM) problem as augmented unit quaternion optimization problems, which are actually real smooth spherical equality constrained optimization problems. Comparing with the corresponding unit dual quaternion optimization model, the augmented unit quaternion optimization model has less variables and removes the orthogonality constraints.

cs.RO↗

arXiv2023

Roto-Translation Invariant Formation of Fixed-Wing UAVs in 3D: Feasibility and Control

This paper investigates the formation of fixed-wing UAVs in 3D, which communicate via a directed acyclic graph. Different from common formation problems, we consider the roto-translation invariant (RTI) formation, where the "roto-translation" refers to a rigid-body motion obtained by composing rotation and translation. Besides, the fixed-wing UAV is modelled by a 3-D nonholonomic constrained rigid body instead of a particle agent. The main results of this paper include proposing the formation feasibility conditions and designing the formation controller. Firstly, we define the RTI formation and propose the conditions to guarantee that the formations are feasible for the fixed-wing UAVs under the nonholonomic and input saturation constraints. Secondly, given feasible formations, we design a formation controller by introducing a virtual leader and employing the compensation of rotation, followed by proving the stability of the closed-loop system. Finally, simulation examples are presented to verify the theoretical results.al with the motion coupling among multiple robots. Finally, numerical simulations are conducted to verify the theoretical results.

eess.SY↗

arXiv2022

Dual Quaternion Matrices in Multi-Agent Formation Control

Three kinds of dual quaternion matrices associated with the mutual visibility graph, namely the relative configuration adjacency matrix, the logarithm adjacency matrix and the relative twist adjacency matrix, play important roles in multi-agent formation control. In this paper, we study their properties and applications. We show that the relative configuration adjacency matrix and the logarithm adjacency matrix are all Hermitian matrices, and thus have very nice spectral properties. We introduce dual quaternion Laplacian matrices, and prove a Gershgorin-type theorem for square dual quaternion Hermitian matrices, for studying properties of dual quaternion Laplacian matrices. The role of the dual quaternion Laplacian matrices in formation control is discussed.

math.OC↗

arXiv2022

Optimal control of nonlinear systems with unsymmetrical input constraints and its applications to the UAV circumnavigation problem

In this paper, a novel design scheme is introduced to solve the optimal control problem for nonlinear systems with unsymmetrical and state-dependent input constraints. By introducing an initial stabilizing control policy as the baseline of the constructed optimal control policy, we remove the assumption in the current study for the adaptive optimal control, that is, the internal dynamics should hold zero when the state of the system is in the origin. Particularly, nonlinear control systems with partially-unknown dynamics are investigated and the procedure to acquire the corresponding optimal control policy is presented. The stability for the closed-loop dynamics and the optimality of the obtained control policy are both proved. Besides, we apply the proposed control design framework to solve the optimal circumnavigation problem based on the accumulative Fisher information for a fixed-wing unmanned aerial vehicle (UAV). The control performance of our algorithm is compared with that of the existing circumnavigation control policy in a numerical simulation.

eess.SY↗

arXiv2022

Implementation of UAV Coordination Based on a Hierarchical Multi-UAV Simulation Platform

In this paper, a hierarchical multi-UAV simulation platform,called XTDrone, is designed for UAV swarms, which is completely open-source 4 . There are six layers in XTDrone: communication, simulator,low-level control, high-level control, coordination, and human interac-tion layers. XTDrone has three advantages. Firstly, the simulation speedcan be adjusted to match the computer performance, based on the lock-step mode. Thus, the simulations can be conducted on a work stationor on a personal laptop, for different purposes. Secondly, a simplifiedsimulator is also developed which enables quick algorithm designing sothat the approximated behavior of UAV swarms can be observed inadvance. Thirdly, XTDrone is based on ROS, Gazebo, and PX4, andhence the codes in simulations can be easily transplanted to embeddedsystems. Note that XTDrone can support various types of multi-UAVmissions, and we provide two important demos in this paper: one is aground-station-based multi-UAV cooperative search, and the other is adistributed UAV formation flight, including consensus-based formationcontrol, task assignment, and obstacle avoidance.

eess.SY↗

arXiv2020

Time-Efficient Mars Exploration of Simultaneous Coverage and Charging with Multiple Drones

This paper presents a time-efficient scheme for Mars exploration by the cooperation of multiple drones and a rover. To maximize effective coverage of the Mars surface in the long run, a comprehensive framework has been developed with joint consideration for limited energy, sensor model, communication range and safety radius, which we call TIME-SC2 (TIme-efficient Mars Exploration of Simultaneous Coverage and Charging). First, we propose a multi-drone coverage control algorithm by leveraging emerging deep reinforcement learning and design a novel information map to represent dynamic system states. Second, we propose a near-optimal charging scheduling algorithm to navigate each drone to an individual charging slot, and we have proven that there always exists feasible solutions. The attractiveness of this framework not only resides on its ability to maximize exploration efficiency, but also on its high autonomy that has greatly reduced the non-exploring time. Extensive simulations have been conducted to demonstrate the remarkable performance of TIME-SC2 in terms of time-efficiency, adaptivity and flexibility.

cs.RO↗

arXiv2020

Rethinking the Mathematical Framework and Optimality of Set-Membership Filtering

Set-Membership Filter (SMF) has been extensively studied for state estimation in the presence of bounded noises with unknown statistics. Since it was first introduced in the 1960s, the studies on SMF have used the set-based description as its mathematical framework. One important issue that has been overlooked is the optimality of SMF. In this work, we put forward a new mathematical framework for SMF using concepts of uncertain variables. We first establish two basic properties of uncertain variables, namely, the law of total range (a non-stochastic version of the law of total probability) and the equivalent Bayes' rule. This enables us to put forward a general SMFing framework with established optimality. Furthermore, we obtain the optimal SMF under a non-stochastic Markov condition, which is shown to be fundamentally equivalent to the Bayes filter. Note that the classical SMF in the literature is only equivalent to the optimal SMF we obtained under the non-stochastic Markov condition. When this condition is violated, we show that the classical SMF is not optimal and it only gives an outer bound on the optimal estimation.

eess.SY↗