Hostname: page-component-8448b6f56d-qsmjn Total loading time: 0 Render date: 2024-04-16T06:27:02.927Z Has data issue: false hasContentIssue false

Manoeuvring highly redundant manipulators

Published online by Cambridge University Press:  01 July 1997

E. Sahin Conkur
Affiliation:
AMARC, Faculty of Engineering, University of Bristol, 26-32 Park Row, Bristol, BS1 45LY, UK
Rob Buckingham
Affiliation:
AMARC, Faculty of Engineering, University of Bristol, 26-32 Park Row, Bristol, BS1 45LY, UK

Abstract

A task based approach to the issue of redundant robots starts from the premise that there are obstacles that cannot be removed from the working area and which therefore must be avoided. This statement produces the requirement for a device with a certain degree of mobility, and stresses the need to ensure that the aim is twofold: reach the goal and avoid obstacles. But avoiding obstacles is not the same objective as keeping as far away from an obstacle as possible; the primary goal is still to reach the target. In fact humans use soft contact to reach targets that are at the periphery of their reach. This soft distributed contact has the effect of smoothing the surface of the object and hence there is an element of only being interested in obstacle detail at the appropriate scale to achieve the task.

This paper describes a new approach to collision avoidance based on using a global path finding algorithm, in this case using Laplacian potential fields, in conjunction with a simple local geometrically based algorithm for avoiding obstacles and maximising the use of manoeuvring space in a manner which is not limited by digital computation resolution issues. This extra technique is in some ways analogous to the human soft contact approach.

Three examples are presented to illustrate the robustness of the algorithm. In order to be able to compare results with other techniques, an environment measurement scheme is defined which gives an indication of the difficulty of the trajectory being followed.

Type
Research Article
Copyright
© 1997 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)