LQLun Quan

Lun Quan

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Lun Quan has a total of 31 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • RE-Formation: Resilient and Efficient Formation Planning in Large-Scale Distributed Aerial Swarms

    by Yuan Zhou, Lun Quan, Chao Xu, Guangtong Xu, Fei Gao

    Due to the limited online computational resources and the inherent probability of hardware and software failures of real-world robots, large-scale formation planning faces two common challenges: computational intractability and agent failures. Based on the theory of sparse graphs and the maximum clique, we achieve a resilient and efficient formation planning (RE-Formation) to address these issues. To improve the computational efficiency of trajectory planning while ensuring flexible formation maneuvers, we introduce sparse graphs to describe connection relationships and present a sparse graph construction method with closed-form solutions. The sparse graphs ensure the $\underline {G}$ lobal $\underline {R}$ igidity for uniquely corresponding to a geometric shape and $\underline {P}$ reserve the main $\underline {F}$ eatures of complete graphs, denoted as the GRPF sparse graph. To prevent the impact of abnormal agents, the problem of eliminating abnormal agents is transformed into an outlier rejection problem that can be solved by computing the maximum clique. We approximate the maximum clique by periodically triggering the calculation of the maximum $k$ - $core$ to meet the real-time computational demands of large-scale swarms. We validate the performance through real-world experiments and implement formation planning with 100 drones in simulation. Benchmark comparisons and ablation experiments demonstrate the effectiveness of our method. Note to Practitioners—In this paper, we address the challenges of large-scale aerial swarm formation planning, focusing on computational efficiency and resilience to agent failures. Real-world swarm robots often face limitations in computational resources and are prone to hardware and software failures, which can severely impact formation coordination. Our proposed method uses sparse graphs that are globally rigid to reduce computational complexity while ensuring flexible formation maneuvers, and employs outliers rejection to eliminate abnormal agents, ensuring resilient collaboration.


  • Cost-Effective Swarm Navigation System via Close Cooperation

    by Nanhe Chen, Zhehan Li, Lun Quan, Xinwei Chen, Chao Xu, Fei Gao, Yanjun Cao

    Multi-robot system is desired to achieve global cost-efficiency by fully utilizing individual advantages. For example, leveraging unmanned aerial vehicles' (UAVs') agility for inspection and ground vehicles' (UGVs') capability for heavy-duty tasks. Coordinating the motion of multiple robots smartly is complex and it becomes more challenging when robots in the swarm are not equipped with sufficient sensors for environmental perception (e.g. in our case only one robot has a depth camera). In this letter, we propose a tightly coupled systematic framework to navigate a swarm composed of UAV and UGVs in unknown scenes. The system has only one depth camera with a field of view for environmental perception. We fully explore the cooperation between robots by proposing a Sequential Exploration and Aiding Localization (SEAL) planning strategy for the UAV and a Collision-Adaptive Trajectory (CAT) optimization for UGVs. The UAV assists UGVs' localization with relative pose estimation and own global localization, meanwhile, it focuses on exploration to provide UGVs with abundant environmental information. The UGV team can navigate safely and autonomously in obstacle-rich environments and even maintain formations with only the wheel odometer and UAV's assistance using CAT optimization. Our method is validated both in simulations and real-world experiments indoors and outdoors.


  • Collaborative Planning for Catching and Transporting Objects in Unstructured Environments

    by Liuao Pei, Junxiao Lin, Zhichao Han, Lun Quan, Yanjun Cao, Chao Xu, Fei Gao

    Multi-robot teams have attracted attention from industry and academia for their ability to perform collaborative tasks in unstructured environments, such as wilderness rescue and collaborative transportation. In this letter, we propose a trajectory planning method for a non-holonomic robotic team with collaboration in unstructured environments. For the adaptive state collaboration of a robot team to catch and transport targets to be rescued using a net, we model the process of catching the falling target with a net in a continuous and differentiable form. This enables the robot team to fully exploit the kinematic potential, thereby adaptively catching the target in an appropriate state. Furthermore, the size safety and topological safety of the net, resulting from the collaborative support of the robots, are guaranteed through geometric constraints. We integrate our algorithm on a car-like robot team and test it in simulations and real-world experiments to validate our performance. Our method is compared to state-of-the-art multi-vehicle trajectory planning methods, demonstrating significant performance in efficiency and trajectory quality.


  • Top Cited Papers

    Robust and Efficient Trajectory Planning for Formation Flight in Dense Environments

    by Lun Quan, Longji Yin, Tingrui Zhang, Mingyang Wang, Ruilin Wang, Sheng Zhong, Xin Zhou, Yanjun Cao, Chao Xu, Fei Gao

    Formation flight has a vast potential for aerial robot swarms in various applications. However, the existing methods lack the capability to achieve fully autonomous large-scale formation flight in dense environments. To bridge the gap, we present a complete formation flight system that effectively integrates real-world constraints into aerial formation navigation. This article proposes a differentiable graph-based metric to quantify the overall similarity error between formations. This metric is invariant to rotation, translation, and scaling, providing more freedom for formation coordination. We design a distributed trajectory optimization framework that considers formation similarity, obstacle avoidance, and dynamic feasibility. The optimization is decoupled to make large-scale formation flights computationally feasible. To improve the elasticity of formation navigation in highly constrained scenes, we present a swarm reorganization method that adaptively adjusts the formation parameters and task assignments by generating local navigation goals. A novel swarm agreement strategy called global-remap-local-replan and a formation-level path planner is proposed in this article to coordinate the global planning and local trajectory optimizations.To validate the proposed method, we design comprehensive benchmarks and simulations with other cutting-edge works in terms of adaptability, predictability, elasticity, resilience, and efficiency. Finally, integrated with palm-sized swarm platforms with onboard computers and sensors, the proposed method demonstrates its efficiency and robustness by achieving the largest scale formation flight in dense outdoor environments.


  • Open Access

    Robust and Efficient Trajectory Planning for Formation Flight in Dense Environments

    by Lun Quan, Longji Yin, Tingrui Zhang, Mingyang Wang, Ruilin Wang, Sheng Zhong, Zhou Xin, Yanjun Cao, Chao Xu, Fei Gao

    Formation flight has a vast potential for aerial robot swarms in various applications. However, existing methods lack the capability to achieve fully autonomous large-scale formation flight in dense environments. To bridge the gap, we present a complete formation flight system that effectively integrates real-world constraints into aerial formation navigation. This paper proposes a differentiable graph-based metric to quantify the overall similarity error between formations. This metric is invariant to rotation, translation, and scaling, providing more freedom for formation coordination. We design a distributed trajectory optimization framework that considers formation similarity, obstacle avoidance, and dynamic feasibility. The optimization is decoupled to make large-scale formation flights computationally feasible. To improve the elasticity of formation navigation in highly constrained scenes, we present a swarm reorganization method that adaptively adjusts the formation parameters and task assignments by generating local navigation goals. A novel swarm agreement strategy called global-remap-local-replan and a formation-level path planner is proposed in this work to coordinate the global planning and local trajectory optimizations. To validate the proposed method, we design comprehensive benchmarks and simulations with other cutting-edge works in terms of adaptability, predictability, elasticity, resilience, and efficiency. Finally, integrated with palm-sized swarm platforms with onboard computers and sensors, the proposed method demonstrates its efficiency and robustness by achieving the largest scale formation flight in dense outdoor environments.

  • Open Access

    EVA-Planner: Environmental Adaptive Quadrotor Planning

    by Lun Quan, Zhiwei Zhang, Xingguang Zhong, Chao Xu, Fei Gao

    The quadrotor is popularly used in challenging environments due to its superior agility and flexibility. In these scenarios, trajectory planning plays a vital role in generating safe motions to avoid obstacles while ensuring flight smoothness. Although many works on quadrotor planning have been proposed, a research gap exists in incorporating self-adaptation into a planning framework to enable a drone to automatically fly slower in denser environments and increase its speed in a safer area. In this paper, we propose an environmental adaptive planner to adjust the flight aggressiveness effectively based on the obstacle distribution and quadrotor state. Firstly, we design an environmental adaptive safety aware method to assign the priority of the surrounding obstacles according to the environmental risk level and instantaneous motion tendency. Then, we apply it into a multi-layered model predictive contouring control (Multi-MPCC) framework to generate adaptive, safe, and dynamical feasible local trajectories. Extensive simulations and real-world experiments verify the efficiency and robustness of our planning framework. Benchmark comparison also shows superior performances of our method with another advanced environmental adaptive planning algorithm. Moreover, we release our planning framework as open-source ros-packages.

  • Open Access

    Survey of UAV motion planning

    by Lun Quan, Luxin Han, Boyu Zhou, Shaojie Shen, Fei Gao

    Motion planning is a vital module for unmanned aerial vehicles (UAVs), especially in scenarios of autonomous navigation and operation. This survey delivers some recent state‐of‐the‐art UAV motion planning algorithms and related applications. The logic flow of this survey is divided as the path finding, which is the front‐end of most motion planning systems, and the trajectory optimisation, which usually serves as the back‐end. Motivation, methodology, problem formulation and derivation are given in this survey, in detail. Finally, a section about real‐world applications is given, where roles and effectiveness of most popular motion planning methods are revealed.