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

Heon Song Nam

dblp:95/1408 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1995
—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.

Artificial intelligence
1 paper
Motion planning and robot control · 91% Robot manipulation · 9%

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

TopicWeightPapersLastEvidence papers
Robotics › Motion planning and robot control › path planning
collision-free path planning
0.011995
A Practical Collision-Free Trajectory Planning for Two Robot Systems · ICRA 1995
Robotics › Motion planning and robot control › motion planning
multi-robot motion planning
0.011995
A Practical Collision-Free Trajectory Planning for Two Robot Systems · ICRA 1995
Robotics › Robot manipulation › assembly
multi-robot assembly
0.011995
A Practical Collision-Free Trajectory Planning for Two Robot Systems · ICRA 1995

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

planning-coordination decomposition · 0.0graphical coordination space · 0.0
YearPublicationVenuePosition
1995 A Practical Collision-Free Trajectory Planning for Two Robot Systems
abstract
A practically applicable collision-free trajectory planning technique for two robot systems is proposed. The robot trajectories considered in this work are composed of many segments between which the robots stop to assemble, weld, or do other jobs by end-effector. The proposed method is based on the planning-coordination decomposition approach in which planning finds the trajectory of each robot independently according to their tasks and coordination finds velocity modification to avoid collision with each other. To fully utilize the convenience of independent trajectory planning and to ensure no geometrical path change after coordination, a simple technique avoiding collision by adding least delay-time in the local sense before moving along the next path-segment is developed. The least delay time is determined by a graphical method on the space called co-ordination space where collision between two robots and coordination of two robots are easily visualized.
Jihong Lee, Heon Song Nam, Joon Lyou
ICRA2