Guaranteeing Task Prioritization for Redundant Robots Given Maximum Number of Tasks and Singularities
Conference proceedings article
Authors/Editors
Research Areas
No matching items found.
Publication Details
Author list: Jamisola RS, Chang PH, Lee J
Place: NEW YORK
Publication year: 2012
Journal: TENCON 2012 - 2012 IEEE REGION 10 CONFERENCE: SUSTAINABLE DEVELOPMENT THROUGH HUMANITARIAN TECHNOLOGY (2159-3442)
Journal acronym: TENCON IEEE REGION
Number of pages: 6
ISBN: 978-1-4673-4822-5
eISBN: 978-1-4673-4823-2
ISSN: 2159-3442
Languages: English-Great Britain (EN-GB)
View in Web of Science | View citing articles in Web of Science
Abstract
This paper evaluates the effectiveness of a proposed task-prioritization scheme for redundant robots. The scheme has an advantage of a non-inverse computation of the projection matrix. This feature is important because the projection matrix for redundant robots is singular all the time, except when the Jacobian is zero. The evaluation is based on how task prioritization is managed through singularities, despite carrying out maximum load of task requirements. In particular, the redundant robot should be able to: (1) utilize the lost degree of freedom in the world space for the newly prioritized singularity-escape task in the null space, (2) set this new task as the highest-priority task in the null space, and (3) maintain the hierarchy of task prioritization of the previously assigned tasks. To proceed with the evaluation, we first established the maximum number of prioritized tasks that a given redundant robot can accommodate. Then we assigned this maximum number of tasks on the robot, forced it to assume a singular configuration, and evaluated its task prioritization performance. This scenario is very useful when singularity cannot be avoided during task execution, e. g., avoiding obstacles in the null space such that the robot is forced to assume a singular configuration while fully loaded with prioritized tasks.
Keywords
No matching items found.
Documents
No matching items found.
