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

A. Raue

dblp:39/4931 · DBLP profile ↗
← Back
2ranked-venue papers
0as 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 · 1Systems, architecture and hardware · 1Human-computer interaction and ubiquitous computing · 1Applied, interdisciplinary, general and emerging computing · 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
Robot manipulation · 100%

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

TopicWeightPapersLastEvidence papers
Robotics › Robot manipulation
assembly
0.011999
Identification of Assembly Process States Using Polyhedral Convex Cones · ICRA 1999
Robotics › Robot manipulation › tactile sensing › contact sensing
contact state estimation
0.011999
Identification of Assembly Process States Using Polyhedral Convex Cones · ICRA 1999
Robotics › Robot manipulation
compliant motion
0.011999
Identification of Assembly Process States Using Polyhedral Convex Cones · ICRA 1999

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

symbolic representation · 0.0polyhedral convex cone · 0.0
YearPublicationVenuePosition
1999 Identification of Assembly Process States Using Polyhedral Convex Cones
abstract
The execution of automatically generated assembly plans by robots is one of the key technologies of modern and flexible manufacturing. During the execution of assembly sequences the robot comes into contact with the environment. Since there are positional and geometrical uncertainties from object representation, robot motion, and sensor information, compliance is used typically to prevent excessive contact forces. The contact forces and the resulting torques provide information about the contact geometry which is used to guide the assembly operation. We present a fast algorithm to identify assembly process states considering static friction under uniform gravity. This identification of assembly process states enables a robot to select and modify its motion strategies adequately according to the state. We give a symbolic representation of contact states and analyze the static properties of assemblies at each contact state by using the theory of polyhedral convex cones.
Heiko Mosemann, A. Raue, Friedrich M. Wahl
ICRA2
1998 Classification and recognition of contact states for force guided assembly
abstract
The execution of generated assembly plans by robots is one of the key technologies of modern and flexible manufacturing. During the execution of assembly sequences the robot comes into contact with environment. Since there are positional and geometrical uncertainties from object representation, robot motion, and sensory information, compliance is used typically to prevent excessive contact forces. These contact forces provide information about the contact geometry which is used to guide the assembly operation. In this paper we present an algorithm to classify and recognize contact states between subassemblies. We analyze the local depart space (LDS) given by the assembly planning system for the calculation, classification, and recognition of the contact states. The LDS describes the direction of motion for the separation of subassemblies involved in the assembly sequence. We calculate valid configurations of the active subassembly in an uncertainty region and use the theory of polyhedral convex cones for the recognition of contact states. Therefore, force-torque sensor information acquired in the assembly process is interpreted using state classifiers which are formulated by polyhedral convex cones.
Heiko Mosemann, A. Raue, Friedrich M. Wahl
SMC2