Abstract: The log-sum function as a penalty has always been drawing widespread attention in the field of sparse problems. However, it brings a non-convex, non-smooth and non-Lipschitz optimization ...

Abstract: In this article, based on the rapidly-exploring random tree (RRT), we propose a novel and efficient motion planning algorithm using bidirectional RRT search. First, a RRT extend function is ...