ECE-Engineer/DisasterZonePathFinding ECE-Engineer/DisasterZonePathFinding

  • Stars
    star
    2
  • Language
    Prolog
  • License
    MIT License
  • Created over 7 years ago
  • Updated over 7 years ago
Twitter logo Share LinkedIn logo Share Facebook logo Share
ECE-Engineer/DisasterZonePathFinding
github

ECE-Engineer

Reviews

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

Repository Details

This Prolog program be designed to assist in search-and-rescue operations after a natural disaster. An earthquake has scattered cars in a parking garage in such a way that a rescue robot cannot reach the entrance to the main building to search for survivors. A drone has been used to identify the layout of the cars as they sit now. A plan must be devised for how the cars can be moved backward and forward in order to clear a path from the robot’s entrance to the currently blocked door.

More Repositories

1

Alloy-Heat-Diffusion

A project to show how the temperatures on points of a metal alloy change and diffuse over time. This project utilized the ForkJoinPool, RecursiveAction, & Phaser. The second part of the project was utilizing cluster computing across servers and computers on a network.
C
1
star
2

Kohonen-Self-Organizing-Maps-CLISP

Kohonen SOMs is an unsupervised machine learning technique discovered by Professor Teuvo Kohonen in the 1980s. Kohonen SOMs are generally used for taking n-dimensional information and mapping it down to a 2D representation of the input space ℝn . In this project, this machine learning technique will be applied to a clustering a set of n-dimensional input and clustering the input together by common characteristics. Then categorizing the input to have a way to interact with the program. The application will be a form of color recognition utilizing kohonen Self Organizing Maps. The colors can be represented as vectors of (red, green, blue) components and the SOM will categorize the colors and you can then ask what color a given color vector best represents.
Common Lisp
1
star
3

Traveling-Salesman-Problem-Genetic-Algorithm-CLISP

Given a set of "N" cities, find the shortest possible path through all the cities, starting and ending at the same city. This Genetic Algorithm provides a way to optimize the best possible path between the cities after each generation.
Common Lisp
1
star