A stochastic process approach for multi-agent path finding with non-asymptotic performance guarantees (Q6494378): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Heuristic search viewed as path finding in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-based search for optimal multi-agent pathfinding / rank
 
Normal rank
Property / cites work
 
Property / cites work: The increasing cost tree search for optimal multi-agent pathfinding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anytime Pareto local search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Multi-Armed Bandits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-time analysis of the multiarmed bandit problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploration-exploitation tradeoff using variance estimates in multi-armed bandits / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of some simulation-based algorithms for Markov decision processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank

Revision as of 13:19, 3 December 2024

scientific article; zbMATH DE number 7840022
Language Label Description Also known as
English
A stochastic process approach for multi-agent path finding with non-asymptotic performance guarantees
scientific article; zbMATH DE number 7840022

    Statements

    A stochastic process approach for multi-agent path finding with non-asymptotic performance guarantees (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 April 2024
    0 references
    multi-agent path finding
    0 references
    non-asymptotic performance
    0 references
    stochastic process
    0 references
    multi-armed bandit problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references