Description

Learn 3D Pathfinding with Octrees

Learn 3D Pathfinding with Octrees
Genre: eLearning | MP4 | Video: h264, 1280×720 | Audio: AAC, 44.1 KHz Language: English | Size: 1.96 GB | Duration: 30 lectures • 3h 55m
Discover how to carve up 3D space with octrees and implement the A* algorithm to build AI to automatically navigate.

Discover how to carve up 3D space with octrees and implement the

A* algorithm to build AI to automatically navigate. From 2D pathfinding to 3D, learn how massive worlds can be navigated with ease and grace.

Discover the process of carving up 3D space with octrees, then implementing the

How this course will help you

A* algorithm in an Octree-based AI controller to navigate obstacles in a dynamic environment.

3D Pathfinding with Octrees is an introductory-level course on developing AI for computer games, using the A* algorithm.

The course shows how to accelerate pathfinding by using hierarchical spatial subdivision, and how to use the A* algorithm optimally by storing data specifically for it.

Octrees are a 3D data structure designed to divide up space.

They can be used to build interactive environments that respond to players, whether they’re real or AI agents.

Not only will you learn how octrees work and what they allow you to do in your game, but also how to implement the A*

pathfinding algorithm to have agents automatically navigate through those environments.

How this course will help you

Learn how to create a 3D pathfinding algorithm, and then use it to solve problems.

The fundamentals of pathfinding and the A* algorithm are covered in this course, but the focus is on implementing it in a real-world application by using an octree structure.

Building an AI capable of navigating a 3D environment is a challenging task that rewards you with smart enemies,

obstacles that can be navigated, and complex levels.

Discover how to carve up 3D space with octrees and implement the A* algorithm to build AI to automatically navigate.

3D Pathfinding with Octrees is a course that teaches you how to build effective AI for navigating in 3D games in record time!

How this course will help you

This course will teach you how to carve up 3D space with octrees and implement the A* algorithm to build AI to automatically navigate.

In this course you’ll learn how to carve up 3D space with octrees and implement the A* algorithm to build AI to automatically navigate.

Octrees are a common data structure used in game pathfinding.

Learn how to carve up 3D space with them, and then implement the A* algorithm to create AI that automatically navigates from point A to point B!

This course explores the concepts underlying the search for a path in 3D space.

You will learn about octrees and at-least-visited lists, as well as how to build an AI capable of navigating these structures.

The topics covered will include hierarchical, spatial searches; heuristics and game theory; pathfinding with raycasting; A*; and graph traversal.

You’ll learn to use a variation of the classic A* algorithm called A*.

This is a general-purpose pathfinding algorithm that can quickly solve collision-free navigation problems in 3D space.