2 resultados para Trajectory

em AMS Tesi di Laurea - Alm@DL - Università di Bologna


Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this Bachelor Thesis I want to provide readers with tools and scripts for the control of a 7DOF manipulator, backed up by some theory of Robotics and Computer Science, in order to better contextualize the work done. In practice, we will see most common software, and developing environments, used to cope with our task: these include ROS, along with visual simulation by VREP and RVIZ, and an almost "stand-alone" ROS extension called MoveIt!, a very complete programming interface for trajectory planning and obstacle avoidance. As we will better appreciate and understand in the introduction chapter, the capability of detecting collision objects through a camera sensor, and re-plan to the desired end-effector pose, are not enough. In fact, this work is implemented in a more complex system, where recognition of particular objects is needed. Through a package of ROS and customized scripts, a detailed procedure will be provided on how to distinguish a particular object, retrieve its reference frame with respect to a known one, and then allow navigation to that target. Together with technical details, the aim is also to report working scripts and a specific appendix (A) you can refer to, if desiring to put things together.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In designing the trajectory for a multiple flyby mission to asteroids the choice of the targets is the most challenging problem. This dissertation faces this problem in the framework of the recently issued medium-size mission call (M5) from ESA: CASTAway. Starting from the preliminary work done in [6], this thesis develops a methodology for sequencing the potential targets in a multiple flyby mission. In order to reduce the computational time, the complete database of known small bodies is firstly pruned on the base of heuristic considerations. Using the assumption of small manoeuvres, a chief orbit concept could be used. Thus, two heuristic thresholds are defined in order to exclude non-promising targets given a chief orbit. The sequencing process takes chief orbit and promising targets as inputs and gives a set of candidate sequences. The results of such a process are analysed in the CASTAway framework and the best feasible sequence studied in details.