Uniform coverage of automotive surface patches

被引:140
作者
Atkar, PN [1 ]
Greenfield, A [1 ]
Conner, DC [1 ]
Choset, H [1 ]
Rizzi, AA [1 ]
机构
[1] Carnegie Mellon Univ, Pittsburgh, PA 15213 USA
关键词
uniform coverage; trajectory planning; spray painting; surface deposition;
D O I
10.1177/0278364905059058
中图分类号
TP24 [机器人技术];
学科分类号
080202 [机械电子工程]; 1405 [智能科学与技术];
摘要
In spray painting applicatious, it is essential to generate a spray gull trajectory such that the entire stuface is completely covered and receives an acceptably uniform layer of paint deposition; we call this the "uniform coverage" problem. The uniform coverage problem is challenging because the atomizer emits a non-trivial paint distribution, thus making the relationships between the spray gull trajectory and the deposition uniformity complex. To understand the key is- sues involved in uniform coverage, we consider surface patches that are geodesically convex and topologically simple as representative of subsets of realistic automotive surfaces. hi addition to ensuring uniform paint deposition oil the surface, our goal is to also minimize the associated process cycle time and paint waste. Based oil the relationships between the spray gull trajectory and the output characteristics (i.e., uniformity, cycle time and paint waste), our approach decomposes the coverage trajectory generation problem into three subproblems: (1) selecting a seed curve, (2) determining a speed profile along each pass, and (3) selecting the spacing between successive passes. Using concepts such as area magnification and the Gauss-Bonnet theorem from differential geometry, as well as standard optimization procedures, we present procedures to solve each subproblem independently from the others. We demonstrate our trajectory planning procedures by approximating real automotive surfaces by simple surfaces in simulation, and finally evaluate the effectiveness of our algorithms experimentally oil real automotive surfaces.
引用
收藏
页码:883 / 898
页数:16
相关论文
共 20 条
[1]
Arikan MAS, 2000, J ROBOTIC SYST, V17, P479, DOI 10.1002/1097-4563(200009)17:9<479::AID-ROB3>3.0.CO
[2]
2-L
[3]
Asakawa N, 1997, IEEE INT CONF ROBOT, P1875, DOI 10.1109/ROBOT.1997.619061
[4]
ATKAR PN, 2005, P IEEE INT C ROB AUT
[5]
Chen H, 2003, IEEE INT CONF ROBOT, P3984
[6]
Chen HP, 2002, 2002 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS I-IV, PROCEEDINGS, P450, DOI 10.1109/ROBOT.2002.1013401
[7]
CONNER DC, 2002, CMURITR0208
[8]
CONNER DC, 2004, UNPUB IEEE T AUTOMAT
[9]
FREUND E, 1998, P 24 ANN C IEEE IND, V1, P208
[10]
Haung WH, 2001, IEEE INT CONF ROBOT, P27, DOI 10.1109/ROBOT.2001.932525