{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T11:05:28Z","timestamp":1747652728079,"version":"3.33.0"},"reference-count":19,"publisher":"Wiley","issue":"10","license":[{"start":{"date-parts":[[2007,3,13]],"date-time":"2007-03-13T00:00:00Z","timestamp":1173744000000},"content-version":"vor","delay-in-days":4181,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Robotic Syst."],"published-print":{"date-parts":[[1995,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A recent development in robotics is the increase of intelligence in robots. One of the research fields is to enable robots to autonomously avoid collisions with surrounding objects. This article presents an efficient method for planning collision\u2010free paths for an articulated robot that is surrounded by polyhedral objects. The algorithm plans a hypothetical Archimedes's spiral path from the initial position to the goal position. When a collision among the arms and obstacles is detected, the hypothetical path will be modified to avoid the collision. The algorithm applies geometric methods to determine the upper and lower bounds of the reachable area of the wrist and then determines a collision\u2010free path point on that reachable area. Because the equations, which represent the upper and lower bounds, are simple, the algorithm can rapidly determine a collision\u2010free path. Moreover, with minor modifications, this path planning algorithm can also be applied to other robots such as spherical, cylindrical, and Cartesian types of robots. \u00a9<jats:italic>1995 John Wiley &amp; Sons, Inc<\/jats:italic>.<\/jats:p>","DOI":"10.1002\/rob.4620121002","type":"journal-article","created":{"date-parts":[[2007,7,6]],"date-time":"2007-07-06T16:54:36Z","timestamp":1183740876000},"page":"637-646","source":"Crossref","is-referenced-by-count":1,"title":["Path planning for robobt manipulators in polyhhedral objects environment"],"prefix":"10.1002","volume":"12","author":[{"given":"Ching\u2010Shiow","family":"Tseng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsun\u2010Sun","family":"Lue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2007,3,13]]},"reference":[{"key":"e_1_2_1_2_2","first-page":"737","volume-title":"Proc. Int. Joint Conf. Artif. Intel.","author":"Udupa S. M.","year":"1977"},{"doi-asserted-by":"publisher","key":"e_1_2_1_3_2","DOI":"10.1109\/TSMC.1983.6313112"},{"key":"e_1_2_1_4_2","first-page":"5","volume-title":"Proc. Int. Rob. Res. Symp.","author":"Brooks R. A.","year":"1984"},{"doi-asserted-by":"crossref","unstructured":"J. F.CannyandM. C.Lin \u201cAn opportunistic global path planner \u201dProc. IEEE Int. Conf. Rob. Autom. 1990 pp.1554\u20131559.","key":"e_1_2_1_5_2","DOI":"10.1109\/ROBOT.1990.126229"},{"issue":"2","key":"e_1_2_1_6_2","first-page":"58","article-title":"Generation of collision\u2010free paths for robot manipulators,","volume":"7","author":"Tseng C. S.","year":"1988","journal-title":"J. Comput. Mech. Eng."},{"doi-asserted-by":"publisher","key":"e_1_2_1_7_2","DOI":"10.1115\/1.3258781"},{"doi-asserted-by":"crossref","unstructured":"S.Dubowsky M.Morris andZ.Shiller \u201cTime optimal trajectory planning for robotic manipulators with obstacle avoidance: A CAD approach \u201dProc. IEEE Int. Conf. Rob. Autom. Paper No. 276 St. Louis MS April1986.","key":"e_1_2_1_8_2","DOI":"10.1109\/ROBOT.1986.1087434"},{"unstructured":"P.DupontandS.Derby \u201cPlanning collision free paths for redundant robots using a selective search of configuration space \u201dProc. ASME Mech. Conf. Columbus OH 1986.","key":"e_1_2_1_9_2"},{"doi-asserted-by":"crossref","unstructured":"B.Faverjon \u201cObstacle avoidance using an octree in the configuration space of a manipulator \u201dProc. Int. Conf. Rob. Atlanta GA March1984 pp.504\u2013512.","key":"e_1_2_1_10_2","DOI":"10.1109\/ROBOT.1984.1087218"},{"doi-asserted-by":"publisher","key":"e_1_2_1_11_2","DOI":"10.1109\/JRA.1987.1087095"},{"doi-asserted-by":"publisher","key":"e_1_2_1_12_2","DOI":"10.1109\/70.134270"},{"doi-asserted-by":"crossref","unstructured":"V.LumelskyandE.Cheung \u201cToward safe real\u2010time robot teleoperation: Automatic whole\u2010sensitive arm collision avoidance frees the operator for global control \u201dProc. IEEE Int. Conf. Rob. Autom. Sacramento CA April1991 pp.797\u2013802.","key":"e_1_2_1_13_2","DOI":"10.1109\/ROBOT.1991.131684"},{"doi-asserted-by":"crossref","unstructured":"E.CheungandV.Lumelsky \u201cMotion planning for a whole\u2010sensitive robot arm manipulator \u201dProc. IEEE Int. Conf. Rob. Autom. 1990 pp.344\u2013349.","key":"e_1_2_1_14_2","DOI":"10.1109\/ROBOT.1990.125999"},{"doi-asserted-by":"publisher","key":"e_1_2_1_15_2","DOI":"10.1109\/70.127236"},{"doi-asserted-by":"crossref","unstructured":"G.Heinzinger P.Jacobs J.Canny andB.Paden \u201cTime\u2010optimal trajectories for a robot manipulator: A provably good approximation algorithm \u201dProc. IEEE Int. Conf. Rob. Autom. 1990 pp.150\u2013156.","key":"e_1_2_1_16_2","DOI":"10.1109\/ROBOT.1990.125963"},{"doi-asserted-by":"publisher","key":"e_1_2_1_17_2","DOI":"10.1145\/359156.359164"},{"doi-asserted-by":"publisher","key":"e_1_2_1_18_2","DOI":"10.1177\/027836499101000605"},{"doi-asserted-by":"crossref","unstructured":"M. S.BranickyandW. S.Newman \u201cRapid computation of configuration space obstacles \u201dProc. IEEE Int Conf. Rob. Autom. 1990 pp.304\u2013310.","key":"e_1_2_1_19_2","DOI":"10.1109\/ROBOT.1990.125992"},{"key":"e_1_2_1_20_2","first-page":"11","volume-title":"Proc. IEEE Conf. Decis. Control","author":"Dubowsky S.","year":"1985"}],"container-title":["Journal of Robotic Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Frob.4620121002","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/rob.4620121002","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T07:49:53Z","timestamp":1737186593000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/rob.4620121002"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,10]]},"references-count":19,"journal-issue":{"issue":"10","published-print":{"date-parts":[[1995,10]]}},"alternative-id":["10.1002\/rob.4620121002"],"URL":"https:\/\/doi.org\/10.1002\/rob.4620121002","archive":["Portico"],"relation":{},"ISSN":["0741-2223","1097-4563"],"issn-type":[{"type":"print","value":"0741-2223"},{"type":"electronic","value":"1097-4563"}],"subject":[],"published":{"date-parts":[[1995,10]]}}}