Abstract
In recent years, the complex and growing constraints in the planning domain have made constraint satisfaction technology a hotspot in the automatic planning field. In the procedure of planning, the action processing plays a vital role. However, diverse but conflicting action relation is difficult to solve in a typical constraint satisfaction method. This paper we code the planning actions as constraints to make the classic planning model a domain-dependent constraint satisfaction problem and let the domain-specific action constraints help guide the search. Based on the model, a dynamic constraint set and constraint process method is proposed to solve the conflicts between the specific action constraints and general constraints in constraint satisfaction problem. The simulation experiments show that the proposed algorithm, with specific constraints, can effectively reduce the planning time and achieves a better performance over other constraint programmed planners.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Roman, B.: Constraint processing. Acta Autom. Sin. 17(2), 687 (2007)
Lozano-Pérez, T., Kaelbling, L. P.: A constraint-based method for solving sequential manipulation planning problems. In: International Conference on Intelligent Robots and Systems, pp. 3684–3691. IEEE (2014)
Veksler, M., Strichman, O.: Learning general constraints. Arti. Intell. 238, 135–153 (2016)
Verfaillie, G.: How to model planning and scheduling problems using constraint networks on timelines. Knowl. Eng. Rev. 25(3), 319–336 (2010)
Achlioptas, D., Hassani, S.H., Macris, N., et al: Bounds for random constraint satisfaction problems via spatial coupling. In: Twenty-Seventh ACM-SIAM Symposium on Discrete Algorithms, pp. 469–479. ACM (2016)
Rintanen, J.: Heuristics for planning with SAT. In: International Conference on Principles and Practice of Constraint Programming, pp. 414–428. Springer (2010)
Jorg, H.: FF: the fast-forward planning system. AI Mag. 22(3), 57–62 (2014)
Edward, T.: Foundations of Constraint Satisfaction: The Classic Text, BoD–Books on Demand (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Jiang, X., Zhao, Y., Xu, R., Xu, W. (2018). An Action-Based Constraint Satisfaction Algorithm for Planning Problems. In: Qiao, F., Patnaik, S., Wang, J. (eds) Recent Developments in Mechatronics and Intelligent Robotics. ICMIR 2017. Advances in Intelligent Systems and Computing, vol 691. Springer, Cham. https://doi.org/10.1007/978-3-319-70990-1_61
Download citation
DOI: https://doi.org/10.1007/978-3-319-70990-1_61
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-70989-5
Online ISBN: 978-3-319-70990-1
eBook Packages: EngineeringEngineering (R0)