Abstract
Hierarchical Task Network (HTN) is widely used for intelligent planning problems due to its simplicity and efficiency. As an intelligent planner based on HTN, JSHOP2 can complete task planning in order of precedence or randomly. In real-world tasks planning, such as automatic vehicles dispatch, has to deal with complicated auto planning problems where different tasks must be considered properly at the same time. But JSHOP2 ignores the priority of different tasks and thus fails to deal with multi-task planning problems with priorities. In this paper, we improve JSHOP2 planner by adding priorities to different task lists and task items, and adjusting the order of task execution according to priority. Furthermore, we conduct an experiment using a classic logistics problem, and get the results validate the effectiveness of our method.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ontanon, S., Buro, M.: Adversarial hierarchical-task network planning for complex real-time games. In: Proceedings of the 24th International Conference on Artificial Intelligence (IJCAI), pp. 1652–1658 (2015)
Ilghami, O.: Documentation for JSHOP2. Department of Computer Science, University of Maryland, Technical Report (2006)
Georgievski, I., Aiello, M.: HTN planning: overview, comparison, and beyond. Artif. Intell. 222, 124–156 (2015)
Nau, D., et al.: SHOP2: an HTN planning system. J. Artif. Intell. Res. 20, 379–404 (2003)
Fox, M., Long, D.: pddl2.1: an extension to pddl for expressing temporal planning domains. J. Artif. Intell. Res. 20, 61–124 (2003)
Song, S., Lee, S.-W.: A goal-driven approach for adaptive service composition using planning. Math. Comput. Model. 58(1–2), 261–273 (2013)
Lu, F., Tian, G., Li, Q.: An improved JSHOP2 planner oriented to service robot multi-tasks planning. In: 2016 Chinese Control and Decision Conference (CCDC) (2016)
Nau, D.S., Cao, Y., Lotem, A., Muñoz-Avila, H.: SHOP: simple hierarchical ordered planner. In: Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, pp. 968–973. AAAI Press (1999)
Liu, C., Layland, J.: Scheduling algorithms for multiprogramming in a hard real-time environment. J. ACM 20, 46–61 (2003)
Biyabani, S.R., Stankovic, J.A., Ramamritham, K.: The integration of deadline and criticalness in hard real-time scheduling. In: Proceedings of the 9th IEEE Real-Time Systems Symposium, pp. 152–160 (1988)
Acknowledgement
This research is supported in part by the National Natural Science Foundation of China under Grant No. 61571066, No.61602054, (NSFC, 61571066, 61602054).
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
Ke, R., Sun, Q., Li, J., Zhou, A., Wang, S. (2020). Multi-task Planning with the Consideration of Task Priority. In: Hsu, CH., Kallel, S., Lan, KC., Zheng, Z. (eds) Internet of Vehicles. Technologies and Services Toward Smart Cities. IOV 2019. Lecture Notes in Computer Science(), vol 11894. Springer, Cham. https://doi.org/10.1007/978-3-030-38651-1_6
Download citation
DOI: https://doi.org/10.1007/978-3-030-38651-1_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-38650-4
Online ISBN: 978-3-030-38651-1
eBook Packages: Computer ScienceComputer Science (R0)