8000 GitHub - Timotheergd/travelling_salesman_problem
[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to content

Timotheergd/travelling_salesman_problem

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

11 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Travelling Salesman Problem

The goal is to make a rust script to find the best path in a 2D grid (or 3D) grid betwin 2 points by going trought some checkpoints. There will be walls to avoid.

Why ?

I'm making this project to get the best path in a shop, and getting all my items.

How to use it

Install cargo (see rust documentation) and launch it with : cargo run

TO-DOs :

Starting ideas

For that, I have 4 ideas :

  • Done : Searching throught every possibilities
  • Going throught a path that goes everywhere and cut it when it is possible
  • Using a sort of AI, by creating a engine that goes randomly in the grid, rewarding or punishing him and taking the bests to create a new generation. OR a neural network ?
  • Ant colony
  • Using a tree to cover every points of the graph with the minimal cost and following it.

Tools

I need tools like :

  • an engine who can move
  • a pathfinding algorithme betwin 2 points, A* in the first place
  • a graph with all possibilities
  • a way to show the path

Inputs

This should be an external file containing the map of the shop (to define) but I will start with a grid in the program. A color define the type of product of the shelves, for example, yogurts.

An additionnal file ? to know in witch shelf are the products.

Output

The output sould be a screen with the map of the shop and a line to show the path to follow.

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

0