{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T15:10:01Z","timestamp":1749222601119,"version":"3.41.0"},"reference-count":71,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1997,9,1]],"date-time":"1997-09-01T00:00:00Z","timestamp":873072000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,9,1]],"date-time":"1997-09-01T00:00:00Z","timestamp":873072000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Intelligent and Robotic Systems"],"published-print":{"date-parts":[[1997,9]]},"DOI":"10.1023\/a:1007948727999","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T12:13:40Z","timestamp":1040559220000},"page":"45-69","source":"Crossref","is-referenced-by-count":44,"title":["Fast Motion Planning by Parallel Processing \u2013 a Review"],"prefix":"10.1007","volume":"20","author":[{"given":"Dominik","family":"Henrich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"138258_CR1","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF01762120","volume":"3","author":"A. Aggarwahl","year":"1988","unstructured":"Aggarwahl, A., et al.: 1988, Parallel computational geometry, in: Algorithmica, Vol 3, pp. 293\u2013327. Keywords: survey.","journal-title":"Algorithmica"},{"key":"138258_CR2","doi-asserted-by":"crossref","unstructured":"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\u201317 Sept., 1991, pp. 84\u201393. Keywords: mobile robots; manipulators; cell decomposition; genetic algorithms; MIMD computers; torus networks; scalable parallelism.","DOI":"10.1007\/3-540-57132-9_6"},{"key":"138258_CR3","unstructured":"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\u20137 Aug., 1992, pp. 671\u2013675. Keywords: mobile robots; manipulators; cell decomposition; genetic algorithms; MIMD computers; torus networks; scalable parallelism."},{"key":"138258_CR4","doi-asserted-by":"crossref","unstructured":"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\u2013122. Keywords: skeleton; shared memory systems.","DOI":"10.1145\/73833.73846"},{"key":"138258_CR5","doi-asserted-by":"crossref","unstructured":"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\u20131900. Keywords: path optimization; shared memory.","DOI":"10.1109\/ROBOT.1986.1087478"},{"key":"138258_CR6","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.21236\/ADA209890"},{"issue":"6","key":"138258_CR7","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1177\/027836499101000604","volume":"10","author":"J. Barraquand","year":"1991","unstructured":"Barraquand, J. and Latombe J.-C.: 1991, Robot motion planning: A distributed representation approach, Int. J. Robotics Research\n10(6), 628\u2013649. Keywords: potential field; skeleton; graph search; no parallel implementation; scalable parallelism.","journal-title":"Int. J. Robotics Research"},{"key":"138258_CR8","unstructured":"Bessi\u00e8re P., et al.: 1994, The Adriane\u2019s 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."},{"key":"138258_CR9","doi-asserted-by":"crossref","unstructured":"Betts, J. T. and Huffman, W. P.: 1991, Trajectory optimization on a parallel processor, Guidance, Control, and Dynamics\n14(2). Keywords: mobile robots; path optimization; static task scheduling; shared memory systems; specialist parallelism.","DOI":"10.2514\/3.20656"},{"key":"138258_CR10","doi-asserted-by":"crossref","unstructured":"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\u2013999. Keywords: manipulators; mathematical programming; static task scheduling, no parallel implementation; specialist parallelism.","DOI":"10.1109\/ICAR.1991.240542"},{"key":"138258_CR11","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1016\/B978-0-444-81837-9.50017-8"},{"key":"138258_CR12","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1109\/ROBOT.1993.292122","volume":"2","author":"D. J. Challou","year":"1993","unstructured":"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\u20136 May, 1993, Vol 2, pp. 46\u201351. Keywords: manipulators; potential field; skeleton; graph search; MIMD computers; SIMD computers; bus networks; hupercube networks.","journal-title":"IEEE Int. Conf. on Robotics and Automation, Atlanta, GA USA, 2\u20136 May, 1993"},{"key":"138258_CR13","doi-asserted-by":"crossref","unstructured":"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 AutomationNagoya, Aichi, Japan, May 21\u201327, 1995 pp. 709\u2013714. Keywords: manipulators; potential field; skeleton; graph search; MIMD computers; SIMD computers; bus networks; hypercube networks.","DOI":"10.1109\/ROBOT.1995.525367"},{"key":"138258_CR14","unstructured":"Chan K. K. and Zalzala, A. M. S.: 1993, Genetic-based minimum-time trajectory of articulated manipulators with torque constraints, in: IEEE Colloquium on \u2018Genetic Algorithms for Control Systems Engineering\u2019London, UK, 28 May, 1993, pp. 4\/1. Keywords: manipulators; path optimization; genetic algorithms; no parallel implementation; scalable parallelism."},{"key":"138258_CR15","doi-asserted-by":"crossref","unstructured":"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\u201321 Nov., 1991, pp. 1542\u20131547. Keywords: mobile robots; skeleton; genetic algorithms; neural nets; no parallel implementation; scalable parallelism.","DOI":"10.1109\/IJCNN.1991.170621"},{"key":"138258_CR16","doi-asserted-by":"crossref","unstructured":"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\u201991. IEEE\/RSJ Int. Workshop on Intelligent Robots and Systems\u201991. Intelligence for Mechanical Systems, Osaka, Japan, 3\u20135 Nov., 1991, pp. 824\u2013828. Keywords: mobile robots; skeleton; genetic algorithms; neural nets; no parallel implementation; scalable parallelism.","DOI":"10.1109\/IROS.1991.174586"},{"key":"138258_CR17","doi-asserted-by":"crossref","unstructured":"Davidor, Y.: 1990, Robot programming with a genetic algorithm, in: COMPEURO\u201990. Proceedings of the 1990 IEEE Int. Conf. on Computer Systems and Software Engineering, Tel-Aviv, Israel, 8\u201310 May, 1990, pp. 186\u2013191. Keywords: manipulators; path optimization; genetic algorithms; no parallel implementation; scalable parallelism.","DOI":"10.1109\/CMPEUR.1990.113625"},{"key":"138258_CR18","unstructured":"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\u20133 Oct., 1990, pp. 356\u2013362. Keywords: mobile robots; potential field; cellular automata; SIMD computers; mesh networks; scalable parallelism."},{"key":"138258_CR19","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0167-8191(89)90055-0","volume":"12","author":"F. Dehne","year":"1989","unstructured":"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\u2013231. Keywords: mobile robots; C-space computation; cellular automata; MIMD computers; mesh networks; scalable parallelism.","journal-title":"Parallel Computing"},{"key":"138258_CR20","doi-asserted-by":"crossref","unstructured":"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\u20131 April, pp. 206\u2013214. Keywords: multirobot environments; mobile robots; potential field; cellular automata; mesh networks; scalable parallelism.","DOI":"10.1109\/ISADS.1993.262702"},{"issue":"6","key":"138258_CR21","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1524\/auto.1991.39.112.197","volume":"39","author":"B. Fink","year":"1991","unstructured":"Fink, B. and Wend, H.-D.: 1991, Collision-free motion-planning for robot-manipulators working in a changing environment, Automatisierungstechnik\n39(6), 197\u2013200. Keywords: manipulators; cell decompositionl; potential field; static task scheduling; MIMD computers; specialist parallelism.","journal-title":"Automatisierungstechnik"},{"key":"138258_CR22","doi-asserted-by":"crossref","unstructured":"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.\u20132 Dec., 1992, pp. 180\u2013308. Keywords: mobile robots; collision avoidance; MIMD computers; special purpose networks; specialist parallelism.","DOI":"10.1109\/ACV.1992.240298"},{"key":"138258_CR23","first-page":"168","volume-title":"Applications of Transputers","author":"J. S. Gonzalez","year":"1991","unstructured":"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 Transputers3. Proceedings of the Third Int. Conf. on Applications of Transputers, IOS Press-Amsterdam, pp. 168\u2013173. Keywords: manipulators, cell decomposition; processor farms; static task scheduling; MIMD computers; special purpose networks; scalable parallelism."},{"issue":"5","key":"138258_CR24","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1145\/42411.42415","volume":"31","author":"J. L. Gustafson","year":"1988","unstructured":"Gustafson, J. L.: 1988, Reevaluation Amdahl\u2019s law, Communications of the ACM\n31(5), 532\u2013533. Keywords: MIMD computers; SIMD computers.","journal-title":"Communications of the ACM"},{"key":"138258_CR25","doi-asserted-by":"crossref","unstructured":"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\u20131062. Keywords: mobile robots: potential fields; neural networks; no parallel implementation; scalable parallelism.","DOI":"10.1145\/98894.99122"},{"key":"138258_CR26","doi-asserted-by":"crossref","unstructured":"Hwang, Y. K. and Ahuja N.: 1992, Gross motion planning\u2013A survey, ACM Computing Surveys, 24(3). Keywords: survey.","DOI":"10.1145\/136035.136037"},{"key":"138258_CR27","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1109\/IMC.1990.687331","volume":"1","author":"H. Hyotyniemi","year":"1990","unstructured":"Hyotyniemi, H.: 1990, Locally controlled optimization of spray painting robot trajectories, in: Intelligent Motion Control. Proceedings of the IEEE International Workshop, 20\u201322 Aug., 1990, Istambul, Vol. 1., pp. 283\u2013287. Keywords: manipulators; path optimization; cellular automata; no parallel implementation; scalable parallelism.","journal-title":"Intelligent Motion Control"},{"key":"138258_CR28","doi-asserted-by":"crossref","unstructured":"Kalyayev, I. A.: 1993, Homogeneous neuronlike structures for optimization variational problem solving, in: A. Bode, M. Reeve, and G. Wolf (eds), PARLE\u201993, Parallel Architectures and Languages Europe. 5th Int. PARLE Conf. Proc., 14\u201317 June, 1993, Springer, Berlin, pp. 438\u2013451. Keywords: mobile robots; cell decomposition; neural nets; special purpose hardware; mesh networks; scalable parallelism.","DOI":"10.1007\/3-540-56891-3_35"},{"key":"138258_CR29","doi-asserted-by":"crossref","unstructured":"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\u20131 June, 1991, pp. 500\u2013506. Keywords: manipulators; collision avoidance; processor farms; special purpose hardware; scalable parallelism.","DOI":"10.1109\/VLSIC.1991.760063"},{"issue":"4","key":"138258_CR30","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1109\/4.126537","volume":"27","author":"M. Kameyama","year":"1992","unstructured":"Kameyama, M., Amada, T., and Higuchi, T.: 1992, Highly parallel collision detection processor for intelligent robots, IEEE Solid-State Circuits\n27(4), 500\u2013506. Keywords: manipulators; collision avoidance; processor farms; special purpose hardware; scalable parallelism.","journal-title":"IEEE Solid-State Circuits"},{"key":"138258_CR31","doi-asserted-by":"crossref","unstructured":"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\u20136 May, 1993, pp. 255\u2013261. Keywords: C-space computation; special purpose hardware; scalable parallelism.","DOI":"10.1109\/ROBOT.1993.292185"},{"key":"138258_CR32","doi-asserted-by":"crossref","unstructured":"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\u20131073. Keywords: mobile robots; potential field; cellular automata; SIMD computers; mesh networks; scalable parallelism.","DOI":"10.1109\/ICAR.1991.240414"},{"key":"138258_CR33","doi-asserted-by":"crossref","unstructured":"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\u2013385. Keywords: mobile robots; potential field; cellular automata; SIMD computers; mesh networks; scalable parallelism.","DOI":"10.1109\/ROBOT.1994.351266"},{"key":"138258_CR34","doi-asserted-by":"crossref","unstructured":"Latombe, J. C.: 1991, Robot motion planning, Kluwer Academic Publishers. Keywords: survey, introduction.","DOI":"10.1007\/978-1-4615-4022-9"},{"issue":"3","key":"138258_CR35","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1162\/neco.1991.3.3.350","volume":"3","author":"M. Lemmon","year":"1991","unstructured":"Lemmon, M.: 1991, 2-Degree-of-freedom robot path planning using cooperative neural fields, Neural Computation3(3), 350\u2013362. Keywords: mobile robots; mathematical programming; neural nets; no parallel implementation; scalable parallelism.","journal-title":"Neural Computation"},{"key":"138258_CR36","doi-asserted-by":"crossref","unstructured":"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\u201994, Coventry, UK, 21\u201324 March, 1994, pp. 760\u2013764. Keywords: mobile robots; cell decomposition; genetic algorithms; no parallel implementations; scalable parallelism.","DOI":"10.1049\/cp:19940228"},{"issue":"1","key":"138258_CR37","first-page":"1","volume":"6","author":"C.-S. Lin","year":"1991","unstructured":"Lin, C.-S., and Wann, C.-D.: 1991, A parallel processing model for robot path planning on grid terrains, Int. J. Robotics & Automation6(1), 1\u201311. Keywords: mobile robots; skeleton; neutral networks; special purpose hardware; mesh networks; scalable parallelism.","journal-title":"Int. J. Robotics & Automation"},{"key":"138258_CR38","doi-asserted-by":"crossref","unstructured":"Lozano-Perez, T. and O\u2019Donnell, P. A.: 1991, Parallel robot motion planning, in: IEEE Int. Conf. on Robotics and Automation, Sacramento, California, April, 1991, pp. 1000\u20131007. Keywords: manipulators; C-space computation; cellular automata; SIMD computers; scalable parallelism.","DOI":"10.1109\/ROBOT.1991.131722"},{"key":"138258_CR39","doi-asserted-by":"crossref","unstructured":"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\u201311. Keywords: skeleton; hypercube networks.","DOI":"10.1109\/FMPC.1990.89429"},{"key":"138258_CR40","unstructured":"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\u201327 May, 1993, pp. 163\u2013167. Keywords: mobile robots; potential fields; special purpose hardware; mesh networks; scalable parallelism."},{"key":"138258_CR41","unstructured":"Mazer, E., Ahuactzin, J. M., Talbi, E., and Bessiere, P.: 1993, Robot motion planning with the Ariadne\u2019s 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\u201318 Feb., pp. 196\u2013205. Keywords: mobile robots; cell decomposition; genetic algorithms; MIMD computers; torus networks; scalable parallelism."},{"key":"138258_CR42","unstructured":"Paige, R. C. and Kruskal, C. P.: 1985, Parallel algorithms for shortest path problems, in: IEEE, 14\u201320. Keywords: graph search; shared memory systems."},{"key":"138258_CR43","unstructured":"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\u201330, 1995, pp. 413\u2013419. Keywords: mobile robots; skeleton; genetic algorithms; no parallel implementations; scalable parallelism."},{"issue":"1","key":"138258_CR44","first-page":"1","volume":"22","author":"V. K. Prasanna","year":"1992","unstructured":"Prasanna, V. K. and Rao, A. S.: 1992, Parallel algorithms for robotics\u2013A survey, Computer Science and Informatics\n22(1), 1\u201318. Keywords: survey.","journal-title":"Computer Science and Informatics"},{"key":"138258_CR45","volume-title":"Proc. of the Int. Conf. Connectionism in Perspective","author":"E. Prassler","year":"1989","unstructured":"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 paral-lelism."},{"key":"138258_CR46","first-page":"2","volume":"1388","author":"E. Prassler","year":"1990","unstructured":"Prassler, E. and Milios, E.: 1990, Parallel path planning in unknown terrains, in: Proc. of the SPIE\u2013The Int. Society for Optical Engineering, Vol. 1388, 1990, pp. 2\u201313. Keywords: mobile robots; potential field; cellular automata; no parallel implementation; mesh networks; scalable parallelism.","journal-title":"Proc. of the SPIE\u2013The Int. Society for Optical Engineering"},{"key":"138258_CR47","unstructured":"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\u201994, Munich, Germany. Keywords: mobile robots; potential field; cellular automata; no parallel implementation; mesh networks; scalable parallelism."},{"key":"138258_CR48","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1142\/9789812797773_0006"},{"key":"138258_CR49","unstructured":"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."},{"key":"138258_CR50","unstructured":"Qin, C. and Henrich, D.: 1996, Path planning for industrial robot arms\u2013A parallel randomized approach, in: Proceedings of the International Symposium on Intelligent Robotic Systems (SIRS\u201996), Lisbon, Portugal, July 22\u201326, 1996, pp. 65\u201372. Keywords: manipulators, cell decom-position; graph search; MIMD computers; bus networks; scalable parallelism."},{"key":"138258_CR51","doi-asserted-by":"crossref","unstructured":"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\u201329 April, pp. 275\u2013279. Keywords: mobile robots; potential field; cellular automata; special purpose hardware; linear networks; scalable parallelism.","DOI":"10.1109\/IPPS.1994.288289"},{"key":"138258_CR52","doi-asserted-by":"crossref","unstructured":"Reid, M. B.: 1993, Path planning using optically computed potential fields, in: Proc. IEEE Int. Conf. on Robotics and Automation, Atlanta, GA, USA, 2\u20136 May, 1993, pp. 295\u2013300. Keywords: mobile robots; potential field; special purpose hardware.","DOI":"10.1109\/ROBOT.1993.292161"},{"key":"138258_CR53","doi-asserted-by":"crossref","unstructured":"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\u201314 May, 1992, pp. 2224\u20132229. Keywords: manipulators; skeleton; static task scheduling; MIMD computers; special purpose networks; specialist parallelism.","DOI":"10.1109\/ROBOT.1992.219927"},{"key":"138258_CR54","unstructured":"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 3Proc. of the Third Int. Conf. on Applications of Transputers, Glasgow, UK, 28\u201330 Aug., 1991, pp. 174\u2013179. Keywords: mobile robots; cell decomposition; graph search; MIMD computers."},{"key":"138258_CR55","doi-asserted-by":"crossref","unstructured":"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\u2013Technology for the Intelligent Factory, Proc., Melbourne, Vic., Australia, 11\u201314 Aug., 1992, pp. 676\u2013680. Keywords: mobile robots; multirobot environments; skeleton; graph search; shared memory systems; scalable parallelism.","DOI":"10.1109\/ETFA.1992.683338"},{"key":"138258_CR56","doi-asserted-by":"crossref","unstructured":"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\u20136 May, 1993, pp. 760\u2013765. Keywords: mobile robots; multirobot environments; skeleton; genetic algorithms; no parallel implementation; skalable parallelism.","DOI":"10.1109\/ROBOT.1993.292069"},{"key":"138258_CR57","unstructured":"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\u201327 Sept., 1990, pp. 383\u2013388. Keywords: mobile robots; potential field; cellular automata; SIMD computers; mesh networks; scalable parallelism."},{"key":"138258_CR58","doi-asserted-by":"crossref","unstructured":"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\u20132801. Keywords: mobile robots; cell decomposition; neural networks; no parallel implementation; scalable parallelism.","DOI":"10.1109\/ROBOT.1994.350915"},{"key":"138258_CR59","unstructured":"Solano, J. and Jones, D. I.: 1993, Generation of collision-free paths, a genetic approach, in: IEE Colloquium on \u2018Genetic Algorithms for Control Systems Engineering\u2019, London, UK, 28 May, 1993, pp. 5\/1. Keywords: mobile robots; manipulators; skeleton; genetic algorithms; no parallel implementation."},{"key":"138258_CR60","doi-asserted-by":"crossref","unstructured":"Solano, J. and Jones, D. I.: 1994, Parameter determination for a genetic algorithm applied to robot control, in: Int. Conf. on Control\u201994, Coventry, UK, 21\u201324 March, 1994, pp. 765\u2013770. Keywords: mobile robots; potential field; processor farms; MIMD computers; linear networks; special purpose networks; scalable parallelism.","DOI":"10.1049\/cp:19940229"},{"key":"138258_CR61","doi-asserted-by":"crossref","unstructured":"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\u20136 Oct., 1993, pp. 87\u2013104. Keywords: manipulators; cell decomposition; graph search; shared memory systems.","DOI":"10.1007\/3-540-57314-3_8"},{"issue":"2","key":"138258_CR62","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1147\/rd.382.0167","volume":"38","author":"P. N. Stiles","year":"1994","unstructured":"Stiles, P. N. and Glickstein, I. S.: 1994, Highly parallelizable route planner based on cellular automata algorithms, IBM J. Res. and Dev.\n38(2), 167\u2013181. Keywords: mobile robots; potential field; cellular automata; SIMD computer; mesh networks; scalable parallelism.","journal-title":"IBM J. Res. and Dev."},{"key":"138258_CR63","doi-asserted-by":"crossref","unstructured":"Suzuki, H. and Arimoto, S.: 1991, Parallel-processable recursive and heuristic method for path planning, in: Proc. IROS\u201991. IEEE\/RSJ Int. Workshop on Intelligent Robots and Systems\u201991. Intelligence for Mechanical Systems, Osaka, Japan, 3\u20135 Nov., 1991, pp. 616\u2013618. Keywords: mobile robots; potential field; cellular automata; no parallel implementation; scalable parallelism.","DOI":"10.1109\/IROS.1991.174545"},{"key":"138258_CR64","unstructured":"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."},{"key":"138258_CR65","unstructured":"Talbi, E.G. and Muntean, T.: 1993, Designing embedded parallel systems with parallel genetic algorithms, in: IEE Colloquium on \u2018Genetic Algorithms for Control Systems Engineering\u2019, London, UK, 28 May, 1993, pp. 7\/1. Keywords: mobile robots; cell decomposition; genetic algorithms; MIMD computers; torus networks; scalable parallelism."},{"key":"138258_CR66","doi-asserted-by":"crossref","unstructured":"Tarassenko, L. and Blake, A.: 1991, Analogue computation for collison-free paths, in: IEEECROB, pp. 540\u2013545. Keywords: mobile robots; potential field, special purpose hardware; mesh net-works; scalable parallelism.","DOI":"10.1109\/ROBOT.1991.131636"},{"issue":"1","key":"138258_CR67","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1109\/21.214770","volume":"23","author":"Y. A. Teng","year":"1993","unstructured":"Teng, Y. A., DeMenthon, D., and Davis, L. S.: 1993, Stealth terrain navigation, IEEE Trans. Systems, Man Cybernet.\n23(1), 96\u2013110. Keywords: multirobot environment; cell decomposition; cellular automata; SIMD computers; hypercube networks; scalable parallelism.","journal-title":"IEEE Trans. Systems, Man Cybernet"},{"issue":"3","key":"138258_CR68","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1017\/S0263574700007943","volume":"10","author":"S. D. Voliotis","year":"1992","unstructured":"Voliotis, S. D. and Christodoulou, M. A.: 1992, Continuous path planning via a noninverting parallel algorithm, Robotica\n10(3), 205\u2013216. Keywords: manipulators; path optimization; static task scheduling; MIMD computers; bus networks; specialist parallelism.","journal-title":"Robotica"},{"key":"138258_CR69","unstructured":"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\u2013829. Keywords: mobile robots; potential field; cellular automata; SIMD computer; mesh networks; scalable parallelism."},{"key":"138258_CR70","unstructured":"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\u2013637. Keywords: potential field; cellular automata; MIMD computers; mesh networks; hypercube networks; scalable parallelism."},{"key":"138258_CR71","doi-asserted-by":"crossref","unstructured":"Yen I.-L., Dubash, R. M., and Bastani, F. B.: 1993, Strategies for mapping Lee\u2019s maze routing algorithm onto parallel architectures, in: Proc. of Seventh Int. Parallel Processing Symposium, Newport, CA, USA, 13\u201316 April, 1993, pp. 672\u2013679. Keywords: cell decomposition; potential field; cellular automata; no parallel implementation; mesh networks; hypercube networks; scalable parallelism.","DOI":"10.1109\/IPPS.1993.262800"}],"container-title":["Journal of Intelligent and Robotic Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007948727999.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1007948727999\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007948727999.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T14:35:33Z","timestamp":1749220533000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1007948727999"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,9]]},"references-count":71,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,9]]}},"alternative-id":["138258"],"URL":"https:\/\/doi.org\/10.1023\/a:1007948727999","relation":{},"ISSN":["0921-0296","1573-0409"],"issn-type":[{"type":"print","value":"0921-0296"},{"type":"electronic","value":"1573-0409"}],"subject":[],"published":{"date-parts":[[1997,9]]}}}