Abstract
Fast forward programming for creating/deleting objects is a method to deal with the problem of creating/deleting objects. This paper puts forward the concept of object element, which can be divided into ordinary object and object element. A new algorithm, RCDO algorithm, is designed. The partial relaxed RCDO algorithm is used to expand the planning diagram. In the process of expanding the planning diagram, mutual exclusion between actions, propositions and objects is considered. According to the newly constructed heuristic function, the heuristic value is calculated. In order to avoid the appearance of plain state, the enhanced mountain climbing method was used as the search strategy. The planning process for CDOFF is described in detail below.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Blum, A.L., Furst, M.L.: Fast planning through planning graph analysis. Artif. Intell. 90, 281–300 (1997)
Hoffmann, J.: The metric - FF planning system: translating “ignoring delete lists” to numeric state variables. J. Artif. Intell. Res. 20, 341 (2003)
Courcelle, B., Engelfriet, J.: Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach, 1st edn. Cambridge University Press, New York (2012)
Russell, S.J., Norvig, P.: Artificial Intelligence - A Modern Approach, 3rd edn. Pearson Education, London (2010)
Coles, A., Coles, A.: A Temporal relaxed planning graph heuristic for planning with envelopes. In: Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling (ICAPS 2017) (2017)
Gu, W.X., Cai, Z.Y., Zhang, X.M., et al.: The extending graphplan to handle the creating or destroying objects planning. In: ICMLC (2005)
Bonet, B., Loerincs, G., Geffner, H.: A robust and fast action selection mechanism for planning. In: Proceedings of AAAI-97, pp. 714–719. MIT Press (2018)
Hoffmann, J., Nebel, B.: The FF planning system: fast plan generation through heuristic search. J. Artif. Intell. Res. 14, 253–302 (2001)
Bit-Monnot, A., Smith, D.E, Do, M.: Delete-free reachability analysis for temporal and hierarchical planning. In: Proceedings of the HSDIP Workshop at the International Conference on Automated Planning and Scheduling (ICAPS) (2016)
Coles, A.J., Coles., A.I.: Have I been here before? State memoisation in temporal planning. In: Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS) (2016)
Acknowledgements
This work was supported by National Undergraduate Entrepreneurship Project (NO. 201911439030).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Sun, M., Wang, S. (2020). Creating/Deleting Objects Fast Forword Planning. In: Xu, Z., Parizi, R., Hammoudeh, M., Loyola-González, O. (eds) Cyber Security Intelligence and Analytics. CSIA 2020. Advances in Intelligent Systems and Computing, vol 1147. Springer, Cham. https://doi.org/10.1007/978-3-030-43309-3_15
Download citation
DOI: https://doi.org/10.1007/978-3-030-43309-3_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-43308-6
Online ISBN: 978-3-030-43309-3
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)