z-logo
open-access-imgOpen Access
Multi-Goal Multi-Agent Path Finding via Decoupled and Integrated Goal Vertex Ordering
Author(s) -
Pavel Surynek
Publication year - 2021
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v35i14.17472
Subject(s) - vertex (graph theory) , hamiltonian path , computer science , satisfiability modulo theories , path (computing) , hamiltonian path problem , modulo , solver , heuristic , task (project management) , undirected graph , graph , algorithm , mathematics , theoretical computer science , combinatorics , mathematical optimization , artificial intelligence , management , economics , programming language

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom