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

DOI10.1016/J.ARTINT.2024.104084MaRDI QIDQ6494378zbMATH OpenWikidataFDO

Authors Xiaoyu He, Xueyan Tang, Wentong Cai, Jingning Li

Publication date 30 April 2024

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ARTINT.2024.104084

zbMATH Keywords

multi-agent path findingmulti-armed bandit problemnon-asymptotic performancestochastic process

Mathematics Subject Classification ID

Inference from stochastic processes (62M99) Agent technology and artificial intelligence (68T42) Multi-objective and goal programming (90C29)

Recommendations

• Conflict-based search for optimal multi-agent pathfinding
• scientific article; zbMATH DE number 5959974
• Pairwise symmetry reasoning for multi-agent path finding search
• Branch-and-cut-and-price for multi-agent path finding
• Robust multi-agent path finding and executing

Cites work

• A survey of some simulation-based algorithms for Markov decision processes
• Anytime Pareto local search
• Benchmarking optimization software with performance profiles.
• Conflict-based search for optimal multi-agent pathfinding
• Exploration-exploitation tradeoff using variance estimates in multi-armed bandits
• Finite-time analysis of the multiarmed bandit problem
• Heuristic search viewed as path finding in a graph
• Introduction to multi-armed bandits
• The increasing cost tree search for optimal multi-agent pathfinding

Cited in

(2)

• Continuous optimisation problem and game theory for multi-agent pathfinding
• A unified theoretical framework for the last-iterate convergence of stochastic adaptive optimization

This page was built for publication: A stochastic process approach for multi-agent path finding with non-asymptotic performance guarantees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6494378)