This paper introduces the first planner, called STAMINER (STAte-to-state tiMe-optImal memoryless planNER), which is able to real-time plan collision-free, local time-optimal trajectories in unknown and cluttered settings without the need for any maps or fused occupancy structures of the surrounding environment. Specifically, our method explores a library of state-to-state time-optimal trajectories in a memoryless collision-checking framework. It iteratively searches for the best trajectory with the longest projection on the direction to the goal. Results obtained from two different simulated cluttered scenarios demonstrate that our planner outperforms the state-of-the-art baselines concerning global finishing time. Furthermore, real-world flight trials were conducted to validate the effectiveness of our algorithm in an actual quadrotor. Finally, this paper also provides a mathematical proof of the solution characterization that is not available in the literature for the considered state-to-state time-optimal trajectory generation problem.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Online State-to-State Time-Optimal Trajectory Planning for Quadrotors in Unknown Cluttered Environments




    Publication date :

    2024-06-04


    Size :

    3829179 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English





    Minimum-Time Trajectory Generation for Quadrotors in Constrained Environments

    Spedicato Sara / Notarstefano Giuseppe | BASE | 2018

    Free access


    Online cooperative path planning for multi-quadrotors in an unknown dynamic environment

    Jia, Zhenyue / Lin, Ping / Liu, Jiaolong et al. | SAGE Publications | 2022