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

Y. Hoshino

dblp:48/2456 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1991
—ORCID · none

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

Artificial 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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 50% High-performance computing · 50%
Artificial intelligence
1 paper
Motion planning and robot control · 100%

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

TopicWeightPapersLastEvidence papers
Parallel and multicore computing
parallel algorithms
0.011991
Parallel implementation of Newton-Euler algorithm with one step ahead prediction · ICRA 1991
High-performance computing › parallel numerical algorithms
parallel robot dynamics computation
0.011991
Parallel implementation of Newton-Euler algorithm with one step ahead prediction · ICRA 1991
Robotics › Motion planning and robot control › robot dynamics
inverse dynamics
0.011991
Parallel implementation of Newton-Euler algorithm with one step ahead prediction · ICRA 1991
Robotics › Motion planning and robot control
robot control
0.011991
Parallel implementation of Newton-Euler algorithm with one step ahead prediction · ICRA 1991

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

one-step-ahead prediction · 0.0newton-euler algorithm · 0.0data buffering · 0.0
YearPublicationVenuePosition
1991 Parallel implementation of Newton-Euler algorithm with one step ahead prediction
abstract
The authors propose a parallel Newton-Euler algorithm for calculating the inverse dynamics of manipulators whose computational time is independent of the number of links. The algorithm consists of two paths: a forward path for calculating a kinematic chain, i.e., linear velocities, linear accelerations, etc.; and a backward path for determining a dynamic chain, i.e., forces and moments. In order to determine each moment or force perfectly, the paths must be tracked sequentially. Complete parallel implementation of the Newton-Euler algorithm with data buffering is proposed for constructing a control scheme whose control period can be reduced drastically and is independent of the number of links. Delays due to the data buffering are suppressed by a one-step-ahead prediction using a linear model. The effectiveness of the proposed algorithm is demonstrated by extensive numerical simulations.>
Masaki Yamakita, Y. Hoshino, K. Morimoto, Katsuhisa Furuta
ICRA2