{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:13:55Z","timestamp":1759637635092},"reference-count":17,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[1998,8,1]],"date-time":"1998-08-01T00:00:00Z","timestamp":901929600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Pattern Recognition"],"published-print":{"date-parts":[[1998,8]]},"DOI":"10.1016\/s0031-3203(97)00141-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:02:01Z","timestamp":1027605721000},"page":"1127-1138","source":"Crossref","is-referenced-by-count":12,"title":["A morphological approach to shortest path planning for rotating objects"],"prefix":"10.1016","volume":"31","author":[{"given":"Soo-Chang","family":"Pei","sequence":"first","affiliation":[]},{"given":"Chin-Lun","family":"Lai","sequence":"additional","affiliation":[]},{"given":"Frank Y.","family":"Shih","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0031-3203(97)00141-6_BIB1","series-title":"Robot Motion Planning","author":"Latombe","year":"1991"},{"issue":"3","key":"10.1016\/S0031-3203(97)00141-6_BIB2","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1145\/136035.136037","article-title":"Gross motion planning \u2014 a survey","volume":"24","author":"Hwang","year":"1992","journal-title":"ACM Comput. Surveys"},{"issue":"10","key":"10.1016\/S0031-3203(97)00141-6_BIB3","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/359156.359164","article-title":"An algorithm for planning collision-free paths among polyhedral obstacles","volume":"22","author":"Lozano-Perez","year":"1979","journal-title":"Comm. ACM"},{"key":"10.1016\/S0031-3203(97)00141-6_BIB4","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1109\/TC.1983.1676196","article-title":"Spatial planning","volume":"c 32","author":"Lozano-Perez","year":"1983","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"10.1016\/S0031-3203(97)00141-6_BIB5","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1109\/JRA.1987.1087095","article-title":"A simple motion planning algorithm for general robot manipulators","volume":"RA 3","author":"Lozano-Perez","year":"1987","journal-title":"IEEE Trans. Robotics Automat."},{"key":"10.1016\/S0031-3203(97)00141-6_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0734-189X(90)90160-W","article-title":"A solution of polygon containment, spatial planning, and other related problems using Minkowski operations","volume":"49","author":"Ghosh","year":"1990","journal-title":"Comput. Vision Graphics Image Process."},{"issue":"3","key":"10.1016\/S0031-3203(97)00141-6_BIB7","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1109\/21.256552","article-title":"A shortest path algorithm for a nonrotating object among obstacles of arbitrary shapes","volume":"23","author":"Lin","year":"1993","journal-title":"IEEE Trans. Systems Man Cybernet."},{"key":"10.1016\/S0031-3203(97)00141-6_BIB8","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/0885-064X(87)90025-2","article-title":"Algorithmic and complexity issues of robot motion planning in an uncertain environment","volume":"3","author":"Lumelsky","year":"1987","journal-title":"Journal of Complexity"},{"issue":"3","key":"10.1016\/S0031-3203(97)00141-6_BIB9","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1109\/TSMC.1983.6313112","article-title":"Solving the findpath problem by good representation of free space","volume":"13","author":"Brooks","year":"1983","journal-title":"IEEE Trans. Systems, Man Cybernet."},{"issue":"3","key":"10.1016\/S0031-3203(97)00141-6_BIB10","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1109\/JRA.1986.1087051","article-title":"Multiresolution path planning for mobile robots","volume":"2","author":"Kambhampati","year":"1994","journal-title":"IEEE Trans. Robotics Automat."},{"key":"10.1016\/S0031-3203(97)00141-6_BIB11","series-title":"Random Sets and Integral Geometry","author":"Matheron","year":"1975"},{"key":"10.1016\/S0031-3203(97)00141-6_BIB12","series-title":"Image Analysis and Mathematical Morphology","author":"Serra","year":"1982"},{"key":"10.1016\/S0031-3203(97)00141-6_BIB13","unstructured":"F. Y. Shih, S. C. Pei and J. H. Horng, Edge linking using adaptive morphology, Pattern Recognition (submitted)."},{"issue":"6","key":"10.1016\/S0031-3203(97)00141-6_BIB14","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1016\/0031-3203(87)90030-6","article-title":"Computing distance trans formation in convex and non-convex domains","volume":"20","author":"Piper","year":"1987","journal-title":"Pattern Recognition"},{"key":"10.1016\/S0031-3203(97)00141-6_BIB15","series-title":"The implementation of 8\u00d78 DCT-based codec by using fast algorithms on digital signal processor, Master thesis","author":"Lai","year":"1993"},{"issue":"2","key":"10.1016\/S0031-3203(97)00141-6_BIB16","doi-asserted-by":"crossref","first-page":"367","DOI":"10.2140\/pjm.1990.145.367","article-title":"Optimal paths for a car that goes both forward and backwards","volume":"145","author":"Reeds","year":"1990","journal-title":"Pacific J. Math."},{"issue":"5","key":"10.1016\/S0031-3203(97)00141-6_BIB17","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1109\/70.326564","article-title":"A motion planner for nonholonomic mobile robots","volume":"10","author":"Laumond","year":"1994","journal-title":"IEEE Trans. Robotics Automat."}],"container-title":["Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0031320397001416?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0031320397001416?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T19:55:49Z","timestamp":1556481349000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0031320397001416"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,8]]},"references-count":17,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1998,8]]}},"alternative-id":["S0031320397001416"],"URL":"https:\/\/doi.org\/10.1016\/s0031-3203(97)00141-6","relation":{},"ISSN":["0031-3203"],"issn-type":[{"value":"0031-3203","type":"print"}],"subject":[],"published":{"date-parts":[[1998,8]]}}}