2014 IEEE/RSJ International Conference on Intelligent Robots and Systems 2014
DOI: 10.1109/iros.2014.6943200
|View full text |Cite
|
Sign up to set email alerts
|

Improving the sequence of robotic tasks with freedom of execution

Abstract: An industrial robot's workflow typically consists of a set of tasks that have to be repeated multiple times. A task could be, for example, welding a seam or cutting a hole. The efficiency with which the robot performs the sequence of tasks is an important factor in most production domains. In most practical scenarios, the majority of tasks have a certain freedom of execution. For example, closed-contour welding task can often be started and finished at any point of the curve. In this paper we propose a method … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 10 publications
(3 citation statements)
references
References 20 publications
(24 reference statements)
0
3
0
Order By: Relevance
“…T Lee and Kwon [57] G A P , A Elbassioni et al [58] Approx. T Gentilini et al [59] MINLP T Alatartsev et al [60] H A Alatartsev et al [61] H A Alatartsev and Ortmeier [62] H A Vicencio et al [63] GA A, GTSPN the paper takes common cut constraints into account directly or indirectly. Arkin and Hassin [9] introduce the TSP-N (although they call it the Geometric Covering Salesman Problem) and present several approximation algorithms for simple cases.…”
Section: Ccp Arkin and Hassin [9]mentioning
confidence: 99%
See 1 more Smart Citation
“…T Lee and Kwon [57] G A P , A Elbassioni et al [58] Approx. T Gentilini et al [59] MINLP T Alatartsev et al [60] H A Alatartsev et al [61] H A Alatartsev and Ortmeier [62] H A Vicencio et al [63] GA A, GTSPN the paper takes common cut constraints into account directly or indirectly. Arkin and Hassin [9] introduce the TSP-N (although they call it the Geometric Covering Salesman Problem) and present several approximation algorithms for simple cases.…”
Section: Ccp Arkin and Hassin [9]mentioning
confidence: 99%
“…However, as in [60], only ellipsoid areas are considered. Alatartsev and Ortmeier [62] then apply this approach to an actual case where additional postoptimization occurs once the task sequence is known in order to adapt the path to a robot path.…”
Section: Ccp Arkin and Hassin [9]mentioning
confidence: 99%
“…The end-effector orientation and position freedom, as well as the robot configuration, greatly influences the cost of supporting movement [14]. The design and implementation of a platform for rapid external sensor integration into an industrial robot control system was presented [1].…”
Section: Introductionmentioning
confidence: 99%