A New Method to Handle Temporal Planning in Flexible Graphplan Framework

Article Preview

Abstract:

This paper presents a new algorithm FTGP which could deal with temporal information in Flexible planning framework. The new algorithm could solve the action whose duration is no longer an abstract time unit, but a positive real number. We defined new mutex relationships according to the characters of temporal planning and Flexible planning. FTGP adopted a compact graph expansion, which could save time and space of expansion.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 690-693)

Pages:

2776-2780

Citation:

Online since:

May 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Ian.M, Qiang.S, Peter.J: Engineering Applications of Artificial Intelligence, 14(3), pages 301-327, 2001.

Google Scholar

[2] Ian.M, Peter.J, Qiang.S: Proceedings of the Fourteenth European Conference on Artificial Intelligence, pages 506-510, 2000.

Google Scholar

[3] Ian. M, Qiang.S: Artificial Intelligence 148,pages 11-52,2003.

Google Scholar

[4] Avrim.L.B, Merrick. L.F: J. Artificial Intelligence, 90(1--2):281--300, 1997.

Google Scholar

[5] David. E.S, Daniel.S.W: In Proceedings of IJCAI, pages 326-337, 1999.

Google Scholar

[6] Long.D, Fox.M:Exploiting a graphplan framework in temporal planning. In Proceedings of ICAPS'03.

Google Scholar

[7] David.E.S, Daniel.S.W: Incremental Graphplan. Technical Report 98-09-06. Univ. of Wash.

Google Scholar

[8] David.E.S, Daniel S.W: Conditional Effects in Graphplan AIPS-98.

Google Scholar