© 20xx IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. ; In this paper a trajectory generation approach using quadratic programming is described for aerial manipulation, i.e. for the control of an aerial vehicle equipped with a robot arm. The proposed approach applies the online active set strategy to generate a feasible trajectory of the joints, in order to accomplish a set of tasks with defined bounds and constraint inequalities. The definition of the problem in the acceleration domain allows to integrate and perform a large set of tasks and, as a result, to obtain smooth motion of the joints. A weighting strategy, associated with a normalization procedure, allows to easily define the relative importance of the tasks. This approach is useful to accomplish different phases of a mission with different redundancy resolution strategies. The performance of the proposed technique is demonstrated through real experiments with all the algorithms running onboard in real time. In particular, the aerial manipulator can successfully perform navigation and interaction phases, while keeping motion within prescribed bounds and avoiding collisions with external obstacles. ; Peer Reviewed ; Postprint (author's final draft)
Trajectory generation for unmanned aerial manipulators through quadratic programming
2017-04-01
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
DDC: | 629 |
Trajectory generation for unmanned aerial manipulators through quadratic programming
BASE | 2017
|Visual guidance of unmanned aerial manipulators
TIBKAT | 2019
|Suboptimal trajectory programming for unmanned aerial vehicles with dynamic obstacle avoidance
SAGE Publications | 2019
|Trajectory Generation for Robotic Manipulators
British Library Conference Proceedings | 1998
|