default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKoichi Kondo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c4]Xiaotao Shan, Yichao Jin, Koichi Kondo:
A Queueing Network Based Consultation Tool for Interconnected Warehouse Automation Processes. INFOCOM (Workshops) 2024: 1-2- [i1]Xiaotao Shan, Yichao Jin, Peizheng Li, Koichi Kondo:
Modeling and Analysis of Multi-Line Orders in Multi-Tote Storage and Retrieval Autonomous Mobile Robot Systems. CoRR abs/2407.06394 (2024)
2010 – 2019
- 2018
- [c3]Nahoko Kusaka, Nobuyuki Ueda, Koichi Kondo:
Multigenerational Collaboration to Create a Community of Practice Through Robot Application Development. RiE 2018: 125-136 - 2017
- [j14]Kanae Akaiwa, Yoshimasa Nakamura, Masashi Iwasaki, Akira Yoshida, Koichi Kondo:
An arbitrary band structure construction of totally nonnegative matrices with prescribed eigenvalues. Numer. Algorithms 75(4): 1079-1101 (2017) - 2015
- [j13]Kanae Akaiwa, Yoshimasa Nakamura, Masashi Iwasaki, Hisayoshi Tsutsumi, Koichi Kondo:
A finite-step construction of totally nonnegative matrices with specified eigenvalues. Numer. Algorithms 70(3): 469-484 (2015) - 2011
- [j12]Kenichi Yadani, Koichi Kondo, Masashi Iwasaki:
Numerical performance of hyperplane constrained method and its hybrid method for singular value decomposition. Computing 92(3): 265-283 (2011) - [j11]Koichi Kondo:
Solutions of Sakaki-Kakei equations of type 1, 2, 7 and 12. JSIAM Lett. 3: 45-48 (2011) - 2010
- [j10]Kenichi Yadani, Koichi Kondo, Masashi Iwasaki:
A singular value decomposition algorithm based on solving hyperplane constrained nonlinear systems. Appl. Math. Comput. 216(3): 779-790 (2010) - [j9]Kenichi Yadani, Koichi Kondo, Masashi Iwasaki:
On the convergence of the V-type hyperplane constrained method for singular value decomposition. JSIAM Lett. 2: 21-24 (2010) - [j8]Kenichi Yadani, Koichi Kondo, Masashi Iwasaki:
Mixed double-multiple precision version of hyperplane constrained method for singular value decomposition. JSIAM Lett. 2: 25-28 (2010) - [j7]Koichi Kondo:
Solutions of Sakaki-Kakei equations of type 3, 5 and 6. JSIAM Lett. 2: 73-76 (2010)
2000 – 2009
- 2009
- [j6]Koichi Kondo, Shinji Yasukouchi, Masashi Iwasaki:
Eigendecomposition algorithms solving sequentially quadratic systems by Newton method. JSIAM Lett. 1: 40-43 (2009)
1990 – 1999
- 1994
- [c2]Yoshihito Koga, Koichi Kondo
, James Kuffner, Jean-Claude Latombe:
Planning motions with intentions. SIGGRAPH 1994: 395-408 - 1991
- [j5]Koichi Kondo:
Motion planning with six degrees of freedom by multistrategic bidirectional heuristic free-space enumeration. IEEE Trans. Robotics Autom. 7(3): 267-277 (1991) - 1990
- [j4]Koichi Kondo:
Collision avoidance by free space enumeration based on heuristic graph search. Adv. Robotics 5(3): 293-308 (1990) - [j3]Koichi Kondo:
Collision avoidance by free space enumeration using multiple search strategies. Adv. Robotics 5(4): 411-427 (1990) - [j2]Koichi Kondo:
PIGMOD: parametric and interactive geometric modeller for mechanical design. Comput. Aided Des. 22(10): 633-644 (1990)
1980 – 1989
- 1988
- [j1]Koichi Kondo, Fumihiko Kimura:
Collision avoidance using a free space enumeration method based on grid expansion. Adv. Robotics 3(3): 159-175 (1988) - [c1]Koichi Kondo:
A simple motion planning algorithm using heuristic free space enumeration. IROS 1988: 751-756
Coauthor Index
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 2024-10-07 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
