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

Li-Chun T. Wang

dblp:08/4896 · also Li-Chun Tommy Wang · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 1994
—ORCID · none

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

Applied, interdisciplinary, general and emerging computing · 4 · 4 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
2 papers
Motion planning and robot control · 39% Multi-agent systems · 30% Robot manipulation · 30%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

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

TopicWeightPapersLastEvidence papers
Robotics › Robot manipulation › cooperative manipulation
cooperating manipulators
0.011994
Dynamic load-carrying capacity and inverse dynamics of multiple cooperating robotic manipulators · IEEE Trans. Robotics Autom. 1994
Robotics › Motion planning and robot control › robot dynamics
inverse dynamics
0.011994
Dynamic load-carrying capacity and inverse dynamics of multiple cooperating robotic manipulators · IEEE Trans. Robotics Autom. 1994
Knowledge, reasoning and agents › Multi-agent systems
multi-robot systems
0.011994
Dynamic load-carrying capacity and inverse dynamics of multiple cooperating robotic manipulators · IEEE Trans. Robotics Autom. 1994
Robotics › Motion planning and robot control
robot control
0.011985
Recursive computations of kinematic and dynamic equations for mechanical manipulators · IEEE J. Robotics Autom. 1985
Graph algorithms and graph theory › graph algorithms › graph search
depth-first search
0.011993
On the numerical kinematic analysis of general parallel robotic manipulators · IEEE Trans. Robotics Autom. 1993

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

quadratic programming · 0.0linear programming · 0.0d'alembert's principle · 0.0recursion formulas · 0.0graph theory · 0.0depth-first search · 0.0rodrigues' equation · 0.0recursive formulation · 0.0
YearPublicationVenuePosition
1994 Dynamic load-carrying capacity and inverse dynamics of multiple cooperating robotic manipulators
abstract
A unified method for computing the dynamic load-carrying capacity (DLCC) and the inverse dynamics of multiple cooperating robotic manipulators is developed in this paper. In this method, the kinematic constraints and the governing dynamic equations of the multi-robot system are formulated in the joint space based on a coordinate partitioning technique and the generalized D'Alembert's principle. This approach not only gives the minimum number of equations but also allows separate computations of the dynamics of the robots and that of the payload. The upper limit of the DLCC at any points on a given trajectory is obtained by solving a small-size linear programming problem. An iterative algorithm for evaluating the maximum allowable DLCC of the trajectory is also developed. After the DLCC is determined, the optimum distribution of actuator torques are computed by using a quadratic programming technique. The proposed method is conceptually straightforward, and it is applicable to wide varieties of multi-robot systems as well as fully parallel robots with redundant actuators.>
Li-Chun T. Wang, Ming Jun Kuo
IEEE Trans. Robotics Autom.1
1993 On the numerical kinematic analysis of general parallel robotic manipulators
abstract
A systematic two-part approach for the numerical kinematic analysis of general parallel robotic manipulators, is presented. The first part deals with structural analysis. Based on graph theory and the depth first search algorithm, a method for identifying and orienting the dependent kinematic loops of the robot is developed. This method not only facilitates the assignment of the local coordinate systems attached to the robot, but also arranges them in the correct order to allow efficient recursive coordinate transformation. The second part deals with displacement analysis. A set of recursion formulas is developed for computing the forward coordinate transformations, and these formulas are then adopted in a two-phase computational algorithm to obtain the numerical solutions to the direct and inverse kinematics problems. The two-phase algorithm developed is not only insensitive to the initial approximation of the solution vector, but also converges rapidly. It is also useful for finding multiple solutions for the robot as well as for continuous trajectory planning, as shown by the numerical examples presented.>
Li-Chun T. Wang
IEEE Trans. Robotics Autom.1
1991 A combined optimization method for solving the inverse kinematics problems of mechanical manipulators
abstract
A new method for computing numerical solutions to the inverse kinematics problem of robotic manipulators is developed. The method is based on a combination of two nonlinear programming techniques and the forward recursion formulas, with the joint limitations of the robot being handled implicitly as simple boundary constraints. This method is numerically stable since it converges to the correct answer with virtually any initial approximation, and it is not sensitive to the singular configuration of the manipulator. In addition, this method is computationally efficient and can be applied to serial manipulators having any number of degrees of freedom.>
Li-Chun T. Wang
IEEE Trans. Robotics Autom.1
1985 Recursive computations of kinematic and dynamic equations for mechanical manipulators
abstract
Computational kinematics and dynamics of robot manipulators are dealt with. A recursive method based on the vector form of Rodrigues' equation is presented for the computation of the associated coordinate transformations. The method allows for forward, backward, and two-way recursions and is applied to the computations of the Jacobian matrices and dynamic equations for mechanical manipulators. The computational complexities of the resulting equations are also evaluated and compared to some of the existing methods in each case. It is shown that the algorithms presented have certain computational advantages over most of the existing methods.
Li-Chun T. Wang, Bahram Ravani
IEEE J. Robotics Autom.1