{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,7]],"date-time":"2025-06-07T04:05:46Z","timestamp":1749269146902,"version":"3.41.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"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":[[2001,11]]},"DOI":"10.1023\/a:1013949515552","type":"journal-article","created":{"date-parts":[[2002,12,28]],"date-time":"2002-12-28T18:55:48Z","timestamp":1041101748000},"page":"307-319","source":"Crossref","is-referenced-by-count":18,"title":["High-Speed Environment Representation Scheme for Dynamic Path Planning"],"prefix":"10.1007","volume":"32","author":[{"given":"S. K.","family":"Lam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Srikanthan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"323382_CR1","volume-title":"Parallel Computational Geometry","author":"S. A. Aki","year":"1993","unstructured":"Aki, S. A. and Lyons, K. A.: Parallel Computational Geometry, Prentice-Hall, Englewood Cliffs, 1993."},{"issue":"1","key":"323382_CR2","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/rob.4620070107","volume":"7","author":"L.-C. Fu","year":"1990","unstructured":"Fu, L.-C. and Liu, D.-Y.: An efficient algorithm for finding a collision-free path among polyhedral obstacles, J. Robotic Systems\n7(1) (1990), 129-137.","journal-title":"J. Robotic Systems"},{"key":"323382_CR3","doi-asserted-by":"crossref","unstructured":"Fujimura, K.: Motion planning amidst dynamic obstacles on three dimensions, in: Proc. of the IEEE\/RSJ Internat. Conf. on Intelligent Robots and Systems, July 1993, pp. 1387-1392.","DOI":"10.1109\/IROS.1993.583791"},{"key":"323382_CR4","doi-asserted-by":"crossref","unstructured":"Goodrich, M. T., Shauck, S. B., and Guha, S.: Parallel methods for visibility and shortest path problems in simple polygons, in: Proc. of the Sixth Annual Symposium on Computational Geometry, 1990, pp. 73-82.","DOI":"10.1145\/98524.98539"},{"key":"323382_CR5","volume-title":"Computer Architectures for Robotics and Automation","author":"J. H. Graham","year":"1987","unstructured":"Graham, J. H.: Computer Architectures for Robotics and Automation, Gordon and Breach, London, 1987."},{"key":"323382_CR6","doi-asserted-by":"crossref","unstructured":"Janet, J. A., Luo, R. C., and Kay, M. G.: T-vectors make autonomous mobile robot motion planning and self-referencing more efficient, in: IEEE Internat. Conf. on Intelligent Robots and Systems, 1994, pp. 587-594.","DOI":"10.1109\/IROS.1994.407421"},{"key":"323382_CR7","unstructured":"Kortenkamp, D., Bonasso, R. P., and Murphy, R.: Artificial Intelligence and Mobile Robots, AAAI Press\/MIT Press, 1998."},{"key":"323382_CR8","doi-asserted-by":"crossref","unstructured":"Kutulakos, K. N., Lumelsky, V. J., and Dyer, C. R.: Vision guided exploration: A step toward general motion planning in three dimensions, in: IEEE Internat. Conf. on Robotics and Automation, 1993, pp. 289-296.","DOI":"10.1109\/ROBOT.1993.291997"},{"key":"323382_CR9","series-title":"Honours Year Report","volume-title":"VLSI based high-speed routing strategy for network management","author":"S. K. Lam","year":"1998","unstructured":"Lam, S. K.: VLSI based high-speed routing strategy for network management, Honours Year Report, School of Applied Science, Nanyang Technological University, Singapore, 1998."},{"key":"323382_CR10","doi-asserted-by":"crossref","unstructured":"Lin, M. C. and Canny, J. F.: A fast algorithm for incremental distance calculation, in: Proc. of IEEE Internat. Conf. on Robotics and Automation, April 1991, pp. 1008-1014.","DOI":"10.1109\/ROBOT.1991.131723"},{"key":"323382_CR11","doi-asserted-by":"crossref","unstructured":"Liu, Y.-H. and Arimoto, S.: Proposal of tangent graph and extended tangent graph for path planning of mobile robots, in: Proc. IEEE Internat. Conf. on Robotics and Automation, April 1991, pp. 312-317.","DOI":"10.1109\/ROBOT.1991.131594"},{"key":"323382_CR12","doi-asserted-by":"crossref","unstructured":"Lozano-Perez, T.: Spatial planning: A configuration space approach, IEEE Trans. Computers (February 1983), 108-120.","DOI":"10.1109\/TC.1983.1676196"},{"key":"323382_CR13","first-page":"316","volume":"1195","author":"R. C. Luo","year":"1989","unstructured":"Luo, R. C. and Pan, T.-J.: An intelligent path planning system for robot navigation in an unknown environment, in: SPIE Mobile Robots IV, Vol. 1195, 1989, pp. 316-326.","journal-title":"SPIE Mobile Robots IV"},{"key":"323382_CR14","unstructured":"Quek, K. H. and Srikanthan, T.: A hierarchical representation of roadway networks, in: 7th World Congress on Intelligent Transport Systems, Italy, November 2000."},{"key":"323382_CR15","first-page":"88","volume":"1195","author":"T. M. Rao","year":"1989","unstructured":"Rao, T. M. and Arkin, R. C.: 3D path planning for flying\/crawling robots, in: SPIE Mobile Robots IV, Vol. 1195, 1989, pp. 88-96.","journal-title":"SPIE Mobile Robots IV"},{"issue":"3","key":"323382_CR16","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1137\/0216038","volume":"16","author":"M. Sharir","year":"1987","unstructured":"Sharir, M.: On shortest paths amidst convex polyhedra, SIAM J. Comput.\n16(3) (June 1987), 561-572.","journal-title":"SIAM J. Comput."},{"issue":"1","key":"323382_CR17","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1137\/0215014","volume":"15","author":"M. Sharir","year":"1986","unstructured":"Sharir, M. and Schorr, A.: On shortest paths in polyhedral spaces, SIAM J. Comput.\n15(1) (1986), 193-215.","journal-title":"SIAM J. Comput."},{"key":"323382_CR18","doi-asserted-by":"crossref","unstructured":"Shu, C. and Buxton, H.: A parallel path planning algorithm for mobile robots, in: Proc. of the 1st Internat. Conf. on Automation, Robotics and Computer Vision, 1990, pp. 489-493.","DOI":"10.5244\/C.4.68"},{"key":"323382_CR19","doi-asserted-by":"crossref","unstructured":"Shu, C. and Buxton, H.: Dynamic motion planning using a distributed representation, J. Intelligent Robotic Systems (November 1995), 241-262.","DOI":"10.1007\/BF01258351"},{"key":"323382_CR20","first-page":"89","volume":"10","author":"A. Stentz","year":"1995","unstructured":"Stentz, A.: Optimal and efficient path planning for unknown and dynamic environments, Internat. J. Robotics Automat.\n10 (1995), 89-100.","journal-title":"Internat. J. Robotics Automat."},{"key":"323382_CR21","unstructured":"Stifter, S.: A medley of solutions to the robot collision problem in two and three dimensions, Johannes Kepler Universit\u00e4t Linz, 1989."},{"key":"323382_CR22","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1117\/12.143799","volume":"1831","author":"P. Tzionas","year":"1992","unstructured":"Tzionas, P., Tsalides, Ph., and Thanailakis, A.: 3-D minimum cost path planning using cellular automata architectures, in: SPIE Mobile Robots VII, Vol. 1831, 1992, pp. 297-306.","journal-title":"SPIE Mobile Robots VII"},{"issue":"2","key":"323382_CR23","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1109\/70.563646","volume":"13","author":"P. Tzionas","year":"1997","unstructured":"Tzionas, P., Tsalides, Ph., and Thanailakis, A.: Collision-free path planning for a diamond-shaped robot using two-dimensional cellular automata, IEEE Trans. Robotics Automat.\n13(2) (1997), 237-250.","journal-title":"IEEE Trans. Robotics Automat."}],"container-title":["Journal of Intelligent and Robotic Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013949515552.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1013949515552\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013949515552.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T14:24:03Z","timestamp":1749219843000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1013949515552"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,11]]}},"alternative-id":["323382"],"URL":"https:\/\/doi.org\/10.1023\/a:1013949515552","relation":{},"ISSN":["0921-0296","1573-0409"],"issn-type":[{"type":"print","value":"0921-0296"},{"type":"electronic","value":"1573-0409"}],"subject":[],"published":{"date-parts":[[2001,11]]}}}