Project managing robot movement from starting point to goal giving max speed and obstacles coords. Uses A* algorithm to find optimal path
on a discrete map. Given a way, the task is to follow it with a max speed possible. Also a bit of insufficient genetic algorithm approach were used,
gives poor results on a more complex tests.
For more detailed expanation, please refer to .pdf file.
This project is licensed under the terms of the MIT license.
-
Notifications
You must be signed in to change notification settings - Fork 0
nikolay-egorov/Robot-Movement
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Project managing robot movement from starting point to goal giving max speed and obstacles coords. Sort of dynamic path tracing made as a part of Optimisation Methods Course, ITMO.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published