#TITLE_ALTERNATIVE#
In an open space, there exist some points of interest. It is desired that those points are inspected. Instead of visiting them one by one, it is better to visit them all at once. The problem can be divided into smaller problems where a point must be inspected by at least one robot. The main problem...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/11202 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| Summary: | In an open space, there exist some points of interest. It is desired that those points are inspected. Instead of visiting them one by one, it is better to visit them all at once. The problem can be divided into smaller problems where a point must be inspected by at least one robot. The main problem now is how to deploy those robots. In this final assignment, the deployment problem will be described as a geometric optimization problem and a solution will be found. After that, an algorithm will be created using the solution to deploy the robots. |
|---|