About topic

• Plan paths under communication constrained for a team of agents

• Extend the method to handle non-homogeneous teams

• Evaluate the impact of the changes on the computational complexity of the method

Suitable for: Student(s) who are interested in multi-agent path-finding on graphs.

Requirements: C/C++

Work can be adapted towards: bachelor or master thesis

Are you interested?

Contact herynjac@fel.cvut.cz!