@inproceedings{f86b7c39320e44678b79977eb21ab58d,
title = "An Action-Based Constraint Satisfaction Algorithm for Planning Problems",
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.",
keywords = "Action constraint, Constraint satisfaction, Domain dependent, Planning",
author = "Xiao Jiang and Yuting Zhao and Rui Xu and Wenming Xu",
note = "Publisher Copyright: {\textcopyright} 2018, Springer International Publishing AG.; International Conference on Mechatronics and Intelligent Robotics, ICMIR 2017 ; Conference date: 20-05-2017 Through 21-05-2017",
year = "2018",
doi = "10.1007/978-3-319-70990-1_61",
language = "English",
isbn = "9783319709895",
series = "Advances in Intelligent Systems and Computing",
publisher = "Springer Verlag",
pages = "412--417",
editor = "Feng Qiao and John Wang and Srikanta Patnaik",
booktitle = "Recent Developments in Mechatronics and Intelligent Robotics - Proceedings of the International Conference on Mechatronics and Intelligent Robotics, ICMIR 2017",
address = "Germany",
}