Tech Xplore on MSN

Shortest paths research narrows a 25-year gap in graph algorithms

Most of you have used a navigation app like Google Maps for your travels at some point. These apps rely on algorithms that ...
IEEE

Fully Distributed Path Planning and Bipartite Formation Tracking for Multiple Euler-Lagrange Agents with Faults and Input Saturation

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 ...
IEEE

Subregion graph: A path planning acceleration structure for characters with various motion types in very large environments

Abstract: Modern computer graphics applications commonly feature very large virtual environments and diverse characters which perform different kinds of motions. To accelerate path planning in such a ...