Let's upgrade cheap off-the-shelf robotic mowers to modern, smart RTK GPS based lawn mowing robots!
-
Updated
May 17, 2024 - C
Let's upgrade cheap off-the-shelf robotic mowers to modern, smart RTK GPS based lawn mowing robots!
This repository contains maze building and solving algorithms. The solvers are multithreaded.
A path finding algorithm written in javascript by me when I was younger.
#include-only, single header, custom written ai that can play ANY turn based game, including Boardgames, Card-games, hidden-info games, multiplayer games, and games with randomness.
🎮 An artificial intelligence game to demonstrate the A* pathfinding. The enemy will try to get close to the agent and make it stuck between walls.
Generalized voronoi diagram for python
Welcome to my Project 'Maze', an exciting project where I use the power of Tkinter to demonstrate different path finding algorithms.
Developed a Python tool with Pygame for interactive visualization, allowing users to comprehend Dijkstra's and A* pathfinding algorithms step by step.Customize mazes and dynamically toggle walls to observe algorithmic adaptability. Run the Python script, use the GUI to set points, and visualize algorithm behavior in real time.
A web app designed to visualize pathfinding and sorting algorithms.
simple-path-finding-algorithm
A Python snake game with a fun automatic mode based on a path finding algorithm.
🚀Welcome to the H.A.R.E. Mars Rover project, where we've unleashed the power of Haskell monads to chart precise paths across the Martian landscape 🗺️, while our disk rotation wizardry ensures data integrity even in the harshest conditions. From chunking files for floppy disk storage to dynamic track allocation, we're redefining space exploration.
A small program for visualizing the A* path-finding algorithm
A* search algorithm in TypeScript
A* Algorithm for robot path planning using a simple Euclidean heuristic function.
Research Project in A3C reinforcement learning algorithm used for path finding mobile robots
A decision-making algorithm used for game playing and decision-making problems. This algorithm combines the power of Monte Carlo simulation with the depth of tree search to find the best move or action. This GitHub project implements MCTS in Kotlin to solve decision-making problems efficiently.
Algorithms for CS3613: Introduction to Artificial Intelligence
Add a description, image, and links to the path-finding topic page so that developers can more easily learn about it.
To associate your repository with the path-finding topic, visit your repo's landing page and select "manage topics."