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

Multi-Target Point Path Planning and Tracking of Unmanned Surface Vehicle Using SFLOS Algorithm and Incremental PID Control With Crane-Assisted

Abstract: To enhance the multi-target path planning and tracking performance of Unmanned Surface Vehicles (USVs), a combined control strategy integrating the Serret-Frenet Line-of-Sight (SFLOS) ...