Zobrazeno 1 - 10
of 474
pro vyhledávání: '"Andreychuk, A. A."'
Multi-agent pathfinding (MAPF) is a challenging computational problem that typically requires to find collision-free paths for multiple agents in a shared environment. Solving MAPF optimally is NP-hard, yet efficient solutions are critical for numero
Externí odkaz:
http://arxiv.org/abs/2409.00134
Autor:
Skrynnik, Alexey, Andreychuk, Anton, Borzilov, Anatolii, Chernyavskiy, Alexander, Yakovlev, Konstantin, Panov, Aleksandr
Multi-agent reinforcement learning (MARL) has recently excelled in solving challenging cooperative and competitive multi-agent problems in various environments with, mostly, few agents and full observability. Moreover, a range of crucial robotics-rel
Externí odkaz:
http://arxiv.org/abs/2407.14931
Multi-agent pathfinding (MAPF) is the problem of finding a set of conflict-free paths for a set of agents. Typically, the agents' moves are limited to a pre-defined graph of possible locations and allowed transitions between them, e.g. a 4-neighborho
Externí odkaz:
http://arxiv.org/abs/2404.16379
The Multi-Agent Pathfinding (MAPF) problem involves finding a set of conflict-free paths for a group of agents confined to a graph. In typical MAPF scenarios, the graph and the agents' starting and ending vertices are known beforehand, allowing the u
Externí odkaz:
http://arxiv.org/abs/2312.15908
Autor:
Skrynnik, Alexey, Andreychuk, Anton, Nesterova, Maria, Yakovlev, Konstantin, Panov, Aleksandr
Multi-agent Pathfinding (MAPF) problem generally asks to find a set of conflict-free paths for a set of agents confined to a graph and is typically solved in a centralized fashion. Conversely, in this work, we investigate the decentralized MAPF setti
Externí odkaz:
http://arxiv.org/abs/2310.01207
Autor:
Pitanov, Yelisey, Skrynnik, Alexey, Andreychuk, Anton, Yakovlev, Konstantin, Panov, Aleksandr
In this work we study a well-known and challenging problem of Multi-agent Pathfinding, when a set of agents is confined to a graph, each agent is assigned a unique start and goal vertices and the task is to find a set of collision-free paths (one for
Externí odkaz:
http://arxiv.org/abs/2307.13453
Publikováno v:
Біологічні студії, Vol 18, Iss 2, Pp 233-250 (2024)
Introduction. Campanula alpina is a perennial herbaceous bellflower grown in the Eastern Alps, Carpathians, and Balkans. Fruit in Campanula species opens by the hippocrepiform slits in the fruit wall, which are formed by axicorns, elongated structure
Externí odkaz:
https://doaj.org/article/01431dcd9ca74b5690bcf56676ade54f
Heuristic search algorithms, e.g. A*, are the commonly used tools for pathfinding on grids, i.e. graphs of regular structure that are widely employed to represent environments in robotics, video games etc. Instance-independent heuristics for grid gra
Externí odkaz:
http://arxiv.org/abs/2212.11730
Conflict-Based Search (CBS) is a widely used algorithm for solving multi-agent pathfinding (MAPF) problems optimally. The core idea of CBS is to run hierarchical search, when, on the high level the tree of solutions candidates is explored, and on the
Externí odkaz:
http://arxiv.org/abs/2209.09612
We introduce POGEMA (https://github.com/AIRI-Institute/pogema) a sandbox for challenging partially observable multi-agent pathfinding (PO-MAPF) problems . This is a grid-based environment that was specifically designed to be a flexible, tunable and s
Externí odkaz:
http://arxiv.org/abs/2206.10944