Fast Motion Planning by Parallel Processing - A Review

Journal of Intelligent and Robotic Systems: Theory and Applications

Volumn 20, Issue 1, 1997, Pages 45-69

  Henrich, Dominik ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

Autonomous systems; Motion planning; Parallel algorithms; Parallelism and concurrency; Review; Robotics

Indexed keywords

COMPUTATIONAL METHODS; CONCURRENCY CONTROL; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; ROBOTICS;

PLANNING ALGORITHMS;

MOTION PLANNING;

EID: 0031236308     PISSN: 09210296     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1007948727999     Document Type: Review

References (71)

1. Aggarwahl, A., et al.: 1988, Parallel computational geometry, in: Algorithmica, Vol 3, pp. 293-327. Keywords: survey.
2. Ahuactzin, J. M., Talbi, E.-G., Bessiere, P., and Mazer, E.: 1991, Using genetic algorithms for robot motion planning, in: Geometric reasoning for Perception and Action. Workshop, 16-17 Sept., 1991, pp. 84-93. Keywords: mobile robots; manipulators; cell decomposition; genetic algorithms; MIMD computers; torus networks; scalable parallelism.
3. Ahuactzin, J. M., Talbi, E.-G., Bessiere, P., and Mazer E.: 1992, Using genetic algorithms for robot motion planning, in: ECAI 92, 10th European Conference on Artificial Intelligence Proceedings, 3-7 Aug., 1992, pp. 671-675. Keywords: mobile robots; manipulators; cell decomposition; genetic algorithms; MIMD computers; torus networks; scalable parallelism.
4. Atallah, M. J. and Zehn D. Z.: 1989, An optimal parallel algorithm for the visibility of a simple polygon from a point, in: Annual Symposium on Computational Geometry, ACM, pp. 114-122. Keywords: skeleton; shared memory systems.
5. Bajaj, C.: 1986, An efficient parallel solution for Euclidean shortest path in three dimensions, in: Proc. 1986 IEEE Int. Conf. on Robotics and Automation, pp. 1897-1900. Keywords: path optimization; shared memory.
6. Barraquand, J. and Latombe J.-C.: 1989, Robot motion planning: A distributed representation approach, Technical Report, STAN-CS-89-1257, Leland Stanford Junior University, Department of Computer Science. Keywords: manipulators; multirobot environments; potential field; skeleton; graph search; SIMD computers; hypercube networks; scalable parallelism.
7. Barraquand, J. and Latombe J.-C.: 1991, Robot motion planning: A distributed representation approach, Int. J. Robotics Research 10(6), 628-649. Keywords: potential field; skeleton; graph search; no parallel implementation; scalable parallelism.
8. Bessière P., et al.: 1994, The Adriane's clew algorithm, in: K. Goldberg and A. K. Pefers (eds), Algorithmic Foundation of Robotics. Keywords: mobile robots; manipulators; cell decomposition; genetic algorithms; MIMD computers; torus networks; scalable parallelism.
9. Betts, J. T. and Huffman, W. P.: 1991, Trajectory optimization on a parallel processor, Guidance, Control, and Dynamics 14(2). Keywords: mobile robots; path optimization; static task scheduling; shared memory systems; specialist parallelism.
10. Cela, A., Hamam, Y., and Georges D.: 1991, Decomposition method for the constrained path planning of articulated systems, in: 91 ICAR. Fifth Int. Conf. on Advanced Robotics. Robots in Unstructured Environments, Pisa, Italy, pp. 994-999. Keywords: manipulators; mathematical programming; static task scheduling, no parallel implementation; specialist parallelism.
11. Challou, D. J., Gini M., and Kumar V.: 1994, Towards real-time motion planning, in: H. Kitano et al. (eds), Parallel Processing for Artificial Intelligence, 2, Elsevier. Keywords: manipulators; potential field; skeleton; graph search; MIMD computers; hypercube networks.
12. Challou, D. J., Gini, M., and Kumar, V.: 1993, Parallel search algorithms for robot motion planning, in: IEEE Int. Conf. on Robotics and Automation, Atlanta, GA USA, 2-6 May, 1993, Vol 2, pp. 46-51. Keywords: manipulators; potential field; skeleton; graph search; MIMD computers; SIMD computers; bus networks; hupercube networks.
13. Challou, D. J., Boley, D., Gini, M., and Kumar V.: 1995, A parallel formulation of informed randomized search for robot motion planning problems, in: Proceedings IEEE Int. Conf. on Robotics and Automation Nagoya, Aichi, Japan, May 21-27, 1995 pp. 709-714. Keywords: manipulators; potential field; skeleton; graph search; MIMD computers; SIMD computers; bus networks; hypercube networks.
14. Chan K. K. and Zalzala, A. M. S.: 1993, Genetic-based minimum-time trajectory of articulated manipulators with torque constraints, in: IEEE Colloquium on 'Genetic Algorithms for Control Systems Engineering' London, UK, 28 May, 1993, pp. 4/1. Keywords: manipulators; path optimization; genetic algorithms; no parallel implementation; scalable parallelism.
15. Chung, C. H. and Lee K. S.: 1991a, Hopfield network application to optimal edge selection, in: 1991 IEEE Int. Joint Conf. on Neural Networks, Singapore, 18-21 Nov., 1991, pp. 1542-1547. Keywords: mobile robots; skeleton; genetic algorithms; neural nets; no parallel implementation; scalable parallelism.
16. Chung, C. H. and Lee, K. S.: 1991b, Neural network application to the obstacle avoidance path planning for CIM computer intergrated manufacturing, in: Proceedings IROS'91. IEEE/RSJ Int. Workshop on Intelligent Robots and Systems'91. Intelligence for Mechanical Systems, Osaka, Japan, 3-5 Nov., 1991, pp. 824-828. Keywords: mobile robots; skeleton; genetic algorithms; neural nets; no parallel implementation; scalable parallelism.
17. Davidor, Y.: 1990, Robot programming with a genetic algorithm, in: COMPEURO'90. Proceedings of the 1990 IEEE Int. Conf. on Computer Systems and Software Engineering, Tel-Aviv, Israel, 8-10 May, 1990, pp. 186-191. Keywords: manipulators; path optimization; genetic algorithms; no parallel implementation; scalable parallelism.
18. Decuyper, J. and Keymeulen D.: 1990, A reactive robot navigation system based on a fluid dynamics metaphor, in: H.-P. Schwelfel and R. Manner (eds), Parallel Problem Solving from Nature, 1st Workshop, PPSN, 1 Proceedings, 1-3 Oct., 1990, pp. 356-362. Keywords: mobile robots; potential field; cellular automata; SIMD computers; mesh networks; scalable parallelism.
19. Dehne, F., Hassenklover, A.-L., and Sack, J.-R.: 1989, Computing the configuration space for a robot on a mesh-of-processors, in: Parallel Computing, Vol. 12, pp. 221-231. Keywords: mobile robots; C-space computation; cellular automata; MIMD computers; mesh networks; scalable parallelism.
20. Dubash, R. M. and Bastani, F. B.: 1993, A hybrid architecture for mobile robots based on decentralized, parallel path planning, in: Proceedings ISADS 93. International Symposium on Autonomous Decentralized Systems, Kawasaki, Japan, 30 March-1 April, pp. 206-214. Keywords: multirobot environments; mobile robots; potential field; cellular automata; mesh networks; scalable parallelism.
21. Fink, B. and Wend, H.-D.: 1991, Collision-free motion-planning for robot-manipulators working in a changing environment, Automatisierungstechnik 39(6), 197-200. Keywords: manipulators; cell decompositionl; potential field; static task scheduling; MIMD computers; specialist parallelism.
22. Fossa, M., Grosso, E., Ferrari, F., Magrassi, M., Sandini, G., and Zapendouski, M.: 1992, A visually guided mobile robot acting in indoor environments, in: Proc. IEEE Workshop on Applications of Computer Vision, Palm Springs, CA, USA, 30 Nov.-2 Dec., 1992, pp. 180-308. Keywords: mobile robots; collision avoidance; MIMD computers; special purpose networks; specialist parallelism.
23. Gonzalez, J. S. and Jones, D. I.: 1991, An implementation on multiple transputers of a configuration space approach to robot obstacle avoidance, in: T. S. Durrani, et al. (eds), Applications of Transputers 3. Proceedings of the Third Int. Conf. on Applications of Transputers, IOS Press-Amsterdam, pp. 168-173. Keywords: manipulators, cell decomposition; processor farms; static task scheduling; MIMD computers; special purpose networks; scalable parallelism.
24. Gustafson, J. L.: 1988, Reevaluation Amdahl's law, Communications of the ACM 31(5), 532-533. Keywords: MIMD computers; SIMD computers.
25. Huse, S. M.: 1990, Path analysis using a predactor-prey neural network paradigm, in: Proc. of the 3rd Int. Conf. on Industrial and Engineering, pp. 1054-1062. Keywords: mobile robots: potential fields; neural networks; no parallel implementation; scalable parallelism.
26. Hwang, Y. K. and Ahuja N.: 1992, Gross motion planning - A survey, ACM Computing Surveys, 24(3). Keywords: survey.
27. Hyotyniemi, H.: 1990, Locally controlled optimization of spray painting robot trajectories, in: Intelligent Motion Control. Proceedings of the IEEE International Workshop, 20-22 Aug., 1990, Istambul, Vol. 1., pp. 283-287. Keywords: manipulators; path optimization; cellular automata; no parallel implementation; scalable parallelism.
28. Kalyayev, I. A.: 1993, Homogeneous neuronlike structures for optimization variational problem solving, in: A. Bode, M. Reeve, and G. Wolf (eds), PARLE'93, Parallel Architectures and Languages Europe. 5th Int. PARLE Conf. Proc., 14-17 June, 1993, Springer, Berlin, pp. 438-451. Keywords: mobile robots; cell decomposition; neural nets; special purpose hardware; mesh networks; scalable parallelism.
29. Kameyama, M., Amada, T., and Higuchi T.: 1991, Highly parallel collision detection VLSI processor for intelligent robots, in: 1991 Symposium on VLSI Circuits. Digest of Technical Papers, Oiso, Japan, 30 May-1 June, 1991, pp. 500-506. Keywords: manipulators; collision avoidance; processor farms; special purpose hardware; scalable parallelism.
30. Kameyama, M., Amada, T., and Higuchi, T.: 1992, Highly parallel collision detection processor for intelligent robots, IEEE Solid-State Circuits 21 (4), 500-506. Keywords: manipulators; collision avoidance; processor farms; special purpose hardware; scalable parallelism.
31. Kavraki, L.: 1993, Computation of configuration-space obstacles using the fast Fourier transform, in: Proc. IEEE Int. Conf. on Robotics and Automation, Atlanta, GA, USA, 2-6 May, 1993, pp. 255-261. Keywords: C-space computation; special purpose hardware; scalable parallelism.
32. Keymeulen, D. and Decuyper, J.: 1991, A flexible path generator for a mobile robot, in: 91 ICAR. Fifth Int. Conf. on Advanced Robotics. Robots in Unstructured Environments, Pisa, Italy, pp. 1069-1073. Keywords: mobile robots; potential field; cellular automata; SIMD computers; mesh networks; scalable parallelism.
33. Keymeulen, D. and Decuyper, J.: 1994, The fluid dynamics applied to mobile robot motion: The stream field method, in: IEEE Int. Conf. on Robotics and Automation, pp. 378-385. Keywords: mobile robots; potential field; cellular automata; SIMD computers; mesh networks; scalable parallelism.
34. Latombe, J. C.: 1991, Robot motion planning, Kluwer Academic Publishers. Keywords: survey, introduction.
35. Lemmon, M.: 1991, 2-Degree-of-freedom robot path planning using cooperative neural fields, Neural Computation 3(3), 350-362. Keywords: mobile robots; mathematical programming; neural nets; no parallel implementation; scalable parallelism.
36. Leung, C. H. and Zalzala, A. M. S.: 1994, A genetic solution for the motion of wheeled robotic systems in dynamic environments, in: Int. Conf. on Control'94, Coventry, UK, 21-24 March, 1994, pp. 760-764. Keywords: mobile robots; cell decomposition; genetic algorithms; no parallel implementations; scalable parallelism.
37. Lin, C.-S., and Wann, C.-D.: 1991, A parallel processing model for robot path planning on grid terrains, Int. J. Robotics & Automation 6(1), 1-11. Keywords: mobile robots; skeleton; neutral networks; special purpose hardware; mesh networks; scalable parallelism.
38. Lozano-Perez, T. and O'Donnell, P. A.: 1991, Parallel robot motion planning, in: IEEE Int. Conf. on Robotics and Automation, Sacramento, California, April, 1991, pp. 1000-1007. Keywords: manipulators; C-space computation; cellular automata; SIMD computers; scalable parallelism.
39. MacKenzie, P. D. and Stout, Q. F.: 1990, Asymptotically efficient hypercube algorithms for computational geometry, in: Third Symposium on the Fontiers of Massively Parallel Computation, College Park, MD., Oct. 1991, pp. 8-11. Keywords: skeleton; hypercube networks.
40. Marshall, G. F. and Tarassenko L.: 1993, Robot path planning using VLSI resistive grids, in: Third Int. Conf. on Artificial Neural Networks, Brighton, UK, 25-27 May, 1993, pp. 163-167. Keywords: mobile robots; potential fields; special purpose hardware; mesh networks; scalable parallelism.
41. Mazer, E., Ahuactzin, J. M., Talbi, E., and Bessiere, P.: 1993, Robot motion planning with the Ariadne's clew algorithm, in: F. C. A. Groen, S. Hirose, and C. E. Thorpe (eds), Intelligent Autonomous Systems. IAS-3. Proc. of the Int. Conf., Pittsburgh, PA, USA, 15-18 Feb., pp. 196-205. Keywords: mobile robots; cell decomposition; genetic algorithms; MIMD computers; torus networks; scalable parallelism.
42. Paige, R. C. and Kruskal, C. P.: 1985, Parallel algorithms for shortest path problems, in: IEEE, 14-20. Keywords: graph search; shared memory systems.
43. Pinchard, O., Liegeois, A., and Emmanuel, T.: 1995, A genetic algorithm for outdoor robot path planning, in: U. Rembold, (ed.), Intelligent Autonomous Systems (IAS-4), Karlsruhe, Germany, March 27-30, 1995, pp. 413-419. Keywords: mobile robots; skeleton; genetic algorithms; no parallel implementations; scalable parallelism.
44. Prasanna, V. K. and Rao, A. S.: 1992, Parallel algorithms for robotics - A survey, Computer Science and Informatics 22(1), 1-18. Keywords: survey.
45. Prassler, E.: 1989, Electrical networks and a connectionist approach to path-finding, in: Proc. of the Int. Conf. Connectionism in Perspective, Elsevier, Amsterdam. Keywords: mobile robots; potential field; cellular automata; no parallel implementation; mesh networks; scalable parallelism.
46. Prassler, E. and Milios, E.: 1990, Parallel path planning in unknown terrains, in: Proc. of the SPIE - The Int. Society for Optical Engineering, Vol. 1388, 1990, pp. 2-13. Keywords: mobile robots; potential field; cellular automata; no parallel implementation; mesh networks; scalable parallelism.
47. Prassler, E. and Milios, E.: 1994, Motion planning amongst arbitrarily moving unknown objects, in: Proc. of the IEEE/RSJ/GI Int. Conf. on Intelligent Robots and Systems IROS'94, Munich, Germany. Keywords: mobile robots; potential field; cellular automata; no parallel implementation; mesh networks; scalable parallelism.
48. Prassler, E.: 1995, Robot navigation: A simple guidance system for a complex changing world, in: H. Bunke et al. (eds), Environment Modeling and Motion planning for Autonomous Robotats, World Scientific (to appear). Keywords: mobile robots; potential field; cellular automata; no parallel implementation; mesh networks; scalable parallelism.
49. Qin, C. and Henrich, D.: 1996, Randomized parallel motion planning for robot manipulators, Technical Report 5/96, Computer Science Department, University Karlsruhe. Keywords: manipulators, cell decomposition; graph search; MIMD computers; bus networks; scalable parallelism.
50. Qin, C. and Henrich, D.: 1996, Path planning for industrial robot arms - A parallel randomized approach, in: Proceedings of the International Symposium on Intelligent Robotic Systems (SIRS'96), Lisbon, Portugal, July 22-26, 1996, pp. 65-72. Keywords: manipulators, cell decomposition; graph search; MIMD computers; bus networks; scalable parallelism.
51. Ranganathan, N., Parthasarathy, B., and Hughes, K.: 1994, A parallel algorithm and architecture for robot path planning, in: H. J. Siegal (ed.), Proc. Eighth Int. Parallel Processing Symposium, Cancun, Mexico, 26-29 April, pp. 275-279. Keywords: mobile robots; potential field; cellular automata; special purpose hardware; linear networks; scalable parallelism.
52. Reid, M. B.: 1993, Path planning using optically computed potential fields, in: Proc. IEEE Int. Conf. on Robotics and Automation, Atlanta, GA, USA, 2-6 May, 1993, pp. 295-300. Keywords: mobile robots; potential field; special purpose hardware.
53. Rovetta, A. and Sala R.: 1992, Robot motion planning with parallel systems, in: Proc. 1992 IEEE Int. Conf. on Robotics and Automation, Nice, France, 12-14 May, 1992, pp. 2224-2229. Keywords: manipulators; skeleton; static task scheduling; MIMD computers; special purpose networks; specialist parallelism.
54. Schmidt-Brauns, R., Swietlik, A., and Dillmann, R.: 1991, Robot path planning on transputer networks, in: T. S. Durrani; W. A. Sandham; J. J. Soraghan; S. M. Forbers (eds), Applications of Transputers 3 Proc. of the Third Int. Conf. on Applications of Transputers, Glasgow, UK, 28-30 Aug., 1991, pp. 174-179. Keywords: mobile robots; cell decomposition; graph search; MIMD computers.
55. Shang, W. and Egan, G. K.: 1992, Mobile robot path planning using parallel computer system, in: R. Zurawski and T. S. Dillon (eds), IEEE Int. Workshop on Emerging Technologies and Factory Automation Technology for the Intelligent Factory, Proc., Melbourne, Vic., Australia, 11-14 Aug., 1992, pp. 676-680. Keywords: mobile robots; multirobot environments; skeleton; graph search; shared memory systems; scalable parallelism.
56. Shibata, T. and Fukuda, T.: 1993, Coordinate behavior by genetic algorithm and fuzzy in evolutionary multi-agent system, in: Proc. IEEE Int. Conf. on Robotics and Automation, Atlanta, GA, USA, 2-6 May, 1993, pp. 760-765. Keywords: mobile robots; multirobot environments; skeleton; genetic algorithms; no parallel implementation; skalable parallelism.
57. Shu, C. and Buxton, H.: 1990, A parallel path planning algorithm for mobile robots, in: BMVC90, Proc. of the British Machine Vision Conf., Oxford, UK, 24-27 Sept., 1990, pp. 383-388. Keywords: mobile robots; potential field; cellular automata; SIMD computers; mesh networks; scalable parallelism.
58. Siemiatkowska, B.: 1994, A highly parallel method for mapping and navigation of an autonomous mobile robot, in: Proc. IEEE Int. Conference on Robotics and Automation, pp. 2796-2801. Keywords: mobile robots; cell decomposition; neural networks; no parallel implementation; scalable parallelism.
59. Solano, J. and Jones, D. I.: 1993, Generation of collision-free paths, a genetic approach, in: IEE Colloquium on 'Genetic Algorithms for Control Systems Engineering', London, UK, 28 May, 1993, pp. 5/1. Keywords: mobile robots; manipulators; skeleton; genetic algorithms; no parallel implementation.
60. Solano, J. and Jones, D. I.: 1994, Parameter determination for a genetic algorithm applied to robot control, in: Int. Conf. on Control'94, Coventry, UK, 21-24 March, 1994, pp. 765-770. Keywords: mobile robots; potential field; processor farms; MIMD computers; linear networks; special purpose networks; scalable parallelism.
61. Stifter, S.: 1993, Shortest non-synchronized motions parallel versions for shared memory CREW models, in: J. Volkert (ed.), Parallel Computation. Second Int. ACPC Conf. Proc., Gmunden, Austria, 4-6 Oct., 1993, pp. 87-104. Keywords: manipulators; cell decomposition; graph search; shared memory systems.
62. Stiles, P. N. and Glickstein, I. S.: 1994, Highly parallelizable route planner based on cellular automata algorithms, IBM J. Res. and Dev. 38(2), 167-181. Keywords: mobile robots; potential field; cellular automata; SIMD computer; mesh networks; scalable parallelism.
63. Suzuki, H. and Arimoto, S.: 1991, Parallel-processable recursive and heuristic method for path planning, in: Proc. IROS'91. IEEE/RSJ Int. Workshop on Intelligent Robots and Systems'91. Intelligence for Mechanical Systems, Osaka, Japan, 3-5 Nov., 1991, pp. 616-618. Keywords: mobile robots; potential field; cellular automata; no parallel implementation; scalable parallelism.
64. Talbi, E. G. and Bessiere, P.: 1992, Parallel robot motion planning in a dynamic environment, in: Second Join Int. Conference on Vector and Parallel Processing, Sept., 1992, Lyon, France. Keywords: mobile robots; cell decomposition; genetic algorithms; MIMD computers; torus networks; scalable parallelism.
65. Talbi, E.G. and Muntean, T.: 1993, Designing embedded parallel systems with parallel genetic algorithms, in: IEE Colloquium on 'Genetic Algorithms for Control Systems Engineering', London, UK, 28 May, 1993, pp. 7/1. Keywords: mobile robots; cell decomposition; genetic algorithms; MIMD computers; torus networks; scalable parallelism.
66. Tarassenko, L. and Blake, A.: 1991, Analogue computation for collison-free paths, in: IEEECROB, pp. 540-545. Keywords: mobile robots; potential field, special purpose hardware; mesh networks; scalable parallelism.
67. Teng, Y. A., DeMenthon, D., and Davis, L. S.: 1993, Stealth terrain navigation, IEEE Trans. Systems, Man Cybernet. 23(1), 96-110. Keywords: multirobot environment; cell decomposition; cellular automata; SIMD computers; hypercube networks; scalable parallelism.
68. Voliotis, S. D. and Christodoulou, M. A.: 1992, Continuous path planning via a noninverting parallel algorithm, Robotica 10(3), 205-216. Keywords: manipulators; path optimization; static task scheduling; MIMD computers; bus networks; specialist parallelism.
69. Witkowski, C. M.: 1983, A parallel processor algorithm for robot route planning, in: Int. Joint Conf. on Artificial Intelligence (IJCAI), Karlsruhe, West Germany, Aug., 1983, pp. 827-829. Keywords: mobile robots; potential field; cellular automata; SIMD computer; mesh networks; scalable parallelism.
70. Won, Y. and Sahni, S.: 1987, Maze routing on a hypercube multiprocessor computer, in: Proc. of the 1987 Int. Conf. on Parallel Processing, pp. 630-637. Keywords: potential field; cellular automata; MIMD computers; mesh networks; hypercube networks; scalable parallelism.
71. Yen I.-L., Dubash, R. M., and Bastani, F. B.: 1993, Strategies for mapping Lee's maze routing algorithm onto parallel architectures, in: Proc. of Seventh Int. Parallel Processing Symposium, Newport, CA, USA, 13-16 April, 1993, pp. 672-679. Keywords: cell decomposition; potential field; cellular automata; no parallel implementation; mesh networks; hypercube networks; scalable parallelism.