A self-adjusting and modular supervisory control algorithm for planar dexterous manipulation

Date

2023-04

Editor(s)

Advisor

Supervisor

Co-Advisor

Co-Supervisor

Instructor

Source Title

Mechatronics

Print ISSN

0957-4158

Electronic ISSN

1873-4006

Publisher

Elsevier

Volume

90

Issue

Pages

102936-1 - 102936-16

Language

en

Journal Title

Journal ISSN

Volume Title

Citation Stats
Attention Stats
Usage Stats
20
views
22
downloads

Series

Abstract

Many applications require precise handling and manipulation of delicate objects. In some cases, the object must be transported to a new location following a strict travel path including time-related constraints. This paper presents a self-adjusting modular control algorithm for dexterous manipulation of planar objects using multiple manipulators with precise path and timing deliveries. The popular caging approach is simple, and usually effective when manipulating objects with multiple devices but can fail following complex paths with orientation adjustments under time-critical tracking requirements. The proposed approach exploits the dynamics of the object in real-time using tracking control and allocates the force that needs to be applied by each manipulator based on their current position around the object to maximize their capability to push in the direction of the contact angle. The new algorithm is self-adjusting and modular; It can adjust its force allocation according to configuration changes during operation, and manipulators execute the same algorithm regardless of their number. The advantages of the new approach are successfully demonstrated both with simulations and testbed experiments, including orientation tracking, which is not typically featured with the caging approach. Conditions to check when the new algorithm is most effective are also analyzed. The closed-loop stability and performance of the new algorithm are also studied and necessary conditions are identified.

Course

Other identifiers

Book Title

Degree Discipline

Degree Level

Degree Name

Citation

Published Version (Please cite this version)