日本計算工学会論文集
Online ISSN : 1347-8826
ISSN-L : 1344-9443
資源割当てを伴う複数経路探索における対話的制約充足
小野 智司浜田 佳延水野 一徳西原 清一中山 茂
著者情報
ジャーナル フリー

2005 年 2005 巻 p. 20050001

詳細
抄録

This paper proposes a planning and scheduling method for rearrangement of floor layouts (RAFL)-a search problem involving multi-path planning and resource allocation. RAFL consists of pre- and postchanged layouts of objects, workers and a work time limit. The goal in solving RAFL is to find a pair of a rearrangement plan - a set of paths for each object - and its schedule - an assignment of actions for each worker in each turn in order to make objects move along the planned paths. RAFL is difficult to find even a feasible solution due to frequent collision and scrambles for workers among objects. The proposed method represents the problem by a set of various, complex constraints necessary to planning and scheduling, and finds a solution efficiently by using user’s advice as both constraints and heuristics for pruning wasteful search space and weighting significant values and variables. Experimental results showed user’s advice considerably reduced the time to solve and enabled to get a feasible solution within practical time.

著者関連情報
© 2005 The Japan Society For Computational Engineering and Science
次の記事
feedback
Top