2017 22nd IEEE International Conference on Emerging Technologies and Factory Automation (ETFA) 2017
DOI: 10.1109/etfa.2017.8247616
|View full text |Cite
|
Sign up to set email alerts
|

Cartesian path planning for arc welding robots: Evaluation of the descartes algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
11
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 17 publications
(11 citation statements)
references
References 5 publications
0
11
0
Order By: Relevance
“…2 Note that this procedure is different than that described in Section 1 which pertains to a 3D situation.…”
Section: General Procedures and Concept Of Experimentsmentioning
confidence: 98%
See 2 more Smart Citations
“…2 Note that this procedure is different than that described in Section 1 which pertains to a 3D situation.…”
Section: General Procedures and Concept Of Experimentsmentioning
confidence: 98%
“…Therefore, the correction to a target location was estimated by linearly interpolating the fiducial corrections of the eight fiducials closest to the target. 2 The measured target locations (i.e., raw measured locations in robot frame) were only used to determine the registration error, TRE.…”
Section: General Procedures and Concept Of Experimentsmentioning
confidence: 99%
See 1 more Smart Citation
“…In many robotic assembly applications, the robot's end effector is required to move linearly, where the end effector's tip must follow designated path points. However, its orientation may still have some degrees of freedom [6]. In the case of spatial extrusion, the tip of the printing nozzle needs to traverse the points on the linear path formed by the element but has freedom in choosing the end effector's orientations.…”
Section: Semi-constrained Cartesian Planningmentioning
confidence: 99%
“…Existing work addresses semi-constrained Cartesian planning problem using an approach that discretizes the end effector's candidate poses and kinematic solutions and performs a discrete search on a planning graph [6] [56]. This algorithm starts with a list of given end effector poses for the robot to traverse and each end effector pose is assigned with parameters with tolerance ranges.…”
Section: Semi-constrained Cartesian Planningmentioning
confidence: 99%