The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
An improved PSO algorithm for smooth path planning of mobile robots using continuous high-degree Bezier curve
Open accessAbstract
Abstract In this paper, a new strategy is developed to plan the smooth path for mobile robots through an improved PSO algorithm in combination with the continuous high-degree Bezier curve. Rather than connecting several low-degree Bezier curve segments, the use of continuous high-degree Bezier curves facilitates the fulfilment of the requirement of high-order continuity such as the continuous curvature derivative, which is critical for the motion control of the mobile robots. On the other hand, the smooth path planning of mobile robots is mathematically an optimization problem that can be dealt with by evolutionary computation algorithms. In this regard, an improved particle swarm optimization (PSO) algorithm is proposed to tackle the local trapping and premature convergence issues. In the improved PSO algorithm, an adaptive fractional-order velocity is introduced to enforce some disturbances on the particle swarm according to its evolutionary state, thereby enhancing its capability of jumping out of the local minima and exploring the searching space more thoroughly. The superiority of the improved PSO algorithm is verified by comparing with several standard and modified PSO algorithms on some benchmark functions, and the advantages of the new strategy is also confirmed by several comprehensive simulation experiments for the smooth path planning of mobile robots.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Kennedy, J., & Eberhart, R. (2002) · Proceedings of ICNN'95 - International Conference on Neural Networks · doi:10.1109/icnn.1995.488968 · Cited by 58,192
A modified particle swarm optimizer
Shi, Y., & Eberhart, R. (2002) · 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360) · doi:10.1109/icec.1998.699146 · Cited by 10,229
Probabilistic roadmaps for path planning in high-dimensional configuration spaces
Kavraki, L. E., Svestka, P., Latombe, J.-C., & Overmars, M. H. (1996) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.508439 · Cited by 6,343
Rapidly-exploring random trees : a new tool for path planning
LaValle, S. M. (1998) · Cited by 3,704
Self-Organizing Hierarchical Particle Swarm Optimizer With Time-Varying Acceleration Coefficients
Ratnaweera, A., Halgamuge, S. K., & Watson, H. C. (2004) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2004.826071 · Cited by 3,034
Adaptive Particle Swarm Optimization
Zhan, Z.-H., Zhang, J., Li, Y., & Chung, H. S.-H. (2009) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2009.2015956 · Cited by 2,075
A Review of Motion Planning Techniques for Automated Vehicles
Gonzalez, D., Perez, J., Milanes, V., & Nashashibi, F. (2016) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2015.2498841 · Cited by 1,670
Sampling-Based Robot Motion Planning: A Review
Elbanhawi, M., & Simic, M. (2014) · IEEE Access · doi:10.1109/access.2014.2302442 · Cited by 786
Evolutionary Multi-Objective Workflow Scheduling in Cloud
Zhu, Z., Zhang, G., Li, M., & Liu, X. (2016) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2015.2446459 · Cited by 401
A Novel Sigmoid-Function-Based Adaptive Weighted Particle Swarm Optimizer
Liu, W., Wang, Z., Yuan, Y., Zeng, N., Hone, K., & Liu, X. (2021) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2019.2925015 · Cited by 346
Self-citationRoadmap-Based Path Planning - Using the Voronoi Diagram for a Clearance-Based Shortest Path
Bhattacharya, P., & Gavrilova, M. (2008) · IEEE Robotics & Automation Magazine · doi:10.1109/mra.2008.921540 · Cited by 312
A new switching-delayed-PSO-based optimized SVM algorithm for diagnosis of Alzheimer’s disease
Zeng, N., Qiu, H., Wang, Z., Liu, W., Zhang, H., & Li, Y. (2018) · Neurocomputing · doi:10.1016/j.neucom.2018.09.001 · Cited by 303
Self-citationAn Analytical Continuous-Curvature Path-Smoothing Algorithm
Yang, K., & Sukkarieh, S. (2010) · IEEE Transactions on Robotics · doi:10.1109/tro.2010.2042990 · Cited by 293
Optimal and Efficient Path Planning for Unknown and Dynamic Environments
Stentz, A. (1993) · Cited by 275
Bezier Curve Based Path Planning in a Dynamic Field using Modified Genetic Algorithm
Elhoseny, M., Tharwat, A., & Hassanien, A. E. (2017) · Journal of Computational Science · doi:10.1016/j.jocs.2017.08.004 · Cited by 274
Shen, B., Wang, Z., Wang, D., & Li, Q. (2020) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2019.2946290 · Cited by 267
Self-citationParticle swarm optimization with fractional-order velocity
Solteiro Pires, E. J., Tenreiro Machado, J. A., de Moura Oliveira, P. B., Boaventura Cunha, J., & Mendes, L. (2010) · Nonlinear Dynamics · doi:10.1007/s11071-009-9649-y · Cited by 248
Bakdi, A., Hentout, A., Boutami, H., Maoudj, A., Hachour, O., & Bouzouia, B. (2017) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2016.12.008 · Cited by 246
Tharwat, A., Elhoseny, M., Hassanien, A. E., Gabel, T., & Kumar, A. (2019) · Cluster Computing · doi:10.1007/s10586-018-2360-3 · Cited by 238
Planning Smooth and Obstacle-Avoiding B-Spline Paths for Autonomous Mining Vehicles
Berglund, T., Brodnik, A., Jonsson, H., Staffanson, M., & Soderkvist, I. (2010) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2009.2015886 · Cited by 230
Path Planning Based on Bézier Curve for Autonomous Ground Vehicles
Choi, J.-W., Curry, R., & Elkaim, G. (2008) · Advances in Electrical and Electronics Engineering - IAENG Special Edition of the World Congress on Engineering and Computer Science 2008 · doi:10.1109/wcecs.2008.27 · Cited by 228
Layout optimization of large-scale oil–gas gathering system based on combined optimization strategy
Liu, Y., Chen, S., Guan, B., & Xu, P. (2019) · Neurocomputing · doi:10.1016/j.neucom.2018.12.021 · Cited by 188
Distributed State-Saturated Recursive Filtering Over Sensor Networks Under Round-Robin Protocol
Shen, B., Wang, Z., Wang, D., & Liu, H. (2020) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2019.2932460 · Cited by 159
Self-citationShen, B., Wang, Z., Wang, D., Luo, J., Pu, H., & Peng, Y. (2018) · Automatica · doi:10.1016/j.automatica.2018.11.010 · Cited by 155
Self-citationA Novel Particle Swarm Optimization Approach for Patient Clustering From Emergency Departments
Liu, W., Wang, Z., Liu, X., Zeng, N., & Bell, D. (2018) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2018.2878536 · Cited by 148
Self-citationProtocol-Based Unscented Kalman Filtering in the Presence of Stochastic Uncertainties
Liu, S., Wang, Z., Chen, Y., & Wei, G. (2019) · CRC Press eBooks · doi:10.1201/9781003683957-2 · Cited by 135
Self-citationZeng, N., Wang, Z., Zhang, H., & Alsaadi, F. E. (2016) · Cognitive Computation · doi:10.1007/s12559-016-9396-6 · Cited by 134
Self-citationTang, Y. S., Wang, Z., & Fang, J. (2010) · Expert Systems with Applications · doi:10.1016/j.eswa.2010.08.041 · Cited by 97
Self-citationAn N -State Markovian Jumping Particle Swarm Optimization Algorithm
Rahman, I. U., Wang, Z., Liu, W., Ye, B., Zakarya, M., & Liu, X. (2020) · IEEE Transactions on Systems Man and Cybernetics Systems · doi:10.1109/tsmc.2019.2958550 · Cited by 51
Self-citationA precise curved motion planning for a differential driving mobile robot
Han, S., Choi, B.-S., & Lee, J.-M. (2008) · Mechatronics · doi:10.1016/j.mechatronics.2008.04.001 · Cited by 48
Cited by
Review of Autonomous Path Planning Algorithms for Mobile Robots
Qin, H., Shao, S., Wang, T., Yu, X., Jiang, Y., & Cao, Z. (2023) · Drones · doi:10.3390/drones7030211 · Cited by 322
An intelligence-based hybrid PSO-SA for mobile robot path planning in warehouse
Lin, S., Liu, A., Wang, J., & Kong, X. (2023) · Journal of Computational Science · doi:10.1016/j.jocs.2022.101938 · Cited by 150
Metadata
- Authors
- Song, B., Wang, Z., & Zou, L.
- Venue
- Applied Soft Computing
- Publisher
- Elsevier BV
- Published
- 2021-03
- Volume
- 100
- Pages
- 106960
- ISSN
- 1568-4946 (ISSN-L)
- OpenAlex
- W3108081931
- Cited by
- 441
- References
- 30
- FWCI
- 21.97
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.