Wiki › Technique

Pathfinding

Technique

No article has been written for this page yet; it is generated from the knowledge graph.
About Pathfinding · from Wikipedia

Pathfinding or pathing is the search, by a computer application, for the shortest route between two points. It is a more practical variant on solving mazes. This field of research is based heavily on Dijkstra's algorithm for finding the shortest path on a weighted graph.

Summary from Wikipedia ↗, CC BY-SA 4.0.
  • Agent-to-room navigation May 2024
    It shows the path from an agent to a chosen room, seen from a fixed bird's-eye camera, using Unity's NavMesh pathfinding.
  • iNav pathfinder Apr 2024
    iNav pathfinder is the first of his iNav indoor-navigation experiments in Unity.

In the knowledge graph

Pathfinding and the 2 things it is linked to. Open any dot for its page, or explore it in the full graph.

As data

Everything on this page is read from triples in the knowledge graph. These are the 6 it states about Pathfinding, and 1 more its ontology implies; the console runs SPARQL over the whole graph, here in your browser.

Download
@prefix id: <https://ask.chaipat.cc/id/> .
@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
@prefix cj: <https://ask.chaipat.cc/ns#> .
@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .
@prefix skos: <http://www.w3.org/2004/02/skos/core#> .
@prefix schema: <https://schema.org/> .

id:Pathfinding
    a cj:Technique ;
    rdfs:label "Pathfinding" ;
    skos:altLabel "pathfinding" , "NavMesh" , "pathfinder" ;
    schema:sameAs <https://en.wikipedia.org/wiki/Pathfinding> .