Loading...
Please wait, while we are loading the content...
Similar Documents
Minimizing the Cost of Team Exploration
| Content Provider | Semantic Scholar |
|---|---|
| Author | Urba'nska-Osula, Dorota |
| Copyright Year | 2017 |
| Abstract | A group of mobile entities is given a task to explore an edge-weighted tree T , i.e. every vertex of T has to be visited by at least one agent. There is no centralized unit to coordinate their actions, but they can freely communicate with each other and they know the structure of T in advance. The goal is to construct a deterministic strategy which allows robots to complete their task optimally. In this paper we are interested in a cost-optimal strategy, where the cost is understood as the sum of the total distance traversed by agents and the cost of invoking them. We present an algorithm that finds an optimal solution for a given n-node tree in O(n) time. keywords: graph exploration, distributed searching, fuel minimization, mobile agents |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | https://arxiv.org/pdf/1705.10826v1.pdf |
| Language | English |
| Access Restriction | Open |
| Subject Keyword | Algorithm Centralized computing Class Clique (graph theory) Competitive analysis (online algorithm) Cost efficiency Cycle (graph theory) Distance Entity Financial cost Graph - visual representation Graph theory Mobile agent NP-hardness Node - plant part Online and offline Population Parameter Real life Robot (device) Software license Trees (plant) Vertex Web strategy |
| Content Type | Text |
| Resource Type | Article |