0
TECHNICAL PAPERS

Robot Path Planning for Dimensional Measurement in Automotive Manufacturing

[+] Author and Article Information
Weihua Sheng

Electrical and Computer Engineering Department, Kettering University, Flint, MI, 48504e-mail: wsheng@kettering.edu

Ning Xi

Electrical and Computer Engineering Department, Michigan State University, East Lansing, MI 48824

Mumin Song, Yifan Chen

Scientific Research Labs, Ford Motor Company, Dearborn, MI 48121

J. Manuf. Sci. Eng 127(2), 420-428 (Apr 25, 2005) (9 pages) doi:10.1115/1.1870013 History: Received May 22, 2003; Revised August 31, 2004; Online April 25, 2005
Copyright © 2005 by ASME
Your Session has timed out. Please sign back in to continue.

References

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.
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.
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.
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.
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.
The VRML Consortium Incorporated, The Virtual Reality Modeling Language, 1997.
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.
Lawler, E. L., Lenstra, J. K., Kan, A. H. G. R., and Shmoys, D. B., 1985, The Traveling Salesman Problem, Wiley, Chichester.
Edmonds,  J., 1965, “Paths, Trees, and Flowers,” Can. J. Math., 17, pp. 449–467.
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.
Bellman,  R. E., 1962, “Dynamic Programming Treatment of the Traveling Salesman Problem,” J. Assoc. Comput. Mach., 9, pp. 61–63.
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.
Kruskal,  J. B., 1956, “On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem,” Proc. Am. Math. Soc., 7, pp. 48–50.
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.
Lin,  S., and Kernighan,  B. W., 1999, “An Effective Heuristic Algorithm for the Traveling Salesman Problem,” Oper. Res., 21, pp. 498–516.
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.
Hoogeveen,  J. A., 1991, “Analysis of Christofides’ Heuristic: Some Paths are More Difficult than Cycles,” Oper. Res. Lett., 10(5), pp. 291–295.
Chisman,  J. A., 1975, “The Clustered Traveling Salesman Problem,” Comput. Oper. Res., 2, pp. 115–119.
Lokin,  F. C. J., 1978, “Procedures for Traveling Salesman Problems With Additional Constraints,” Eur. J. Oper. Res., 3(2), pp. 135–141.
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.
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.
Jain, A. K., 1988, Algorithms for Clustering Data, Prentice Hall, New Jersey.
Skiena, S. S., 1998, The Algorithm Design Manual, Springer-Verlag, Rensselaer, NY.

Figures

Grahic Jump Location
The testing 2D points for TLT and OLT algorithm
Grahic Jump Location
The final path from the TLT algorithm
Grahic Jump Location
The final path from the OLT algorithm
Grahic Jump Location
The suboptimal path generated by the TLT algorithm
Grahic Jump Location
The suboptimal path generated by the OLT algorithm
Grahic Jump Location
The relation between the shortest Hamiltonian circle and the shortest extended intragroup Hamiltonian path
Grahic Jump Location
Find the intragroup Hamiltonian paths
Grahic Jump Location
Distances between groups and the group graph
Grahic Jump Location
Construct a two-end Hamiltonian Path from a SFHP
Grahic Jump Location
Estimate the penalty of Guttmann’s algorithms
Grahic Jump Location
Camera planning system for automated part dimensional inspection

Tables

Errata

Discussions

Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In