Learn 3D Pathfinding with Octrees (Unity 6 Compatible)
- Descrição
- Currículo
- FAQ
- Revisões
Ever wanted to take navmeshes off the level and extend them into 3D space? The techniques revealed in this course will show you how to use Octrees to recursively divide space for use with the A* algorithm to find paths from one location to another. Throughout, you will follow along in the Unity game engine to develop a project that creates and visualises Octrees in carving up the space around game objects before developing an automatic navigating AI character that uses A* for pathfinding.
The course includes:
-
Octree and Tree Graph Theory
-
Waypoint Graph Theory
-
The practical application of Octrees in space dividing, in a 3D Unity environment
-
A close-up look and implementation of the A* algorithm
-
The development of AI characters that independently navigate 3D space
By the end of this course, you will have a thorough appreciation of the power of Octrees and their use in 3D pathfinding and be able to implement them in Unity to develop your own AI characters with auto-navigation.
What others are saying about Penny’s courses:
-
This course is amazing! Penny has got to be, hands down, one of the best instructors on game development, Unity, and C#! In the span of three hours, I have learned so much that it rivals my graduate program!
-
Best Unity class I’ve taken.
-
Wow, the most fun I’ve ever had coding! For the first time since taking numerous online courses over a 4 year span, I took on all of Penny’s challenges successfully. Personally, I feel as though I am making progress, and this is thanks to her professional teaching ability.
-
1
WelcomeIn this video Penny introduces the course.
-
2
Join the H3D Student Community
In this video you will learn about the avenues you have for getting in contact with the teaching team.
-
3
Contacting H3DHow to contact us
-
4
FAQs
In this article you will find a list of frequently asked student questions.
-
5
Updating to Unity 6
While this course was developed in a previous version of Unity, we've tested the projects and they work with Unity 6. This video is a guide to help you adjust your learning in this course to use Unity 6.
-
6
What is an Octree
In this lecture students will gain an overview of how Octrees and Quadtrees work.
-
7
The Octree Base Classes
In this lecture students will begin the coding of the base classes for octree space divisions and storage.
-
8
Adding a Node
In this lecture students will create the root node and ensure it is drawn in the scene to validate its size.
-
9
Splitting a Node
In this lecture students will learn how to split a single node cube into eight equal-sized cubes.
-
10
Dividing Space
In this lecture students will learn how to recursively divide space into octrees until the minimum size for a node is reached.
-
11
Selectively Dividing Space
In this lecture students will complete the octree divisions and see the results drawn on the screen.
-
12
Finding Empty Leaves
In this lecture students will complete the octree and discover how it will be used for pathfinding.
-
13
Splitting for Higher Granularity
In this lecture students will learn two techniques to make an octree that fits tighter around the objects contained within.
-
14
Basic Graph Architecture Part 1
In this lecture students will learn about the structure required to build a waypoint graph.
-
15
Basic Graph Architecture Part 2
In this lecture students will complete writing the basic graph code to store waypoints and the paths between them.
-
16
Adding Nodes to the Waypoints Graph
In this lecture students will learn how to add nodes to the navigation graph and display them in the scene.
-
17
Adding Edges to the Waypoints Graph
In this lecture students will explore ways to add edges to the graph.
-
18
Reducing Edges
In this lecture students will learn ways in which to reduce the number of edges added to the graph.
-
19
Pathfinding
In this lecture students will learn about the A* algorithm they will implement to find a path through the waypoint graph.
-
20
Implementing A* Part 1
In this lecture students will begin implementing the A* algorithm to search for a path in the waypoint graph.
-
21
Implementing A* Part 2
In this lecture students will learn how to complete the A* search algorithm to return a path through the waypoints graph.
-
22
Developing a Path Following AI
In this lecture students will develop and AI character that will perform an A* search on the graph and follow the waypoints.
-
23
The First Test Flight
In this lecture students will use the A* algorithm and AI code to get the first test flight through the waypoints.
-
24
Adding Multiple AI and Paths
In this lecture students will learn how to create individual paths for multiple AI characters.
-
25
Combining A* with Octrees for Pathfinding Part 1
In this lecture students will learn about an optimisation technique that will reduce the edges of the graph by joining neighbour nodes instead of using parents.
-
26
Combining A* with Octrees for Pathfinding Part 2
In this lecture students will learn how to use rays and bounding boxes to determine neighbour nodes in an Octree.
-
27
Combining A* with Octrees for Pathfinding Part 3
In this lecture students will learn how to connect the neighbouring nodes with edges.
-
28
Adding Destinations for AI Part 1
In this lecture students will learn how to add code to provide a destination for the AI to travel to and find that point inside the Octree.
-
29
Adding Destinations for AI Part 2
In this lecture students will learn how to program the AI to add a new destination to it's path list to enable it to traverse the Octree to reach it.
-
30
Adding Destinations for AI Part 3
In this lecture students will complete the code to program an AI character to move to any point within the Octree.
