Rearrangement of Floor Layouts Based on Constraints

摘要

This paper proposes a system for rearranging floor layouts, which makes up a plan and schedule synchronously. Rearrangement of a floor layout (RAFL) is a search problem, which consists of pre-and postchange layouts of objects, workers, and a work hour limit. The goal in solving RAFL is to find a pair of rearrangement plan and its schedule. RAFL deals with planning and scheduling simultaneously, whereas, a schedule is usually determined after a plan is found. In RAFL, even if an optimal plan is obtained in advance, a schedule consisting of its elements may not be necessarily feasible. The proposed system uses constraints to represent required knowledge and tree search algorithm. The system is interactive and informs users of search progress. Users may interrupt a search at any time to correct the system if its search is too slow or reaches an insufficient solution. Experimental results show that the system interacted with the user can find a valid solution in scores of minutes, where the time to solve is considerably reduced.