Towards Efficient Moion Planning for UAVs: Lazy A* Search with Motion Primitives
<|reference_start|>Towards Efficient Moion Planning for UAVs: Lazy A* Search with Motion Primitives: Search-based motion planning algorithms have been widely utilized for unmanned aerial vehicles (UAVs). However, deploying these algorithms on real UAVs faces challenges due to limited onboard computational resources. The algorithms struggle to find solutions in high-dimensional search spaces and require considerable time to ensure that the trajectories are dynamically feasible. This paper incorporates the lazy search concept into search-based planning algorithms to address the critical issue of real-time planning for collision-free and dynamically feasible trajectories on UAVs. We demonstrate that the lazy search motion planning algorithm can efficiently find optimal trajectories and significantly improve computational efficiency.<|reference_end|>
@article{wang2024towards,
    title={Towards Efficient Motion Planning for UAVs: Lazy A* Search with Motion
  Primitives},
    author={Wentao Wang, Yi Shen, Kaiyang Chen, Kaifan Lu},
    journal={arXiv preprint arXiv:2410.01230},
    year={2024},
    archivePrefix={arXiv},
    eprint={2410.01230},
    primaryClass={cs.RO}
}