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.
AI Automated Planning with STRIPS and PDDL in Node.js
In this project a gardening system has been automated using IoT in the Raspberry Pi platform.
A Single-Outcome Replanner for Computing Strong Cyclic Solutions in Fully Observable Non-Deterministic Domains
Entropy-controlled contexts in Python
Python implementation of the paper "RRT-Plan: A randomized algorithm for STRIPS planning"
Probabilistic planning solvers using hindsight optimization and reduction to ILP
AI Planning with Constraint Satisfaction Problems.
A behavior tree library to integrate with i.e Unity Game Engine for controlling agents / AIs / NPCs
Autonomous supermarket planned with AI. Planner POPF/XAIP/ROSplan | Automated Planning and Scheduling
Two agents (yellow and red spider) optimally reaching their targets (yellow and red fly) while avoiding obstacles (raindrops), using the A Star technique for AI planning. The user can move one obstacle.
AI agent game competition - Reinforcement learning (Monte Carlo Tree Search, Deep Q-learning, Minimax)
🦾 ⚡ Paladinus: An Iterative Depth-First Search FOND Planner.
Total-order Forward Decomposition Algorithm: HTN Planning
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.
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 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."