Home

Welcome to the ConstrainedPlanningToolbox wiki!

The toolbox provides a collection of models, algorithms and tools that can be used for multi-agent planning under uncertainty in environments with resource constraints. The toolbox relies on Markov Decision Processes and Partially Observable Markov Decision Processes to model planning problems, which are augmented with additional constraints on resource consumption. This model can be used for a variety of constrained planning problems. Examples include robot navigation with limited battery capacity and planning for electric vehicle charging in congested distribution grids.

More mathematical details about the models and an overview of algorithms can be found in the accompanying survey:

Frits de Nijs, Erwin Walraven, Mathijs M. de Weerdt, and Matthijs T. J. Spaan. "Constrained Multiagent Markov Decision Processes: a Taxonomy of Problems and Algorithms". Journal of Artificial Intelligence Research 70 (2021): 955-1001.

This wiki provides all the information that you need to get started with constrained multi-agent planning under uncertainty. Furthermore, we encourage others to contribute to the toolbox by submitting additional algorithms and additional problem domains. When citing this toolbox in academic work, we encourage you to cite the aforementioned survey.