Mars Robot Puzzle (a Multiagent Approach to the Dijkstra Problem)
| Autor: | E. V. Bodin, N. O. Garanina, N. V. Shilov |
|---|---|
| Jazyk: | English<br />Russian |
| Rok vydání: | 2011 |
| Předmět: | |
| Zdroj: | Моделирование и анализ информационных систем, Vol 18, Iss 2, Pp 113-128 (2011) |
| Druh dokumentu: | article |
| ISSN: | 1818-1015 2313-5417 |
| Popis: | We continue our study of multiagent algorithms for a problem that we call the Mars Robot Puzzle. This problem could be considered as a special case of a graph-theoretic problem (Discrete Mathematics), as a combinatorial geometry problem (Computer Science), or as a very special case of a path-planning problem (Artificial Intelligence). Our algorithms grew up from a local search (heuristic) solution of the problem suggested by E.W. Dijkstra. In the paper we present a series of new multiagent algorithms solving the problem, prove (manually) their correctness, model check some of these algorithms, and discuss further research topics. All our algorithms are multiagent in contrast to "centralized" graph and combinatorial algoritms; correctness of our algorithms is formally proven, while the testing is used for validation of path-planning algorithms. |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|