Abstract
Abstract In this paper, a depth-first search strategy to cope with the problem of multi-trip unmanned aerial vehicle (UAV) fleet mission planning is proposed. The considered UAVs delivery problem aims at a trajectory planning issue addressed for UAVs operating in a hostile environment while considering battery and payload weight as well as vehicles reuse. Employed UAVs fly on a 3D plane matching a distribution network while servicing customers and ensuring collision avoidance among team members. The objective is to get a sequence of submissions that ensures delivery to customers satisfying the requested amount and demands within a given time horizon. The method proposed in this paper offers solutions to several questions related to the multistage mission planning that could be applied to solve problems such as minimizing energy consumption, conducting the mission in the shortest possible time, just-in-time replenishing of supplies, and so on. The computational experiment illustrates possibilities of the proposed method.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
