Robot Motion Planning with Optimization-based Algorithm and Neural Network: Unsupervised Path Regression

Yunfeng Kang; Yixin Mai

doi:10.54097/fcis.v4i2.10198

Authors

Yunfeng Kang
Yixin Mai

DOI:

https://doi.org/10.54097/fcis.v4i2.10198

Keywords:

Robot Motion Planning, Optimization-based Algorithm, Neural Network, Path Regression, Path and World Representations

Abstract

Planning collision-free motions for robots is challenging in environments with complex obstacle geometries. In this study, we combine the optimization-based algorithm and neural network to obtain a short and collision-free path through unsupervised path regression. The network can help to predict an educated initial path for an optimization-based planner, which will converge to a better solution. We compare different path representations, world representations, and also their combinations to improve the result. The motion planning problem is extended from a sphere robot in a single 2D world to a more complex static arm robot in multiple worlds. Through our experiments, we can find that in multiple worlds, the relative path with the signed distance field is the best combination for both robots. This is not only proved by metrics of feasible rate and loss but also by the visualization in the map.

Downloads

Download data is not yet available.

References

S. M. LaValle et al., “Rapidly-exploring random trees: A new tool for path planning,” 1998.

L. E. Kavraki, P. Svestka, J.-C. Latombe, and M. H. Overmars, “Probabilistic roadmaps for path planning in high-dimensional configuration spaces,” IEEE transactions on Robotics and Automation, vol. 12, no. 4, pp. 566–580, 1996.

M. Zucker, N. Ratliff, A. D. Dragan, M. Pivtoraiko, M. Klingensmith, C. M. Dellin, J. A. Bagnell, and S. S. Srinivasa, “Chomp: Covariant hamiltonian optimization for motion planning,” The International Journal of Robotics Research, vol. 32, no. 9-10, pp. 1164–1193, 2013.

M. Kalakrishnan, S. Chitta, E. Theodorou, P. Pastor, and S. Schaal, “Stomp: Stochastic trajectory optimization for motion planning,” in 2011 IEEE international conference on robotics and automation. IEEE, 2011, pp. 4569–4574.

J. Schulman, Y. Duan, J. Ho, A. Lee, I. Awwal, H. Bradlow, J. Pan, S. Patil, K. Goldberg, and P. Abbeel, “Motion planning with sequential convex optimization and convex collision checking,” The International Journal of Robotics Research, vol. 33, no. 9, pp. 1251–1270, 2014.

T. Jurgenson and A. Tamar, “Harnessing reinforcement learning for neural motion planning,” arXiv preprint arXiv: 1906. 00214, 2019.

M. P´andy, D. Lenton, and R. Clark, “Unsupervised path regression networks,” in 2021 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). IEEE, 2021, pp. 1413–1420.

K. Li and J. Malik, “Learning to optimize,” arXiv preprint arXiv: 1606.01885, 2016.