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

Koichi Kondo

dblp:54/4179 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 1994
0009-0008-5600-6045ORCID · corroborated

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

Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 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.

Computer graphics and multimedia
2 papers
Geometric modeling and processing · 50% Computer animation and physical simulation · 43% Computational fabrication · 7%
Artificial intelligence
2 papers
Motion planning and robot control · 71% Planning, search and constraint satisfaction · 29%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

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

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › heuristic search › bidirectional search
bidirectional heuristic search
0.011991
Motion planning with six degrees of freedom by multistrategic bidirectional heuristic free-space enumeration · IEEE Trans. Robotics Autom. 1991
Robotics › Motion planning and robot control › motion planning
configuration space
0.011991
Motion planning with six degrees of freedom by multistrategic bidirectional heuristic free-space enumeration · IEEE Trans. Robotics Autom. 1991
Robotics › Motion planning and robot control
motion planning
0.011991
Motion planning with six degrees of freedom by multistrategic bidirectional heuristic free-space enumeration · IEEE Trans. Robotics Autom. 1991
Geometric modeling and processing › shape modeling
interactive modeling
0.011990
PIGMOD: parametric and interactive geometric modeller for mechanical design · Comput. Aided Des. 1990
Geometric modeling and processing › shape modeling
parametric modeling
0.011990
PIGMOD: parametric and interactive geometric modeller for mechanical design · Comput. Aided Des. 1990
Robotics › Motion planning and robot control › robot control
inverse kinematics
0.011994
Planning motions with intentions · SIGGRAPH 1994
Algorithms and data structures › search algorithms
heuristic search
0.011991
Motion planning with six degrees of freedom by multistrategic bidirectional heuristic free-space enumeration · IEEE Trans. Robotics Autom. 1991
Computational fabrication
mechanical design
0.011990
PIGMOD: parametric and interactive geometric modeller for mechanical design · Comput. Aided Des. 1990

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

path planning · 0.0inverse kinematics · 0.0multistrategic search · 0.0collision detection · 0.0
YearPublicationVenuePosition
1994 Planning motions with intentions
abstract
We apply manipulation planning to computer animation. A new path planner is presented that automatically computes the collision-free trajectories for several cooperating arms to manipulate a movable object between two configurations. This implemented planner is capable of dealing with complicated tasks where regrasping is involved. In addition, we present a new inverse kinematics algorithm for the human arms. This algorithm is utilized by the planner for the generation of realistic human arm motions as they manipulate objects. We view our system as a tool for facilitating the production of animation.
Yoshihito Koga, Koichi Kondo, James J. Kuffner, Jean-Claude Latombe
SIGGRAPH2
1991 Motion planning with six degrees of freedom by multistrategic bidirectional heuristic free-space enumeration
abstract
A general and efficient method is presented that uses a configuration space for planning a collision-free path among known stationary obstacles for an arbitrarily moving object with six degrees of freedom. The basic approach is to restrict the free space concerning path planning and to avoid executing unnecessary collision detections. The six-dimensional configuration space is equally quantized into cells by placing a regular grid, and the cells concerning path planning are enumerated by simultaneously executing multiple search strategies. Search strategies of different characteristics are defined by assigning different values to the coefficients of heuristic functions. The efficiency of each search strategy is evaluated during free-space enumeration, and a more promising one is automatically selected and preferentially executed. The free-space cells are efficiently enumerated for an arbitrary moving object in all kinds of working environments. The implementation of this method on several examples that have different characteristics is discussed.>
Koichi Kondo
IEEE Trans. Robotics Autom.1
1990 PIGMOD: parametric and interactive geometric modeller for mechanical design
Koichi Kondo
Comput. Aided Des.1