A New Algorithm Beats Dijkstra's Time For The Shortest Path To Any Point In A Network

Researchers have combined the Dijkstra and Bellman-Ford algorithms to develop an even faster way to find the shortest paths ...
IEEE

Research on Air-Ground Cooperative Autonomous Dynamic Landing Algorithm Based on Multi-Apriltag Code and Visual Constraints

Abstract: For the problem of autonomous dynamic landing under air-ground coordination, a autonomous landing algorithm based on multi-AprilTag codes and visual constraints is proposed. Firstly, in ...
IEEE

An Improved Robot Path Planning Algorithm Based on Bi-RRT

Abstract: Aiming at the problems of low path generation efficiency, untargeted expansion direction, slow convergence speed and many redundant nodes of the Bi-RRT algorithm, an improved Bi-RRT ...