Name
Abstract | ||
|---|---|---|
Recent advances in technologies related to Un-manned Aerial Vehicles have led to applications in challenging tasks such as carrying a payload through a small window. Common approaches to solve this task are based on Reinforcement Learning, Quadratic Programming, and Model Predictive Control. Although they provide optimal motion planning, they rely on the necessity of a quadratic cost function or linear constraints for the obstacles. We propose to use a variant of the Rapidly-exploring Random Tree algorithm to solve the task without relying on convex constraints, tuning weights for cost functions or linear constraints. We show that our approach was able to solve the task of crossing a small window with a slung load, and we suggest future modifications to accelerate the convergence rate of the algorithm. The main advantage of the proposed approach is the capability finding a collision-free trajectory for the whole system that is not restricted to linear constraints, and does not depend on cost functions. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/SysCon47679.2020.9275664 | 2020 IEEE International Systems Conference (SysCon) |
Keywords | DocType | ISSN |
Motion Planning,Kinodynamic RRT,Quadrotor with slung load | Conference | 1944-7620 |
ISBN | Citations | PageRank |
978-1-7281-5366-7 | 0 | 0.34 |
References | Authors | |
11 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jefferson Silveira | 1 | 0 | 0.34 |
| Sidney Nascimento Givigi | 2 | 64 | 12.40 |
| Eduardo O. Freire | 3 | 66 | 5.71 |
| Lucas Molina | 4 | 5 | 1.87 |
| Elyson Carvalho | 5 | 0 | 1.69 |