CSCI 4310. Lecture 8: Path Planning. Book. Buckland Ch. 8. Navigation. How to represent the areas that an agent can occupy in the world. Navigation Graph (NavGraph) Some More Sophisticated Methods. Nav Graph. Works in 2 or 3 dimensions Trade-off Coarsely granulated Easier to manage
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Lecture 8: Path Planning
// Given an item type, this method determines the closest reachable graph node
// to the bot's position and then creates a instance of the time-sliced
// Dijkstra's algorithm, which it registers with the search manager
bool RequestPathToItem(unsigned int ItemType);
// Given a target, this method first determines if nodes can be reached from
// the bot's current position and the target position. If either end point
// is unreachable the method returns false.
// If nodes are reachable from both positions then an instance of the time-
// sliced A* search is created and registered with the search manager. the
// method then returns true.
bool RequestPathToPosition(Vector2D TargetPos);
A path from B
To D should
First Go To
Need to store
Both sides if
We are using
A directed Nav
(A to B may
Be different than
B to A)