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

Masahiro Takeuchi

dblp:08/1803 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
0since 2021 · last 2005
0000-0002-3520-7402ORCID · corroborated

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

Systems, architecture and hardware · 3 · 1 first-authorArtificial intelligence and machine learning · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1Applied, interdisciplinary, general and emerging computing · 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
1 paper
Motion planning and robot control · 75% Robot manipulation · 25%

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

TopicWeightPapersLastEvidence papers
Robotics › Robot manipulation › nonprehensile manipulation
dynamic manipulation
0.012002
Dynamic Dexterity for the Performance of "Wall-Bouncing" Tasks · ICRA 2002
Robotics › Motion planning and robot control › robot control
feedback control
0.012002
Dynamic Dexterity for the Performance of "Wall-Bouncing" Tasks · ICRA 2002
Robotics › Motion planning and robot control › robot control › force control
impact control
0.012002
Dynamic Dexterity for the Performance of "Wall-Bouncing" Tasks · ICRA 2002
Robotics › Motion planning and robot control
robot control
0.012002
Dynamic Dexterity for the Performance of "Wall-Bouncing" Tasks · ICRA 2002

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

stability analysis · 0.0discrete system analysis · 0.0
YearPublicationVenuePosition
2005 A Learning Approach to Robotic Table Tennis
abstract
We propose a method of controlling a table tennis robot so as to return the incoming ball to a desired point on the table with specified flight duration. The proposed method consists of the following three input-output maps implemented by means of locally weighted regression: 1) a map for predicting the impact time of the ball hit by the paddle and the ball position and velocity at that moment according to input vectors describing the state of the incoming ball; 2) a map representing a change in ball velocities before and after impact; and 3) a map giving the relation between the ball velocity just after impact and the landing point and time of the returned ball. We also propose a feed-forward control scheme based on iterative learning control to accurately achieve the stroke movement of the paddle as determined by using these maps. Experimental results including rallies with a human opponent are also reported to demonstrate the effectiveness of our approach.
Michiya Matsushima, Takaaki Hashimoto, Masahiro Takeuchi, Fumio Miyazaki
IEEE Trans. Robotics3
2002 Realization of the Table Tennis Task Based on Virtual Targets
abstract
This paper describes how a table tennis robot with a flat paddle coordinates its movement in order to achieve efficient strokes for any given ball. We propose a method of generating stroke movement based on virtual targets that means the point at which the ball should be struck and the paddle velocity just before hitting the ball. These targets are predicted using inputs-outputs maps implemented efficiently by means of a k-d tree (k dimensional tree). The paddle approaches these targets by using a visual feedback control scheme similar to the mirror law proposed by Koditschek. The results of the implementation are also given to show the effectiveness of the proposed method.
Fumio Miyazaki, Masahiro Takeuchi, Michiya Matsushima, Takamichi Kusano, Takaaki Hashimoto
ICRA2
2002 Dynamic Dexterity for the Performance of "Wall-Bouncing" Tasks
abstract
In this paper, we consider ”wall-bouncing ” task in which we repeat the process of hitting the ball that rebounds from the wall and the table as a typical example of dexterous batting tasks. Through the stability analysis of a discrete system, we reveal that required dexterity varies depending on the location of equilibrium points, that is, the shape of the ball trajectory. A feedback control scheme for the paddle at the moment of impact is also proposed to continue ”wall-bouncing ” task under disturbances.
Masahiro Takeuchi, Fumio Miyazaki, Michiya Matsushima, Masato Kawatani, Takaaki Hashimoto
ICRA1
1998 Real time low bit-rate video coding algorithm using multi-stage hierarchical vector quantization
abstract
We propose a low bit-rate coding algorithm for wireless communication based on multi-stage hierarchical vector quantization, motion compensation and differential pulse code modulation. Our method adapts bit allocation to spatial and temporal correlation. Conventional schemes based on the discrete cosine transform (DCT) need a large amount of computation on both encoding and decoding. On the other hand, our proposed method consists of addition, subtraction and shift operation. It does not use multiplication. It can decode in real time on a conventional serial processor. Encoding by vector quantization (VQ), however, consumes a large amount of computation. We developed a new LSI to accelerate VQ. Our scheme can send 10 frames of QCIF video sequences through a 29.2 kbps line. The quality of reconstructed image is over 30 dB.
Kazuhiko Terada, Masahiro Takeuchi, Kazutoshi Kobayashi, Keikichi Tamaru
ICASSP2
1997 A functional memory type parallel processor for vector quantization
abstract
We propose a memory-based parallel processor for vector quantization, called a functional memory type parallel processor for vector quantization (FMPP-VQ). It accelerates the nearest neighbour search of vector quantization. All distances between an input vector and reference vectors in a codebook are computed simultaneously in all PEs. The minimum value of all distances is searched in parallel. The nearest vector is obtained in O(k), where k stands for the dimension of vectors. An LSI including four PEs has been implemented. It operates at 25 MHz clock frequency.
Kazutoshi Kobayashi, Masayoshi Kinoshita, Masahiro Takeuchi, Hidetoshi Onodera, Keikichi Tamaru
ASP-DAC3