Optimum path planning using convex hull and local search heuristic algorithms

Mechatronics

Volumn 7, Issue 8, 1997, Pages 737-756

  Meeran, S ^a   Shafie, A ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; MOBILE ROBOTS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; ROBOTICS;

CONVEX HULL; MECHATRONIC SYSTEMS; TRAVELING SALESMAN PROBLEM;

MOTION PLANNING;

EID: 0031371659     PISSN: 09574158     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0957-4158(97)00033-0     Document Type: Article

References (54)

1. Bazaryan-lawi, M. and Kaerornich, H., An approach to the machine layout problem in cellular manufacturing environment. Production Planning and Control, 1997, 8(1), 41-55.
2. Jiang, K., Semartiviratire, L. D. and Earles, S. W. E., Motion planning with reversal manoeuvres for a non-hologenic contained robot. Journal of Engineering Manufacture, Proceeding Part B, 1996, 210, 487-497.
3. Schweitzer, G., Mechatronics, basics, objective and examples. Journal of Systems and Control Engineering, Proceeding Part 1, 1996, 210(1), 1-11.
4. Tucker, P. G. and Hewit, J. R., CFD techniques and their relevance to mechatronics. Mechatronic, 1996, 6(2), 193-207.
5. Milne, J. S., An integrative approach. Manufacturing Engineer, 1995, 3, 159-162.
6. Rzevski, G., Mechatronics: Designing Intelligent Machines Vol 1: Perception, Cognition and Execution. Butterworth Heinnemann, 1995.
7. Groover, M. P., Automation, Production Systems and Computer Integrated Manufacturing. Prentice-Hall International, 1997.
8. Hsiea, L. F. and Sha, D. Y., A designing process for tandem automated guided vehicle system: the concurrent design of machine layout and guided vehicle routes in tandem guided vehicle system. Integrated Manufacturing Systems, 1996, 7(6), 30-38.
9. Tachoco, J. M. A. and Siriech, O. S. L., Optimal single loop guide path for AGVS. International Journal of Production Research, 1992, 30(3), 6965-6981.
10. Maxwell, W. L. and Muchstadt, J. A., Designed of automated guided vehicle system. IIE Transactions, 1982, 1(3), 114-124.
11. Cha, Y. Y. and Gweon, D. G., Local path planning of a free ranging mobile robot using directional weighting method. Mechatronics, 1996, 6(1), 53-80.
12. Hague, T. and Tillet, N. W., Navigation and control of an autonomous horticultural robot. Mechatronics, 1996, 6(2), 165-180.
13. Goggos, V. and King, R. E., Stochasting predictive control of mechatronic system. Mechatronics, 1997, 7(2), 129-140.
14. Park, J. S., Motion profile planning of repetitive point-to-point control for maximum energy conversion efficiency under accelerated condition. Mechatronics, 1996, 6(6), 649-663.
15. Yeong, W. H. and Moore, P. R., Object oriented modelling and control of flexible conveyor system for automated assembly. Mechatronics, 1996, 6(7), 799-815.
16. Wong, C., Layout designs for robotics PCB assembly. Integrated Manufacturing System, 1996, 7(4), 39-52.
17. Egbelu, P. J., Wu, C. T. and Pilgaonkar, R., Robotics assembly of printed circuit board with component feeder location consideration. Production Planning and Control, 1996, 7(2), 162-175.
18. Deineko, V. G. and Woeginger, J. G., The convex hull-k-line-line. Travelling Salesman Problem. Information Processing Letters, 1996, 59, 295-301.
19. Ferreira, J. C. E. and Hinduja, S., Convex hull-based feature recognition method for 2.5D components. Computer Aided Design, 1990, 25(1), 41-48.
20. Kim, Y. S., Recognition of form features using convex decomposition. Computer Aided Design, 1992, 24(9), 461-476.
21. Stroud, K. A., Further Engineering Mathematics. The Macmillan Press Ltd, 1970.
22. Flood, M. M., The travelling-salesman problem. Operation Research, 1956, 4, 61-75.
23. Graham, R. L., An efficient algorithm for determining the convex hull of a finite planar set. Information Processing Letters, 1972, 1, 132-133.
24. Hoffman, A. and Wolfe, P., History, Manuscript, IBM Thomas J. Watson Research Centre, 1985.
25. Dantzig, G. B., Fulkerson, D. R. and Johnson, S. M., On a linear programming approach to the Travelling Salesman Problem. Operation Research, 1957, 7, 58-66.
26. Dakin, R., Dakin Branch and Bound TSP Algorithm. Internet, Dakin@pcug.org.au, 1995.
27. Clarke, G. and Wright, J. W., Scheduling of vehicles from a central depot to a number of delivery points. Operation Research, 1964, 12, 568-581.
28. O'Rourke, J., Computational Geometry in C. Cambridge Press 1994.
29. Bentley, J. J., Fast algorithm for geometric Traveling Salesman Problem, ORSA Journal on Computing, 1992, 4, 387-411.
30. Zachariach, M., Tabu Search on the Geometric Traveling Salesman Problem, Technical Report, University of Copenhagen, 1990.
31. Lin, S. and Kernighan, B. W., An effective heuristic algorithm for the Travelling Salesman Problem. Operation Research, 1973, 21, 000-000.
32. Thiel, S. U., Simulated Annealing. University of Wales, Cardiff. Internet, 1994.
33. Holland, J. H., Adaptation in Natural and Artificial Systems, University of Michigan Press, 1975.
34. Amin, S., A self-organised Travelling Salesman Problem. Neural Computing and Applications, 1994, 2, 129-183.
35. Hopfield, J. J., Neural networks and physical system with emergent collective computational abilities. Proceedings of the National Academy of Science, USA, 1982.
36. Muller, B. and Reindhart, J., Neural Networks An Introduction, Springer-Verlag, 1991.
37. Durbin, R. and Willshaw, An analogue approach to the Travelling Salesman Problem using an elastic net. Nature, 1987, 326, 689-691.
38. Johnson, D. S. and Mcleoch, L. A., The Travelling Salesman Problem, Technical Report, AT&T Bell Laboratories, 1995.
39. Rosenkrantz, D. J., Stearns, R. E. and Lewis P. M., An analysis of several heuristics for Travelling Salesman Problem. SIAM Journal of Computing, 1977, 6, 563-581.
40. Stewart, Jr. W. R., A computationally efficient heuristic for the Travelling Salesman Problem. Proceedings of the 13th Annual Meeting of S.E.TIMS, 1977, pp. 75-85.
41. Norback, J. P. and Love, R. G., Geometric approaches to solving the Travelling Salesman Problem. Management Science, 1977, 23, 1208-1223.
42. Or, I., Travelling Salesman-Type combinatorial problems and their relation to the logistic of regional blood banking, Ph.D. thesis, Northwestern University, Evanstone, 1976.
43. Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G. and Shmoys, D. B., Travelling Salesman Problem. Wiley, 1985.
44. Backer, A., Steckheretz, B. and Wottuwa, M., An Efficient Parallel-Cluster-Heuristic For Longer Traveling Salesman Problem. Report No 94-1504, Zentrum Fur Paralles Rechem Publications, 1994.
45. Karp, R. M., Probabilistic analysis of partitioning algorithm for the TSP in the plane. Mathematics of Operation Research, 1977, 2, 209-224.
46. Al-Mulham, M. and Al-Maghribi, T., An Efficient Algorithm to Solve the E-TSP. King Fahd University of Petroleum and Minerals, 1997.
47. Leeuwen, J. V. and Schoone, A. A., Untangling a travelling salesman tour in a plane. Theoretical Computing Science, 1985 to appear.
48. Papadimitriou, C. H. and Steighlitz, K., Combinatorial Optimisation Algorithms and Complexity. Prentice-Hall, 1982.
49. Chen, J. Computational Geometry: Methods and Application. Lecture Notes, Comp. Science Dept., Texas A&M University, 1996.
50. Gabow, H. N. and Tarjan, R. E., Faster scaling algorithm for general graph matching problems. Journal of the Association of Computer Machining, 1991, 38, 815-853.
51. Ong, H. L. and Moore, J. B., Worst case analysis of few TSP heuristics. Operation Research Letters, 1984, 2, 273-277.
52. Lueker, G., Theory of Computation. Manuscript, Princeton University, 1976.
53. Knox, J., Tabu search performance on the symmetric TSP. Computers and Operation Research, 1994, 21, 867-876.
54. Wilson, G. V. and Parley, G. S., On the stability of the TSP algorithm of Hopfield and Tank. Biological Cybernetics, 1988, 58, 63-70.