Informed anytime Bi-directional Fast Marching Tree for optimal motion planning in complex cluttered environments

•Present an anytime asymptotically-optimal motion planning algorithm.•Implement a heuristic cost evaluation to avoid unnecessary collision checks.•Analyze the swift convergence and the computational complexity for the algorithm.•The proposed algorithm is comprehensively evaluated by rigorous experiments.