Using deep reinforcement learning to play Snake game. The used algorithm is PPO for discrete! It has the brilliant performance in the field of discrete action space just like in continuous action space. You just need half an hour to train the snake and then it can be as smart as you.|使用深度强化学习玩蛇游戏。 使用的算法是离散的 PPO！ 它在离散动作空间领域有着与连续动作空间一样的出色表现。

Implement a navigational robot that performs global planning using A* and local planning using Vector Field Histogram (VFH) to help navigate the robot from start to end for a given map.

路径规划算法，主要是 A* 算法以及其 JPS 优化版本，考虑到了对角障碍物的阻塞和绕路情况，Python 实现。 // Python implementation of the A* (A-star) and Jump Point Search algorithms, handling cases with diagonal obstacles.

Robot that cleans room from dirts. Finds the optimum path eventually. Same algorithms are applied as in finding path to escape a maze.

Rescue 1122 Route Planner is a Artificial Intelligence project which implements the A-star algorithm using Python and the simulation is done using Pygame.

A* is a graph traversal and path search algorithm, which is often used in many fields of computer science due to its completeness, optimality, and optimal efficiency

A small simulation of the A* Algorithm fused with steering behaviours to make a car find an optimal path and move from start to goal, avoiding obstacles.

AI for Snake game using A star algorithm

8 Puzzle problem solution with A* algorithm, BFS, and DFS.

This is the implementation of A* and Best First Search Algorithms in python language. The project comprimise two data structures: stack and heap.

In this, we solved a maze using both Greedy Best First Search Algortihm and A* Algorithm

A science project that models the foot traffic of Boston Latin School using A*. Now open-sourced and ready to be used for any campus with a rotating schedule.

Explore a map to find an optimal path from start to goal using classical search-based methods

Python program to implement graph based A* algorithm on a map of Romania

This Python project implements the A* algorithm to find the optimal path in a randomly generated 2D matrix with obstacles. It allows users to choose between Manhattan and Euclidean distances for the pathfinding process. The matrix, along with the calculated path, is displayed on the console.

Implantation of the A* pathfinding algorithm to find the shortest path between two points and it has visualizations to show the algorithm in action.

Senior Design (Artificial Intelligence)

A* path finding algorithm visualized using python and kivy.

This repository contains materials from all disciplines of the third semester

This repository consists of code for visualization of working of A Star Algorithm. The visualization tool has been developed using Pygame.