Print Email Facebook Twitter Solving the Plan Coordination Problem Title Solving the Plan Coordination Problem Author Scharpff, J.C.D. Contributor Klos, T.B. (mentor) Faculty Electrical Engineering, Mathematics and Computer Science Department Software Engineering Programme Department of Algorithmics Date 2010-08-30 Abstract In this thesis we focus on implicit coordination for multi-agent planning problems. In such problems, agents are not able or willing to cooperate with each other and hence we need to perform pre-planning coordination in order to ensure that merging all their plans always results in a feasible joint plan. More specifically, we are interested in finding a minimal cardinality set of constraints such that when add this set to the multi-agent planning problem, no infeasible joint plan can be constructed, whatever local plan each agent develops. Finding such a minimal cardinality set is known as the PLAN COORDINATION PROBLEM (PC) which has been proven to be ?p2 -complete [44]. Previous work has focussed on approximation and special cases for PC, however some scenarios require or allow for exact solutions. Also, smaller instances might be solvable in reasonable time. This thesis discusses several exact solving methods and combines them into one exact algorithm that is able to solve instances with task sizes up to 50 planarcs within the hour. Subject multi-agent planningcoordination mechanismsimplicit coordination To reference this document use: http://resolver.tudelft.nl/uuid:81749be6-b1b2-40fe-ad13-02be9b9fbd01 Part of collection Student theses Document type master thesis Rights (c) 2010 Scharpff, J.C.D. Files PDF Scharpff_-_Solving_the_Pl ... roblem.pdf 2.7 MB Close viewer /islandora/object/uuid:81749be6-b1b2-40fe-ad13-02be9b9fbd01/datastream/OBJ/view