对不确定规划中观测约简的进-步研究.pdfVIP

ISSN1 RUXUEW 000—9825，CODEN Journal ofSoftware，V01．20，No．5，May2009，PP．1254-1268 doi：10．3724／SPJ．1001．2009．03453 o Institute reserved． Chinese rights by ofSoftware，theAcademyofSciences．All 对不确定规划中观测约简的进一步研究木 饶东宁1+，蒋志华1,2，姜云飞1，朱慧泉3 1(中山大学信息科学与技术学院软件研究所，广东广州510275) 2(暨南大学计算机系，广东广州510632) of of 3(School University Computing。NationalSingapore，Singapore) FurtherResearchonObservationReductioninNon-Deterministic Planning KAO Zhi．Hual，2，JIANGYun．Feil，ZHUHui．Quan3 Dong．Nin91+，JIANG ResearchInstitute。SchoolofInformationScienceand Yat-Sen 51 1(Software Technology，SunUniversity，Guangzhou0275，China) 2(DepartmentofComputerScience，JinanUniversity，Guangzhou510632，China) of 3(SchoolofComputing，NationalUniversitySingapore，Singapore) +Correspondingauthor：E-mail：rdn2006@163．com Rao YF，Zhu researchonobservationreductionin DN，JiangZH，Jlang HQ．Further planning．Journal in Abstract：This themethodsofobservationreductionnon-deterministic three paperimproves observation outthe observation MOS(minimalset)；in optimal aspects：infinding finding observationshavedifferent in fault-tolerantOOS．AMOS issimilartoaminimalset costs；andfinding problem can MOSis MSC it be that cover(MSC)problem，SOprovedfinding NP—hard．Inspiredby methods，an0(2”m2)but forMOSis misthenumberof fX2”1)algorithmpresented，where observations．Byusinginteger orfaulttolerantOOScanbefoundout．Pr