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

Greg Heinzinger

dblp:181/3302 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 1990
—ORCID · none

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

Artificial intelligence and machine learning · 4 · 4 first-authorSystems, architecture and hardware · 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
4 papers
Motion planning and robot control · 95% Robot navigation and mapping · 5%
Theoretical computer science
1 paper
Approximation and online algorithms · 100%

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

TopicWeightPapersLastEvidence papers
Robotics › Motion planning and robot control
motion planning
0.021990
Time-optimal trajectories for a robot manipulator: a provably good approximation algorithm · ICRA 1990
Bounded error interpolates for manipulators with prismatic and revolute joints · ICRA 1989
Robotics › Motion planning and robot control
robot kinematics
0.021989
Bounded error interpolates for manipulators with prismatic and revolute joints · ICRA 1989
Bounds on the derivatives of the forward kinematic map for open-kinematic-chain manipulators · ICRA 1989
Robotics › Motion planning and robot control › trajectory optimization
time-optimal trajectory
0.011990
Time-optimal trajectories for a robot manipulator: a provably good approximation algorithm · ICRA 1990
Approximation and online algorithms
approximation algorithms
0.011990
Time-optimal trajectories for a robot manipulator: a provably good approximation algorithm · ICRA 1990
Robotics › Motion planning and robot control
robot dynamics
0.011989
Bounds on robot dynamics · ICRA 1989
Robotics › Robot navigation and mapping
obstacle avoidance
0.011990
Time-optimal trajectories for a robot manipulator: a provably good approximation algorithm · ICRA 1990
Robotics › Motion planning and robot control
robot control
0.011989
Bounds on robot dynamics · ICRA 1989
Robotics › Motion planning and robot control › trajectory planning
trajectory interpolation
0.011989
Bounds on the derivatives of the forward kinematic map for open-kinematic-chain manipulators · ICRA 1989

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

approximation algorithm · 0.0rigid-body motion metrics · 0.0configuration-independent bounds · 0.0bounded error interpolation · 0.0
YearPublicationVenuePosition
1990 Time-optimal trajectories for a robot manipulator: a provably good approximation algorithm
abstract
An algorithm is presented for generating near-time-optimal trajectories for an open-kinematic-chain manipulator moving in a cluttered workspace. This is the first algorithm to guarantee bounds on the closeness of an approximation to a time-optimal trajectory. The running time and space required are polynomial in the desired accuracy of the approximation. The user may also specify tolerances by which the trajectories must clear obstacles in the workspace to allow modeling of control errors.>
Greg Heinzinger, Paul E. Jacobs, John F. Canny, Brad E. Paden
ICRA1
1989 Bounds on the derivatives of the forward kinematic map for open-kinematic-chain manipulators
abstract
The authors develop simple, configuration-independent bounds for the Jacobian and the higher order derivatives of the forward kinematic map of a manipulator with revolute and prismatic joints. In doing so they obtain: a simple formula for the higher order derivatives of the forward kinematic map; an easily computable and meaningful metric on the group of rigid-body motions; and useful norms on the joint space of a manipulator. The bounds on the forward kinematic map are practical to implement and have proved to be very useful for trajectory interpolation, space generation, and interpolation of the robot dynamics.>
Greg Heinzinger, Brad E. Paden
ICRA1
1989 Bounded error interpolates for manipulators with prismatic and revolute joints
abstract
An algorithm for interpolating workspace trajectories in the joint space of a manipulator having revolute and prismatic joints is described. This algorithm relies on bounds on the derivatives of the kinematic map of such a manipulator derived by the authors (ibid., vol.3, p.1744-9). The algorithm generates interpolates such that user-specified tolerances on position, velocity and acceleration are maintained. This is the first joint space interpolation algorithm to guarantee workspace error bounds on velocity and acceleration. The algorithm includes the prismatic case, which is also novel, and it takes into account factors beyond kinematic errors, making it a practical addition to a robotic manipulator system.>
Greg Heinzinger, Brad E. Paden
ICRA1
1989 Bounds on robot dynamics
abstract
The authors develop simple configuration-independent bounds on the dynamics of a robot manipulator. In particular, the inertia and gravity tensors and their derivatives of all orders for open-kinematic-chain manipulators. The bounds are useful in dynamics interpolation bounding the Coriolis and centrifugal forces (since these depend on the derivatives of the inertia tensor), suboptimal control, and path planning with dynamical constraints. These bounds can be used for verifying that trajectories satisfy actuator constraints. The bounds on the derivatives of the inertia tensor bound Coriolis and centrifugal forces and determine whether or not they can be ignored along a trajectory. The bounds on the derivatives also permit reliable interpolation of feedforward terms of dynamic compensation in control. In addition, they may also be used to simplify convergence proofs in nonlinear control schemes where detailed estimates of the dynamics are required, and they are useful in a variety of planning and optimization problems to prove the correctness of algorithms.>
Greg Heinzinger, Brad E. Paden
ICRA1