Demo Data from VLDB 2026 / reviewers in the wild / expert
O. M. Ismaeil
dblp:27/1563
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 1994
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-authorSystems, architecture and hardware · 2 · 1 first-author
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% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Robotics › Robot manipulation
grasping |
0.0 | 1 | 1994 | Grasping Using the Whole Finger · ICRA 1994 |
Robotics › Robot manipulation › grasping › grasp optimization
grasping force optimization |
0.0 | 1 | 1994 | Grasping Using the Whole Finger · ICRA 1994 |
Methods — techniques the papers use, named apart from their topics
rigid body dynamics · 0.0penalty method · 0.0coulomb friction model · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1994 | Grasping Using the Whole FingerabstractThe authors have developed a method for calculating stable grasps of an object by enclosing it with a robotic finger, accounting for the rigid-body dynamics of both the finger and the object. Beginning with a set of contact points and assuming a local Coulomb friction model, a penalty method finds a set of contact forces that produce a stable grasp. From the known relationship between the finger-joint forces and the forces exerted by the finger links, the additional grasping force can be found and added to the joint force that is required to hold the finger in the grasping configuration. The authors illustrate their algorithm by some examples to show how to grasp and move an object using the whole finger.> O. M. Ismaeil, Randy E. Ellis |
ICRA | 1 |
| 1992 | Numerical stability of forward-dynamics algorithmsabstractMany physical systems, particularly robotic linkages, can be modeled as mechanisms. In order to simulate the dynamical behavior of such systems as the number of links become large, the algorithms must produce efficient and stable computations. The mechanisms studied here include those which have tree-structured topologies, that is, a link may have more than one successor link but there are no loops in the linkage topology. The authors present a formulation of the dynamics based on representing Lagrangian mechanics with spatial, or screw, displacements. This shows that several existing algorithms are equivalent to recursive calculations on an inertial supermatrix, which is a matrix the elements of which are matrices. The result is numerically stable forward and inverse computations of the second-order terms that grow linearly with the number of links, and provides a new insight into the nature of the dynamics of mechanisms.> Randy E. Ellis, O. M. Ismaeil, I. H. Carmichael |
ICRA | 2 |