A Novel Path Planning Method for Articulated Road Roller Using Support Vector Machine and Longest Accessible Path With Course Correction
Xu Tong, Chen Siwei, Wang Dong and 3 more
IEEE Access · 2019
doi:10.1109/access.2019.2959346 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
Aiming at Articulated Road Roller (ARR) path planning near the construction area, a novel path planning method using Support Vector Machine (SVM) and Longest Accessible Path with Course Correction (LAP-CC) is proposed. First, the feasible path selected by Goal-Directed RRT (GDRRT) will be repeated 20 times to determine which category the obstacle belongs to, and then the error penalty factor and kernel parameter of SVM are selected by the grid search and cross-validation parameter optimization algorithm. Then, A set of different virtual obstacles are used on both sides of ARR to control the start and end points of the zero-potential decision boundary. Next, Longest Accessible Path (LAP) is presented to search critical turning points on the decision boundary. Finally, Course Correction (CC) corrects ARR course at these critical turning points. Simulation experiments show that the novel path planning method for ARR using SVM and LAP-CC has the advantages of simplicity, feasibility, low computational cost and good repeatability.
Abstract licence: CC BY-NC-ND
References25
25 more references, whose wording the paper’s licence keeps private.
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.