Shortest path algorithms sit at the heart of modern graph theory and many of the systems that move people, data, and goods around the world. After nearly seventy years of relying on the same classic ...

Abstract: This paper addresses the path planning and bipartite formation tracking (BFT) problem for multiple Euler-Lagrange agents (MELAs) subject to actuator faults and input saturation. A fully ...

When Edsger W. Dijkstra published his algorithm in 1959, computer networks were barely a thing. The algorithm in question found the shortest path between any two nodes on a graph, with a variant ...

We publish the best academic work (that's too often lost to peer reviews & the TA's desk) to the global tech community ...

The original version of this story appeared in Quanta Magazine. If you want to solve a tricky problem, it often helps to get organized. You might, for example, break the problem into pieces and tackle ...

Abstract: To address the challenge of full coverage path planning (CPP) for Unmanned Aerial Vehicles (UAVs) in urban road networks, this paper proposes an efficient solution method integrating Genetic ...

Traditional path planning algorithms often face problems such as local optimum traps and low monitoring efficiency in agricultural UAV operations, making it difficult to meet the operational ...

If you want to solve a tricky problem, it often helps to get organized. You might, for example, break the problem into pieces and tackle the easiest pieces first. But this kind of sorting has a cost.

Unmanned surface vehicles (USVs) nowadays have been widely used in ocean observation missions, helping researchers to monitor climate change, collect environmental data, and observe marine ecosystem ...

ABSTRACT: In any military operation, reliable logistics is essential to maintaining a combat-effective force. Without the continual resupply of ammunition, food, and other materiel, forces cannot ...