For this first draft I feel like I'm lacking content. The Any-angle path planning page seems to have a decent amount of content, but I felt that it could use some rewording to make the concepts clearer. I would like to make an image or two to add to the article, but I don't know the best way do that right now. I felt unsure while writing this article since I'm not sure how long the ideal article for this topic should be. I feel that the article needs to be made clearer and have a few pictures added, but overall does not need to be made significantly longer. I looked at the A* article and the pathfinding article as a guide. The pathfinding article is reasonably long, but this is due to the explanations for several algorithms. To me this seems redundant since the respective articles contain all of the information a reader would want to know about each algorithm. Because of this, I don't think the Any-angle path planning article should have more than a short summary about each algorithm. I've instead created a start for the Theta* article with commented pseudocode for the algorithm. If necessary I can create new articles for the algorithms I covered in my lit review and add what information I can to them. I would like to know what else people think should be added to or made clearer in the Any-angle path planning article.
Looking at this from the perspective of Wikipedia as a whole, I chose this article since it seemed to be quite short given the amount of material on these algorithms. If separate articles are created for each algorithm, I don't think there is an issue with the Any-angle path planning article's brevity. Regarding the standards: 1) Non-triviality: The concept of any-angle path planners is not a trivial concept, and I think my modifications make the concept clearer. My draft of the Theta* article further explains how the algorithm works. 2) Quality: I think I made some of the language clearer and addressed a couple of the concerns on the talk page. The Theta* article fills in a missing part of Wikipedia. 3) Credibility: I have added some citations and will add more once the changes are incorporated into the article. The Theta* article will only have a few sources since most of the content will only come from one paper. The papers that I have used and are currently used in the live article are from conferences and journals. 4) NPOV: I think the tone of the current article and my changes are neutral. (I don't think this could be anything but neutral even if I tried.)
AnonymousEditor ( talk) 02:59, 23 November 2016 (UTC)
What works: The first sentence gives a clear description of what Any-path finding is. For people who don't know what it is, they can click on the links for pathfinding and any other included for clarity. A solid example of Any-path, following the general description, could help with more clarity.
Improvements:
Binary Tree Method X / \ X X / \ / \ X X X X / \ \ \ X X X X \ / \ X X X
Minor Edits
Though it's a bit short, it has a clear definition of what Any-path finding is and gives a helpful example of it, namely the pseudocode. I think the most important improvement for the article is clarity. Clarity of the concept can be best explained through concrete examples and images. The article is short as the topic is not widely known but it's a great start.
For this first draft I feel like I'm lacking content. The Any-angle path planning page seems to have a decent amount of content, but I felt that it could use some rewording to make the concepts clearer. I would like to make an image or two to add to the article, but I don't know the best way do that right now. I felt unsure while writing this article since I'm not sure how long the ideal article for this topic should be. I feel that the article needs to be made clearer and have a few pictures added, but overall does not need to be made significantly longer. I looked at the A* article and the pathfinding article as a guide. The pathfinding article is reasonably long, but this is due to the explanations for several algorithms. To me this seems redundant since the respective articles contain all of the information a reader would want to know about each algorithm. Because of this, I don't think the Any-angle path planning article should have more than a short summary about each algorithm. I've instead created a start for the Theta* article with commented pseudocode for the algorithm. If necessary I can create new articles for the algorithms I covered in my lit review and add what information I can to them. I would like to know what else people think should be added to or made clearer in the Any-angle path planning article.
Looking at this from the perspective of Wikipedia as a whole, I chose this article since it seemed to be quite short given the amount of material on these algorithms. If separate articles are created for each algorithm, I don't think there is an issue with the Any-angle path planning article's brevity. Regarding the standards: 1) Non-triviality: The concept of any-angle path planners is not a trivial concept, and I think my modifications make the concept clearer. My draft of the Theta* article further explains how the algorithm works. 2) Quality: I think I made some of the language clearer and addressed a couple of the concerns on the talk page. The Theta* article fills in a missing part of Wikipedia. 3) Credibility: I have added some citations and will add more once the changes are incorporated into the article. The Theta* article will only have a few sources since most of the content will only come from one paper. The papers that I have used and are currently used in the live article are from conferences and journals. 4) NPOV: I think the tone of the current article and my changes are neutral. (I don't think this could be anything but neutral even if I tried.)
AnonymousEditor ( talk) 02:59, 23 November 2016 (UTC)
What works: The first sentence gives a clear description of what Any-path finding is. For people who don't know what it is, they can click on the links for pathfinding and any other included for clarity. A solid example of Any-path, following the general description, could help with more clarity.
Improvements:
Binary Tree Method X / \ X X / \ / \ X X X X / \ \ \ X X X X \ / \ X X X
Minor Edits
Though it's a bit short, it has a clear definition of what Any-path finding is and gives a helpful example of it, namely the pseudocode. I think the most important improvement for the article is clarity. Clarity of the concept can be best explained through concrete examples and images. The article is short as the topic is not widely known but it's a great start.