A temporal logic programming approach to planning

Kai Yang (), Cong Tian (), Nan Zhang (), Zhenhua Duan () and Hongwei Du ()
Additional contact information
Kai Yang: Institute of Computing Theory and Technology, and ISN Laboratory, Xidian University
Cong Tian: Institute of Computing Theory and Technology, and ISN Laboratory, Xidian University
Nan Zhang: Institute of Computing Theory and Technology, and ISN Laboratory, Xidian University
Zhenhua Duan: Institute of Computing Theory and Technology, and ISN Laboratory, Xidian University
Hongwei Du: Harbin Institute of Technology Shenzhen Graduate School

Journal of Combinatorial Optimization, 2019, vol. 38, issue 2, No 5, 402-420

Abstract: Abstract This paper presents an approach to performing artificial intelligence planning through temporal logic programming with Search Control Knowledge (SCK). First, the planning problem described with Planning Domain Description Language is modeled as a program m in Modeling, Simulation and Verification Language (MSVL). Second, the SCK is also specified with an MSVL program $$m'$$ m ′ . Third, using the basic operation “and” in MSVL, a new MSVL program “ $$m~and~m'$$ m a n d m ′ ” is obtained. Forth, with the compiler MC of MSVL, an executable binary code of program “ $$m~and~m'$$ m a n d m ′ ” is obtained. Finally, planning result can be obtained via executing the executable code. Experimental results on selected benchmark planning domains from the International Planning Competition 2014 show that our approach is more effective in practice. Furthermore, the obtained plans are verified with the toolkit MSV so that a plan can be confirmed whether it is a reliable one.

Keywords: Planning; Temporal logic; MSVL; PDDL; Search control knowledge (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-019-00389-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:38:y:2019:i:2:d:10.1007_s10878-019-00389-y

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-019-00389-y

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().