{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T04:05:42Z","timestamp":1649131542990},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"6","license":[{"start":{"date-parts":[[2003,10,24]],"date-time":"2003-10-24T00:00:00Z","timestamp":1066953600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Robotica"],"published-print":{"date-parts":[[2003,12]]},"abstract":"<jats:p>Today, in robot applications continuous paths often result from CAD or other planning tools. We present here an approach to the question that has been discussed for a long time, i.e. how to approximate a given path by a second one in such a way that the latter \nlies in a tube of given radius \u03b5 around the first. The approximation should be a (normally cubic) spline with a small number of breakpoints. The strategy is based on \nalgorithms used in \u201ccomputer aided geometric design\u201d and is applied \nto examples from industrial and surgical robotics.<\/jats:p>","DOI":"10.1017\/s026357470300523x","type":"journal-article","created":{"date-parts":[[2003,10,24]],"date-time":"2003-10-24T16:01:43Z","timestamp":1067011303000},"page":"605-614","source":"Crossref","is-referenced-by-count":2,"title":["Data reduction for manipulator path planning"],"prefix":"10.1017","volume":"21","author":[{"given":"Werner","family":"Korb","sequence":"first","affiliation":[]},{"given":"Inge","family":"Troch","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2003,10,24]]},"container-title":["Robotica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S026357470300523X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,6]],"date-time":"2019-05-06T22:13:00Z","timestamp":1557180780000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S026357470300523X\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10,24]]},"references-count":0,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2003,12]]}},"alternative-id":["S026357470300523X"],"URL":"https:\/\/doi.org\/10.1017\/s026357470300523x","relation":{},"ISSN":["0263-5747","1469-8668"],"issn-type":[{"value":"0263-5747","type":"print"},{"value":"1469-8668","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,10,24]]}}}