Talk:Any-angle path planning
Add topic | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
.jpg){kind=small}
Untitled
[edit]I started the page on any-angle path planning. So far, it is mostly a stub. Eventually, one needs to add an example why paths that are constrained to grid edges are typically longer than any-angle paths and why post-optimization typically does not find such paths. One probably should also create its own pages for Field D* and Theta* and describe them on their own pages in more detail. But, this page is a start. Antonbharkamsan (talk) 06:29, 6 September 2009 (UTC)
Wiki Education Foundation-supported course assignment
[edit]
This article is or was the subject of a Wiki Education Foundation-supported course assignment. Further details are available on the course page. Student editor(s): AnonymousEditor.
Above undated message substituted from Template:Dashboard.wikiedu.org assignment by PrimeBOT (talk) 14:31, 16 January 2022 (UTC)
Definition?
[edit]What is the definition of any-angle path planning? Why does the article start by excluding algorithms that searches for the corresponding visibility graph? Aren't they also any-angle path planning algorithms? —Kri (talk) 15:49, 6 November 2014 (UTC)
Rewording
[edit]I'm rewording some of the sections of this article so it is more approachable to those unfamiliar with the subject. Please revert these changes if I've removed or changed too much.