Back in the hazy olden days of the pre-2000s, navigating between two locations generally required someone to whip out a paper map and painstakingly figure out the most optimal route between those ...

A hybrid of probabilistic roadmaps and bidirectional A* search produced shorter paths and faster planning times than Dijkstra ...

Whenever I explain that work, I end up explaining the same thing first: where path planning sits in an autonomous system, and why it's harder than "find the shortest route." This is that explanation, ...

A MATLAB simulation combining Theta* planning, potential field avoidance, Pure Pursuit tracking and LIDAR mapping reached the goal in nine of thirteen cluttered-environment trials, while ablation ...