In environments, where agents have their own goals, but they want to cooperate as well, it is necessary to look for common recipes, i.e., multi-agent plans. Using such plans, the agents fulfill the goals in a coordinated manner. Research field of multi-agent planning search for both theoretical guarantees and practical algorithms for solving of these problems.  Multi-agent planning problems can also comprise additional distinctive resources, which have to be handled by the agents. Resource allocation problems cover this extensions. The application domains can vary. In our group, we focus on a wide spectrum of problems from domain-independent planning, where the particular domain is a part of the input, to low-level domain specific planners, e.g., generating non-collision trajectories for hardware airplanes.

Contact person: Antonin Komenda

Learn more about Multi-agent planning and resource allocation in ATG