https://github.com/daniel-beard/dstarlitejava

A java implementation of the incremental heuristic search algorithm D* Lite.
https://github.com/daniel-beard/dstarlitejava

dstarlite game-development java pathfinding

Last synced: 17 days ago
JSON representation

A java implementation of the incremental heuristic search algorithm D* Lite.

• Host: GitHub
• URL: https://github.com/daniel-beard/dstarlitejava
• Owner: daniel-beard
• Created: 2012-09-07T00:30:59.000Z (about 12 years ago)
• Default Branch: master
• Last Pushed: 2017-04-19T17:42:55.000Z (over 7 years ago)
• Last Synced: 2024-10-04T12:14:07.938Z (about 1 month ago)
• Topics: dstarlite, game-development, java, pathfinding
• Language: Java
• Size: 10.7 KB
• Stars: 53
• Watchers: 8
• Forks: 17
• Open Issues: 1
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
DStarLiteJava

=============

A java implementation of the incremental heuristic search algorithm D* Lite.

Getting Started

=============

Import the DStarLite, Pair and State files into your project.

Example usage: 

      //Create pathfinder

      DStarLite pf = new DStarLite();

      //set start and goal nodes

      pf.init(0,1,3,1);

      //set impassable nodes

      pf.updateCell(2, 1, -1);

      pf.updateCell(2, 0, -1);

      pf.updateCell(2, 2, -1);

      pf.updateCell(3, 0, -1);

      //perform the pathfinding

      pf.replan();

      //get and print the path

      List path = pf.getPath();

      for (State i : path)

      {   

         System.out.println("x: " + i.x + " y: " + i.y);

      }   

      

License

=============

MIT