A simple HTN planner based around the principles of the Builder pattern.
-
Updated
May 24, 2024 - C#
A simple HTN planner based around the principles of the Builder pattern.
Simple classical planning implementation for .NET.
KLEP (Key-Lock-Executable-Process) is a groundbreaking AI framework that utilizes symbolic AI for dynamic decision-making. It integrates keys, locks, executables, and processes to foster ethical, modular, and transparent AI applications, offering a novel approach for developers and researchers in AI and cognitive science.
This repository uses Planning Domain Definition Language (PDDL) to optimize a yearly book reading schedule, balancing pages read and adhering to constraints like reading order, book predecessors and parallel reads.
An AI planning project based on the 2019 international university timetabling competition which used commercial software IBM CPLEX to generate feasible course timetables with minimum penalty.
🦾 ⚡ Paladinus: An Iterative Depth-First Search FOND Planner.
Planning tasks succinctly represent labeled transition systems, with each ground action corresponding to a label. This granularity, however, is not necessary for solving planning tasks and can be harmful, especially for model-free methods. In this work, we propose automatic approach to reduce the label sets for planning domains.
Mini AI Task and Motion Planning project. Part of Assignment of AI for Robotics 2 course at UniGe, Italy.
Collaborative definition of HDDL Temporal extension
PDDL+ based AI Task Planning domain modelling a robot-enabled cafe environment. Part of Assignment for AI for Robotics 2 course at UniGe, Italy.
ABL-Unity3D is a GUI-based and efficient Genetic Programming (GP) and AI Planning framework designed for agent-based learning (ABL) research.
AI Automated Planning with STRIPS and PDDL in Node.js
Repo for lab assignments in to course TDDC17 - Artificial Intelligence, taught at Linkoping University, Sweden.
In this project a gardening system has been automated using IoT in the Raspberry Pi platform.
AI agent game competition - Reinforcement learning (Monte Carlo Tree Search, Deep Q-learning, Minimax)
In Artificial Intelligence Planning, there are different types of planning, and this problem is an example of Classical Planning.
Final work of the master's degree course in Artificial Intelligence and Robotics - Sapienza, Rome
Problem instances for help debugging/testing/improving pyplanners and pddlstream
OWLS-FDplan is a service composition planner: Given a set of problem and/or domain described in OWL as input, as well as a service composition problem expressed in OWL-S 1.1, OWLS-FDplan produces a set of plans solving that problem.
A Single-Outcome Replanner for Computing Strong Cyclic Solutions in Fully Observable Non-Deterministic Domains
Add a description, image, and links to the ai-planning topic page so that developers can more easily learn about it.
To associate your repository with the ai-planning topic, visit your repo's landing page and select "manage topics."