S. Vera, J. A. Cobano, D. Alejo, G. Heredia, A. Ollero
{"title":"Optimal conflict resolution for multiple UAVs using pseudospectral collocation","authors":"S. Vera, J. A. Cobano, D. Alejo, G. Heredia, A. Ollero","doi":"10.1109/MED.2015.7158725","DOIUrl":null,"url":null,"abstract":"This paper presents an optimal conflict resolution method for multiple unmanned aerial vehicles based on pseudospectral collocation which solves numerically optimal control problems by using non-linear programming. The trajectory of each aerial vehicle is defined by a set of waypoints and the time of arrival at each waypoint. The maneuvers allowed to solve the conflicts are the changes of speed of each aerial vehicle. A novel aspect is the application of this kind of methods to multiple aerial vehicles. The main characteristic of the method is the low execution time in the addressed problem. Moreover, the scalability of the proposed method is studied and the execution time is compared with another optimal solver. Several simulations in different scenarios are performed to test the behavior of the method.","PeriodicalId":316642,"journal":{"name":"2015 23rd Mediterranean Conference on Control and Automation (MED)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 23rd Mediterranean Conference on Control and Automation (MED)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MED.2015.7158725","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
This paper presents an optimal conflict resolution method for multiple unmanned aerial vehicles based on pseudospectral collocation which solves numerically optimal control problems by using non-linear programming. The trajectory of each aerial vehicle is defined by a set of waypoints and the time of arrival at each waypoint. The maneuvers allowed to solve the conflicts are the changes of speed of each aerial vehicle. A novel aspect is the application of this kind of methods to multiple aerial vehicles. The main characteristic of the method is the low execution time in the addressed problem. Moreover, the scalability of the proposed method is studied and the execution time is compared with another optimal solver. Several simulations in different scenarios are performed to test the behavior of the method.