
浏览全部资源
扫码关注微信
1. 北京航空航天大学计算机学院,北京 100191
2. 北京航空航天大学人工智能研究院,北京 100191
[ "王雨倩(1999− ),女,北京航空航天大学计算机学院硕士生,主要研究方向为无人系统智能算法" ]
[ "丁嵘(1975− ),男,博士,北京航空航天大学人工智能研究院博士生导师,主要研究方向为软件工程、自主无人系统、群体智能等" ]
网络出版日期:2022-06,
纸质出版日期:2022-06-15
移动端阅览
王雨倩, 丁嵘. 基于群体智能成果的路径规划程序自动生成系统[J]. 智能科学与技术学报, 2022,4(2):255-263.
Yuqian WANG, Rong DING. Automatic path planning program generation system based on swarm intelligence results[J]. Chinese journal of intelligent science and technology, 2022, 4(2): 255-263.
王雨倩, 丁嵘. 基于群体智能成果的路径规划程序自动生成系统[J]. 智能科学与技术学报, 2022,4(2):255-263. DOI: 10.11959/j.issn.2096-6652.202228.
Yuqian WANG, Rong DING. Automatic path planning program generation system based on swarm intelligence results[J]. Chinese journal of intelligent science and technology, 2022, 4(2): 255-263. DOI: 10.11959/j.issn.2096-6652.202228.
路径规划算法被广泛地应用于各种运动规划任务,如机器人运动、自动驾驶等。迄今为止,许多优秀的路径规划算法被提出并被应用于不同领域。对于一个特定的任务环境,选择合适的路径规划算法能更高效地规划出满足约束条件的较优路径。基于群体智能成果,以遗传编程算法为框架,研究快速扩展随机树(RRT)路径规划算法及其变种RRT-Star路径规划算法、RRT-Star-Smart路径规划算法在不同任务环境下的适应度及路径规划效率,设计出一个路径规划程序自动生成系统。该系统能自主分析当前环境地图特征,并结合 RRT 路径规划算法及其变种算法的特性,生成新的、更适配当前环境的路径规划算法。生成的路径规划算法能高效地规划出一条从起始点到目标点的可行路径。
Path planning algorithms are widely used in various motion planning tasks
such as robot motion and autonomous driving.So far
many excellent path planning algorithms have been proposed for applications in different fields.For a specific task environment
choosing the appropriate path planning algorithm can plan a better path that satisfies the constraints more efficiently.Based on the results of swarm intelligence
the adaptability and path planning efficiency of rapidly-exploring random tree (RRT) path planning algorithm and its variants RRT-Star path planning algorithm and RRT-Star-Smart path planning algorithm under different task environments were studied.Using genetic programming algorithm as a framework to design a system
which could automatically analyze the map features of the current environment and combine the characteristics of RRT path planning algorithm and its variants to generate new path planning algorithms that were more suitable for the current environment.The generated path planning algorithm can efficiently plan a feasible path from the starting point to the target point.
LA VALLE S M . Motion planning [J ] . IEEE Robotics & Automation Magazine , 2011 , 18 ( 2 ): 108 - 118 .
ZHANG H Y , LIN W M , CHEN A X . Path planning for the mobile robot:a review [J ] . Symmetry , 2018 , 10 ( 10 ): 450 .
LAVALLE S M , KUFFNER J J . Rapidly-exploring random trees:progress and prospects [M ] .[S.l.:s.n. ] , 2001 .
PÉREZ-HIGUERAS N , CABALLERO F , MERINO L . Learning robot navigation behaviors by demonstration using a RRT* planner [C ] // Proceedings of the International Conference on Social Robotics .[S.l.:s.n. ] , 2016 .
ISLAM F , NASIR J , MALIK U , et al . RRT-Smart:rapid convergence implementation of RRT towards optimal solution [C ] // Proceedings of 2012 IEEE International Conference on Mechatronics and Automation . Piscataway:IEEE Press , 2012 : 1651 - 1656 .
SAKAMOTO E , IBA H . Inferring a system of differential equations for a gene regulatory network by using genetic programming [C ] // Proceedings of 2001 Congress on Evolutionary Computation .[S.l.:s.n. ] , 2001 .
SRINIVAS M , PATNAIK L M . Adaptive probabilities of crossover and mutation in genetic algorithms [J ] . IEEE Transactions on Systems Man & Cybernetics , 2002 , 24 ( 4 ): 656 - 667 .
LE G C , NGUYEN T , FORREST S , et al . GenProg:a generic method for automatic software repair [J ] . IEEE Transactions on Software Engineering , 2012 , 38 ( 1 ): 54 - 72 .
KHAN J A , LIU L , WEN L , et al . Crowd intelligence in requirements engineering:current status and future directions [C ] // Proceedings of the International Working Conference on requirements Engineering:Foundation for Software Quality . Cham:Springer , 2019 : 245 - 261 .
LIU J R , JI W . Crowd intelligence evolution based on complex network [J ] . International Journal of Crowd Science , 2021 , 5 ( 3 ): 281 - 292 .
CUI B J , LI J S , GUO T , et al . Code comparison system based on abstract syntax tree [C ] // Proceedings of 2010 3rd IEEE International Conference on Broadband Network and Multimedia Technology . Piscataway:IEEE Press , 2010 : 668 - 673 .
FERREIRA C . Gene expression programming:a new adaptive algorithm for solving problems [J ] . Complex Systems , 2001 , 13 ( 2 ): 87 - 129 .
YAN Z C , BI Y , XUE B , et al . Automatically extracting features using genetic programming for low-quality fish image classification [C ] // Proceedings of 2021 IEEE Congress on Evolutionary Computation . Piscataway:IEEE Press , 2021 : 2015 - 2022 .
AHVANOOEY M T , LI Q M , WU M , et al . A survey of genetic programming and its applications [J ] . KSll Transactions on Internet and Information Systems . 2019 , 13 ( 14 ): 1765 - 1794 .
OLTEAN M . Solving classification problems using traceless genetic programming [J ] . arXiv preprint,2021,arXiv:2111.14790 .
KANG J G , JUNG J W . Post triangular rewiring method for shorter RRT robot path planning [J ] . International Journal of Fuzzy Logic and Intelligent Systems , 2021 , 21 ( 3 ): 213 - 221 .
KALA R . Rapidly exploring random graphs:motion planning of multiple mobile robots [J ] . Advanced Robotics , 2013 , 27 ( 14 ): 1113 - 1122 .
ZHANG L W , LIN Z B , WANG J , et al . Rapidly-exploring random trees multi-robot map exploration under optimization framework [J ] . Robotics and Autonomous Systems , 2020 131 : 103565 .
GE Q Y , LI A J , LI S H , et al . Improved bidirectional RRT path planning method for smart vehicle [J ] . Mathematical Problems in Engineering , 2021 :6669728.
SUDHAKARA P , GANAPATHY V , SUNDARAN K . Optimal trajectory planning based on bidirectional spline-RRT∗ for wheeled mobile robot [C ] // Proceedings of 2017 3rd International Conference on Sensing,Signal Processing and Security . Piscataway:IEEE Press , 2017 : 65 - 68 .
TAK H T , PARK C G , LEE S C . Improvement of RRT*-Smart algorithm for optimal path planning and application of the algorithm in 2& 3-dimension environment [J ] . Journal of the Korean Society for Aviation and Aeronautics , 2019 , 27 ( 2 ): 1 - 8 .
HASSANAT A , ALMOHAMMADI K , ALKAFAWEEN E , et al . Choosing mutation and crossover ratios for genetic algorithms—a review with a new dynamic approach [J ] . Information , 2019 , 10 ( 12 ): 390 .
DENG W , XU J J , SONG Y J , et al . Differential evolution algorithm with wavelet basis function and optimal mutation strategy for complex optimization problem [J ] . Applied Soft Computing , 2021 , 100 : 106724 .
0
浏览量
810
下载量
0
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621