Continuous time in a SAT-based planner

Ji Ae Shin, Ernest Davis

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish (US)
Title of host publicationProceedings - Nineteenth National Conference on Artificial Intelligence (AAAI-04): Sixteenth Innovative Applications of Artificial Intelligence Conference (IAAI-2004)
Pages531-536
Number of pages6
StatePublished - 2004
EventProceedings - 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 2004Jul 29 2004

Other

OtherProceedings - Nineteenth National Conference on Artificial Intelligence (AAAI-2004): Sixteenth Innovative Applications of Artificial Intelligence Conference (IAAI-2004)
CountryUnited States
CitySan Jose, CA
Period7/25/047/29/04

Fingerprint

Welds
Engines

Keywords

  • Continuous time
  • LPSAT
  • Numerical quantities
  • Processes
  • Propositional planning

ASJC Scopus subject areas

  • Software

Cite this

Shin, J. A., & Davis, E. (2004). Continuous time in a SAT-based planner. In Proceedings - Nineteenth National Conference on Artificial Intelligence (AAAI-04): Sixteenth Innovative Applications of Artificial Intelligence Conference (IAAI-2004) (pp. 531-536)

Continuous time in a SAT-based planner. / Shin, Ji Ae; Davis, Ernest.

Proceedings - Nineteenth National Conference on Artificial Intelligence (AAAI-04): Sixteenth Innovative Applications of Artificial Intelligence Conference (IAAI-2004). 2004. p. 531-536.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Shin, JA & Davis, E 2004, Continuous time in a SAT-based planner. in Proceedings - Nineteenth National Conference on Artificial Intelligence (AAAI-04): Sixteenth Innovative Applications of Artificial Intelligence Conference (IAAI-2004). pp. 531-536, Proceedings - Nineteenth National Conference on Artificial Intelligence (AAAI-2004): Sixteenth Innovative Applications of Artificial Intelligence Conference (IAAI-2004), San Jose, CA, United States, 7/25/04.
Shin JA, Davis E. Continuous time in a SAT-based planner. In Proceedings - Nineteenth National Conference on Artificial Intelligence (AAAI-04): Sixteenth Innovative Applications of Artificial Intelligence Conference (IAAI-2004). 2004. p. 531-536
Shin, Ji Ae ; Davis, Ernest. / Continuous time in a SAT-based planner. Proceedings - Nineteenth National Conference on Artificial Intelligence (AAAI-04): Sixteenth Innovative Applications of Artificial Intelligence Conference (IAAI-2004). 2004. pp. 531-536
@inproceedings{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",
booktitle = "Proceedings - Nineteenth National Conference on Artificial Intelligence (AAAI-04): Sixteenth Innovative Applications of Artificial Intelligence Conference (IAAI-2004)",

}

TY - GEN

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 - Conference contribution

SP - 531

EP - 536

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

ER -