ai-series-part-12
ai-series-part-10
ai-series-part-12 | ai-series-part-10 | |
---|---|---|
2 | 1 | |
6 | 6 | |
- | - | |
0.0 | 0.0 | |
over 2 years ago | about 3 years ago | |
ShaderLab | ShaderLab | |
MIT License | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
ai-series-part-12
-
Drawing Informational Text and Lines in the Scene View | Editor Script Used in AI Series Part 12 | Full Tutorial in Comments
As always, full project code from AI Series Part 12, including this editor script is available on GitHub!
-
How to Find the Closest Target on a NavMesh Based on Distance an Agent Will Travel | AI Series Part 12 | Full Tutorial in Comments
As always, full project code is available on GitHub!
ai-series-part-10
-
Creating a Flying NavMeshAgent! | AI Series Part 10 | Unity Tutorial
As always, full project code is available on GitHub!
What are some alternatives?
KinetixAIDemos - A sample Unity Project used to test Kinetix AI Features
ai-series-part-9 - Full project of the end state of the AI Series Part 9 video where we dive deeper into ScriptableObjects and change to a Data-Oriented Design from our prefab-focused design.
ai-series-part-3 - Full project of the end state of the AI Series Part 3 video where we add basic animations to our NavMeshAgents
ai-series-part-11 - Project for the tutorial on how to implement basic finite state machines for your AI in Unity.
ai-series-part-29 - Learn how to make NavMeshAgents find valid cover spots from another target object.
ai-series-part-37 - In this tutorial repository and accompanying video you will learn how to make your NavMeshAgents break down obstacles that block their path. The agents will consider if a particular path is worth going through by breaking down the obstructions or if pathing around them is more worthwhile.