Abstract

AbstractUnmanned aerial vehicles (UAV) have seen a rapid growth in utilisation for reconnaissance, mostly using single UAVs. However, future utilisation of UAVs for applications such as bistatic synthetic aperture radar and stereoscopic imaging, will require the use of multiple UAVs acting cooperatively to achieve mission goals. In addition, to de-skill the operation of UAVs for certain applications will require the migration of path-planning functions from the ground to the UAV. This paper details a computationally efficient algorithm to enable path-planning for single UAVs and to form and re-form UAV formations with active collision avoidance. The algorithm presented extends classical potential field methods used in other domains for the UAV path-planning problem. It is demonstrated that a range of tasks can be executed autonomously, allowing high level tasking of single and multiple UAVs in formation, with the formation commanded as a single entity.

Full Text
Paper version not known

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 call

Disclaimer: 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.