Circular Obstacle Pathfinding (2017)
This article explains how the A* pathfinding algorithm can be applied to non-grid environments, such as navigating around circular obstacles. It details the mechanics of the algorithm, including the use of priority queues and heuristic estimates to find optimal paths.
Why it matters
Understanding graph-based pathfinding is fundamental to robotics, game development, and logistics optimization.
The A* pathfinding algorithm is a powerful method for quickly generating optimal paths. Typically, people demonstrate A* navigating grid-based maps, but A* isn’t just a grid algorithm! It can work on any graph. We can use A* to find a path through this world of round obstacles.
How does the same algorithm solve both problems? Let’s start with a review of how A* works.
Get smarter about the news
Sign up free for a feed built around what you actually care about, Dive Deeper research on any story, and the full text of every article.
Create free accountAlready have an account? Sign in