This paper addresses the robot path planning problem in our effort to develop a fully automated dimensional measurement system using an eye-in-hand robotic manipulator. First, the CAD-based vision sensor planning system developed in our lab is briefly introduced; it uses both the CAD model and the camera model to plan camera viewpoints. The planning system employs a decomposition-based approach to generate camera viewpoints that satisfy given task constraints. Second, to improve the efficiency of the eye-in-hand robot inspection system, robot path planning is studied, which is the focus of this paper. This problem is rendered as a Traveling Salesman Problem (TSP). A new hierarchical approach is developed to solve the TSP into its suboptimality. Instead of solving a large size TSP, this approach utilizes the clustering nature of the viewpoints and converts the TSP into a clustered Traveling Salesman Problem (CTSP). A new algorithm, which favors the intergroup paths, is proposed to solve the CTSP quickly. Performance of the new algorithm is analyzed. It is shown that instead of a fixed performance ratio as reported in some existing work, a constant bound can be achieved which is related to the diameter of the clusters. Experimental results demonstrate the effectiveness of the robot motion planning system. The proposed path planning approach can obtain sub-optimal solutions quickly for many large scale TSPs, which are common problems in many robotic applications.

1.
Spitz, S. N., and Requicha, A. A. G., 1999, “Hierchical Constraint Satisfaction for High-Level Dimensional Inspection Planning,” Proc. of 1999 IEEE Int. Symp. on Assembly and Task Planning, IEEE, New York, pp. 374–380.
2.
Lee
,
K. H.
, and
Park
,
H. P.
,
2000
, “
Automated Inspection Planning of Free-Form Shape Parts by Laser Scanning
,”
Rob. Comput.-Integr. Manufact.
,
6
(
4
), pp.
201
210
.
3.
Hu
,
G.
, and
Stockman
,
G.
,
1989
, “
3-D Surface Solution Using Structured Light and Constraint Propagation
,”
IEEE Trans. Pattern Anal. Mach. Intell.
,
11
(
4
), pp.
390
402
.
4.
Sheng, W., Xi, N., Song, M., Chen, Y., and Rankin, III, J. S., 2000, “Automated Cad-Guided Automobile Part Dimensional Inspection,” in Proc. of 2000 Int. Conf. on Robotics and Automation, Vol. 2, pp. 1157–1162.
5.
Sheng
,
W.
,
Xi
,
N.
,
Song
,
M.
, and
Chen
,
Y.
,
2003
, “
Cad-Guided Sensor Planning for Dimensional Inspection in Automotive Manufacturing
,”
IEEE/ASME Trans. Mechatron.
,
8
(
3
),
372
380
.
6.
The VRML Consortium Incorporated, The Virtual Reality Modeling Language, 1997.
7.
Edan
,
Y.
,
Flash
,
T.
,
Peiper
,
U. M.
,
Shmulevich
,
I.
, and
Sarig
,
Y.
,
1991
, “
Near-Minimum-Time Task Planning for Fruit-Picking Robots
,”
IEEE Trans. Rob. Autom.
,
7
(
1
), pp.
48
56
.
8.
Lawler, E. L., Lenstra, J. K., Kan, A. H. G. R., and Shmoys, D. B., 1985, The Traveling Salesman Problem, Wiley, Chichester.
9.
Edmonds
,
J.
,
1965
, “
Paths, Trees, and Flowers
,”
Can. J. Math.
,
17
, pp.
449
467
.
10.
Dantzig
,
G. B.
,
Fulkerson
,
D. R.
, and
Johnson
,
S. M.
,
1954
, “
On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem
,”
Oper. Res.
,
7
, pp.
58
66
.
11.
Bellman
,
R. E.
,
1962
, “
Dynamic Programming Treatment of the Traveling Salesman Problem
,”
J. Assoc. Comput. Mach.
,
9
, pp.
61
63
.
12.
Rosenkrantz
,
D. J.
,
Stearns
,
R. E.
, and
Lewis
,
P. M.
,
1977
, “
An Analysis of Several Heuristics for the Traveling Salesman Problem
,”
SIAM J. Comput.
,
6
, pp.
563
581
.
13.
Kruskal
, Jr.,
J. B.
,
1956
, “
On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem
,”
Proc. Am. Math. Soc.
,
7
, pp.
48
50
.
14.
Christofides, N., 1976, “Worst-Case Analysis of a New Heuristic for the Traveling Salesman Problem,” Tech. Rep. 338, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh.
15.
Lin
,
S.
, and
Kernighan
,
B. W.
,
1999
, “
An Effective Heuristic Algorithm for the Traveling Salesman Problem
,”
Oper. Res.
,
21
, pp.
498
516
.
16.
Guttmann-Beck
,
N.
,
Hassin
,
R.
,
Khuller
,
S.
, and
Raghavachari
,
B.
,
2000
, “
Approximation Algorihthms With Bounded Performance Guarantees for the Clustered Traveling Salesman Problem
,”
Algorithmica
,
28
, pp.
422
437
.
17.
Hoogeveen
,
J. A.
,
1991
, “
Analysis of Christofides’ Heuristic: Some Paths are More Difficult than Cycles
,”
Oper. Res. Lett.
,
10
(
5
), pp.
291
295
.
18.
Chisman
,
J. A.
,
1975
, “
The Clustered Traveling Salesman Problem
,”
Comput. Oper. Res.
,
2
, pp.
115
119
.
19.
Lokin
,
F. C. J.
,
1978
, “
Procedures for Traveling Salesman Problems With Additional Constraints
,”
Eur. J. Oper. Res.
,
3
(
2
), pp.
135
141
.
20.
Laporte
,
G.
,
Potvin
,
J. Y.
, and
Quilleret
,
F.
,
1996
, “
A Tabu Search Heuristic Using Genetic Diversification for the Clustered Traveling Salesman Problem
,”
J. Heuristics
,
2
(
2
), pp.
187
200
.
21.
Gendreau, M., Laporte, G., and Potvin, J. Y., “Heusitics for the Clustered Traveling Salesman Problem,” Tech. Rep., Center de recherche sur les transports, Universite de Montreal, 1994.
22.
Jain, A. K., 1988, Algorithms for Clustering Data, Prentice Hall, New Jersey.
23.
Skiena, S. S., 1998, The Algorithm Design Manual, Springer-Verlag, Rensselaer, NY.
You do not currently have access to this content.