RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Model. Anal. Inform. Sist.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Model. Anal. Inform. Sist., 2011, Volume 18, Number 2, Pages 113–128 (Mi mais179)  

This article is cited in 2 scientific papers (total in 2 papers)

Mars robot puzzle (a multiagent approach to the Dijkstra problem)

E. V. Bodin, N. O. Garanina, N. V. Shilov

A. P. Ershov Institute of Informatics Systems Sib. Br. RAS

Abstract: 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.

Keywords: multiagent system, distributed algorithm, assignment problem, path-planning problem.

Full text: PDF file (697 kB)
References: PDF file   HTML file
UDC: 004.896 + 519.713
Received: 09.02.2011

Citation: E. V. Bodin, N. O. Garanina, N. V. Shilov, “Mars robot puzzle (a multiagent approach to the Dijkstra problem)”, Model. Anal. Inform. Sist., 18:2 (2011), 113–128

Citation in format AMSBIB
\Bibitem{BodGarShi11}
\by E.~V.~Bodin, N.~O.~Garanina, N.~V.~Shilov
\paper Mars robot puzzle (a multiagent approach to the Dijkstra problem)
\jour Model. Anal. Inform. Sist.
\yr 2011
\vol 18
\issue 2
\pages 113--128
\mathnet{http://mi.mathnet.ru/mais179}


Linking options:
  • http://mi.mathnet.ru/eng/mais179
  • http://mi.mathnet.ru/eng/mais/v18/i2/p113

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
    Cycle of papers

    This publication is cited in the following articles:
    1. A. Yu. Bernshtein, N. V. Shilov, “Multiagentnaya zadacha o robotakh v prostranstve: informatsionnyi i kriptograficheskii aspekty”, PDM. Prilozhenie, 2012, no. 5, 61–63  mathnet
    2. A. Yu. Bernshtein, N. V. Shilov, “Multiagentnaya zadacha o robotakh v prostranstve: slozhnostnói, informatsionnyi i kriptograficheskii aspekty”, Model. i analiz inform. sistem, 20:2 (2013), 34–53  mathnet
  • Моделирование и анализ информационных систем
    Number of views:
    This page:302
    Full text:121
    References:41

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020