[1]GU Wen-xiang,YANG Yong-juan,YAN Shu-ya.Creating or deleting objects graphplan based on condition al effects[J].CAAI Transactions on Intelligent Systems,2007,2(3):12-18.
Copy
Creating or deleting objects graphplan based on condition al effects
CAAI Transactions on Intelligent Systems[ISSN 1673-4785/CN 23-1538/TP] Volume:
2
Number of periods:
2007 3
Page number:
12-18
Column:
学术论文—人工智能基础
Public date:
2007-06-25
- Title:
- Creating or deleting objects graphplan based on condition al effects
- Keywords:
- graphplan; correlative component; irrelative compon ent; creating or deleting objects component; conditional effects
- CLC:
- TP18
- DOI:
- -
- Abstract:
- Mainly research was done on the creating or deleting objects Graphplan that based on conditional effects. Firstly, several new concepts wer e propos ed, such as correlative component, irrelative component, creating or deleting ob jects component, common component and so on. Secondly, both actions with conditi onal effects and that without conditional effects were considered as components and the conception of transforming object into proposition was introduced. Third ly, a novel intelligent planning algorithm which expanded the planning graph bac kwards from the goal set and searched a valid plan forward was proposed and also a new definition of mutex inference backwards was given correspondingly. The me thod reduced the scale of the planning graph and the search space, improved the efficiency of searching the valid plan greatly. Because the effects created by a ctions were contexdependent, it was more suitable for the practical needs comp ared with previous methods, and made the planning problems to be handled much cl oser to the real word. Therefore, the method has its advantage over previous one s in application and has more practical significance.
- References:
-
［1］BLUM A, FURST M. Fast planning through planning graph analysis［A］ . In Proc 14th Int Joint Conf AI［C］. Montreal, Canada, 1995.
［2］BLUM A, FURST M. Fast planning through planning graph analysis［J］. J Ar tificial Intelligence, 1997,90(1-2):281-300.
［3］ANDERSON C R, SMITH D E,WELD D S. Conditional effects in graphplan［A］. In Proc AI Planning Systems Conference［C］. AAAI Press. Melo Park, 1998.
［4］WELD D S, ANDERSON C R, SMITH D E. Extending graphplan to handle uncertain and sensing actions［A］. In AAAI98［C］. Madison, Wisconsin, U S A, 1998.
［5］BLUM A L, LANGFORD J C. Probabilistic planning in the graphplan framework ［A］.AIPS98 Workshop on Planning as Combinatorial Search［C］. Pittsburgh , 199 8.
［6］PARKER E. Making graphplan goalDirected［A］. In ECP99［C］. Durham, Unit ed Kingdom , 1999.
［7］HONG J. Graph construction and analysis as a paradigm for plan recognition ［A］. In Proc of AAAI2000: Seventeenth National Conference on Artificial Inte lligence［C］. Austin, Texas, USA, 2000.
［8］GU Wenxiang, CAI Zengyu, ZHANG Xinmei, et al. Extending graphplan to handl e the creating or destroying objects panning［A］. ICMLC2005［C］. Guangzhou,Chi na, 2005.
［9］NEBEL B, DIMOPOULOS Y,KOEHLER J. Ignoring irrelevant facts and opera tors in plan generation［A］. In Proc 4th European Conference on Planning［C］. Toulouse, France, 1997.
［10］XU Li, GU Wenxiang, ZHANG Xinmei, et al. Goal-directed flexible graphplan ［A］. In Proceeding of 2005 International Conference on Machine Learning and Cy bernetics［C］. Guangzhou, China, 2005.
［11］KAMBHAMPATI S, PARKER E，LAMBRECHT E. Understanding and extending gr aphpla n［A］. In proceedings of the 4th European Conference on Planning Toulouse［C］. France, 1997.
［12］MIGUEL I, JARVIS P，SHEN Q. Flexible graphplan［A］. In Proceedings of the Fourteenth European Conference on Artificial Intelligence［C］. Berlin, Humbold t University, 2000.
［13］MITTAL S，FALKENHAINER B. Dynamic constraint satisfaction problems［A］. I n Proc. of the 8th National Conference on Artificial Intelligence［C］. Boston, Massachusetts, 1990.
- Similar References:
Memo
-
Last Update:
2009-05-06