


default search action
Makoto Kaneko
- > Home > Persons > Makoto Kaneko
Publications
- 2002
- [j42]Kensuke Harada
, Taiga Kawashima, Makoto Kaneko:
Rolling Based Manipulation under Neighborhood Equilibrium. Int. J. Robotics Res. 21(5-6): 463-474 (2002) - [j41]Kensuke Harada
, Makoto Kaneko, Toshio Tsuji
:
Active force closure for multiple objects. J. Field Robotics 19(3): 133-141 (2002) - [j40]Kensuke Harada
, Makoto Kaneko, Toshio Tsuji:
A sufficient condition for manipulation of Envelope Family. IEEE Trans. Robotics Autom. 18(4): 597-607 (2002) - [c79]Makoto Kaneko, Kensuke Harada, Toshio Tsuji:
Dynamic Friction Closure. ICRA 2002: 1584-1589 - [c78]Kensuke Harada, Jun Nishiyama, Yoshihiro Murakami, Makoto Kaneko:
Pushing Multiple Objects using Equivalent Friction Center. ICRA 2002: 2485-2491 - [c74]Kensuke Harada, Makoto Kaneko:
Manipulation of 3D enveloped object. IROS 2002: 1619-1625 - [c73]Makoto Kaneko, Akihiko Mizuno, Kensuke Harada:
Torque distribution for achieving a Hugging Walk. IROS 2002: 2613-2618 - 2001
- [c71]Jonghoon Park, Kensuke Harada
, Makoto Kaneko:
Enveloping Grasp Feasibility Inequality. ICRA 2001: 2210-2216 - [c70]Kensuke Harada, Makoto Kaneko:
Rolling Based Manipulation under Neighborhood Equilibrium. ICRA 2001: 2492-2498 - [c69]Makoto Kaneko, Tatsuya Shirai, Kensuke Harada, Toshio Tsuji:
Analysis on Detaching Assist Motion (DAM). ICRA 2001: 3028-3033 - [c68]Toshio Tsuji, Kensuke Harada
, Makoto Kaneko:
A Neuro-based Adaptive Training Method for Robotic Rehabilitation Aids. ICRA 2001: 3680-3685 - [c66]Jonghoon Park, Kensuke Harada
, Makoto Kaneko:
Analysis of frictional forces in indeterminate enveloping grasps. IROS 2001: 1882-1887 - 2000
- [j33]Kensuke Harada
, Makoto Kaneko, Toshio Tsuji
:
Rolling-based manipulation for multiple objects. IEEE Trans. Robotics Autom. 16(5): 457-468 (2000) - [c65]Makoto Kaneko, Kensuke Harada, Toshio Tsuji:
A Sufficient Condition for Manipulation of Envelope Family. ICRA 2000: 1060-1067 - [c64]Kensuke Harada, Makoto Kaneko:
Neighborhood Equilibrium Grasp for Multiple Objects. ICRA 2000: 2159-2164 - [c62]Kensuke Harada, Makoto Kaneko, Toshio Tsuji:
Rolling Based Manipulation for Multiple Objects. ICRA 2000: 3887-3894 - [c59]Makoto Kaneko, Tatsuya Shirai, Kensuke Harada, Toshio Tsuji
:
Grasp Strategy Simplified by Detaching Assist Motion (DAM). ISER 2000: 131-140 - 1999
- [c52]Makoto Kaneko, Kensuke Harada, Toshio Tsuji
:
Experimental Approach on Grasping and Manipulating Multiple Objects. ISER 1999: 47-55 - 1998
- [j27]Makoto Kaneko, Tatsuya Shirai, Kensuke Harada
, Toshio Tsuji:
Grasp and manipulation for multiple objects. Adv. Robotics 13(3): 353-354 (1998) - [c50]Kensuke Harada
, Makoto Kaneko:
Enveloping Grasp for Multiple Objects. ICRA 1998: 2409-2415 - [c46]Makoto Kaneko, Michael Kessler, Kensuke Harada, Toshio Tsuji:
Necessary and sufficient number of fingers for capturing pyramidal-like objects. IROS 1998: 134-139 - [c44]Kensuke Harada, Makoto Kaneko:
Kinematics and internal force in grasping multiple objects. IROS 1998: 298-303

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-07-06 18:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint