Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Leonid Faybusovich

dblp:62/8138 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1997
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Robot manipulation · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Robotics › Robot manipulation
grasping
0.011997
Recursive algorithms for real-time grasping force optimization · ICRA 1997
Robotics › Robot manipulation › grasping › grasp optimization
grasping force optimization
0.011997
Recursive algorithms for real-time grasping force optimization · ICRA 1997
Mathematical optimization › continuous optimization
convex optimization
0.011997
Recursive algorithms for real-time grasping force optimization · ICRA 1997
Mathematical optimization
semidefinite programming
0.011997
Recursive algorithms for real-time grasping force optimization · ICRA 1997

Methods — techniques the papers use, named apart from their topics

self-concordant functions · 0.0dikin-type algorithm · 0.0barrier function · 0.0
YearPublicationVenuePosition
1997 Recursive algorithms for real-time grasping force optimization
abstract
In dextrous robotic hand grasping the external object force needs to be balanced with contact forces maintaining grasp stability. Redundancy in the grasp yields the optimization problem to minimize the grasp effort subject to nonlinear friction stability constraints. We reformulate the optimization problem as a semidefinite program with affine constraints. In this paper, two versions of strictly convex cost functions including a barrier term, one of them self-concordant, are considered. For the general class of such cost functions Dikin-type algorithms are considered. It is shown that the proposed algorithms guarantee convergence to the unique solution of the underlying semidefinite program. Numerical examples demonstrate the simplicity of implementation and the good numerical properties of the approach.
Martin Buss, Leonid Faybusovich, John B. Moore
ICRA2