{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T22:45:24Z","timestamp":1776811524730,"version":"3.51.2"},"reference-count":20,"publisher":"European Society of Computational Methods in Sciences and Engineering","issue":"5","license":[{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computational Methods in Sciences and Engineering"],"published-print":{"date-parts":[[2022,9]]},"abstract":"<jats:p>Currently available algorithms developed for planning robot motion paths in configuration spaces with both obstacle avoidance constraints and end-effector pose constraints suffer from low sampling rates, long computation times, and requirements for specific manipulator structures. The present work addresses this issue by developing an improved sampling-type motion planning algorithm based on a modified form of the rapidly-exploring random tree (RRT) algorithm. The sampling process is based on the standard premise that the constrained manifold is continuous within a particular range. Therefore, configurations that meet the specific constraints associated with a proscribed motion planning task are sampled in advance, and those configurations meeting the constraints are stored in an offline configuration dataset that is employed exclusively in the RRT process. Accordingly, the proposed algorithm facilitates a greatly streamlined motion planning process for manipulators with high degrees of freedom. The computational speed and planning precision of the algorithm are further enhanced by introducing a target bias mechanism and applying an adaptive mechanism to improve the obstacle collision detection performance. The high motion-planning performance of the proposed algorithm is verified by comparisons with the performances of other state-of-the-art RRT-based algorithms based on numerical simulations.<\/jats:p>","DOI":"10.3233\/jcm-226140","type":"journal-article","created":{"date-parts":[[2022,5,31]],"date-time":"2022-05-31T12:16:30Z","timestamp":1653999390000},"page":"1545-1557","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":1,"title":["Robot motion planning with orientational constraints based on offline sampling datasets"],"prefix":"10.66113","volume":"22","author":[{"given":"Qinglei","family":"Zhang","sequence":"first","affiliation":[{"name":"Shanghai Maritime University","place":["China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhangpeng","family":"Wang","sequence":"additional","affiliation":[{"name":"Shanghai Maritime University","place":["China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianguo","family":"Duan","sequence":"additional","affiliation":[{"name":"Shanghai Maritime University","place":["China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiyun","family":"Qin","sequence":"additional","affiliation":[{"name":"Shanghai Maritime University","place":["China"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"55691","published-online":{"date-parts":[[2022,9]]},"reference":[{"key":"e_1_3_2_2_2","unstructured":"LaValleSM KuffnerJJ. Rapidly-exploring random trees: Progress and prospects. Algorithmic Comput Rob: New Dir. 2001; 293-308."},{"key":"e_1_3_2_3_2","doi-asserted-by":"crossref","unstructured":"LaValleSM YakeyJH KavrakiLE. A probabilistic roadmap approach for systems with closed kinematic chains. IEEE Int Conf Rob Autom. 1999; 3: 1671-1676.","DOI":"10.1109\/ROBOT.1999.770349"},{"key":"e_1_3_2_4_2","doi-asserted-by":"crossref","unstructured":"KuffnerJJ LaValleSM. RRT-connect: an efficient approach to single-query path planning. IEEE Int Conf Rob Autom. 2002; 2: 995-1001.","DOI":"10.1109\/ROBOT.2000.844730"},{"key":"e_1_3_2_5_2","doi-asserted-by":"crossref","unstructured":"BerensonD SrinivasazSS. Probabilistically complete planning with end-effector pose constraints. In: 2010 IEEE International Conference on Robotics and Automation; 2010. pp. 2724-2730.","DOI":"10.1109\/ROBOT.2010.5509694"},{"key":"e_1_3_2_6_2","doi-asserted-by":"crossref","unstructured":"BonillaM FarnioliE PallottinoL BicchiA. Sample-based motion planning for robot manipulators with closed kinematic chains. In: 2015 IEEE International Conference on Robotics and Automation (ICRA); 2015. pp. 2522-2527.","DOI":"10.1109\/ICRA.2015.7139537"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/s12530-018-9224-1"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/70.976030"},{"key":"e_1_3_2_9_2","doi-asserted-by":"crossref","unstructured":"StilmanM. Task constrained motion planning in robot joint space. IROS. 2007.","DOI":"10.1109\/IROS.2007.4399305"},{"key":"e_1_3_2_10_2","doi-asserted-by":"crossref","unstructured":"BerensonD SrinivasaSS FergusonD KuffnerJJ. Manipulation planning on constraint manifolds. In: 2009 IEEE International Conference on Robotics and Automation; 2009. pp. 625-632.","DOI":"10.1109\/ROBOT.2009.5152399"},{"key":"e_1_3_2_11_2","doi-asserted-by":"crossref","unstructured":"DalibardS NakhaeiA LamirauxF LaumondJP. Whole-body task planning for a humanoid robot: A way to integrate collision avoidance. In: IEEE International Conference on Humanoid Robots; 2009. pp. 1-6.","DOI":"10.1109\/ICHR.2009.5379547"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2970540"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1177\/1729881419829651"},{"key":"e_1_3_2_14_2","doi-asserted-by":"crossref","unstructured":"WegheMV FergusonD SrinivasaSS. Randomized path planning for redundant manipulators without inverse kinematics. In: 2007 7th IEEE-RAS International Conference on Humanoid Robots; 2007. pp. 477-482.","DOI":"10.1109\/ICHR.2007.4813913"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2012.2222272"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2013.2260679"},{"key":"e_1_3_2_17_2","doi-asserted-by":"crossref","unstructured":"JailletL PortaJM. Asymptotically-optimal path planning on manifolds. A: Robotics: Science and Systems. In: Proceedings of the 2012 Robotics: Science and Systems Conference. Sidney; 2012. pp. 1-8.","DOI":"10.15607\/RSS.2012.VIII.019"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013219111657"},{"key":"e_1_3_2_20_2","doi-asserted-by":"crossref","unstructured":"BurgetF HornungA BennewitzM. Whole-body motion planning for manipulation of articulated objects. In: 2013 IEEE International Conference on Robotics and Automation; 2013. pp. 1656-1662.","DOI":"10.1109\/ICRA.2013.6630792"},{"key":"e_1_3_2_21_2","doi-asserted-by":"crossref","unstructured":"SucanIA ChittaS. Motion planning with constraints using configuration space approximations. In: 2012 IEEE\/RSJ International Conference on Intelligent Robots and Systems; 2012. pp. 1904-1910.","DOI":"10.1109\/IROS.2012.6386092"}],"container-title":["Journal of Computational Methods in Sciences and Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JCM-226140","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JCM-226140","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JCM-226140","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T22:06:28Z","timestamp":1776809188000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JCM-226140"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9]]},"references-count":20,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["10.3233\/JCM-226140"],"URL":"https:\/\/doi.org\/10.3233\/jcm-226140","relation":{},"ISSN":["1472-7978","1875-8983"],"issn-type":[{"value":"1472-7978","type":"print"},{"value":"1875-8983","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9]]}}}