Path tracking for waypoint lists based on a pure pursuit method for fixed wing UAS

• Type: Article in International Conference Proceedings Book
• Date: 2017

Authors

Balampanis, F (Author) Other; Aguiar, AP (Author) FEUP; Maza, I (Author) Other; Ollero, A (Author) Other

Conference proceedings International

Title: 2017 WORKSHOP ON RESEARCH, EDUCATION AND DEVELOPMENT OF UNMANNED AERIAL SYSTEMS (RED-UAS)

Pages: 55-59

Workshop on Research, Education and Development of Unmanned Aerial Systems (RED-UAS)

Linkoping, SWEDEN, OCT 03-05, 2017

Indexing

ISI Web of Knowledge - 1 Citation

Scopus - 1 Citation

Other information

Authenticus ID: P-00N-RJ8

DOI: 10.1109/red-uas.2017.8101643

Abstract (EN): This paper introduces a method for path tracking based on a basic pure pursuit (PP) algorithmic strategy. To increase the robustness and reliability in coverage and tracking tasks using multiple Unmanned Aerial Systems (UAS), several criteria must be taken into consideration, like safe separation between the vehicles and complete area coverage based on their on board sensors. In this context, we propose a guidance strategy where initially a straight line path between previously calculated waypoints for coverage tasks is calculated. Then, for each next turn of the vehicle, a goal point is chosen in order to minimize a deviation error from the straight line path and the current position of the vehicle. In order to calculate this point, an offline lookup table is created, which correlates the underlying control model with the turn angles; during flight, the best value is chosen for each next turn. The algorithm has been tested in different scenarios and against a robust simulation framework by the means of Software-in-the-Loop (SITL). The results show that this strategy manages to provide a computationally inexpensive method for the goal points of the pure pursuit algorithm and minimizes the deviation from the straight line trajectories of the waypoint planning.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 5