Continuous time in a SAT-based planner

Ji Ae Shin; Ernest Davis

Continuous time in a SAT-based planner

Computer Science

Research output: Contribution to conference › Paper › peer-review

Abstract

The TM-LPSAT planner can construct plans in domains containing atomic actions and durative actions; events and processes; discrete, real-valued, and interval-valued fluents; and continuous linear change to quantities. It works in three stages. In the first stage, a representation of the domain and problem in an extended version of PDDL+ is compiled into a system of propositional combinations of propositional variables and linear constraints over numeric variables. In the second stage, the LPSAT constraint engine (Wolfman & Weld 2000) is used to find a solution to the system of constraints. In the third stage, a correct parallel plan is extracted from this solution. We discuss the structure of the planner and show how a real-time temporal model is compiled into LPSAT constraints.

Original language	English (US)
Pages	531-536
Number of pages	6
State	Published - 2004
Event	Proceedings - Nineteenth National Conference on Artificial Intelligence (AAAI-2004): Sixteenth Innovative Applications of Artificial Intelligence Conference (IAAI-2004) - San Jose, CA, United States Duration: Jul 25 2004 → Jul 29 2004

Other

Other	Proceedings - Nineteenth National Conference on Artificial Intelligence (AAAI-2004): Sixteenth Innovative Applications of Artificial Intelligence Conference (IAAI-2004)
Country/Territory	United States
City	San Jose, CA
Period	7/25/04 → 7/29/04

Keywords

Continuous time
LPSAT
Numerical quantities
Processes
Propositional planning

ASJC Scopus subject areas

Software
Artificial Intelligence

Cite this

Continuous time in a SAT-based planner. / Shin, Ji Ae; Davis, Ernest.
2004. 531-536 Paper presented at Proceedings - Nineteenth National Conference on Artificial Intelligence (AAAI-2004): Sixteenth Innovative Applications of Artificial Intelligence Conference (IAAI-2004), San Jose, CA, United States.

Research output: Contribution to conference › Paper › peer-review

@conference{f14ca8ec6153463ebffcd11c31c9612f,

title = "Continuous time in a SAT-based planner",

abstract = "The TM-LPSAT planner can construct plans in domains containing atomic actions and durative actions; events and processes; discrete, real-valued, and interval-valued fluents; and continuous linear change to quantities. It works in three stages. In the first stage, a representation of the domain and problem in an extended version of PDDL+ is compiled into a system of propositional combinations of propositional variables and linear constraints over numeric variables. In the second stage, the LPSAT constraint engine (Wolfman & Weld 2000) is used to find a solution to the system of constraints. In the third stage, a correct parallel plan is extracted from this solution. We discuss the structure of the planner and show how a real-time temporal model is compiled into LPSAT constraints.",

keywords = "Continuous time, LPSAT, Numerical quantities, Processes, Propositional planning",

author = "Shin, {Ji Ae} and Ernest Davis",

year = "2004",

language = "English (US)",

pages = "531--536",

note = "Proceedings - Nineteenth National Conference on Artificial Intelligence (AAAI-2004): Sixteenth Innovative Applications of Artificial Intelligence Conference (IAAI-2004) ; Conference date: 25-07-2004 Through 29-07-2004",

}

TY - CONF

T1 - Continuous time in a SAT-based planner

AU - Shin, Ji Ae

AU - Davis, Ernest

PY - 2004

Y1 - 2004

N2 - The TM-LPSAT planner can construct plans in domains containing atomic actions and durative actions; events and processes; discrete, real-valued, and interval-valued fluents; and continuous linear change to quantities. It works in three stages. In the first stage, a representation of the domain and problem in an extended version of PDDL+ is compiled into a system of propositional combinations of propositional variables and linear constraints over numeric variables. In the second stage, the LPSAT constraint engine (Wolfman & Weld 2000) is used to find a solution to the system of constraints. In the third stage, a correct parallel plan is extracted from this solution. We discuss the structure of the planner and show how a real-time temporal model is compiled into LPSAT constraints.

AB - The TM-LPSAT planner can construct plans in domains containing atomic actions and durative actions; events and processes; discrete, real-valued, and interval-valued fluents; and continuous linear change to quantities. It works in three stages. In the first stage, a representation of the domain and problem in an extended version of PDDL+ is compiled into a system of propositional combinations of propositional variables and linear constraints over numeric variables. In the second stage, the LPSAT constraint engine (Wolfman & Weld 2000) is used to find a solution to the system of constraints. In the third stage, a correct parallel plan is extracted from this solution. We discuss the structure of the planner and show how a real-time temporal model is compiled into LPSAT constraints.

KW - Continuous time

KW - LPSAT

KW - Numerical quantities

KW - Processes

KW - Propositional planning

UR - http://www.scopus.com/inward/record.url?scp=9444275935&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=9444275935&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:9444275935

SP - 531

EP - 536

T2 - Proceedings - Nineteenth National Conference on Artificial Intelligence (AAAI-2004): Sixteenth Innovative Applications of Artificial Intelligence Conference (IAAI-2004)

Y2 - 25 July 2004 through 29 July 2004

ER -

Continuous time in a SAT-based planner

Abstract

Other

Keywords

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this