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

Path Planning for Transoceanic Underwater Glider Based on Hybrid Reinforcement Learning Algorithm

Abstract: Underwater gliders (UGs) represent a class of autonomous underwater vehicles renowned for their extended operational endurance, capable of traversing thousands of kilometers. As the primary ...