По вашему запросу найдено документов: 31690
Страница 1 из 3169
Applying MAPP algorithm for cooperative path finding in urban environments of intelligent agents (mobile robots). Two divergent approaches, e.g. centralized and decentralized, are surveyed
Path finding for the coalition of co-operative agents acting in the environment with destructible obstaclesThe problem of planning a set of paths for the coalition of robots (agents) with different
Two techniques that enhance the performance of multi-robot prioritized path planning the search-space of the individual planner involved in the prioritized path finding. © 2018 International
Improving Continuous-time Conflict Based Search*Multi-Agent Pathfinding (MAPF) is the problem of finding paths for n agents in a graph
On the application of safe-interval path planning to a variant of the pickup and delivery problemWe address a variant of multi-agent pickup and delivery problem and decouple into two parts: task
Multi-agent path finding with kinematic constraints via conflict based search of mobile agents operating in the shared environment, i.e. multi-agent path-finding (MAPF). A modification
Prioritized multi-agent path finding for differential drive robotsPrioritized multi-agent path finding for differential drive robots
Multi-agent pathfinding with continuous timeMulti-Agent Pathfinding (MAPF) is the problem of finding paths for multiple agents such that every
Multi-agent pathfinding with continuous timeMulti-Agent Pathfinding (MAPF) is the problem of finding paths for multiple agents such that each
Any-Angle Pathfinding for Multiple Agents Based on SIPP Algorithm based on Safe Interval Path Planning (SIPP) algorithm is proposed to find trajectories for an agent
Страница 1 из 3169
Фасеты
Партнеры
Индексация
