Pattern Based Temporal Inference In Forward Search Temporal Planning

Atif Talukdar; Maria Fox; Derek Long

Pattern Based Temporal Inference In Forward Search Temporal Planning

Atif Talukdar, Maria Fox, Derek Long

Department of Informatics

Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review

65 Downloads (Pure)

Abstract

Temporal Planners are developed to address problem domains of a more realistic nature, where time is a factor. Some of the most difficult problems to solve are those containing required concurrency since the planner must execute actions in parallel. Forward search planners are generally good at finding plans using search with heuristic guidance. However, temporal planners still face limitations in their use of inference. This paper discusses patterns of required concurrency and how we can solve problems of this nature, with reduced search and more inference, in a forward search framework.

Original language	English
Title of host publication	CEUR Workshop Proceedings
Publisher	CEUR-WS
Number of pages	5
Volume	1782
Publication status	Published - Jan 2017
Event	34th Workshop of the UK Planning and Scheduling Special Interest Group, PlanSIG 2016 - Huddersfield, United Kingdom Duration: 15 Dec 2016 → 16 Dec 2016

Conference

Conference	34th Workshop of the UK Planning and Scheduling Special Interest Group, PlanSIG 2016
Country/Territory	United Kingdom
City	Huddersfield
Period	15/12/2016 → 16/12/2016

Access to Document

Pattern Based Temporal Inference_TALUKDAR_Accepted 2016_GOLD VOR_OTHER
You hold the copyright to your paper. So, you are free to do so. You don't even have to ask us or the editor of your volume. Likewise, you can put a copy of your paper on your personal website. You can use the version of the paper published at CEUR-WS.org.
Final published version, 932 KBLicence: Other

Cite this

@inbook{41484cf2d07f4d0892acacb8322f0c26,

title = "Pattern Based Temporal Inference In Forward Search Temporal Planning",

abstract = "Temporal Planners are developed to address problem domains of a more realistic nature, where time is a factor. Some of the most difficult problems to solve are those containing required concurrency since the planner must execute actions in parallel. Forward search planners are generally good at finding plans using search with heuristic guidance. However, temporal planners still face limitations in their use of inference. This paper discusses patterns of required concurrency and how we can solve problems of this nature, with reduced search and more inference, in a forward search framework.",

author = "Atif Talukdar and Maria Fox and Derek Long",

year = "2017",

month = jan,

language = "English",

volume = "1782",

booktitle = "CEUR Workshop Proceedings",

publisher = "CEUR-WS",

note = "34th Workshop of the UK Planning and Scheduling Special Interest Group, PlanSIG 2016 ; Conference date: 15-12-2016 Through 16-12-2016",

}

TY - CHAP

T1 - Pattern Based Temporal Inference In Forward Search Temporal Planning

AU - Talukdar, Atif

AU - Fox, Maria

AU - Long, Derek

PY - 2017/1

Y1 - 2017/1

N2 - Temporal Planners are developed to address problem domains of a more realistic nature, where time is a factor. Some of the most difficult problems to solve are those containing required concurrency since the planner must execute actions in parallel. Forward search planners are generally good at finding plans using search with heuristic guidance. However, temporal planners still face limitations in their use of inference. This paper discusses patterns of required concurrency and how we can solve problems of this nature, with reduced search and more inference, in a forward search framework.

AB - Temporal Planners are developed to address problem domains of a more realistic nature, where time is a factor. Some of the most difficult problems to solve are those containing required concurrency since the planner must execute actions in parallel. Forward search planners are generally good at finding plans using search with heuristic guidance. However, temporal planners still face limitations in their use of inference. This paper discusses patterns of required concurrency and how we can solve problems of this nature, with reduced search and more inference, in a forward search framework.

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

M3 - Conference paper

AN - SCOPUS:85013343999

VL - 1782

BT - CEUR Workshop Proceedings

PB - CEUR-WS

T2 - 34th Workshop of the UK Planning and Scheduling Special Interest Group, PlanSIG 2016

Y2 - 15 December 2016 through 16 December 2016

ER -

Pattern Based Temporal Inference In Forward Search Temporal Planning

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this