TY - JOUR
T1 - A Path Planning Learning Strategy Design for a Wheel-Legged Vehicle Considering Both Distance and Energy Consumption
AU - Wang, Weida
AU - Zhao, Jing
AU - Yang, Chao
AU - Qie, Tianqi
AU - Li, Ying
AU - Huang, Kun
AU - Xiang, Changle
N1 - Publisher Copyright:
© 1967-2012 IEEE.
PY - 2023/4/1
Y1 - 2023/4/1
N2 - To obtain an optimal feasible path, this paper presents a path planning learning strategy for a wheel-legged vehicle considering both distance and energy consumption. Firstly, a new reward function and update rule of the Q-Learning algorithm, considering the influence of obstacle crossing parameters and modification of path energy consumption, is presented to ensure the path shortening and energy consumption reduction. Secondly, the future energy consumption is introduced into the modification of path energy consumption. It evaluates the potential energy consumption between each state reached by the vehicle and the target state. The priority sequence of Q table update is provided, which greatly speeds up the convergence speed of the algorithm. Finally, the proposed strategy is verified on different size maps with 0-1m obstacle height. Results show that, in the complex map, the proposed strategy is effective to shorten 7.6m distance compared with the wheeled driving strategy and to reduce energy consumption by 31% compared with the wheel-legged obstacle crossing strategy. It has a faster convergence speed. Compared with the A∗-based and Dijkstra-based strategies, their planning effect is approximately the same, but the energy consumption using the proposed strategy can be reduced by 3.5%.
AB - To obtain an optimal feasible path, this paper presents a path planning learning strategy for a wheel-legged vehicle considering both distance and energy consumption. Firstly, a new reward function and update rule of the Q-Learning algorithm, considering the influence of obstacle crossing parameters and modification of path energy consumption, is presented to ensure the path shortening and energy consumption reduction. Secondly, the future energy consumption is introduced into the modification of path energy consumption. It evaluates the potential energy consumption between each state reached by the vehicle and the target state. The priority sequence of Q table update is provided, which greatly speeds up the convergence speed of the algorithm. Finally, the proposed strategy is verified on different size maps with 0-1m obstacle height. Results show that, in the complex map, the proposed strategy is effective to shorten 7.6m distance compared with the wheeled driving strategy and to reduce energy consumption by 31% compared with the wheel-legged obstacle crossing strategy. It has a faster convergence speed. Compared with the A∗-based and Dijkstra-based strategies, their planning effect is approximately the same, but the energy consumption using the proposed strategy can be reduced by 3.5%.
KW - Q reinforcement learning
KW - Wheel-legged vehicle
KW - energy consumption
KW - path planning
UR - http://www.scopus.com/inward/record.url?scp=85144048730&partnerID=8YFLogxK
U2 - 10.1109/TVT.2022.3223727
DO - 10.1109/TVT.2022.3223727
M3 - Article
AN - SCOPUS:85144048730
SN - 0018-9545
VL - 72
SP - 4277
EP - 4293
JO - IEEE Transactions on Vehicular Technology
JF - IEEE Transactions on Vehicular Technology
IS - 4
ER -