MCMuqing Cao

Muqing Cao

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Muqing Cao has a total of 59 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • IA-TIGRIS: An Incremental and Adaptive Sampling-Based Planner for Online Informative Path Planning

    by Brady Moon, Nayana Suvarna, Andrew Jong, Satrajit Chatterjee, Junbin Yuan, Muqing Cao, Sebastian Scherer

    Planning paths that maximize information gain for robotic platforms has wide-ranging applications and significant potential impact. To effectively adapt to real-time data collection, informative path planning must be computed online and be responsive to new observations. In this work, we present IA-TIGRIS (Incremental and Adaptive Tree-based Information Gathering Using Informed Sampling), which is an incremental and adaptive sampling-based informative path planner designed for real-time onboard execution. Our approach leverages past planning efforts through incremental refinement while continuously adapting to updated belief maps. We additionally present detailed implementation and optimization insights to facilitate real-world deployment, along with an array of reward functions tailored to specific missions and behaviors. Extensive simulation results demonstrate IA-TIGRIS generates higher-quality paths compared to baseline methods. We validate our planner on two distinct hardware platforms: a hexarotor unmanned aerial vehicle (UAV) and a fixed-wing UAV, each having different motion models and configuration spaces. Our results show up to a 38% improvement in information gain compared to baseline methods, highlighting the planner's potential for deployment in real-world applications. Project website: ia-tigris.github.io.


  • Beyond Frame-Wise Tracking: A Trajectory-Based Paradigm for Efficient Point Cloud Tracking

    by BaiChen Fan, Sifan Zhou, Jian Li, Shibo Zhao, Muqing Cao, Qin Wang

    LiDAR-based 3D single object tracking (3D SOT) is a critical task in robotics and autonomous systems. Existing methods typically follow frame-wise motion estimation or a sequence-based paradigm. However, the two-frame methods are efficient but lack long-term temporal context, making them vulnerable in sparse or occluded scenes, while sequence-based methods that process multiple point clouds gain robustness at a significant computational cost. To resolve this dilemma, we propose a novel trajectory-based paradigm and its instantiation, TrajTrack. TrajTrack is a lightweight framework that enhances a base two-frame tracker by implicitly learning motion continuity from historical bounding box trajectories alone—without requiring additional, costly point cloud inputs. It first generates a fast, explicit motion proposal and then uses an implicit motion modeling module to predict the future trajectory, which in turn refines and corrects the initial proposal. Extensive experiments on the large-scale NuScenes benchmark show that TrajTrack achieves new state-of-the-art performance, dramatically improving tracking precision by 3.02% over a strong baseline while running at 55 FPS. Besides, we also demonstrate the strong generalizability of TrajTrack across different base trackers.

  • Braid-based entanglement-free trajectory planning for multiple tethered robots

    by Muqing Cao, Kun Cao, Xinhang Xu, Shenghai Yuan, Yan Loi Wong, Lihua Xie

    Path planning for multiple tethered robots is a challenging problem due to the complex interactions among the cables and the possibility of severe entanglements. Previous works on this problem either consider idealistic cable models or provide no guarantee for entanglement-free paths. This work presents a new approach to address this problem using topological braids. The dual algebraic and geometric representations of braids allow us to abstract the topological patterns from the complex spatiotemporal interactions among robots. By establishing a topological equivalence between the physical cables and the spatiotemporal trajectories of the robots, and identifying particular braid patterns that emerge from the entangled trajectories, we obtain the key finding that all complex entanglements stem from a finite number of interaction patterns between 2 or 3 robots. Hence, non-entanglement can be guaranteed by avoiding the trajectories corresponding to these interaction patterns. Based on this finding, we present a topology planning algorithm that computes a desired multi-robot path topology by searching in a graph of robot permutations and rejecting the entangling braid patterns. Then, the desired path topology serves as the high-level reference for each robot to generate non-entangling trajectories in a decentralized manner. We demonstrate that the proposed algorithm can achieve 100% goal-reaching capability without entanglement for 10 drones with a slack cable model in a high-fidelity simulation platform. The practicality of the proposed approach is verified using three small tethered drones in indoor flight experiments.


  • Hierarchical Planning for Long-Horizon Multi-Target Tracking Under Target Motion Uncertainty

    by Junbin Yuan, Brady Moon, Muqing Cao, Sebastian Scherer

    Achieving persistent tracking of multiple dynamic targets over a large area poses major challenges for a single robot with limited sensing. As the robot moves to track different targets, those outside its field of view accumulate uncertainty, making them harder to recover. An effective planner must manage uncertainty over long horizons and prevent permanent loss of unseen targets. However, most existing methods rely on short horizons and assume small, bounded environments, leading to poor tracking performance in large-scale settings. We present a hierarchical planner for tracking multiple moving targets with an aerial vehicle. To handle non-static targets, our method incorporates motion models and uncertainty propagation during path execution for informed decision-making. We decompose multi-target tracking into sub-tasks of single-target search and detection. Our pipeline includes a novel coverage planner for searching within evolving belief regions and an estimation module that assesses each sub-task’s success likelihood. This formulation enables conversion of the active tracking problem into a Markov decision process (MDP) solved via a tree-based algorithm to determine sub-task sequences. Simulation results show our planner outperforms existing approaches, reducing final uncertainty by 11–70% across environments. We further validate practical deployability in a real-robot experiment. The project website is at https://yuanjunbin.github.io/hptracking/.


  • Graph Optimality-Aware Stochastic LiDAR Bundle Adjustment With Progressive Spatial Smoothing

    by Jianping Li, Thien-Minh Nguyen, Muqing Cao, Shenghai Yuan, Tzu-Yi Hung, Lihua Xie

    Large-scale LiDAR Bundle Adjustment (LBA) to refine sensor orientation and point cloud accuracy simultaneously for building navigation maps is a fundamental task in logistics, intelligent transportation, and robotics. In the context of autonomous delivery and smart mobility, the 3D map obtained by accurate and robust LBA plays a pivotal role in enabling reliable localization and navigation across complex, large-scale urban environments. Unlike pose-graph-based methods that rely solely on pairwise relationships between LiDAR frames, LBA leverages raw LiDAR correspondences to achieve more precise results, especially when initial pose estimates are unreliable for low-cost sensors. However, existing LBA methods face challenges such as simplistic planar correspondences, extensive observations, and dense normal matrices in the least-squares problem, which limit robustness, efficiency, and scalability. To address these issues, we propose a Graph Optimality-aware Stochastic Optimization scheme with Progressive Spatial Smoothing, namely PSS-GOSO, to achieve robust, efficient, and scalable LBA. The Progressive Spatial Smoothing (PSS) module extracts robust LiDAR feature association exploiting the prior structure information obtained by the polynomial smooth kernel. The Graph Optimality-aware Stochastic Optimization (GOSO) module first sparsifies the graph according to optimality for an efficient optimization. GOSO then utilizes stochastic clustering and graph marginalization to solve the large-scale state estimation problem for a scalable LBA. We validate PSS-GOSO across diverse scenes captured by various platforms, demonstrating its superior performance compared to existing methods. Moreover, the resulting point cloud maps are used for automatic last-mile delivery in large-scale complex scenes, showcasing the practical benefits of our method in modern intelligent transportation systems. The project page can be found at: https://kafeiyin00.github.io/PSS-GOSO/


  • Following is All You Need: Robot Crowd Navigation Using People as Planners

    by Yuwen Liao, Xinhang Xu, Ruofei Bai, Yizhuo Yang, Muqing Cao, Shenghai Yuan, Lihua Xie

    Navigating in crowded environments requires the robot to be equipped with high-level reasoning and planning techniques. Existing works focus on developing complex and heavyweight planners while ignoring the role of human intelligence. Since humans are highly capable agents who are also widely available in a crowd navigation setting, we propose an alternative scheme where the robot utilises people as planners to benefit from their effective planning decisions and social behaviours. Through a set of rule-based evaluations, we identify suitable human leaders who exhibit the potential to guide the robot towards its goal. Using a simple base planner, the robot follows the selected leader through short-horizon subgoals that are designed to be straightforward to achieve. We demonstrate through both simulated and real-world experiments that our novel framework generates safe and efficient robot plans compared to existing planners, even without predictive or data-driven modules. Our method also brings human-like robot behaviours without explicitly defining traffic rules and social norms.


  • Cooperative Aerial Robot Inspection Challenge: A Benchmark for Heterogeneous Multi-Uncrewed-Aerial-Vehicle Planning and Lessons Learned

    by Muqing Cao, Thien-Minh Nguyen, Shenghai Yuan, Andreas Anastasiou, Angelos Zacharia, Savvas Papaioannou, Panayiotis Kolios, Christos G. Panayiotou, Marios M. Polycarpou, Xinhang Xu, et al.

    We propose the Cooperative Aerial Robot Inspection Challenge (CARIC), a simulation-based benchmark for motion planning algorithms in heterogeneous multi-uncrewed-aerial-vehicle (UAV) systems. CARIC features UAV teams with complementary sensors, realistic constraints, and evaluation metrics prioritizing inspection quality and efficiency. It offers a ready-to-use perception-control software stack and diverse scenarios to support the development and evaluation of task allocation and motion planning algorithms. Competitions using CARIC were held at the 2023 IEEE Conference on Decision and Control (CDC) and the IROS 2024 Workshop on Multi-Robot Perception and Navigation, attracting innovative solutions from research teams worldwide. This article examines the top three teams from CDC 2023, analyzing their exploration, inspection, and task allocation strategies while drawing insights into their performance across scenarios. The results highlight the task’s complexity and suggest promising research directions in cooperative multi-UAV systems. The simulation framework, including the source code and detailed instructions, is publicly available at https://ntu-aris.github.io/caric.


  • Top Cited Papers

    Relative Localizability and Localization for Multirobot Systems

    by Liangming Chen, Chenyang Liang, Shenghai Yuan, Muqing Cao, Lihua Xie

    Inter-robot relative positions are crucial for executing various multi-robot missions, such as formation maneuvering and collaborative inspection. However, the current sensing technology only provides part of relative position information, such as inter-robot distances, bearings and angles. This prompts the study of determining inter-robot relative positions, i.e., relative localization, from these partial measurements. Based on the existing results of static networks' localizability and mobile networks' relative localization, we propose a novel concept, relative localizability to describe whether a multi-robot system is relatively localizable. Given each robot's self-displacement measurements and inter-robot partial measurements in $d$ ($d\leq 4$) sampling instants, we show that a multi-robot system's relative localization can be achieved in a purely algebraic and distributed manner, in which the multi-robot system is said to be $d$-step relatively localizable. To make the results more general, we consider that a) the multi-robot system consists of landmarks, leaders and followers, b) and the inter-robot measurements can be distances, bearings or angles. When robots' coordinate frames have different orientations, we show that the given local measurements can be used to determine robots' relative positions and their coordinate frames' relative orientations simultaneously. Simulations and experiments of relative localization for ground robots are conducted to validate the obtained results.


  • Open Access

    A data-driven control method for ground locomotion on sloped terrain of a hybrid aerial-ground robot

    by Xinhang Xu, Yizhuo Yang, Muqing Cao, Thien-Minh Nguyen, Kun Cao, Lihua Xie