Multiagent Connected Path Planning: PSPACE-Completeness and How to Deal With It

This package contains the experiments for the paper:

Tateo, D., Banfi, J., Riva, A., Amigoni, F., & Bonarini, A. (2018, April). Multiagent connected path planning: PSPACE-completeness and how to deal with it. In Thirty-Second AAAI Conference on Artificial Intelligence.

To cite this paper:

@inproceedings{tateo2018multiagent,
  title={Multiagent connected path planning: PSPACE-completeness and how to deal with it},
  author={Tateo, Davide and Banfi, Jacopo and Riva, Alessandro and Amigoni, Francesco and Bonarini, Andrea},
  booktitle={Thirty-Second AAAI Conference on Artificial Intelligence},
  year={2018}
}

Installation

1. Install ROS
2. Install the required dependencies (Eigen3, Boost 1.53)
3. Clone the repository into the ROS workspace
4. Compile the ROS workspace using catkin_make