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

P. Misra

dblp:12/11135 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 1999
—ORCID · unresolved

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

Applied, interdisciplinary, general and emerging computing · 3Artificial 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
3 papers
Motion planning and robot control · 80% Robot manipulation · 20%

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

TopicWeightPapersLastEvidence papers
Robotics › Motion planning and robot control › robot control
manipulator dynamics
0.031988
Efficient modeling and computation of manipulator dynamics using orthogonal Cartesian tensors · IEEE J. Robotics Autom. 1988
A Cartesian tensor approach for fast computation of manipulator dynamics · ICRA 1988
Recursive evaluation of linearized dynamic robot models · IEEE J. Robotics Autom. 1986
Robotics › Motion planning and robot control › robot dynamics › equations of motion
newton-euler formulation
0.011988
Efficient modeling and computation of manipulator dynamics using orthogonal Cartesian tensors · IEEE J. Robotics Autom. 1988
Robotics › Motion planning and robot control
robot dynamics
0.011988
A Cartesian tensor approach for fast computation of manipulator dynamics · ICRA 1988

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

orthogonal cartesian tensors · 0.0newton-euler formulation · 0.0cartesian tensor · 0.0sensitivity matrices · 0.0recursive evaluation · 0.0
YearPublicationVenuePosition
1999 Special Issue on Global Positioning System
P. Enge, P. Misra
Proc. IEEE2
1988 A Cartesian tensor approach for fast computation of manipulator dynamics
abstract
Orthogonal second-order Cartesian tensors are used to formulated the Newton-Euler dynamic equations for a robot manipulator. Based on this formulation, an efficient recursive procedure is developed to evaluate the joint torques. The procedure is applicable to all rigid-link manipulators with open-chain kinematic structures with revolute and/or prismatic joints. For simplicity of presentation, only manipulators with (kinematically more complex) revolute joints are considered. An efficient implementation of the proposed method shows that the joint torques for a six-degree-of-freedom manipulator with revolute joint, can be computed in approximately 500 multiplications and 420 additions. For manipulators with 0 degrees or 90 degrees twist angles, the required computations are reduced to 380 multiplications and 315 additions.>
Constantinos A. Balafoutis, P. Misra, Rajnikant V. Patel
ICRA2
1988 Efficient modeling and computation of manipulator dynamics using orthogonal Cartesian tensors
abstract
The authors use orthogonal second-order Cartesian tensors to formulate the Newton-Euler dynamic equations for a robot manipulator. Based on this formulation, they develop two efficient recursive algorithms for computing the joint actuator torques/forces. The proposed algorithms are applicable to all rigid-link manipulators with open-chain kinematic structures with revolute and/or prismatic joints. An efficient implementation of one of the proposed algorithms shows that the joint torques/forces for a six-degrees-of-freedom manipulator with revolute joints, can be computed in approximately 489 multiplications and 420 additions. For manipulators with zero or 90 degrees twist angles, the required computations are reduced to 388 multiplications and 370 additions. For manipulators with even simpler geometric structures, these arithmetic operations can be further reduced to 277 multiplications and 255 additions.>
Constantinos A. Balafoutis, Rajnikant V. Patel, P. Misra
IEEE J. Robotics Autom.3
1986 Recursive evaluation of linearized dynamic robot models
abstract
A computational method for recursive evaluation of linearized dynamic robot models about a nominal trajectory is presented. The forward method evaluates the "sensitivity matrices" necessary to calculate the "forward" dynamics of the linearized model. The method has made efficient by using the fact that the derivatives of trigonometric functions need not be computed explicitly and that the partial derivatives of the homogeneous transformation matrices, may be obtained merely by row and column manipulations. The proposed scheme is general in nature and can be applied efficiently to manipulators having revolute and prismatic joints.
Constantinos A. Balafoutis, P. Misra, Rajnikant V. Patel
IEEE J. Robotics Autom.2