An Action-Based Constraint Satisfaction Algorithm for Planning Problems

Xiao Jiang*, Yuting Zhao, Rui Xu, Wenming Xu

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (Scopus)

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.

Original languageEnglish
Title of host publicationRecent Developments in Mechatronics and Intelligent Robotics - Proceedings of the International Conference on Mechatronics and Intelligent Robotics, ICMIR 2017
EditorsFeng Qiao, John Wang, Srikanta Patnaik
PublisherSpringer Verlag
Pages412-417
Number of pages6
ISBN (Print)9783319709895
DOIs
Publication statusPublished - 2018
EventInternational Conference on Mechatronics and Intelligent Robotics, ICMIR 2017 - Kunming, China
Duration: 20 May 201721 May 2017

Publication series

NameAdvances in Intelligent Systems and Computing
Volume691
ISSN (Print)2194-5357

Conference

ConferenceInternational Conference on Mechatronics and Intelligent Robotics, ICMIR 2017
Country/TerritoryChina
CityKunming
Period20/05/1721/05/17

Keywords

  • Action constraint
  • Constraint satisfaction
  • Domain dependent
  • Planning

Fingerprint

Dive into the research topics of 'An Action-Based Constraint Satisfaction Algorithm for Planning Problems'. Together they form a unique fingerprint.

Cite this