Skip to content

Implementation of Incremental Path Planning (D*-Lite) in Pacman Domain

Notifications You must be signed in to change notification settings

atinsinghal97/lifelong-planning-pacman

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

14 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Team Name : Group 4 Team Members: Neha Tandon, Atin Singhal, Shivani Shah, Amarnath Tadigadapa Topic Chosen: Topic 2: Life-long planning Contributions Of Each Member: Amarnath and Atin were responsible for implementation of Dlite and Naive Re-planning Aalgorithms while Shivani and Neha covered the compilation of the report. Instructions To Run The Code: Please Go To The Search Folder where we have Search.py, SearchAgent.py and pacman.py files and Run the Below Commands:

To Run Naive A* algorithm:

python pacman.py -l LAYOUT_NAME -p SearchAgent -a fn=nastar For Example to run the algorithm on MediumMaze use below cammand python pacman.py -l mediumMaze -p SearchAgent -a fn=nastar

To Run D* Lite Algorithm:

python pacman.py -l LAYOUT_NAME -p SearchAgent -a fn=dstarlite For Example to run the algorithm on MediumMaze use below cammand python pacman.py -l mediumMaze -p SearchAgent -a fn=dstarlite

About

Implementation of Incremental Path Planning (D*-Lite) in Pacman Domain

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages