A labeling algorithm for the navigation of automated guided vehicles

Journal of Manufacturing Science and Engineering, Transactions of the ASME

Volumn 115, Issue 3, 1993, Pages 315-321

  Huang, J ^a   Palekar, U S ^a   Kapoor, S G ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85024553928     PISSN: 10871357     EISSN: 15288935     Source Type: Journal    
DOI: 10.1115/1.2901666     Document Type: Article

References (25)

1. Baker, E. K., 1983, “An Exact Algorithm for the Time-Constrained Traveling Salesman Problem,” Operations Research, Vol. 31, No. 5, pp. 938-945.
2. Baker, E. K., and Schaffer, J. R., 1986, “Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints,” American Journal of Mathematical and Management Sciences, Vol. 6, Nos. 3-4, pp. 261-300.
3. Canny, J., 1986, “Collision Detection for Moving Polyhedra,” IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMl-8:2, pp. 200-209, March.
4. Crowley, J. L., 1985, “Navigation for an Intelligent Mobile Robot,” IEEE Journal of Robotics and Automation, RA-1, No. 1, pp. 31-41, March.
5. Denton, R. V., and Froeberg, P. L., 1984, “Applications of Artificial Intelligence in Automated Route Planning,” SPIE V. 485, Applications of Artificial Intelligence, pp. 126-132, 1984.
6. Desrochers, M., and Soumis, F., 1985, “A Generalized Permanent Labeling Algorithm for the Shortest Path Problem with Time Windows,” Pub. No. 394, Centre de recherche sur les transports, Université de Montreal, Canada, 27 pages.
7. Desrochers, M., 1988, “An Algorithm for the Shortest Path Problem with Resource Constraints,” G-88-27, ISSN 0711-2440, GERAD, Ecole des H.E.C., Canada, 32 pages.
8. Desrosiers, M., Sauve, M., and Soumis, F., 1985, “Shortest Path with Time Windows Problem,” Pub. No. 389, Centre de reserche sur les transports, Canada, 11 pages.
9. Gilbert, E. G., and Johnson, D. W., 1985, “Distance Functions and Their Application to Robot Path Planning in the Presence of Obstacles,” IEEE Journal of Robotics and Automation, RA-1, No. 1, pp. 21-30, March.
10. Gilmore, J. F., Semeco, A. C., and Eamsherangkoon, P., 1984, “A Heuristic Route Planner for Autonomous Robots,” SPIE V. 521, Intelligent Robots and Computer Vision, pp. 160-169.
11. Gilmore, J. F., Semeco, A. C., and Eamsherangkoon, P., 1985, “Knowledge-Based Route Planning Through Natural Terrain,” SPIE V. 548, Applications of Artificial Intelligence, II, pp. 128-136.
12. Huang, J., and Palekar, U. S., 1989, “Shortest Path Problems with Multiple Time Windows on Arcs and Nodes,” working paper, Department of Mechanical and Industrial Engineering, University of Illinois at Urbana-Champaign.
13. Jaw, J. J., Odoni, A. R., Psaraftis, H. N., and Wilson, N. H. M., 1986, “A Heuristic Algorithm for the Multi-Vehicle Advance Request Dial-a-Ride Problem with Time Windows,” Transportation Research B, 20B:3, pp. 243-257.
14. Kolen, A. W. J., Rinnooy Kan, A. H. G., Trienekens, H. W. J. M., 1987, “Vehicle Routing with Time Windows,” Operations Research, Vol. 35, No. 2, pp. 266-273.
15. Kreifeldt, J. G., 1984, “Collision Avoidance in Robotic Environments,” Proceedings of the 1984 National Topical Meeting on Robotics and Remote Handling in Hostile Environments, pp. 341-354.
16. Lozano-Pérez, T., 1981, “Automatic Planning of Manipulator Transfer Movements,” IEEE Transactions on System, Man, and Cybernetics, SMC-11:10, pp. 681-698, Aug.
17. Menon, S. R., Kapoor, S. G., and Blackmon, R. B., 1988, “Navigation Planning for Mobile Robotic Devices in Modular Warehouses,” The International Journal of Advanced Manufacturing Technology, Vol. 3, No. 4, pp. 4762.
18. Müller, D. T., 1983, Automated Guided Vehicles, IFS Ltd., Bedford, UK.
19. Psaraftis, H. N., 1983, “An Exact Algorithm for the Single Vehicle Many-to-Many Dial-a-Ride Problem with Time Windows,” Transportation Science, Vol. 17, No. 3, pp. 351-357.
20. Savelsbergh, M. W. P., 1985, “Local Search in Routing Problems with Time Windows,” Annals of Operations Research, Vol. 4, pp. 285-305.
21. Sexton, T., and Bodin, L. D., 1985, “Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times I: Scheduling,” Transportation Science, Vol. 19, No. 4, pp. 378-410.
22. Sexton, T., and Bodin, L. D., 1985, “Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times II: Routing,” Transportation Science, Vol. 19, No. 4, pp. 411-435.
23. Solomon, M. M., 1987, “Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints,” Operations Research, Vol. 35, No. 2, pp. 254-265.
24. Tarjan, R. E., 1983, Data Structures and Network Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, Pennsylvania.
25. Wong, E. K., and Fu, K. S., 1985, “A Hierachical-Orthogonal Space Approach to Collision-Free Path Planning,” IEEE Conference on Robotics and Automation, pp. 506-511.