The Fast Downward domain-independent classical planning system

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

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

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

Build a Forward Planning Agent

Fast Downward

Experience-Based Planning Domains (EBPDs)

Simple classical planning implementation for .NET.

🤖 Classical Planning with AI, from Udacity AI Nanodegree

Lazy Optimization Planner - domain-independent planning system

📖 My master's thesis @ UFRGS.

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

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

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.

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

Understanding Sample Generation Strategies for Learning Heuristic Functions in Classical Planning