4.: Difference between revisions
Jump to navigation
Jump to search
mNo edit summary |
No edit summary |
||
| Line 4: | Line 4: | ||
https://dl.acm.org/citation.cfm?id=3016346 | https://dl.acm.org/citation.cfm?id=3016346 | ||
===Summary=== | ====Summary==== | ||
This paper looks into a way to minimize the time it takes for all packages within a set to be delivered, working with the following model of the world: each robot caries one package, 2 adjacent robots can exchange their packages and each package needs to be delivered at a certain destination. The model especially studies the amount of robots best to employ for a given set of packages. | This paper looks into a way to minimize the time it takes for all packages within a set to be delivered, working with the following model of the world: each robot caries one package, 2 adjacent robots can exchange their packages and each package needs to be delivered at a certain destination. The model especially studies the amount of robots best to employ for a given set of packages. | ||
Latest revision as of 13:06, 21 March 2018
Multi-Agent Path Finding with Payload Transfers and the Package-Exchange Robot-Routing Problem
Multi-Agent Path Finding with Payload Transfers and the Package-Exchange Robot-Routing Problem Hang Ma, Craig Tovey, Guni Sharon, T. K. Satish Kumar, Sven Koenig https://dl.acm.org/citation.cfm?id=3016346
Summary
This paper looks into a way to minimize the time it takes for all packages within a set to be delivered, working with the following model of the world: each robot caries one package, 2 adjacent robots can exchange their packages and each package needs to be delivered at a certain destination. The model especially studies the amount of robots best to employ for a given set of packages.