Skip to content

Java implementation of algorithms from Norvig And Russell's "Artificial Intelligence - A Modern Approach"

License

Notifications You must be signed in to change notification settings

PalindromeLeung/aima-java

 
 

Repository files navigation

AIMA4e-Java (JDK 8+) Build Status

Java implementation of algorithms from Norvig And Russell's "Artificial Intelligence - A Modern Approach 4th Edition." You can use this in conjunction with a course on AI, or for study on your own. We're loooking for solid contributors to help.


NOTE: This is an in progress complete rewrite of the algorithms, leveraging JDK 8's new language features, from the AIMA3e branch (currently master branch). This will also become the new master branch once the 4th edition of "Artificial Intelligence - A Modern Approach" is published.


Index of Implemented Algorithms

Fig Page Name/Pseudocode (in book) Implementation(s)
2.1 35 Agent Agent
2.3 36 Table-Driven-Vacuum-Agent TableDrivenVacuumAgent
2.7 47 Table-Driven-Agent TableDrivenAgent
2.8 48 Reflex-Vacuum-Agent ReflexVacuumAgent
2.10 49 Simple-Reflex-Agent SimpleReflexAgent
2.12 51 Model-Based-Reflex-Agent ModelBasedReflexAgent
3 66 Problem Problem
3.1 67 Simple-Problem-Solving-Agent SimpleProblemSolvingAgent
3.2 68 Romania SimplifiedRoadMapOfPartOfRomania
3.7 77 Tree-Search ExampleTreeSearch
Alternative(s)
TreeQueueSearch
TreeGoalTestedFirstQueueSearch
TreePriorityQueueSearch
3.7 77 Graph-Search ExampleGraphSearch
Alternative(s)
GraphQueueSearch
GraphGoalTestedFirstQueueSearch
GraphPriorityQueueSearch
3.10 79 Node Node
3.11 82 Breadth-First-Search TODO - ExampleBreadthFirstSearch
Alternative(s)
BreadthFirstQueueSearch
3.14 84 Uniform-Cost-Search TODO - ExampleUniformCostSearch
Alternative(s)
UniformCostQueueSearch
3 5 Depth-first Search DepthFirstQueueSearch
3.17 88 Depth-Limited-Search DepthLimitedTreeSearch
3.18 89 Iterative-Deepening-Search IterativeDeepeningSearch
3 92 Best-First search BestFirstQueueSearch
3 92 Greedy best-First search GreedyBestFirstQueueSearch
3 93 A* Search AStarQueueSearch
3.26 99 Recursive-Best-First-Search RecursiveBestFirstSearch
4.2 122 Hill-Climbing HillClimbingSearch
4.5 126 Simulated-Annealing SimulatedAnnealingSearch

TODO (REMEMBER - KEEP IT SIMPLE SIMPLE SIMPLE!!!! :)

CURRENT (Rewrite of chapters 3 to 6)

Chp 3

  • Different types of Search APIs (i.e SearchActionsFunction, SearchStateFunction, SearchActionFunction) for different use cases.
  • Add Bidirectional Search implementation.
  • GraphPriorityQueueSearch and TreePriorityQueueSearch potentially need a better mechanism for determining state containment and removal of a node with a lower priority.
  • Recursive-Best-First-Search - look to improve/tidy up implementation.
  • Add a mechanism for gathering search metrics. Want to make more flexible and introduce less clutter into the core algorithms in order to support.

Chp 4

  • Reconsider using a separate state oriented Search API (as opposed to the current sequence of actions).
  • Follow up on Genetic Algorithm experiments on N-Queens problem (based on aima3e implementation) to determine if performs no better than random selection.

Chp 5

Chp 6

LATER

Chapter 4 'core' module.

  • Add tests for all implemented algorithms.

Chapter 3 'core' module.

  • Add tests for all implemented algorithms.

Chapter 2 'core' module.

  • Add tests for all implemented algorithms.

Chapter 2 'extra' module.

  • Environment definition: Consider specifying Dimensions in API, see pg. 42.
  • Environment Simulator referenced on pg. 45 (this will be a re-factor of a lot of the environment stuff in aima3e-core).

USEFUL RESOURCES

GUI

About

Java implementation of algorithms from Norvig And Russell's "Artificial Intelligence - A Modern Approach"

Resources

License

Stars

Watchers

Forks

Packages

No packages published

Languages

  • Java 100.0%