This paper proposes a rescheduling method based on a distributed cooperative problem solving model to cope with contingencies. Using several Planners with different search strategies, the rescheduling system tries to obtain a solution. In case the solution which satisfies all the constraints cannot be found, the proposed system detects some of the most promising positions where it is effective to apply relaxation of constraints, and displays candidate conditions to be relaxed to the human operator for the purpose of supporting his/her decision. This idea is applied to a train rescheduling problem, and the result of the experiment is shown.
|出版ステータス||Published - 1996 12月 1|
|イベント||Proceedings of the 1996 IEEE Conference on Emerging Technologies and Factory Automation, ETFA'96. Part 2 (of 2) - Kauai, HI, USA|
継続期間: 1996 11月 18 → 1996 11月 21
|Other||Proceedings of the 1996 IEEE Conference on Emerging Technologies and Factory Automation, ETFA'96. Part 2 (of 2)|
|City||Kauai, HI, USA|
|Period||96/11/18 → 96/11/21|
ASJC Scopus subject areas