过去一年中添加的文章,按日期排序

非固定送货位置的多智能体取送货问题研究

翟民, 章政, 黄卫华, 付亮亮, 罗文龙 - 计算机辅助设计与图形学学报 - jcad.cn
8 天前 - … 取送货(multi-agent pickup and delivery, MAPD)问题, 提出一种基于能源成 本的启发
式冲突搜索最优任务分配(energy-cost-based heuristic conflict-based search with optimal task …

Multi-Agent Trajectory Planning for Nonholonomic UAVs

O Maass, T Vallgren - 2024 - diva-portal.org
20 天前 - … The first algorithm is a UAV-like Conflict-Based Search (CBS) algorithm, belonging
to the optimal MAPF solver class, and is based on a Carlike CBS algorithm. The second …

Fools Rush in Where Angels Fear to Tread in Multi-Goal CBS

G Mouratidis, B Nebel, S Koenig - … Symposium on Combinatorial Search, 2024 - ojs.aaai.org
39 天前 - … Research on multi-agent pathfinding (MAPF) has recently shifted towards problem
… the Conflict Based Search (CBS) algorithm to multiple goals. This extension might look

MGCBS: An Optimal and Efficient Algorithm for Solving Multi-Goal Multi-Agent Path Finding Problem

M Tang, Y Li, H Liu, Y Chen, M Liu, L Wang - arXiv preprint arXiv …, 2024 - arxiv.org
69 天前 - … the optimal solution. To obtain the optimal result, we propose the MultiGoal
Conflict-Based Search (MGCBS), which is based on Decoupling the goal Safe interval visiting order …

Optimal and Bounded Suboptimal Any-Angle Multi-agent Pathfinding

K Yakovlev, A Andreychuk, R Stern - … on Combinatorial Search, 2024 - ojs.aaai.org
74 天前 - Multi-agent pathfinding (MAPF) is the problem of finding a set of conflict-free paths
for a … Disjoint splitting for multi-agent path finding with conflictbased search. In International …

Targeted Parallelization of Conflict-Based Search for Multi-Robot Path Planning

T Guo, J Yu - arXiv preprint arXiv:2402.11768, 2024 - arxiv.org
140 天前 - … “Conflict-based search for optimal multi-agent pathfinding,… for multi-agent path
finding with conflict-based search.” in … for multi-agent path finding with conflict-based search,” in …

Optimal Task Assignment and Path Planning using Conflict-Based Search with Precedence and Temporal Constraints

YQ Chong, J Li, K Sycara - arXiv preprint arXiv:2402.08772, 2024 - arxiv.org
147 天前 - Multi-Agent Path Finding (MAPF) problem entails findingPath Finding with
Precedence and Temporal Constraints (TAPF-PTC) problem. We augment Conflict-Based Search (…

A stochastic process approach for multi-agent path finding with non-asymptotic performance guarantees

X He, X Tang, W Cai, J Li - Artificial Intelligence, 2024 - Elsevier
159 天前 - … bound based rule for finding the optimal state transition strategy… conflict based
search and Monte Carlo tree search. We show that the proposed method is almost surely optimal

Synergistic Strategies in Multi-Robot Systems: Exploring Task Assignment and Multi-Agent Pathfinding

Y Bai - 2024 - diva-portal.org
168 天前 - … non-holonomic heterogeneous robots based on Conflict-based Search (Papers A)
Conflict-Based Search (DFCBS) algorithm, devised to address the Multi-Agent Pathfinding (…

Depth-First-Conflict-Based Search in Non-Holonomic Heterogeneous Robot Scenarios

Y Bai, C Kanellakis, G Nikolakopoulos - 2024 - diva-portal.org
168 天前 - … addressing the limitationsinherent in current Multi-Agent Path Finding (MAPF)
models. … , with a conflict-based search (CBS) for efficientconflict resolution. A depth-first search