A linear complementarity approach to the frictionless gripper problem

doi:https://doi.org/10.1177/027836499201100202

Title: A linear complementarity approach to the frictionless gripper problem

Full Record
Other Related Research

Abstract

This article deals with static unilateral phenomena arising in grasping mechanisms and caused by the possible loss of contact between elastic grippers and rigid objects. The problem is formulated as a linear complementarity problem (LCP) that is derived from the equilibrium equations of forces and the compatibility equations for the displacements, as well as from the complementarity inequality restriction describing the contract. A variant of the infeasibility-reducing, complementary pivot algorithm of Lemke is used for the numerical solution of the arising LCP. Form and force closure conditions are fulfilled in an automatic way from the solution of the aforementioned LCP. The used algorithm guarantees rapid convergence to the solution of the problem. The theory is illustrated by numerical examples.

Authors:

Al-Fahed, A M; Stavroulakis, G E; Panagiotopoulos, P D ^[1]

Aristotle Univ., Thessaloniki (Greece)

Publication Date:: 1992-04-01

OSTI Identifier:: 6904996

Resource Type:: Journal Article

Journal Name:: International Journal of Robotics Research; (United States)

Additional Journal Information:: Journal Volume: 11:2; Journal ID: ISSN 0278-3649

Country of Publication:: United States

Language:: English

Subject:: 42 ENGINEERING; MANIPULATORS; CONTROL; ALGORITHMS; FINGERS; POSITIONING; ROBOTS; SLIDING FRICTION; SLIP; BODY; BODY AREAS; EQUIPMENT; FRICTION; HANDS; LABORATORY EQUIPMENT; LIMBS; MATERIALS HANDLING EQUIPMENT; MATHEMATICAL LOGIC; REMOTE HANDLING EQUIPMENT; 420200* - Engineering- Facilities, Equipment, & Techniques

Citation Formats


                    Al-Fahed, A M, Stavroulakis, G E, and Panagiotopoulos, P D. A linear complementarity approach to the frictionless gripper problem.  United States: N. p., 1992. 
        Web.  doi:10.1177/027836499201100202.

Copy to clipboard


                    Al-Fahed, A M, Stavroulakis, G E, & Panagiotopoulos, P D. A linear complementarity approach to the frictionless gripper problem.  United States.  https://doi.org/10.1177/027836499201100202

Copy to clipboard


                    Al-Fahed, A M, Stavroulakis, G E, and Panagiotopoulos, P D. Wed .  
        "A linear complementarity approach to the frictionless gripper problem".  United States.  https://doi.org/10.1177/027836499201100202.

Copy to clipboard


                    
@article{osti_6904996,

  title        = {A linear complementarity approach to the frictionless gripper problem},

  author       = {Al-Fahed, A M and Stavroulakis, G E and Panagiotopoulos, P D},

  abstractNote = {This article deals with static unilateral phenomena arising in grasping mechanisms and caused by the possible loss of contact between elastic grippers and rigid objects. The problem is formulated as a linear complementarity problem (LCP) that is derived from the equilibrium equations of forces and the compatibility equations for the displacements, as well as from the complementarity inequality restriction describing the contract. A variant of the infeasibility-reducing, complementary pivot algorithm of Lemke is used for the numerical solution of the arising LCP. Form and force closure conditions are fulfilled in an automatic way from the solution of the aforementioned LCP. The used algorithm guarantees rapid convergence to the solution of the problem. The theory is illustrated by numerical examples.},

  doi          = {10.1177/027836499201100202},

  url          = {https://www.osti.gov/biblio/6904996},
  journal      = {International Journal of Robotics Research; (United States)},

  issn         = {0278-3649},

  number       = ,

  volume       = 11:2,

  place        = {United States},

  year         = {1992},

  month        = {4}

}

Copy to clipboard

Journal Article:

https://doi.org/10.1177/027836499201100202

Other availability

Find in Google Scholar

Search WorldCat to find libraries that may hold this journal

Save / Share:

Export Metadata

Save to My Library

Similar records in OSTI.GOV collections:

Computational experience in solving equilibrium models by a sequence of linear complementarity problems. Technical report SOL 83-1

Technical Report Mathiesen, L

This paper presents a modelling format for partial and general economic equilibrium problems. It reports on computational experience from a series of small to medium sized problems taken from the literature on computation of economic equilibria. The common characteristic of these models is the presence of weak inequalities and complementary slackness, e.g., a linear technology with alternative activities or various institutional constraints on prices. The equilibrium is computed by solving a sequence of linear complementarity problems (LCP). The iterative (outer) part of this algorithm is a Newton process, while for the inner part we use Lemke's almost complementary pivoting algorithm.more »« less
Sequential optimization and complementarity techniques for computing economic equilibria

Technical Report Stone, J C

We address two prominent methods in use today for solution of large-scale economic equilibrium problems with general demand functions and an activity analysis representation of production. The SLCP method computes an equilibrium by solving a sequence of linear complementarity problems. SOPT methods solve a sequence of optimization problems which are typically of lower dimension than the problems solved by SLCP. We develop informative analogies between SLCP and two state-of-the-art algorithms for nonlinear optimization, specifically, projected Lagrangian and sequential quadratic programming methds. Since the convergence properties of the optimization are known, these analogies should contribute to our understanding of SLCP andmore »« less
A Smoothing-Type Algorithm for Solving Linear Complementarity Problems with Strong Convergence Properties

Journal Article Huang Zhenghai, E-mail: huangzhenghai@tju.edu.cn ; Weizhe, Gu - Applied Mathematics and Optimization

In this paper, we construct an augmented system of the standard monotone linear complementarity problem (LCP), and establish the relations between the augmented system and the LCP. We present a smoothing-type algorithm for solving the augmented system. The algorithm is shown to be globally convergent without assuming any prior knowledge of feasibility/infeasibility of the problem. In particular, if the LCP has a solution, then the algorithm either generates a maximal complementary solution of the LCP or detects correctly solvability of the LCP, and in the latter case, an existing smoothing-type algorithm can be directly applied to solve the LCP withoutmore »« less
https://doi.org/10.1007/S00245-007-9004-Y
Parallel and serial solution of large-scale linear complementarity problems

Thesis/Dissertation Thompson, K M

This thesis is concerned with developing algorithms for solving large-scale versions of the linear complementarity problem (LCP), which consists of finding an n-dimensional vector z such that z greater than or equal to O, Mz + q greater than or equal to O, and z(mz + q) = O where M is an n-by-n real matrix and q is a n-vector. The first algorithm proposed is an asynchronous parallel successive overrelaxation (SOR) algorithm suitable for large sparse symmetric problems. The second algorithm is a distributed version of Lemke's classical algorithm for solving the LCP. The algorithm is designed for amore »« less
A computational study of the use of an optimization-based method for simulating large multibody systems.

Journal Article Petra, C ; Gavrea, B ; Anitescu, M ; ... - Optimization Methods and Software

The present work aims at comparing the performance of several quadratic programming (QP) solvers for simulating large-scale frictional rigid-body systems. Traditional time-stepping schemes for simulation of multibody systems are formulated as linear complementarity problems (LCPs) with copositive matrices. Such LCPs are generally solved by means of Lemke-type algorithms and solvers such as the PATH solver proved to be robust. However, for large systems, the PATH solver or any other pivotal algorithm becomes unpractical from a computational point of view. The convex relaxation proposed by one of the authors allows the formulation of the integration step as a QPD, for whichmore »« less
https://doi.org/10.1080/10556780902806094

Similar Records