[1]LAVALLE S M. Randomized Kinodynamic Planning[J]. International Journal of Robotics & Research, 1999, 15(5):378-400.
[2]陈波芝,陆亮,雷新宇, 等.基于改进快速扩展随机树算法的双机械臂协同避障规划方法[J].中国机械工程,2018,29(10):1220-1226.
CHEN Bozhi, LU Liang, LEI Xinyu, et al. Simultaneous Obstacle-avoidance Motion Planning Approach for Dual Arm Robots Based on Improved RRT Algorithm[J]. China Mechanical Engineering, 2018,29(10):1220-1226.
[3]李洋,徐达.基于引力自适应步长RRT的双臂机器人协同路径规划[J].机器人,2020,42(5):606-616.
LI Yang, XU Da. Cooperative Path Planning of Dual-arm Robot Based on Attractive Force Self-adaptive Step Size RRT[J]. Robot, 2020, 42(5):606-616.
[4]KUFFNER J J, LAVALLE S M. RRT-Connect:an Efficient Approach to Single-query Path Planning[C]∥Proceedings of the 2000 IEEE International Conference on Robotics and Automation. San Francisco, 2000:995-1001.
[5]CHANDLER B, GOODRICH M A. Online RRT* and Online FMT*:Rapid Replanning with Dynamic Cost[C]∥2017 IEEE/RSJ International Conference on Intelligent Robots and Systems. Vancouver, 2017:6313-6318.
[6]KARAMAN S, FRAZZOLI E. Sampling-based Algorithms for Optimal Motion Planning[J]. The International Journal of Robotics Research, 2011, 30(7):846-894.
[7]GAMMELL J D, SRINIVASA S S, BARFOOT T D. “Informed RRT*:Optimal Sampling-based Path Planning Focused via Direct Sampling of an Admissible Ellipsoidal Heuristic[C]∥2014 IEEE/RSJ International Conference on Intelligent Robots and Systems. Chicago, 2014:2997-3004.
[8]MASHAYEKHI R, IDRIS M Y I, ANISI M H, et al. Informed RRT*-Connect:an Asymptotically Optimal Single-query Path Planning Method[J]. IEEE Access, 2020, 8:19842-19852.
[9]ADIYATOV O, VAROL H A. Rapidly-exploring Random Tree Based Memory Efficient Motion Planning[C]∥2013 IEEE International Conference on Mechatronics and Automation. Takamatsu, 2013:354-359.
[10]谭建豪,潘豹,王耀南,等.基于改进 RRT*FN 算法的机器人路径规划[J].控制与决策,2021,36(8):1834-1840.
TAN Jianhao, PAN Bao, WANG Yaonan et al. Robot Path Planning Based on Improved RRT*FN Algorithm[J].Control and Decision. 2021,36(8):1834-1840.
[11]ADIYATOV O, VAROL H A. A Novel RRT*-based Algorithm for Motion Planning in Dynamic Environments[C]∥2017 IEEE International Conference on Mechatronics & Automation. Takamatsu, 2017:1416-1421.
[12]宋金泽,戴斌,单恩忠,等. 一种改进的RRT路径规划算法[J]. 电子学报,2010,38(2A):225-228.
SONG Jinze, DAI Bin, SHAN Enzhong, et al. An Improved RRT Path Planning Algorithm[J]. Acta Electronica Sinica, 2010,38(2A):225-228.
[13]KARAMAN S, FRAZZOLI E. Sampling-based Algorithms for Optimal Motion Planning[J]. International Journal of Robotics Research, 2011, 30(7):846-894.
[14]GAMMELL J D, BARFOOT T D, SRINIVASA S S, et al. Informed Sampling for Asymptotically Optimal Path Planning[J]. IEEE Transactions on Robotics, 2018, 34(4):966-984.
[15]De RUITER A H J, FORBES J R. On the Solution of Wahbas Problem on SO(n)[J]. The Journal of the Astronautical Sciences, 2013, 60(1):1-31.
|