The current state of 3D path-planning leaves room for improvement. To navigate a 3D
environment, techniques which were developed for 2D navigation are used and slightly
adapted to generate convincing motion. However, these techniques often constrict the
motion to a single plane. This constriction is not only a limitation, but also increases
the error. We created a new method to compute a path in a 3D world without a planar
constraint. We will discuss the computation of a Navigation Volume Network (NavNet),
and how it finds a path. A NavNet is the 3D generalization of NavMeshes, and holds
boundary and connection information which is utilized when planning a path for motion.
Similar to how NavMeshes allow path-planning by simplifying the ground meshes, the
NavNet simplifies the search space by approximating the 3D world through sampling. / Thesis / Master of Applied Science (MASc)
| Identifer | oai:union.ndltd.org:mcmaster.ca/oai:macsphere.mcmaster.ca:11375/25319 |
| Date | January 2019 |
| Creators | Gwosdz, Thomas |
| Contributors | von Mohrenschildt, Martin, Computing and Software |
| Source Sets | McMaster University |
| Language | English |
| Detected Language | English |
| Type | Thesis |
Page generated in 0.0021 seconds