Proceedings. 1985 IEEE International Conference on Robotics and Automation
DOI: 10.1109/robot.1985.1087274
|View full text |Cite
|
Sign up to set email alerts
|

Opportunistic scheduling for robotic assembly

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
18
0

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 66 publications
(21 citation statements)
references
References 8 publications
0
18
0
Order By: Relevance
“…The reactive component is allowed to modify action ordering or introduce minor deviations. A similar approach has been used by (Fox and Kempf, 1985) for robot assembly tasks and by (Fraichard and Laugier, 1991) for robot motion planning. What distinguishes our approach from those systems is its capability to control the quality of planning on-line in order to respond to resource constraints.…”
Section: Sensing and Planning As Information Sourcesmentioning
confidence: 99%
“…The reactive component is allowed to modify action ordering or introduce minor deviations. A similar approach has been used by (Fox and Kempf, 1985) for robot assembly tasks and by (Fraichard and Laugier, 1991) for robot motion planning. What distinguishes our approach from those systems is its capability to control the quality of planning on-line in order to respond to resource constraints.…”
Section: Sensing and Planning As Information Sourcesmentioning
confidence: 99%
“…As a result, more concise representations are being investigated. Two of the earlier attempts to obtain more compact representations, proposed by Ko and Lee [4] and by Fox and Kempf [9], use a precedence graph to represent the relationship between the various mating tasks. This type of representation, however, does not directly describe all the possible assembly sequences, since the order in which mating tasks can be taken from two parallel precedence paths is not made explicit.…”
Section: Representation Of Assembly Sequencesmentioning
confidence: 99%
“…One early attempt was the use of a set of tasks and a set of precedence constraints relating two tasks [15]. But as discussed elsewhere [17], there are products for which standard precedence constraints cannot encompass all sequences.…”
Section: Representation Of Assembly Sequencesmentioning
confidence: 99%