Papers
Topics
Authors
Recent
2000 character limit reached

Motion Planning for Robotics: A Review for Sampling-based Planners

Published 25 Oct 2024 in cs.RO | (2410.19414v2)

Abstract: Recent advancements in robotics have transformed industries such as manufacturing, logistics, surgery, and planetary exploration. A key challenge is developing efficient motion planning algorithms that allow robots to navigate complex environments while avoiding collisions and optimizing metrics like path length, sweep area, execution time, and energy consumption. Among the available algorithms, sampling-based methods have gained the most traction in both research and industry due to their ability to handle complex environments, explore free space, and offer probabilistic completeness along with other formal guarantees. Despite their widespread application, significant challenges still remain. To advance future planning algorithms, it is essential to review the current state-of-the-art solutions and their limitations. In this context, this work aims to shed light on these challenges and assess the development and applicability of sampling-based methods. Furthermore, we aim to provide an in-depth analysis of the design and evaluation of ten of the most popular planners across various scenarios. Our findings highlight the strides made in sampling-based methods while underscoring persistent challenges. This work offers an overview of the important ongoing research in robotic motion planning.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (198)
  1. M. R. Pedersen, L. Nalpantidis, R. S. Andersen, C. Schou, S. Bøgh, V. Krüger, and O. Madsen, “Robot skills for manufacturing: From concept to industrial deployment,” Robotics and Computer-Integrated Manufacturing, vol. 37, pp. 282–291, 2016.
  2. E. Matheson, R. Minto, E. G. Zampieri, M. Faccio, and G. Rosati, “Human–robot collaboration in manufacturing applications: A review,” Robotics, vol. 8, no. 4, p. 100, 2019.
  3. J. Arents and M. Greitans, “Smart industrial robot control trends, challenges and opportunities within manufacturing,” Applied Sciences, vol. 12, no. 2, p. 937, 2022.
  4. W. Echelmeyer, A. Kirchheim, and E. Wellbrock, “Robotics-logistics: Challenges for automation of logistic processes,” in 2008 IEEE International Conference on Automation and Logistics.   IEEE, 2008, pp. 2099–2103.
  5. R. Lin, H. Huang, and M. Li, “An automated guided logistics robot for pallet transportation,” Assembly Automation, vol. 41, no. 1, pp. 45–54, 2021.
  6. R. Bernardo, J. M. Sousa, and P. J. Gonçalves, “Survey on robotic systems for internal logistics,” Journal of manufacturing systems, vol. 65, pp. 339–350, 2022.
  7. A. R. Lanfranco, A. E. Castellanos, J. P. Desai, and W. C. Meyers, “Robotic surgery: a current perspective,” Annals of surgery, vol. 239, no. 1, pp. 14–21, 2004.
  8. M. Diana and J. Marescaux, “Robotic surgery,” Journal of British Surgery, vol. 102, no. 2, pp. e15–e28, 2015.
  9. A. Sozzi, M. Bonfè, S. Farsoni, G. D. Rossi, and R. Muradore, “Dynamic motion planning for autonomous assistive surgical robots,” Electronics, vol. 8, no. 9, p. 957, 2019.
  10. B. H. Wilcox, “Robotic vehicles for planetary exploration,” Applied Intelligence, vol. 2, pp. 181–193, 1992.
  11. J. Oberländer, S. Klemm, G. Heppner, A. Roennau, and R. Dillmann, “A multi-resolution 3-d environment model for autonomous planetary exploration,” in 2014 IEEE International Conference on Automation Science and Engineering (CASE).   IEEE, 2014, pp. 229–235.
  12. K. Albee, A. C. Hernandez, O. Jia-Richards, and A. T. Espinoza, “Real-time motion planning in unknown environments for legged robotic planetary exploration,” in 2020 IEEE Aerospace Conference.   IEEE, 2020, pp. 1–9.
  13. K. Chen, Z. Bing, Y. Wu, F. Wu, L. Zhang, S. Haddadin, and A. Knoll, “Real-time contact state estimation in shape control of deformable linear objects under small environmental constraints,” in 2024 IEEE International Conference on Robotics and Automation (ICRA), 2024, pp. 13 833–13 839.
  14. P. Vadakkepat, K. C. Tan, and W. Ming-Liang, “Evolutionary artificial potential fields and their application in real time robot path planning,” in Proceedings of the 2000 congress on evolutionary computation. CEC00 (Cat. No. 00TH8512), vol. 1.   IEEE, 2000, pp. 256–263.
  15. D. Fox, W. Burgard, and S. Thrun, “The dynamic window approach to collision avoidance,” IEEE Robotics & Automation Magazine, vol. 4, no. 1, pp. 23–33, March 1997.
  16. E. DIJKSTRA, “A note on two problems in connexion with graphs,” Numerische Mathematik, vol. 1, pp. 269–271, 1959.
  17. A. Zelinsky, R. A. Jarvis, J. Byrne, S. Yuta, et al., “Planning paths of complete coverage of an unstructured environment by a mobile robot,” in Proceedings of international conference on advanced robotics, vol. 13.   Citeseer, 1993, pp. 533–538.
  18. F. Duchoň, A. Babinec, M. Kajan, P. Beňo, M. Florek, T. Fico, and L. Jurišica, “Path planning with modified a star algorithm for a mobile robot,” Procedia engineering, vol. 96, pp. 59–69, 2014.
  19. A. Stentz, “Optimal and efficient path planning for partially-known environments,” in Proceedings of the 1994 IEEE international conference on robotics and automation.   IEEE, 1994, pp. 3310–3317.
  20. J. Tu and S. X. Yang, “Genetic algorithm based path planning for a mobile robot,” in 2003 IEEE International Conference on Robotics and Automation (Cat. No. 03CH37422), vol. 1.   IEEE, 2003, pp. 1221–1226.
  21. Y. Zhang, D.-w. Gong, and J.-h. Zhang, “Robot path planning in uncertain environment using multi-objective particle swarm optimization,” Neurocomputing, vol. 103, pp. 172–185, 2013.
  22. M. P. Garcia, O. Montiel, O. Castillo, R. Sepulveda, and P. Melin, “Path planning for autonomous mobile robot navigation with ant colony optimization and fuzzy cost function evaluation,” Applied Soft Computing, vol. 9, no. 3, pp. 1102–1110, 2009.
  23. Q. Zhu, Y. Yan, and Z. Xing, “Robot path planning based on artificial potential field approach with simulated annealing,” in Sixth international conference on intelligent systems design and applications, vol. 2.   IEEE, 2006, pp. 622–627.
  24. S. X. Yang and C. Luo, “A neural network approach to complete coverage path planning,” IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), vol. 34, no. 1, pp. 718–724, 2004.
  25. J. D. Gammell, S. S. Srinivasa, and T. D. Barfoot, “Informed rrt*: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic,” in 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2014, pp. 2997–3004.
  26. M. P. Strub and J. D. Gammell, “Adaptively informed trees (ait*): Fast asymptotically optimal path planning through adaptive heuristics,” in 2020 IEEE International Conference on Robotics and Automation (ICRA).   IEEE, 2020, pp. 3191–3198.
  27. B. Lindqvist, A. Patel, K. Löfgren, and G. Nikolakopoulos, “A tree-based next-best-trajectory method for 3-d uav exploration,” IEEE Transactions on Robotics, vol. 40, pp. 3496–3513, 2024.
  28. R. Border and J. D. Gammell, “The Surface Edge Explorer (SEE): A measurement-direct approach to next best view planning,” The International Journal of Robotics Research (IJRR), 2024.
  29. L. E. Kavraki, P. Švestka, J.-C. Latombe, and M. H. Overmars, “Probabilistic roadmaps for path planning in high-dimensional configuration spaces,” IEEE Transactions on Robotics and Automation, vol. 12, no. 4, pp. 566–580, 1996.
  30. D. Hsu, R. Kindel, J.-C. Latombe, and S. Rock, “Randomized kinodynamic motion planning with moving obstacles,” The International Journal of Robotics Research, vol. 21, no. 3, pp. 233–255, 2002.
  31. S. LaValle, “Rapidly-exploring random trees: A new tool for path planning,” Research Report 9811, 1998.
  32. J.-C. Latombe, “Motion planning: A journey of robots, molecules, digital actors, and other artifacts,” The International Journal of Robotics Research, vol. 18, no. 11, pp. 1119–1128, 1999.
  33. S. R. Lindemann and S. M. LaValle, “Current issues in sampling-based motion planning,” in Robotics Research. The Eleventh International Symposium: With 303 Figures.   Springer, 2005, pp. 36–54.
  34. K. I. Tsianos, I. A. Sucan, and L. E. Kavraki, “Sampling-based robot motion planning: Towards realistic applications,” Computer Science Review, vol. 1, no. 1, pp. 2–11, 2007.
  35. M. Elbanhawi and M. Simic, “Sampling-based robot motion planning: A review,” Ieee access, vol. 2, pp. 56–77, 2014.
  36. I. Noreen, A. Khan, and Z. Habib, “Optimal path planning using rrt* based approaches: a survey and future directions,” International Journal of Advanced Computer Science and Applications, vol. 7, no. 11, 2016.
  37. Z. Kingston, M. Moll, and L. E. Kavraki, “Sampling-based methods for motion planning with constraints,” Annual review of control, robotics, and autonomous systems, vol. 1, no. 1, pp. 159–185, 2018.
  38. K. Cai, C. Wang, J. Cheng, C. W. De Silva, and M. Q.-H. Meng, “Mobile robot path planning in dynamic environments: A survey,” arXiv preprint arXiv:2006.14195, 2020.
  39. J. R. Sanchez-Ibanez, C. J. Pérez-del Pulgar, and A. García-Cerezo, “Path planning for autonomous mobile robots: A review,” Sensors, vol. 21, no. 23, p. 7898, 2021.
  40. J. D. Gammell and M. P. Strub, “Asymptotically optimal sampling-based motion planning methods,” Annual Review of Control, Robotics, and Autonomous Systems, vol. 4, no. 1, pp. 295–318, 2021.
  41. A. Orthey, C. Chamzas, and L. E. Kavraki, “Sampling-based motion planning: A comparative review,” Annual Review of Control, Robotics, and Autonomous Systems, vol. 7, 2023.
  42. T. Xu, “Recent advances in rapidly-exploring random tree: A review,” Heliyon, 2024.
  43. S. Karaman and E. Frazzoli, “Sampling-based algorithms for optimal motion planning,” The International Journal of Robotics Research, vol. 30, no. 7, pp. 846–894, 2011.
  44. J. D. Gammell, T. D. Barfoot, and S. S. Srinivasa, “Informed sampling for asymptotically optimal path planning,” IEEE Transactions on Robotics, vol. 34, no. 4, pp. 966–984, 2018.
  45. J. Ding, Y. Zhou, X. Huang, K. Song, S. Lu, and L. Wang, “An improved rrt* algorithm for robot path planning based on path expansion heuristic sampling,” Journal of Computational Science, vol. 67, p. 101937, 2023.
  46. J. Wang, W. Chi, C. Li, C. Wang, and M. Q.-H. Meng, “Neural rrt*: Learning-based optimal path planning,” IEEE Transactions on Automation Science and Engineering, vol. 17, no. 4, pp. 1748–1758, 2020.
  47. J. Wang, T. Li, B. Li, and M. Q.-H. Meng, “Gmr-rrt*: Sampling-based path planning using gaussian mixture regression,” IEEE Transactions on Intelligent Vehicles, vol. 7, no. 3, pp. 789–800, 2022.
  48. J. Nasir, F. Islam, U. Malik, et al., “Rrt*-smart: A rapid convergence implementation of rrt*,” International Journal of Advanced Robotic Systems, vol. 10, no. 7, 2013.
  49. B. Sakcak, L. Bascetta, G. Ferretti, and M. Prandini, “Sampling-based optimal kinodynamic planning with motion primitives,” Autonomous Robots, vol. 43, no. 7, pp. 1715–1732, 2019.
  50. J. D. Gammell, S. S. Srinivasa, and T. D. Barfoot, “Batch informed trees (bit*): Sampling-based optimal planning via the heuristically guided search of implicit random geometric graphs,” in 2015 IEEE International Conference on Robotics and Automation (ICRA), 2015, pp. 3067–3074.
  51. J. D. Gammell, T. D. Barfoot, and S. S. Srinivasa, “Batch informed trees (bit*): Informed asymptotically optimal anytime search,” The International Journal of Robotics Research, vol. 39, no. 5, pp. 543–567, 2020.
  52. F. Yu and Y. Chen, “Cyl-irrt*: Homotopy optimal 3d path planning for auvs by biasing the sampling into a cylindrical informed subset,” IEEE Transactions on Industrial Electronics, vol. 70, no. 4, pp. 3985–3994, 2022.
  53. Z. Huang, H. Chen, J. Pohovey, and K. Driggs-Campbell, “Neural informed rrt*: Learning-based path planning with point cloud state representations under admissible ellipsoidal constraints,” 2024. [Online]. Available: https://arxiv.org/abs/2309.14595
  54. B. Ichter, J. Harrison, and M. Pavone, “Learning sampling distributions for robot motion planning,” in 2018 IEEE International Conference on Robotics and Automation (ICRA).   IEEE, 2018, pp. 7087–7094.
  55. D. Molina, K. Kumar, and S. Srivastava, “Learn and link: Learning critical regions for efficient planning,” in 2020 IEEE International Conference on Robotics and Automation (ICRA).   IEEE, 2020, pp. 10 605–10 611.
  56. C. Xiong, H. Zhou, D. Lu, Z. Zeng, L. Lian, and C. Yu, “Rapidly-exploring adaptive sampling tree*: a sample-based path-planning algorithm for unmanned marine vehicles information gathering in variable ocean environments,” Sensors, vol. 20, no. 9, p. 2515, 2020.
  57. K. Cai, C. Wang, S. Song, H. Chen, and M. Q.-H. Meng, “Risk-aware path planning under uncertainty in dynamic environments,” Journal of Intelligent & Robotic Systems, vol. 101, pp. 1–15, 2021.
  58. K. Cai, W. Chen, C. Wang, H. Zhang, and M. Q.-H. Meng, “Curiosity-based robot navigation under uncertainty in crowded environments,” IEEE Robotics and Automation Letters, vol. 8, no. 2, pp. 800–807, 2022.
  59. H.-T. Tak, C.-G. Park, and S.-C. Lee, “Improvement of rrt*-smart algorithm for optimal path planning and application of the algorithm in 2 & 3-dimension environment,” Journal of the Korean Society for Aviation and Aeronautics, vol. 27, no. 2, pp. 1–8, 2019.
  60. H. Suwoyo, A. Adriansyah, J. Andika, A. Ubaidillah, and M. F. Zakaria, “An integrated rrt* smart-a* algorithm for solving the global path planning problem in a static environment,” IIUM Engineering Journal, vol. 24, no. 1, pp. 269–284, 2023.
  61. A. Boeuf, J. Cortés, R. Alami, and T. Siméon, “Enhancing sampling-based kinodynamic motion planning for quadrotors,” in 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).   IEEE, 2015, pp. 2447–2452.
  62. C. K. Verginis, D. V. Dimarogonas, and L. E. Kavraki, “Kdf: Kinodynamic motion planning via geometric sampling-based algorithms and funnel control,” IEEE Transactions on robotics, vol. 39, no. 2, pp. 978–997, 2022.
  63. A. Atramentov and S. M. LaValle, “Efficient nearest neighbor searching for motion planning,” in Proceedings 2002 IEEE International Conference on Robotics and Automation, vol. 1.   IEEE, 2002, pp. 632–637.
  64. J. Pan, S. Chitta, and D. Manocha, “Faster sample-based motion planning using instance-based learning,” in Algorithmic Foundations of Robotics X: Proceedings of the Tenth Workshop on the Algorithmic Foundations of Robotics.   Springer, 2013, pp. 381–396.
  65. M. Kleinbort, O. Salzman, and D. Halperin, “Collision detection or nearest-neighbor search? on the computational bottleneck in sampling-based motion planning,” in Algorithmic Foundations of Robotics XII: Proceedings of the Twelfth Workshop on the Algorithmic Foundations of Robotics.   Springer, 2020, pp. 624–639.
  66. M. Kleinbort, E. Granados, K. Solovey, R. Bonalli, K. E. Bekris, and D. Halperin, “Refined analysis of asymptotically-optimal kinodynamic planning in the state-cost space,” in 2020 IEEE International Conference on Robotics and Automation (ICRA).   IEEE, 2020, pp. 6344–6350.
  67. L. Janson, E. Schmerling, A. Clark, and M. Pavone, “Fast marching tree: A fast marching sampling-based method for optimal motion planning in many dimensions,” The International journal of robotics research, vol. 34, no. 7, pp. 883–921, 2015.
  68. L. Janson, B. Ichter, and M. Pavone, “Deterministic sampling-based motion planning: Optimality, complexity, and performance,” The International Journal of Robotics Research, vol. 37, no. 1, pp. 46–61, 2018.
  69. M. Tsao, K. Solovey, and M. Pavone, “Sample complexity of probabilistic roadmaps via ε𝜀\varepsilonitalic_ε-nets,” in 2020 IEEE International Conference on Robotics and Automation (ICRA).   IEEE, 2020, pp. 2196–2202.
  70. C. Wang and M. Q.-H. Meng, “Variant step size rrt: An efficient path planner for uav in complex environments,” in 2016 IEEE International Conference on Real-time Computing and Robotics (RCAR).   IEEE, 2016, pp. 555–560.
  71. C. Wang, L. Meng, S. She, I. M. Mitchell, T. Li, F. Tung, W. Wan, M. Q.-H. Meng, and C. W. de Silva, “Autonomous mobile robot navigation in uneven and unstructured indoor environments,” in 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).   IEEE, 2017, pp. 109–116.
  72. Y. Zhang, R. Wang, C. Song, and J. Xu, “An improved dynamic step size rrt algorithm in complex environments,” in 2021 33rd Chinese Control and Decision Conference (CCDC).   IEEE, 2021, pp. 3835–3840.
  73. J. Yang, J. Tian, and T. Chao, “Variable step size strategy for rrt* algorithm,” in International Conference On Signal And Information Processing, Networking And Computers.   Springer, 2023, pp. 12–19.
  74. H. Shen, W.-F. Xie, J. Tang, and T. Zhou, “Adaptive manipulability-based path planning strategy for industrial robot manipulators,” IEEE/ASME Transactions on Mechatronics, vol. 28, no. 3, pp. 1742–1753, 2023.
  75. Q. Li, H. Zhao, M. Zhang, and Z. Sun, “A path planning algorithm for mobile robots based on dgabi-rrt,” in Intelligent Robotics and Applications: 14th International Conference, ICIRA 2021, Yantai, China, October 22–25, 2021, Proceedings, Part IV 14.   Springer, 2021, pp. 554–564.
  76. J. Kuffner and S. LaValle, “Rrt-connect: An efficient approach to single-query path planning,” in Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065), vol. 2, 2000, pp. 995–1001 vol.2.
  77. B. Akgun and M. Stilman, “Sampling heuristics for optimal motion planning in high dimensions,” in 2011 IEEE/RSJ international conference on intelligent robots and systems.   IEEE, 2011, pp. 2640–2645.
  78. M. Jordan and A. Perez, “Optimal bidirectional rapidly-exploring random trees,” Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, no. MIT-CSAIL-TR-2013-021, 2013.
  79. A. H. Qureshi and Y. Ayaz, “Intelligent bidirectional rapidly-exploring random trees for optimal motion planning in complex cluttered environments,” Robotics and Autonomous Systems, vol. 68, pp. 1–11, 2015.
  80. Z. Tahir, A. H. Qureshi, Y. Ayaz, and R. Nawaz, “Potentially guided bidirectionalized rrt* for fast optimal path planning in cluttered environments,” Robotics and Autonomous Systems, vol. 108, pp. 13–27, 2018.
  81. F. Burget, M. Bennewitz, and W. Burgard, “Bi 2 rrt*: An efficient sampling-based path planning framework for task-constrained mobile manipulation,” in 2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).   IEEE, 2016, pp. 3714–3721.
  82. D. Yi, M. A. Goodrich, and K. D. Seppi, “Homotopy-aware rrt*: Toward human-robot topological path-planning,” in Proceedings of the 2016 11th ACM/IEEE International Conference on Human-Robot Interaction (HRI).   IEEE, 2016.
  83. Z. Lin, Y. Li, J. Xiang, G. Ling, and F. Suo, “Bidirectional homotopy-guided rrt for path planning,” in 2020 16th International Conference on Control, Automation, Robotics and Vision (ICARCV).   IEEE, 2020, pp. 333–338.
  84. J. Wang, W. Chi, C. Li, and M. Q.-H. Meng, “Efficient robot motion planning using bidirectional-unidirectional rrt extend function,” IEEE Transactions on Automation Science and Engineering, vol. 19, no. 3, pp. 1859–1868, 2021.
  85. H. Liu, X. Zhang, J. Wen, R. Wang, and X. Chen, “Goal-biased bidirectional rrt based on curve-smoothing,” IFAC-PapersOnLine, vol. 52, no. 24, pp. 255–260, 2019.
  86. P. Xin, X. Wang, X. Liu, Y. Wang, Z. Zhai, and X. Ma, “Improved bidirectional rrt* algorithm for robot path planning,” Sensors, vol. 23, no. 2, p. 1041, 2023.
  87. S. M. LaValle and J. J. Kuffner, “Rapidly-exploring random trees: Progress and prospects: Steven m. lavalle, iowa state university, a james j. kuffner, jr., university of tokyo, tokyo, japan,” Algorithmic and computational robotics, pp. 303–307, 2001.
  88. R. Bohlin and L. Kavraki, “Path planning using lazy prm,” in Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065), vol. 1, 2000, pp. 521–528 vol.1.
  89. C. L. Nielsen and L. E. Kavraki, “A two level fuzzy prm for manipulation planning,” in Proceedings. 2000 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2000)(Cat. No. 00CH37113), vol. 3.   IEEE, 2000, pp. 1716–1721.
  90. K. Hauser, “Lazy collision checking in asymptotically-optimal motion planning,” in 2015 IEEE international conference on robotics and automation (ICRA).   IEEE, 2015, pp. 2951–2957.
  91. D. Kim, Y. Kwon, and S.-e. Yoon, “Adaptive lazy collision checking for optimal sampling-based motion planning,” in 2018 15th International Conference on Ubiquitous Robots (UR).   IEEE, 2018, pp. 320–327.
  92. J. Chase Kew, B. Ichter, M. Bandari, T.-W. E. Lee, and A. Faust, “Neural collision clearance estimator for batched motion planning,” in International Workshop on the Algorithmic Foundations of Robotics.   Springer, 2020, pp. 73–89.
  93. L. Janson, E. Schmerling, A. Clark, and M. Pavone, “Fast marching tree: a fast marching sampling-based method for optimal motion planning in many dimensions,” 2015. [Online]. Available: https://arxiv.org/abs/1306.3532
  94. A. H. Qureshi and Y. Ayaz, “Potential functions based sampling heuristic for optimal path planning,” Autonomous Robots, vol. 40, pp. 1079–1093, 2016.
  95. I.-B. Jeong, S.-J. Lee, and J.-H. Kim, “Quick-rrt*: Triangular inequality-based implementation of rrt* with improved initial solution and convergence rate,” Expert Systems with Applications, vol. 123, pp. 82–90, 2019.
  96. Y. Li, W. Wei, Y. Gao, D. Wang, and Z. Fan, “Pq-rrt*: An improved path planning algorithm for mobile robots,” Expert systems with applications, vol. 152, p. 113425, 2020.
  97. B. Liao, F. Wan, Y. Hua, R. Ma, S. Zhu, and X. Qing, “F-rrt*: An improved path planning algorithm with improved initial solution and convergence rate,” Expert Systems with Applications, vol. 184, p. 115457, 2021.
  98. Q. Li, J. Wang, H. Li, B. Wang, and C. Feng, “Fast-rrt*: An improved motion planner for mobile robot in two-dimensional space,” IEEJ Transactions on Electrical and Electronic Engineering, vol. 17, no. 2, pp. 200–208, 2022.
  99. D. Armstrong and A. Jonasson, “Am-rrt*: Informed sampling-based planning with assisting metric,” in 2021 IEEE International Conference on Robotics and Automation (ICRA).   IEEE, 2021, pp. 10 093–10 099.
  100. H. Wanga, X. Liu, S. Song, B. Li, X. Lu, J. Nie, and X. Zhao, “Improved rrt path planning algorithm based on growth evaluation,” in International Conference on Intelligent Equipment and Special Robots (ICIESR 2021), vol. 12127.   SPIE, 2021, pp. 521–527.
  101. C. Urmson and R. Simmons, “Approaches for heuristically biasing rrt growth,” in Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003)(Cat. No. 03CH37453), vol. 2.   IEEE, 2003, pp. 1178–1183.
  102. S. Koenig, M. Likhachev, and D. Furcy, “Lifelong planning a*,” Artificial Intelligence, vol. 155, no. 1-2, pp. 93–146, 2004.
  103. M. P. Strub and J. D. Gammell, “Advanced bit*(abit*): Sampling-based planning with advanced graph-search techniques,” in 2020 IEEE International Conference on Robotics and Automation (ICRA).   IEEE, 2020, pp. 130–136.
  104. L. Chen, L. Yu, S. Libin, and Z. Jiwen, “Greedy bit*(gbit*): greedy search policy for sampling-based optimal planning with a faster initial solution and convergence,” in 2021 International Conference on Computer, Control and Robotics (ICCCR).   IEEE, 2021, pp. 30–36.
  105. M. P. Strub and J. D. Gammell, “Adaptively informed trees (ait*) and effort informed trees (eit*): Asymmetric bidirectional sampling-based path planning,” The International Journal of Robotics Research, vol. 41, no. 4, pp. 390–417, 2022.
  106. V. N. Hartmann, M. P. Strub, M. Toussaint, and J. D. Gammell, “Effort informed roadmaps (eirm*): Efficient asymptotically optimal multiquery planning by actively reusing validation effort,” in The International Symposium of Robotics Research.   Springer, 2022, pp. 555–571.
  107. C. Li, H. Ma, P. Xu, J. Wang, and M. Q.-H. Meng, “Biait*: Symmetrical bidirectional optimal path planning with adaptive heuristic,” IEEE Transactions on Automation Science and Engineering, pp. 1–13, 2023.
  108. O. Arslan and P. Tsiotras, “Use of relaxation methods in sampling-based algorithms for optimal motion planning,” in 2013 IEEE International Conference on Robotics and Automation.   IEEE, 2013, pp. 2421–2428.
  109. ——, “Dynamic programming guided exploration for sampling-based motion planning algorithms,” in 2015 IEEE International Conference on Robotics and Automation (ICRA), Seattle, WA, USA, 2015, pp. 4819–4826.
  110. M. Otte and E. Frazzoli, “Rrtx: Asymptotically optimal single-query sampling-based motion planning with quick replanning,” The International Journal of Robotics Research, vol. 35, no. 7, pp. 797–822, 2016.
  111. K. Naderi, J. Rajamäki, and P. Hämäläinen, “Rt-rrt* a real-time path planning algorithm based on rrt,” in Proceedings of the 8th ACM SIGGRAPH Conference on Motion in Games, 2015, pp. 113–118.
  112. J.-G. Kang, D.-W. Lim, Y.-S. Choi, W.-J. Jang, and J.-W. Jung, “Improved rrt-connect algorithm based on triangular inequality for robot path planning,” Sensors, vol. 21, no. 2, p. 333, 2021.
  113. J.-G. Kang and J.-W. Jung, “Post triangular rewiring method for shorter rrt robot path planning,” arXiv preprint arXiv:2107.05344, 2021.
  114. C.-H. Wei and J.-S. Liu, “Hybridizing rrt and variable-length genetic algorithm for smooth path generation,” in 2011 IEEE International Conference on Robotics and Biomimetics.   IEEE, 2011, pp. 626–632.
  115. R. Mashayekhi, M. Y. I. Idris, M. H. Anisi, and I. Ahmedy, “Hybrid rrt: A semi-dual-tree rrt-based motion planner,” IEEE Access, vol. 8, pp. 18 658–18 668, 2020.
  116. S. Al-Ansarry and S. Al-Darraji, “Hybrid rrt-a*: An improved path planning method for an autonomous mobile robots.” Iraqi Journal for Electrical & Electronic Engineering, vol. 17, no. 1, 2021.
  117. F. Kiani, A. Seyyedabbasi, R. Aliyev, M. U. Gulle, H. Basyildiz, and M. A. Shah, “Adapted-rrt: novel hybrid method to solve three-dimensional path planning problem using sampling and metaheuristic-based algorithms,” Neural Computing and Applications, vol. 33, no. 22, pp. 15 569–15 599, 2021.
  118. M. A. R. Pohan and J. Utama, “Efficient sampling-based for mobile robot path planning in a dynamic environment based on the rapidly-exploring random tree and a rule-template sets,” International Journal of Engineering, vol. 36, no. 4, pp. 797–806, 2023.
  119. L. Cao, L. Wang, Y. Liu, and S. Yan, “3d trajectory planning based on the rapidly-exploring random tree–connect and artificial potential fields method for unmanned aerial vehicles,” International Journal of Advanced Robotic Systems, vol. 19, no. 5, p. 17298806221118867, 2022.
  120. O. Khatib, “Real-time obstacle avoidance for manipulators and mobile robots,” The international journal of robotics research, vol. 5, no. 1, pp. 90–98, 1986.
  121. Z. Wang, K. Wang, and S. An, “Cubic b-spline interpolation and realization,” in Information Computing and Applications: Second International Conference, ICICA 2011, Qinhuangdao, China, October 28-31, 2011. Proceedings, Part I 2.   Springer, 2011, pp. 82–89.
  122. X. Zhang, T. Zhu, L. Du, Y. Hu, and H. Liu, “Local path planning of autonomous vehicle based on an improved heuristic bi-rrt algorithm in dynamic obstacle avoidance environment,” Sensors, vol. 22, no. 20, p. 7968, 2022.
  123. Q. Zou, X. Du, Y. Liu, H. Chen, Y. Wang, and J. Yu, “Dynamic path planning and motion control of microrobotic swarms for mobile target tracking,” IEEE Transactions on Automation Science and Engineering, vol. 20, no. 4, pp. 2454–2468, 2023.
  124. R. Seif and M. A. Oskoei, “Mobile robot path planning by rrt* in dynamic environments,” International journal of intelligent systems and applications, vol. 7, no. 5, p. 24, 2015.
  125. D. Connell and H. M. La, “Dynamic path planning and replanning for mobile robots using rrt*,” in 2017 IEEE International Conference on Systems, Man, and Cybernetics (SMC).   IEEE, 2017, pp. 1429–1434.
  126. J. Qi, H. Yang, and H. Sun, “Mod-rrt*: A sampling-based algorithm for robot path planning in dynamic environment,” IEEE Transactions on Industrial Electronics, vol. 68, no. 8, pp. 7244–7251, 2021.
  127. P. Zhao, Y. Chang, W. Wu, H. Luo, Z. Zhou, Y. Qiao, Y. Li, C. Zhao, Z. Huang, B. Liu, et al., “Dynamic rrt: fast feasible path planning in randomly distributed obstacle environments,” Journal of Intelligent & Robotic Systems, vol. 107, no. 4, p. 48, 2023.
  128. O. Adiyatov and H. A. Varol, “A novel rrt*-based algorithm for motion planning in dynamic environments,” in 2017 IEEE International Conference on Mechatronics and Automation (ICMA).   IEEE, 2017, pp. 1416–1421.
  129. K. Wei and B. Ren, “A method on dynamic path planning for robotic manipulator autonomous obstacle avoidance based on an improved rrt algorithm,” Sensors, vol. 18, no. 2, p. 571, 2018.
  130. K. Cai, C. Wang, C. Li, S. Song, and M. Q.-H. Meng, “Adaptive sampling for human-aware path planning in dynamic environments,” in 2019 IEEE International Conference on Robotics and Biomimetics (ROBIO).   IEEE, 2019, pp. 1987–1994.
  131. C. Yuan, G. Liu, W. Zhang, and X. Pan, “An efficient rrt cache method in dynamic environments for path planning,” Robotics and Autonomous Systems, vol. 131, p. 103595, 2020.
  132. W. Chi and M. Q.-H. Meng, “Risk-rrt*: A robot motion planning algorithm for the human robot coexisting environment,” in 2017 18th International Conference on Advanced Robotics (ICAR).   IEEE, 2017, pp. 583–588.
  133. W. Chi, C. Wang, J. Wang, and M. Q.-H. Meng, “Risk-dtrrt-based optimal motion planning algorithm for mobile robots,” IEEE Transactions on Automation Science and Engineering, vol. 16, no. 3, pp. 1271–1288, 2018.
  134. K. Cai, W. Chen, D. Dugas, R. Siegwart, and J. J. Chung, “Sampling-based path planning in highly dynamic and crowded pedestrian flow,” IEEE Transactions on Intelligent Transportation Systems, 2023.
  135. K. Cai, W. Chen, C. Wang, S. Song, and M. Q.-H. Meng, “Human-aware path planning with improved virtual doppler method in highly dynamic environments,” IEEE Transactions on Automation Science and Engineering, vol. 20, no. 2, pp. 1304–1321, 2022.
  136. Y. Tian, L. Yan, G.-Y. Park, S. Yang, Y.-S. Kim, S.-R. Lee, and C.-Y. Lee, “Application of rrt-based local path planning algorithm in unknown environment,” 2007 International Symposium on Computational Intelligence in Robotics and Automation, pp. 456–460, 2007.
  137. L. Chang-an, C. Jin-gang, L. Guo-dong, and L. Chun-yang, “Mobile robot path planning based on an improved rapidly-exploring random tree in unknown environment,” in 2008 IEEE International Conference on Automation and Logistics.   IEEE, 2008, pp. 2375–2379.
  138. J. Li, C. Li, T. Chen, and Y. Zhang, “Improved rrt algorithm for auv target search in unknown 3d environment,” Journal of Marine Science and Engineering, vol. 10, no. 6, p. 826, 2022.
  139. B. Lindqvist, A. Patel, K. Löfgren, and G. Nikolakopoulos, “A tree-based next-best-trajectory method for 3d uav exploration,” IEEE Transactions on Robotics, 2024.
  140. R. Pepy and A. Lambert, “Safe path planning in an uncertain-configuration space using rrt,” in 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems.   IEEE, 2006, pp. 5376–5381.
  141. Y. Huang and K. Gupta, “Rrt-slam for motion planning with motion and map uncertainty for robot exploration,” in 2008 IEEE/RSJ International Conference on Intelligent Robots and Systems.   IEEE, 2008, pp. 1077–1082.
  142. B. D. Luders and J. P. How, “An optimizing sampling-based motion planner with guaranteed robustness to bounded uncertainty,” in 2014 American Control Conference.   IEEE, 2014, pp. 771–777.
  143. T. Summers, “Distributionally robust sampling-based motion planning under uncertainty,” in 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).   IEEE, 2018, pp. 6518–6523.
  144. B. Englot, T. Shan, S. D. Bopardikar, and A. Speranzon, “Sampling-based min-max uncertainty path planning,” in 2016 IEEE 55th Conference on Decision and Control (CDC).   IEEE, 2016, pp. 6863–6870.
  145. H. Banzhaf, L. Palmieri, D. Nienhüser, T. Schamm, S. Knoop, and J. M. Zöllner, “Hybrid curvature steer: A novel extend function for sampling-based nonholonomic motion planning in tight environments,” in 2017 IEEE 20th International Conference on Intelligent Transportation Systems (ITSC).   IEEE, 2017, pp. 1–8.
  146. J. Peng, Y. Chen, Y. Duan, Y. Zhang, J. Ji, and Y. Zhang, “Towards an online rrt-based path planning algorithm for ackermann-steering vehicles,” in 2021 IEEE International Conference on Robotics and Automation (ICRA).   IEEE, 2021, pp. 7407–7413.
  147. R. Reyes, I. Becerra, R. Murrieta-Cid, and S. Hutchinson, “Visual-rrt: Integrating ibvs as a steering method in an rrt planner,” Robotics and Autonomous Systems, vol. 169, p. 104525, 2023.
  148. Y. Gan, B. Zhang, C. Ke, X. Zhu, W. He, and T. Ihara, “Research on robot motion planning based on rrt algorithm with nonholonomic constraints,” Neural Processing Letters, vol. 53, pp. 3011–3029, 2021.
  149. Y. Dong, E. Camci, and E. Kayacan, “Faster rrt-based nonholonomic path planning in 2d building environments using skeleton-constrained path biasing,” Journal of Intelligent & Robotic Systems, vol. 89, pp. 387–401, 2018.
  150. Y. Chen, M. Liu, and L. Wang, “Rrt* combined with gvo for real-time nonholonomic robot navigation in dynamic environment,” in 2018 IEEE International Conference on Real-time Computing and Robotics (RCAR).   IEEE, 2018, pp. 479–484.
  151. J. J. Park and B. Kuipers, “Feedback motion planning via non-holonomic rrt* for mobile robots,” in 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).   IEEE, 2015, pp. 4035–4040.
  152. Y. Zhang and D. Gong, “S-brrt*: A spline-based bidirectional rrt with strategies under nonholonomic constraint,” in 2021 33rd Chinese Control and Decision Conference (CCDC).   IEEE, 2021, pp. 1753–1758.
  153. D. J. Webb and J. v. d. Berg, “Kinodynamic rrt*: Optimal motion planning for systems with linear differential constraints,” arXiv preprint arXiv:1205.5088, 2012.
  154. Y. Li, R. Cui, Z. Li, and D. Xu, “Neural network approximation based near-optimal motion planning with kinodynamic constraints using rrt,” IEEE Transactions on Industrial Electronics, vol. 65, no. 11, pp. 8718–8729, 2018.
  155. H.-T. L. Chiang, J. Hsu, M. Fiser, L. Tapia, and A. Faust, “Rl-rrt: Kinodynamic motion planning via learning reachability estimators from rl policies,” IEEE Robotics and Automation Letters, vol. 4, no. 4, pp. 4298–4305, 2019.
  156. M. Yavari, K. Gupta, and M. Mehrandezh, “Lazy steering rrt*: An optimal constrained kinodynamic neural network based planner with no in-exploration steering,” in 2019 19th International Conference on Advanced Robotics (ICAR).   IEEE, 2019, pp. 400–407.
  157. D. Zheng and P. Tsiotras, “Accelerating kinodynamic rrt* through dimensionality reduction,” in 2021 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).   IEEE, 2021, pp. 3674–3680.
  158. D. Berenson, S. S. Srinivasa, D. Ferguson, and J. J. Kuffner, “Manipulation planning on constraint manifolds,” in 2009 IEEE international conference on robotics and automation.   IEEE, 2009, pp. 625–632.
  159. C. Suh, T. T. Um, B. Kim, H. Noh, M. Kim, and F. C. Park, “Tangent space rrt: A randomized planning algorithm on constraint manifolds,” in 2011 IEEE International Conference on Robotics and Automation.   IEEE, 2011, pp. 4968–4973.
  160. L. Jaillet and J. M. Porta, “Path planning under kinematic constraints by rapidly exploring manifolds,” IEEE Transactions on Robotics, vol. 29, no. 1, pp. 105–117, 2012.
  161. ——, “Efficient asymptotically-optimal path planning on manifolds,” Robotics and Autonomous Systems, vol. 61, no. 8, pp. 797–807, 2013.
  162. ——, “Path planning with loop closure constraints using an atlas-based rrt,” in Robotics Research: The 15th International Symposium ISRR.   Springer, 2017, pp. 345–362.
  163. B. Kim, T. T. Um, C. Suh, and F. C. Park, “Tangent bundle rrt: A randomized algorithm for constrained motion planning,” Robotica, vol. 34, no. 1, pp. 202–225, 2016.
  164. L. Han, L. Rudolph, J. Blumenthal, and I. Valodzin, “Convexly stratified deformation spaces and efficient path planning for planar closed chains with revolute joints,” The International Journal of Robotics Research, vol. 27, no. 11-12, pp. 1189–1212, 2008.
  165. T. A. McMahon, “Sampling based motion planning with reachable volumes,” Ph.D. dissertation, 2016.
  166. I. A. Şucan and S. Chitta, “Motion planning with constraints using configuration space approximations,” in 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems.   IEEE, 2012, pp. 1904–1910.
  167. F. Burget, A. Hornung, and M. Bennewitz, “Whole-body motion planning for manipulation of articulated objects,” in 2013 IEEE International Conference on Robotics and Automation.   IEEE, 2013, pp. 1656–1662.
  168. B. Cain, M. Kalaitzakis, and N. Vitzilaios, “Mk-rrt*: Multi-robot kinodynamic rrt trajectory planning,” in 2021 International Conference on Unmanned Aircraft Systems (ICUAS).   IEEE, 2021, pp. 868–876.
  169. J. Hvězda, M. Kulich, and L. Přeučil, “Improved discrete rrt for coordinated multi-robot planning,” arXiv preprint arXiv:1901.07363, 2019.
  170. Z. Bing, A. Rohregger, F. Walter, Y. Huang, P. Lucas, F. O. Morin, K. Huang, and A. Knoll, “Lateral flexion of a compliant spine improves motor performance in a bioinspired mouse robot,” Science Robotics, vol. 8, no. 85, 2023.
  171. L. Zhang, Z. Lin, J. Wang, and B. He, “Rapidly-exploring random trees multi-robot map exploration under optimization framework,” Robotics and Autonomous Systems, vol. 131, p. 103565, 2020.
  172. A. Adler, M. De Berg, D. Halperin, and K. Solovey, “Efficient multi-robot motion planning for unlabeled discs in simple polygons,” in Algorithmic Foundations of Robotics XI: Selected Contributions of the Eleventh International Workshop on the Algorithmic Foundations of Robotics.   Springer, 2015, pp. 1–17.
  173. K. Solovey, O. Salzman, and D. Halperin, “Finding a needle in an exponential haystack: Discrete rrt for exploration of implicit roadmaps in multi-robot motion planning,” The International Journal of Robotics Research, vol. 35, no. 5, pp. 501–513, 2016.
  174. R. Shome, K. Solovey, A. Dobson, D. Halperin, and K. E. Bekris, “drrt*: Scalable and informed asymptotically-optimal multi-robot motion planning,” Autonomous Robots, vol. 44, no. 3, pp. 443–467, 2020.
  175. J. Sim, J. Kim, and C. Nam, “Safe interval rrt* for scalable multi-robot path planning in continuous space,” arXiv preprint arXiv:2404.01752, 2024.
  176. L. Zhou, J. Ding, and X. Fan, “An adaptive rrt algorithm based on narrow passage recognition for assembly path planning,” in 2023 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM).   IEEE, 2023, pp. 0203–0208.
  177. A. Belaid, B. Mendil, and A. Djenadi, “Narrow passage rrt*: a new variant of rrt,” International Journal of Computational Vision and Robotics, vol. 12, no. 1, pp. 85–100, 2022.
  178. Q. Chai and Y. Wang, “Rj-rrt: improved rrt for path planning in narrow passages,” Applied Sciences, vol. 12, no. 23, p. 12033, 2022.
  179. X. Shu, F. Ni, Z. Zhou, Y. Liu, H. Liu, and T. Zou, “Locally guided multiple bi-rrt* for fast path planning in narrow passages,” in 2019 IEEE International Conference on Robotics and Biomimetics (ROBIO).   IEEE, 2019, pp. 2085–2091.
  180. J. Szkandera, I. Kolingerová, and M. Maňák, “Narrow passage problem solution for motion planning,” in Computational Science–ICCS 2020: 20th International Conference, Amsterdam, The Netherlands, June 3–5, 2020, Proceedings, Part I 20.   Springer, 2020, pp. 459–470.
  181. W. Wang, L. Zuo, and X. Xu, “A learning-based multi-rrt approach for robot path planning in narrow passages,” Journal of Intelligent & Robotic Systems, vol. 90, pp. 81–100, 2018.
  182. F. Islam, J. Nasir, U. Malik, Y. Ayaz, and O. Hasan, “Rrt*-smart: Rapid convergence implementation of rrt* towards optimal solution,” in 2012 IEEE International Conference on Mechatronics and Automation.   IEEE, 2012, pp. 1651–1656.
  183. L. Jaillet, A. Yershova, S. La Valle, and T. Simeon, “Adaptive tuning of the sampling domain for dynamic-domain rrts,” in 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2005, pp. 2851–2856.
  184. D. Ferguson and A. Stentz, “Anytime rrts,” in 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems.   IEEE, 2006, pp. 5369–5375.
  185. L. Jaillet, J. Cortes, and T. Simeon, “Transition-based rrt for path planning in continuous cost spaces,” in 2008 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2008, pp. 2145–2150.
  186. T. T. Um, B. Kim, C. Suh, and F. C. Park, “Tangent space rrt with lazy projection: An efficient planning algorithm for constrained motions,” in Advances in Robot Kinematics: Motion in Man and Machine: Motion in Man and Machine.   Springer, 2010, pp. 251–260.
  187. R. Kang, H. Liu, and Z. Wang, “Fast convergence rrt for asymptotically-optimal motion planning,” in 2016 IEEE International Conference on Robotics and Biomimetics (ROBIO).   IEEE, 2016, pp. 2111–2116.
  188. C. Wong, E. Yang, X.-T. Yan, and D. Gu, “Optimal path planning based on a multi-tree t-rrt* approach for robotic task planning in continuous cost spaces,” in 2018 12th France-Japan and 10th Europe-Asia Congress on Mechatronics.   IEEE, 2018, pp. 242–247.
  189. S. Primatesta, A. Osman, and A. Rizzo, “MP-RRT#: A model predictive sampling-based motion planning algorithm for unmanned aircraft systems,” Journal of Intelligent and Robotic Systems, vol. 103, p. 59, 2021. [Online]. Available: https://doi.org/10.1007/s10846-021-01501-3
  190. X. Liao, Z. Zhu, H. Tang, and W. Zhang, “F-rrt: Fast rrt algorithm for path planning in dynamic environments,” International Journal of Advanced Robotic Systems, vol. 18, no. 1, pp. 1–12, 2021.
  191. O. Khattab, A. Yasser, M. A. Jaradat, and L. Romdhane, “Intelligent adaptive rrt* path planning algorithm for mobile robots,” in 2023 Advances in Science and Engineering Technology International Conferences (ASET), 2023, pp. 01–06.
  192. Z. Lv, H. Zhang, and W. Liu, “Gmm-rrt for kiwifruit picking path planning,” Journal of Agricultural Robotics, pp. 1–15, 2023.
  193. A. Saccuti, R. Monica, and J. Aleotti, “Protamp-rrt: A probabilistic integrated task and motion planner based on rrt,” IEEE Robotics and Automation Letters, vol. 8, no. 12, pp. 8398–8405, 2023.
  194. J. Ortiz-Haro, W. Hönig, V. N. Hartmann, M. Toussaint, and L. Righetti, “idb-rrt: Sampling-based kinodynamic motion planning with motion primitives and trajectory optimization,” 2024. [Online]. Available: https://arxiv.org/abs/2403.10745
  195. M. Moll, I. A. Sucan, and L. E. Kavraki, “Benchmarking motion planning algorithms: An extensible infrastructure for analysis and visualization,” IEEE Robotics & Automation Magazine, vol. 22, no. 3, pp. 96–102, 2015.
  196. J. D. Gammell, M. P. Strub, and V. N. Hartmann, “Planner developer tools (pdt): Reproducible experiments and statistical analysis for developing and testing motion planners,” in Proceedings of the Workshop on Evaluating Motion Planning Performance (EMPP), IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), 2022.
  197. R. Diankov, “Automated construction of robotic manipulation programs,” PhD Thesis, Carnegie Mellon University, 2010.
  198. I. A. Sucan, M. Moll, and L. E. Kavraki, “The open motion planning library,” IEEE Robotics & Automation Magazine, vol. 19, no. 4, pp. 72–82, 2012.

Summary

No one has generated a summary of this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Sign Up to Summarize

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now

Collections

Sign up for free to add this paper to one or more collections.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up