We consider the problem of planning collision-free motions for a mobile manipulator whose end-effector must travel along a given path. Algorithmic solutions are devised by adapting a technique developed for fixed-base redundant robots. In particular, we exploit the natural partition of generalized coordinates between the manipulator and the mobile base, whose nonholonomy is accounted for at the planning stage. The approach is based on the randomized generation of configurations that are compatible with the end-effector path constraint. The performance of the proposed algorithms is illustrated by several planning experiments.
Motion planning for mobile manipulators along given end-effector paths / Oriolo, Giuseppe; C., Mongillo. - 2005:(2005), pp. 2154-2160. (Intervento presentato al convegno 2005 IEEE International Conference on Robotics and Automation tenutosi a Barcelona, SPAIN nel APR 18-22, 2005) [10.1109/robot.2005.1570432].
Motion planning for mobile manipulators along given end-effector paths
ORIOLO, Giuseppe;
2005
Abstract
We consider the problem of planning collision-free motions for a mobile manipulator whose end-effector must travel along a given path. Algorithmic solutions are devised by adapting a technique developed for fixed-base redundant robots. In particular, we exploit the natural partition of generalized coordinates between the manipulator and the mobile base, whose nonholonomy is accounted for at the planning stage. The approach is based on the randomized generation of configurations that are compatible with the end-effector path constraint. The performance of the proposed algorithms is illustrated by several planning experiments.File | Dimensione | Formato | |
---|---|---|---|
VE_2005_11573-209653.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
825.14 kB
Formato
Adobe PDF
|
825.14 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.