Clustering and avoiding conflicts in planning with incomplete information

Abstract

Abstract.This paper describes a new algorithm for planing with incomplete information and conflicts. The given planing problem has two optimazation criteria: maximize the utility and minimize the conflicts of the plan. In order to achieve the first optimization goal by utility with incomplete data we build a clustering algorithm based on a fuzzy comparison method for intervals. To minimize the.conflicts while keeping a light utility, we apply genetic algorithm. The experiments show that a good balance is achieved by using a dual algorithm with a flexible order of maximizing utility and minimizing conflicts. GI61 THI¥UBai toan l~p ke hoach 111. bai toan kinh di~n diro'c S\!' quan tam d~c bi~t b&i cac ling dung rgng rai cua no. Trong moi trirong ba:t dinh, bai toan l~p ke hoach cho so lo n cac heat dgng yeu diu phai xu: If t5i U'U vo i thOng tin khOng d'ay du, tr anh xung dgt giira cac heat dgng, dtng tho'i phai giai quyet va:n de bung n5 t5 ho'p. Day la muc tieu ra:t kho thuc hien, Bai nay dira ra each giai quyet bai toan l~p ke hoach cac heat di;mg khong ro ket qua. V&i nhirng tham s5 d'au vao d~c trtrng cho m6i hoat d9ng 111. t~p gia tri mer, t~p cac hoat di?ng xung d9t, chung toi sU' dung thu~t toan kep M tim nghiern t5i U'U, dtng thoi tranh xung d9t nh~m dern lai di? thuan lo'i cao nha:t cho ke hoach.Cac ke't qui thirc nghiern thu diro'c cho tha:y tho'i gian thirc hi~n cu a phirong ph ap ttro'ng d5i ngh va cha:t hrong cii a ke hoach kha tot.2. BAI ToAN L~P KE HO~eH eHO cAe HO~T DQNG KHONG RO KET QuA 2.1. P'hat bi~u ba! toan Tjr mi?t t~p cac heat di?ng ma m6i heat di?ng d~c trtrng b&i bOn yeu to: + Di? U1l tien ve tho'i gian xay ra.+ Dg Ich lei rieng ciia tirng hoat dgng.(Di? ich lqi rieng cua mi?t heat di?ng la chi 55 ich lo'i no mang cho toan b9 ke hoach, chira tinh den cac yeu t5 xung <let va yeu t5 thai gian].+ T~p ten cac hoat dgng se xay ra xung di?t neu xep canh no.(Xung d9t la mi?t hi~n tiro'ng lam giarn cha:t hro'ng cua ke hoach, xay r a khi hai ho~c nhieu hoat d9ng nao do xep canh nhau. Vi du: hai Ioai thudc u5ng lien nhau co th~gay h~u qua xa:u) .+ Tho'i gian M thirc hi~n heat di?ng do.Thiet l~p ke hoach t5i U'U M thtrc hi~¥ tien trinh lie~tiep cua t~p heat di?ng tren. Dang t oan h9CCho t~p heat dgng M = {ml' m2, ... ,mn} vci mi: {Ui, [ai,bi],Xm"D.td (i = 1, ... ,n).Trong do: .-U i : d9 'ich lei rieng cii a heat di?ng i,