Bing Hao and Zheping Yan


  1. [1] L.E. Kavraki, P. ˇSvestka, J.C. Latombe, et al., Probabilisticroadmaps for path planning in high-dimensional configurationspaces, IEEE Transactions on Robotics and Automation, 12(4),1996, 566–580.
  2. [2] L.K. Dale and N.M. Amato, Probabilistic roadmaps-puttingit all together, IEEE Int. Conf. on Robotics and Automation(2001 ICRA), IEEE, Seoul, South Korea, 2001, 2, 1940–1947.
  3. [3] P.O. Pettersson and P. Doherty, Probabilistic roadmap basedpath planning for an autonomous unmanned helicopter, Journalof Intelligent & Fuzzy Systems, 17(4), 2006, 395–405.
  4. [4] S.M. LaValle, Planning algorithms (Cambridge: CambridgeUniversity Press, 2006).
  5. [5] Z. Feng, A novel path planning for robots based on rapidly-exploring random tree and particle swarm optimizer algorithm,IAES International Journal of Robotics and Automation, 3(2),2014, 107.
  6. [6] E. Frazzoli, M.A. Dahleh, and E. Feron, Real-time motionplanning for agile autonomous vehicles, Journal of Guidance,Control, and Dynamics, 25(1), 2002, 116–129.
  7. [7] S. Griffiths, J. Saunders, A. Curtis, et al., Maximizing miniatureaerial vehicles, Robotics & Automation Magazine, 13(3), 2006,34–43.
  8. [8] F. Qu, D. Ren, J. Wang, et al., An ensemble successiveproject algorithm for liquor detection using near infrared sensor,Sensors, 16(1), 2016, 89.
  9. [9] E. Rippel, A. Bar-Gill, and N. Shimkin, Fast graph-searchalgorithms for general-aviation flight trajectory generation,Journal of Guidance, Control, and Dynamics, 28(4), 2005:801–811.
  10. [10] D. Ferguson and A. Stentz, Using interpolation to improve pathplanning: The Field D algorithm Journal of Field Robotics,23(2), 2006, 79–101.
  11. [11] J.P. Gonzalez and A.T. Stentz, Planning with uncertainty inposition an optimal and efficient planner, 2005 IEEE/RSJ Int.Conf. on Intelligent Robots and Systems (IROS 2005), IEEE,Edmonton, Alta., Canada, 2005, 2435–2442.
  12. [12] P. Yan, M. Ding, C. Zhou, et al., A path replanning algorithmbased on roadmap-diagram, Fifth World Congress on Intelligent Control and Automation, 2004 (WCICA 2004), IEEE,2004, 3, 2433–2437.
  13. [13] L.E. Dubins, On curves of minimal length with a constrainton average curvature, and with prescribed initial and terminalpositions and tangents, American Journal of Mathematics,79(3), 1957, 497–516.
  14. [14] Z. Said and K. Sundaraj, Simulation of nonholonomic trajectoryfor a car-like mobile platform using Dubins shortest path model,2011 IEEE Conf. on Sustainable Utilization and Developmentin Engineering and Technology (STUDENT), IEEE, Semenyih,Malaysia, 2011, 127–132.
  15. [15] S. Ren, H. Yu, L. Wang, et al., Clustering detection algorithm ofplant leaf relative lesion area based on improved GA, IntelligentAutomation & Soft Computing, 22(2), 2015, 249–254.
  16. [16] D.J. Grymin and A.L. Crassidis, Simplified model developmentand trajectory determination for a UAV using Dubins set,AIAA Atmospheric Flight Mechanics Conference, Chicago,Illinois, 2009, 6050.
  17. [17] S. Jeyaraman, A. Tsourdos, and B. White, Formal techniquesfor the modelling and validation of a co-operating UAV teamthat uses Dubins set for path planning, Proc. of the AmericanControl Conference, IEEE, Portland, USA, 2005, 4690–4695.
  18. [18] R.W. Beard and T.W. McLain, Implementing Dubins airplanepaths on fixed-wing UAVs, Contributed Chapter to the SpringerHandbook for Unmanned Aerial Vehicles, 2013.
  19. [19] D.J. Webb and J. van den Berg, Kinodynamic RRT: Asymptotically optimal motion planning for robots with linear dynamics, 2013 IEEE Int. Conf. on Robotics and Automation(ICRA), IEEE, Karlsruhe, Germany, 2013, 5054–5061.

Important Links:

Go Back