CAPABILITY ITERATION NETWORK FOR ROBOT PATH PLANNING

Buqing Nie, Yue Gao, Yidong Mei, and Feng Gao

Keywords

Path planning, value iteration, value iteration network, capabilityiteration network

Abstract

Path planning is an important topic in robotics. Recently, value iteration-based deep learning models have achieved good perfor- mance such as value iteration network (VIN). However, existing value iteration based methods suffer from slow convergence and low accuracy on large maps, hence restricted in path planning for agents with complex kinematics such as legged robots. Therefore, we propose a new value iteration-based path planning method called capability iteration network (CIN). CIN utilizes sparse reward maps and encodes the capability of the agent with state-action transition probability, rather than a convolution kernel in previous models. Furthermore, two training methods including end-to-end training and training capability module alone are proposed, both of which speed up convergence greatly. Several path planning experiments in various scenarios, including on 2D, 3D grid world and real robot with different map sizes, are conducted. The results demonstrate that CIN has higher accuracy, faster convergence and lower sensi- tivity to random seed compared to previous VI-based models, hence more applicable for real robot path planning.

Important Links:



Go Back