Online Planner Selection with Graph Neural Networks and Adaptive Scheduling (AAAI 2020)
-
Updated
Mar 24, 2023 - Python
Online Planner Selection with Graph Neural Networks and Adaptive Scheduling (AAAI 2020)
Projects from Udacity's Artificial Intelligence Nanodegree (August 2017 cohort) - TERM 1.
This repository contains a Forward Planning Agent & multiple algorithms in Python.
Code to read and analyse Planning graph, including GrapPlan Planner available at http://www.cs.cmu.edu/~avrim/graphplan.html
Defining and solving classical problems in PDDL (Planning Domain Definition Language)
solve deterministic logistics planning problems for an Air Cargo transport system using a planning search agent
My solutions to the projects assigned for the Udacity Artificial Intelligence Nanodegree
Term 1 Project 2 Implement a Planning Search by Luke Schoen for Udacity Artificial Intelligence Nanodegree (AIND)
Domain independent planner
Udacity AI Nanodegree's Project for implementing a Planning search. This project uses multiple search algorithms to solve a planning problem and then analyses the results based on certain metrics to find the best heuristic.
Project: Implement a Planning Search | Artificial Intelligence Nanodegree | Udacity
In Artificial Intelligence Planning, there are different types of planning, and this problem is an example of Classical Planning.
Add a description, image, and links to the planning-graph topic page so that developers can more easily learn about it.
To associate your repository with the planning-graph topic, visit your repo's landing page and select "manage topics."