S. Duan, Lin-Xin Zhang, Xu Han, Yu-Le Li, Fang Wang, G. R. Liu
{"title":"Novel Adaptive Path-Smoothening Optimization Method For Mobile Robots","authors":"S. Duan, Lin-Xin Zhang, Xu Han, Yu-Le Li, Fang Wang, G. R. Liu","doi":"10.1142/s0219876224500051","DOIUrl":null,"url":null,"abstract":" Abstract: A safe and smooth operating path is a prerequisite for mobile robots to accomplish tasks. Although the existing path optimization methods improve the smoothness of the planned path by introducing Bézier curve to locally optimize the path with regard to turning points, most of these methods manually select the position of control points and subjectively analyze the feasibility of the optimized path. It is argued unfavourably that it exhibits strong subjectivity and cumbersome selection process. To this gap, an adaptive path-smoothening optimization method is proposed in this study, which combines neural network, genetic algorithm, and Bézier curve to effectively resolve the problems of strong subjectivity, cumbersome steps, and thus low efficiency in the selection process of control points. To start with, the data set corresponding to the position of the control point and the path offset are constructed. Based on the actual working conditions, the value space of control point position is derived. Latin hypercube sampling is used to sample the control point position of the second-order Bézier curve, which is input into the Bézier curve solution model to calculate the corresponding path offset. The data set corresponding to the position of control point and path offset are thus acquired. Based on the data set, the neural network algorithm is used to train it, and the prediction model of path offset is constructed. Subsequently, with reference to the prediction model of path offset, a performance evaluation function is formulated by comprehending multiple influential factors of mobile robot motion safety and path smoothness. The genetic algorithm is then introduced to detect the optimal control points in different environments. The proposed method is verified by experiments in different operating environments. The study results show that the currently proposed adaptive path-smoothening optimization method exhibits remarkably superior applicability and effectiveness compared to the currently prevailing methods. It demonstrates advantages of fast path planning, reduced path turning points, and desirable path smoothness. In addition, it can also ensure the safety of mobile robot along the planned path as availed by a pre-set criterion.","PeriodicalId":54968,"journal":{"name":"International Journal of Computational Methods","volume":null,"pages":null},"PeriodicalIF":1.4000,"publicationDate":"2024-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computational Methods","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1142/s0219876224500051","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0
Abstract
Abstract: A safe and smooth operating path is a prerequisite for mobile robots to accomplish tasks. Although the existing path optimization methods improve the smoothness of the planned path by introducing Bézier curve to locally optimize the path with regard to turning points, most of these methods manually select the position of control points and subjectively analyze the feasibility of the optimized path. It is argued unfavourably that it exhibits strong subjectivity and cumbersome selection process. To this gap, an adaptive path-smoothening optimization method is proposed in this study, which combines neural network, genetic algorithm, and Bézier curve to effectively resolve the problems of strong subjectivity, cumbersome steps, and thus low efficiency in the selection process of control points. To start with, the data set corresponding to the position of the control point and the path offset are constructed. Based on the actual working conditions, the value space of control point position is derived. Latin hypercube sampling is used to sample the control point position of the second-order Bézier curve, which is input into the Bézier curve solution model to calculate the corresponding path offset. The data set corresponding to the position of control point and path offset are thus acquired. Based on the data set, the neural network algorithm is used to train it, and the prediction model of path offset is constructed. Subsequently, with reference to the prediction model of path offset, a performance evaluation function is formulated by comprehending multiple influential factors of mobile robot motion safety and path smoothness. The genetic algorithm is then introduced to detect the optimal control points in different environments. The proposed method is verified by experiments in different operating environments. The study results show that the currently proposed adaptive path-smoothening optimization method exhibits remarkably superior applicability and effectiveness compared to the currently prevailing methods. It demonstrates advantages of fast path planning, reduced path turning points, and desirable path smoothness. In addition, it can also ensure the safety of mobile robot along the planned path as availed by a pre-set criterion.
期刊介绍:
The purpose of this journal is to provide a unique forum for the fast publication and rapid dissemination of original research results and innovative ideas on the state-of-the-art on computational methods. The methods should be innovative and of high scholarly, academic and practical value.
The journal is devoted to all aspects of modern computational methods including
mathematical formulations and theoretical investigations;
interpolations and approximation techniques;
error analysis techniques and algorithms;
fast algorithms and real-time computation;
multi-scale bridging algorithms;
adaptive analysis techniques and algorithms;
implementation, coding and parallelization issues;
novel and practical applications.
The articles can involve theory, algorithm, programming, coding, numerical simulation and/or novel application of computational techniques to problems in engineering, science, and other disciplines related to computations. Examples of fields covered by the journal are:
Computational mechanics for solids and structures,
Computational fluid dynamics,
Computational heat transfer,
Computational inverse problem,
Computational mathematics,
Computational meso/micro/nano mechanics,
Computational biology,
Computational penetration mechanics,
Meshfree methods,
Particle methods,
Molecular and Quantum methods,
Advanced Finite element methods,
Advanced Finite difference methods,
Advanced Finite volume methods,
High-performance computing techniques.