Any-angle path planning
id:
any-angle-path-planning-162-2055598
title:
Any-angle path planning
text:
Any-angle path planning algorithms are pathfinding algorithms that search for a Euclidean shortest path between two points on a grid map while allowing the turns in the path to have any angle. The result is a path that cuts directly through open areas and has relatively few turns. More traditional pathfinding algorithms such as A* either lack in performance or produce jagged, indirect paths.
brand slug:
wiki
category slug:
encyclopedia
description:
Algorithm to find Euclidean shortest paths
original url:
https://en.wikipedia.org/wiki/Any-angle_path_planning
date created:
2009-09-06T05:44:51Z
date modified:
2024-08-28T04:26:00Z
main entity:
{"identifier":"Q4778119","url":"https://www.wikidata.org/entity/Q4778119"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/1/1e/Shortest_path_vs_A%2A_on_octile_grid.png","width":403,"height":304}
fields total:
13
integrity:
16