ISSN: 2310-757X
Please use this identifier to cite or link to this item:
http://elar.urfu.ru/handle/10995/51308| Title: | Multi-agent path planning |
| Authors: | Gorbenko, A. Popov, V. |
| Issue Date: | 2012 |
| Publisher: | IEEE |
| Citation: | Gorbenko A. Multi-agent path planning / Anna Gorbenko, Vladimir Popov // Applied Mathematical Sciences. — 2012. — Vol. 6. — № 133-136. — P. 6733-6737. |
| Abstract: | In this paper, we consider multi-agent path planning on graphs.In particular, we consider the multi-agent path planning problem on collision-free unit-distance graphs. We describe an approach to solve the problem. This approach is based on an explicit reduction from the problem to the satisfiability problem. |
| Keywords: | MULTI-AGENT SYSTEMS NP-COMPLETE PATH PLANNING ROBOT SATISFIABILITY PROBLEM |
| URI: | http://elar.urfu.ru/handle/10995/51308 |
| SCOPUS ID: | 84869842168 |
| PURE ID: | 1070875 |
| ISSN: | 1312-885X |
| Appears in Collections: | Научные публикации ученых УрФУ, проиндексированные в SCOPUS и WoS CC |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 2-s2.0-84869842168.pdf | 74,35 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.