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

Pudji Astuti

dblp:46/5340 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 1996
0000-0002-0038-0141ORCID · reported

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

Artificial intelligence and machine learning · 3 · 3 first-authorSystems, architecture and hardware · 3 · 3 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
3 papers
Robot manipulation · 56% Motion planning and robot control · 26% Optimization for machine learning · 14%

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

TopicWeightPapersLastEvidence papers
Robotics › Robot manipulation
assembly
0.031996
Discrete event controller synthesis for the convergence of an assembly process · ICRA 1996
The Convergence of Assembly Discrete Event Systems Using Markov Chains · ICRA 1995
Sufficient Conditions for the Success of Robotic Assembly · ICRA 1994
Robotics › Motion planning and robot control › robot control
discrete event control
0.011996
Discrete event controller synthesis for the convergence of an assembly process · ICRA 1996
Machine learning › Optimization for machine learning
convergence analysis
0.011995
The Convergence of Assembly Discrete Event Systems Using Markov Chains · ICRA 1995
Robotics › Robot manipulation › contact-rich manipulation
contact state control
0.011994
Sufficient Conditions for the Success of Robotic Assembly · ICRA 1994
Robotics › Motion planning and robot control
hybrid systems
0.021996
Discrete event controller synthesis for the convergence of an assembly process · ICRA 1996
The Convergence of Assembly Discrete Event Systems Using Markov Chains · ICRA 1995
Knowledge, reasoning and agents › Knowledge representation and reasoning › diagnosis
discrete-event systems
0.011994
Sufficient Conditions for the Success of Robotic Assembly · ICRA 1994

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

discrete event system modeling · 0.0dynamic programming · 0.0transition probability matrix estimation · 0.0markov chain · 0.0petri net · 0.0
YearPublicationVenuePosition
1996 Discrete event controller synthesis for the convergence of an assembly process
abstract
A discrete event controller (DEC) synthesis methodology for the successful convergence of assembly is presented. The modelling of an assembly process as a hybrid dynamic system (HDS) has been shown to be a very effective strategy to incorporate the interaction between the workpiece and its environment. In addition, this modelling has allowed the derivation of realistic conditions on the DEC for the convergence to the full assembly, known as p-convergence. In this paper the authors propose a DEC synthesis methodology resulting in an optimal p-convergence by combining the maintaining and enabling conditions proposed by McCarragher and Asada and dynamic programming. The applicability of the proposed synthesis methodology is then demonstrated for a dual peg insertion task.
Pudji Astuti, Brenan J. McCarragher
ICRA1
1995 The Convergence of Assembly Discrete Event Systems Using Markov Chains
abstract
A new approach to the planning and analysis of the successful convergence of assembly is presented. The convergence is referred to as p-convergence, since it is derived within a probability framework. The assembly is modeled as a hybrid dynamic system (HDS) accounting for the presence of the discrete change of contact and the continuous movement during the process. The continuous property is then employed to represent an assembly DES as a Markov chain such that p-convergence can be proposed. To derive conditions for p-convergence of the full assembly, methods for estimating the transition probability matrix are derived for the perfect case, the tracking error case, and the case of parameter uncertainty. It is shown that p-convergence for an assembly DES requires a control effort which is significantly more realistic for practical implementation than current methods presented in the literature.
Pudji Astuti, Brenan J. McCarragher
ICRA1
1994 Sufficient Conditions for the Success of Robotic Assembly
abstract
Sufficient conditions for the success of the robotic control of assembly are presented. The assembly is modelled as a discrete event system using Petri nets. The abstraction of assembly to the discrete event system highlights the changes in the state of contact as the key points to control in the assembly process. Using this abstraction, sufficient conditions on the velocity commands are developed which guarantee successful parts mating. A method to derive robot velocity commands satisfying these conditions is derived. The method is then applied to a dual peg-in-the-hole problem.>
Pudji Astuti, Brenan J. McCarragher
ICRA1