Continuous optimisation problem and game theory for multi-agent pathfinding
From MaRDI portal
Recommendations
- Multi-agent Path Finding Modulo Theory with Continuous Movements and the Sum of Costs Objective
- Branch-and-cut-and-price for multi-agent path finding
- A stochastic process approach for multi-agent path finding with non-asymptotic performance guarantees
- Conflict-based search for optimal multi-agent pathfinding
- Solving multi-agent path finding on strongly biconnected digraphs
Cites work
- A Differential Game Approach to Multi-agent Collision Avoidance
- A model of the joint motion of agents with a three-level hierarchy based on a cellular automaton
- A simplified combat model based on a cellular automaton
- Concurrent games with ordered objectives
- Conflict-based search for optimal multi-agent pathfinding
- Equilibrium Points of Nonatomic Games Over a Banach Space
- scientific article; zbMATH DE number 3594346 (Why is no real title available?)
- scientific article; zbMATH DE number 1748675 (Why is no real title available?)
- Mean Value Theorems for Vector Valued Functions
- Multi-agent pathfinding with continuous time
- Nash equilibria in concurrent games with Büchi objectives
- On the motion of agents across terrain with obstacles
- Payoff cellular automata and reflexive games
- Probabilistic properties of near-optimal trajectories of an agent moving over a lattice
This page was built for publication: Continuous optimisation problem and game theory for multi-agent pathfinding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6146784)
