{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T17:33:15Z","timestamp":1761154395884,"version":"3.41.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"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":[[2002,2]]},"DOI":"10.1023\/a:1014655007668","type":"journal-article","created":{"date-parts":[[2002,12,28]],"date-time":"2002-12-28T21:18:52Z","timestamp":1041110332000},"page":"209-230","source":"Crossref","is-referenced-by-count":3,"title":["A Recursive Algorithm for On-line Clustering Obstacles Cluttered in Dynamic Environments"],"prefix":"10.1007","volume":"33","author":[{"given":"Jin-Liang","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing-Sin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wan-Chi","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"354668_CR1","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1109\/TSMC.1983.6313112","volume":"13","author":"R. A. Brooks","year":"1983","unstructured":"Brooks, R. A.: Solving the find path problem by good representation of free space, IEEE Trans. Systems Man Cybernet. 13(3) (1983), 190\u2013197.","journal-title":"IEEE Trans. Systems Man Cybernet"},{"key":"354668_CR2","doi-asserted-by":"crossref","first-page":"987","DOI":"10.1109\/ETFA.1999.813099","volume":"2","author":"E. J. Bernabeu","year":"1999","unstructured":"Bernabeu, E. J. and Tornero, J.: Hough transform for robot motion planning in industrial applications, in: 1999 7th IEEE Internat. Conf. on Emerging Technologies and Factory Automation, Vol. 2, 1999, pp. 987\u2013994.","journal-title":"1999 7th IEEE Internat. Conf. on Emerging Technologies and Factory Automation"},{"issue":"6","key":"354668_CR3","doi-asserted-by":"crossref","first-page":"1337","DOI":"10.1109\/21.61205","volume":"20","author":"S. Bonner","year":"1990","unstructured":"Bonner, S. and Kelley, R. B.: A novel representation for planning 3-D collision-free paths, IEEE Trans. Systems Man Cybernet. 20(6) (1990), 1337\u20131351.","journal-title":"IEEE Trans. Systems Man Cybernet"},{"key":"354668_CR4","unstructured":"Chen, J. L., Liu, J. S., and Lee W. C.: A recursive algorithm of obstacles clustering for reducing complexity of collision detection in 2D environment, in: 2001 IEEE Internat. Conf. on Robotics and Automation, Seoul, Korea, May 2001."},{"issue":"12","key":"354668_CR5","doi-asserted-by":"crossref","first-page":"1203","DOI":"10.1109\/TC.1983.1676186","volume":"32","author":"F. Chin","year":"1983","unstructured":"Chin, F., Wang, C. A.: Optimal algorithm for the intersection and the minimum distance problems between planar polygons, IEEE Trans. Comput.\n32(12) (1983), 1203\u20131207.","journal-title":"IEEE Trans. Comput."},{"key":"354668_CR6","doi-asserted-by":"crossref","unstructured":"Gilbert E. G. and Hong S. M.: A new algorithm for detecting the collision of moving objects, in: 1989 IEEE Internat. Conf. on Robotics and Automation, 1989, pp. 8\u201314.","DOI":"10.1109\/ROBOT.1989.99960"},{"issue":"1","key":"354668_CR7","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/JRA.1985.1087003","volume":"1","author":"E. G. Gilbert","year":"1985","unstructured":"Gilbert, E. G. and Jonson, D.W.:Distance functions and their application to robot path planning in the presence of obstacles, IEEE J. Robot. Automat.\n1(1) (1985), 21\u201330.","journal-title":"IEEE J. Robot. Automat."},{"key":"354668_CR8","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1017\/S0263574700003295","volume":"19","author":"M. Y. Ju","year":"2001","unstructured":"Ju, M. Y., Liu, J. S., Shiang, S. P., Chien, Y. R., Hwang, K. S., and Lee, W. C.: Fast and accurate collision detection based on enclosed ellipsoid, Robotica\n19 (2001), 381\u2013394.","journal-title":"Robotica"},{"issue":"1","key":"354668_CR9","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1177\/027836498600500106","volume":"5","author":"O. Khatib","year":"1986","unstructured":"Khatib, O.: Real-time obstacle avoidance for manipulators and mobile robots, Internat. J. Robot. Res.\n5(1) (1986), 90\u201398.","journal-title":"Internat. J. Robot. Res."},{"key":"354668_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-4022-9","volume-title":"Robot Motion Planning","author":"J. C. Latombe","year":"1991","unstructured":"Latombe, J. C.: Robot Motion Planning, Kluwer Academic, Dordrecht, 1991."},{"key":"354668_CR11","volume-title":"The Handbook of Theoretical Computer Science","author":"J. V. Leeuwen","year":"1990","unstructured":"Leeuwen, J. V.: The Handbook of Theoretical Computer Science, Elsevier Science, Amsterdam, 1990."},{"issue":"10","key":"354668_CR12","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/359156.359164","volume":"22","author":"T. Lozano-P\u00e9rez","year":"1979","unstructured":"Lozano-P\u00e9rez, T. and Wesley, M. A.: An algorithm for planning collision-free paths among polyhedral obstacles, Comm. ACM\n22(10)(1979), 560\u2013570.","journal-title":"Comm. ACM"},{"issue":"2","key":"354668_CR13","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1109\/TC.1983.1676196","volume":"32","author":"T. Lozano-P\u00e9rez","year":"1983","unstructured":"Lozano-P\u00e9rez T.: Spatial planning: A configuration space approach, IEEE Trans. Computers\n32(2) (1983), 108\u2013120.","journal-title":"IEEE Trans. Computers"},{"issue":"1","key":"354668_CR14","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1023\/A:1008190406456","volume":"26","author":"A. C. Nearchou","year":"1999","unstructured":"Nearchou, A. C., Aspragathos, N. A., and.Sofotassios, D. P.: Reducing the complexity of robot's scene for faster collision detection, J. Intelligent Robotic Systems\n26(1) (1999), 79\u201389.","journal-title":"J. Intelligent Robotic Systems"},{"key":"354668_CR15","first-page":"20","volume":"6","author":"A. C. Nearchou","year":"1996","unstructured":"Nearchou A. C. and Aspragathos N. A.: Collision-detection continuous path control of manipulators using genetic algorithm, J. Systems Engrg.\n6 (1996), 20\u201332.","journal-title":"J. Systems Engrg."},{"key":"354668_CR16","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1023\/A:1007960531949","volume":"181","author":"E. Rimon","year":"1997","unstructured":"Rimon, E. and Boyd Stephon, P.: Obstacle collision detection using best ellipsoid fit, J. Intelligent Robotic Systems\n18(1) (1997), 105\u2013126.","journal-title":"J. Intelligent Robotic Systems"},{"key":"354668_CR17","first-page":"95","volume-title":"Advances in Robotics: Algorithmic and Geometric Aspects of Robotics","author":"J. T. Schwartz","year":"1987","unstructured":"Schwartz, J. T. and Yap, C. K.: Advances in Robotics: Algorithmic and Geometric Aspects of Robotics, Vol. 1, Lawrence Erlbaum, London, 1987, pp. 95\u2013143."},{"issue":"2","key":"354668_CR18","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1109\/3468.833100","volume":"30","author":"K. P. Valavanis","year":"2000","unstructured":"Valavanis, K. P., Hebert, T., Kolluru, R., and Tsourveloudis, N.: Mobile robot navigation in 2D dynamic environments using electrostatic potential field, IEEE Trans. Systems Man Cybernet. 30(2) (2000), 187\u2013196.","journal-title":"IEEE Trans. Systems Man Cybernet"}],"container-title":["Journal of Intelligent and Robotic Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1014655007668.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1014655007668\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1014655007668.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T14:33:24Z","timestamp":1749220404000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1014655007668"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,2]]}},"alternative-id":["354668"],"URL":"https:\/\/doi.org\/10.1023\/a:1014655007668","relation":{},"ISSN":["0921-0296","1573-0409"],"issn-type":[{"type":"print","value":"0921-0296"},{"type":"electronic","value":"1573-0409"}],"subject":[],"published":{"date-parts":[[2002,2]]}}}