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

D. S. Hong

dblp:88/427 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 1999
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 2 first-authorSystems, architecture and hardware · 3 · 2 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.

Artificial intelligence
1 paper
Robot manipulation · 50% Motion planning and robot control · 50%
Computer graphics and multimedia
1 paper
Computational fabrication · 100%

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

TopicWeightPapersLastEvidence papers
Robotics › Robot manipulation
assembly
0.011995
Dissassemblability Analysis for Generating Robotic Assembly Systems · ICRA 1995
Robotics › Motion planning and robot control
assembly planning
0.011995
Dissassemblability Analysis for Generating Robotic Assembly Systems · ICRA 1995
Computational fabrication
fixture design
0.011995
Dissassemblability Analysis for Generating Robotic Assembly Systems · ICRA 1995

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

motion instability analysis · 0.0mathematical disassemblability analysis · 0.0
YearPublicationVenuePosition
1999 Generation of robotic assembly sequences using a simulated annealing
abstract
An assembly sequence is considered to be optimal when it minimizes assembly cost while satisfying assembly constraints. The assembly cost relates to assembly operations, assembly motions, and assembly direction changes. This study proposes a simulated-annealing method for the generation of such assembly sequences in robotic assembly. This method reflects the assembly cost to an energy function associated with the assembly sequence. The energy function is iteratively minimized and occasionally perturbed by a simulated annealing until no further change in the energy occurs. As a result, an assembly sequence with a low assembly cost is finally found. To show the effectiveness of the proposed method, case study is presented for an electrical relay. The performance is evaluated from the comparison of the result with the ones obtained from an expert system and a neural network-based approach, previously presented methods.
D. S. Hong, Hyung Suck Cho
IROS1
1995 Dissassemblability Analysis for Generating Robotic Assembly Systems
abstract
This paper proposes a mathematical approach to the analysis of disassemblability of a product for generating stable robotic assembly sequences. The disassemblability of a part, which represents a cost for disassembling the part from a base assembly, is derived in terms of both separability of a part from a base assembly and motion instability of the base assembly. Then, stable robotic assembly sequences are found in the list of parts, each of which is sequentially chosen to have a locally maximum disassemblability. To show the effectiveness of the proposed method, case studies are presented for industrial products. The results are compared with those of previous researches. The comparison shows that the proposed method can effectively generate stable robotic assembly sequences and provide essential informations on fixture design.
C. K. Shin, D. S. Hong, Hyung Suck Cho
ICRA2
1993 Optimization of robotic assembly sequences using neural network
abstract
This paper presents a neural network based computational scheme to generate the optimize robotic assembly sequence for an assembly product consisting of a number of parts. An assembly sequence is considered to be optimal when it meets a number of conditions: it must satisfy assembly constraints, keep the stability of in-process subassembly, and minimize assembly cost. Currently, various search algorithms have been reported for the purpose, but as the number of the parts increases they often fail to generate assembly sequences due to the explosion of the search space. As an alternative solution to overcome this problem, the authors propose a scheme using both the Hopfield neural network and the expert system. Based on the inferred precedence constraints and the assembly costs obtained from the expert system, the authors derive the evolution equation of the network, and finally obtain an optimal assembly sequence resulting from the evolution of the network. To illustrate the suitability of the proposed scheme, case study is presented for an electrical relay. The result is compared with that obtained by the expert system.
D. S. Hong, Hyung Suck Cho
IROS1