The Multiagent Planning Problem
The classical Multiple Traveling Salesmen Problem is a well-studied optimization problem. Given a set of n goals/targets and m agents, the objective is to find m round trips, such that each target is visited only once and by only one agent, and the total distance of these round trips is minimal. In...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi-Wiley
2017-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2017/3813912 |