The Fast Downward domain-independent classical planning system

The General Problem Solver, AI's 'first' algorithm, written in multiple programming languages.

Fast Downward

Build a Forward Planning Agent

Classical and FOND Planning for Pure-Past Linear Temporal Logic Goals

My implementation of the AIND classical planning project. The required modifications are included in the "my_planning_graph.py". The comparison results among different algorithms (e.g., depth-first, breadth-first, A*, greedy, uniform-cost) with different heuristics (e.g., unmet goals, max-level, level-sum, set-level) in terms of actions, expansi…

In Artificial Intelligence Planning, there are different types of planning, and this problem is an example of Classical Planning.

Implementation and analysis symbolic logic and classical search to implement an agent that performs progression search to solve planning problems

Understanding Sample Generation Strategies for Learning Heuristic Functions in Classical Planning

Simple classical planning implementation for .NET.

Experience-Based Planning Domains (EBPDs)

PDDL+ based AI Task Planning domain modelling a robot-enabled cafe environment. Part of Assignment for AI for Robotics 2 course at UniGe, Italy.

🤖 Classical Planning with AI, from Udacity AI Nanodegree

Lazy Optimization Planner - domain-independent planning system

Udacity - Artificial Intelligence - Project 2 (Classical Planning) - Air Cargo Problems - All Files - Passed Fri 06 July 2018

📖 My master's thesis @ UFRGS.

My solutions to projects 1, 2 & 3 of Berkeley's AI course