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

Neil D. McKay

dblp:00/3349 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1992
—ORCID · none

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

Artificial intelligence and machine learning · 2Systems, 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.

Computer graphics and multimedia
1 paper
Geometric modeling and processing · 100%
Artificial intelligence
1 paper
Motion planning and robot control · 100%

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

TopicWeightPapersLastEvidence papers
Geometric modeling and processing › registration
rigid registration
0.011992
A Method for Registration of 3-D Shapes · IEEE Trans. Pattern Anal. Mach. Intell. 1992
Geometric modeling and processing
shape matching
0.011992
A Method for Registration of 3-D Shapes · IEEE Trans. Pattern Anal. Mach. Intell. 1992
Geometric modeling and processing
shape registration
0.011992
A Method for Registration of 3-D Shapes · IEEE Trans. Pattern Anal. Mach. Intell. 1992
Robotics › Motion planning and robot control
trajectory planning
0.011986
Automatic generation of trajectory planners for industrial robots · ICRA 1986
Robotics › Motion planning and robot control › trajectory planning
time-optimal trajectory planning
0.011986
Automatic generation of trajectory planners for industrial robots · ICRA 1986

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

mean-square distance minimization · 0.0iterative closest point · 0.0symbolic computation · 0.0dynamic equation generation · 0.0
YearPublicationVenuePosition
1992 A Method for Registration of 3-D Shapes
abstract
The authors describe a general-purpose, representation-independent method for the accurate and computationally efficient registration of 3-D shapes including free-form curves and surfaces. The method handles the full six degrees of freedom and is based on the iterative closest point (ICP) algorithm, which requires only a procedure to find the closest point on a geometric entity to a given point. The ICP algorithm always converges monotonically to the nearest local minimum of a mean-square distance metric, and the rate of convergence is rapid during the first few iterations. Therefore, given an adequate set of initial rotations and translations for a particular class of objects with a certain level of 'shape complexity', one can globally minimize the mean-square distance metric over all six degrees of freedom by testing each initial registration. One important application of this method is to register sensed data from unfixtured rigid objects with an ideal geometric model, prior to shape inspection. Experimental results show the capabilities of the registration algorithm on point sets, curves, and surfaces.>
Paul J. Besl, Neil D. McKay
IEEE Trans. Pattern Anal. Mach. Intell.2
1986 Automatic generation of trajectory planners for industrial robots
abstract
The control of industrial robots is usually divided into several sequential stages. Trajectory planning is an important off-line stage which is concerned with the generation of a time history of a robot's joint position, velocity, acceleration, and input torques. A number of trajectory planning methods have been developed [1], [4]-[6], [10], [11], [13], which usually entail complex computations and algebraic manipulations. Programming this sort of trajectory planners is very complex and error-prone, thereby limiting their applicability. To remove this limitation, we have begun the development of software for automating the trajectory planning, called the Automatic Trajectory Planner Generator (ATPG). This paper describes important components of the ATPG: three trajectory planners, data structures for describing geometric paths, generation of the robot's dynamic equations and constraint functions, and ancillary software. A large portion of the ATPG has been completed, and the remaining portion is currently under development.
Kang G. Shin, Neil D. McKay
ICRA2