“Robots in Space” Multiagent Problem: Complexity, Information and Cryptographic Aspects
We study a multiagent algorithmic problem that we call Robot in Space (RinS): There are n ≥ 2 autonomous robots, that need to agree without outside interference on distribution of shelters, so that straight pathes to the shelters will not intersect. The problem is closely related to the assignment p...
Main Authors: | A. Yu. Bernstein, N. V. Shilov |
---|---|
Format: | Article |
Language: | English |
Published: |
Yaroslavl State University
2013-04-01
|
Series: | Моделирование и анализ информационных систем |
Subjects: | |
Online Access: | https://www.mais-journal.ru/jour/article/view/204 |
Similar Items
-
“Robots in Space” Multiagent Problem: Complexity, Information and Cryptographic Aspects
by: A. Yu. Bernstein, et al.
Published: (2013-01-01) -
Knowledge-based Algorithms for BDI-agents
by: Nikolay Vyacheslavovich Shilov, et al.
Published: (2020-12-01) -
Mars Robot Puzzle (a Multiagent Approach to the Dijkstra Problem)
by: E. V. Bodin, et al.
Published: (2011-06-01) -
On complexity of veri¯cation of nondeterministic probabilistic multiagent systems
by: M. K. Valiev, et al.
Published: (2010-12-01) -
APPLICATION OF ANT COLONY ALGORITHM FOR REALIZATION OF TRANSPOSITION CIPHERS CRYPT ANALYSIS
by: Vladimir A. Fatkhi, et al.
Published: (2011-02-01)