Open AccessMultiagent Connected Path Planning: PSPACE-Completeness and How to Deal With It
Author(s) -
Davide Tateo,
Jacopo Banfi,
Alessandro Riva,
Francesco Amigoni,
Andrea Bonarini
Publication year - 2018
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.v32i1.11587
Subject(s) - completeness (order theory) , plan (archaeology) , computer science , graph , set (abstract data type) , path (computing) , pspace , existential quantification , theoretical computer science , mathematical optimization , mathematics , computational complexity theory , algorithm , discrete mathematics , history , programming language , mathematical analysis , archaeology
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom