This content is not included in your SAE MOBILUS subscription, or you are not logged in.
Path Planning Algorithm of Intelligent Vehicle Based on Improved Visibility Graphs
ISSN: 0148-7191, e-ISSN: 2688-3627
Published August 07, 2018 by SAE International in United States
This content contains downloadable datasetsAnnotation ability available
Presently, the visibility graphs algorithm is mainly applied for path planning of indoor mobile robot. It only considers the constraints such as travelling time and move distance. The road lane and vehicle dynamics constraints are not deal with usually. In this paper, a local path planning algorithm based on improved visibility graphs is proposed for intelligent vehicle on structured road. First, free state space (FSS) is established based on ago-vehicle state, road lane and traffic condition for permitting ago-vehicle move safely. In FSS, the vehicle’s maneuver in preview distance can be inferred and the local target point can be designated. Next, sampling points is created in FSS. Combined with local target point, initial point and sampling points, road network can be generated consequently. Then, the approachable path in the road network are evaluated by constrains of the Euclidean distance and the vehicle dynamics constraints. In this way the unique shortest path satisfying the constraints are generated as an optimal path. Finally, the efficiency and performance of the algorithm are validated by simulation results. The comparison results with RRT algorithm show that, the planned path achieved by improved visibility graphs has shorter travel distance and lower curvature, which shows more superior advantage for the path planning of intelligent vehicle than RRT.
CitationWei, H., "Path Planning Algorithm of Intelligent Vehicle Based on Improved Visibility Graphs," SAE Technical Paper 2018-01-1581, 2018, https://doi.org/10.4271/2018-01-1581.
Data Sets - Support Documents
|[Unnamed Dataset 1]|
- Kambhampati, S. and Davis, L.S., “Multi Resolution Path Planning for Mobile Robots,” IEEE Journal on Robotics & Automation 2(3):135-145, 1986.
- Hachour, O., “Path Planning of Autonomous Mobile Robot,” International Journal of Systems Applications, Engineering & Development 2(4):178-190, 2008.
- Duchoň, F., Babinec, A., Kajan, M. et al., “Path Planning with Modified a Star Algorithm for a Mobile Robot,” Procedia Engineering 96(96):59-69, 2014.
- Li, G., Yamashita, A., Asama, H. et al., “An Efficient Improved Artificial Potential Field Based Regression Search Method for Robot Path Planning,” International Conference on Mechatronics and Automation, IEEE, 2012, 1227-1232.
- Karaman, S. and Frazzoli, E., Sampling-Based Algorithms for Optimal Motion Planning (Sage Publications, Inc., 2011).
- Ma, L., Xue, J., Kawabata, K. et al., “Efficient Sampling-Based Motion Planning for On-Road Autonomous Driving,” IEEE Transactions on Intelligent Transportation Systems 16(4):1961-1976, 2015.
- Karaman, S. and Frazzoli, E., “Incremental Sampling-Based Algorithms for Optimal Motion Planning,” Robotics Science and Systems VI 104, 2010.
- Tuncer, A. and Yildirim, M., “Dynamic Path Planning of Mobile Robots with Improved Genetic Algorithm,” Computers & Electrical Engineering 38(6):1564-1572, 2012.
- Gong, D., Zhang, J., and Zhang, Y., “Multi-Objective Particle Swarm Optimization for Robot Path Planning in Environment with Danger Sources,” Journal of Computers 6(8):1554-1561, 2011.
- García, M.A.P., Montiel, O., Castillo, O. et al., “Optimal Path Planning for Autonomous Mobile Robot Navigation Using Ant Colony Optimization and a Fuzzy Cost Function Evaluation,” Applied Soft Computing 9(3):1102-1110, 2009.
- Xiao, J., Michalewicz, Z., Zhang, L. et al., “Adaptive Evolutionary Planner/Navigator for Mobile Robots,” IEEE Transactions on Evolutionary Computation 1(1):18-28, 1997.
- Lozano-Pérez, T. and Wesley, M.A., “An Algorithm for Planning Collision-Free Paths among Polyhedral Obstacles,” Communications of the ACM 22(10):560-570, 1979.
- Oommen, B.J., Iyengar, S.S., Rao, N.S.V. et al., “Robot Navigation in Unknown Terrains Using Learned Visibility Graphs. Part I: The Disjoint Convex Obstacle Case,” IEEE Journal of Robotics and Automation 3(6):672-681, 1987.
- Lunhui, X., Qiang, L., Jianwei, W. et al., “Research on Car - Following Model Based on Minimum Safe Distance,” Journal of Highway and Transportation Research and Development 27(10):95-100, 2010.
- Feng, Y., “Research on Control Method of Intelligent Vehicle Track and Automatic Overtrapping,” Jilin University, 2005.
- Wang, J., Sun, Y., Liu, Z. et al., “Route Planning Based on Floyd Algorithm for Intelligence Transportation System,” IEEE International Conference on Integration Technology, IEEE, 2007, 544-546.
- Queir, E., Martins, V., Margarida, M. et al., “A New Improvement for a K Shortest Paths Algorithm,” APDIO - Associação Portuguesa de Investigação Operacional 21, 2001.
- Elbanhawi, M., Simic, M., and Jazar, R.N., “Continuous Path Smoothing for Car-Like Robots Using B-Spline Curves,” Journal of Intelligent & Robotic Systems 80(1):23-56, 2015.