Tractability of planning with loops

Siddharth Srivastava, Shlomo Zilberstein, Abhishek Gupta, Pieter Abbeel, Stuart Russell

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

2 Citations (Scopus)

Abstract

We create a unified framework for analyzing and synthesizing plans with loops for solving problems with nondeterministic numeric effects and a limited form of partial observability. Three different action models-with deterministic, qualitative non-deterministic and Boolean nondeterministic semantics-are handled using a single abstract representation. We establish the conditions under which the correctness and termination of solutions, represented as abstract policies, can be veri tied. We also examine the feasibility of learning abstract policies from examples. We demonstrate our techniques on several planning problems and show that they apply to challenging real-world tasks such as doing the laundry with a PR2 robot. These results resolve a number of open questions about planning with loops and facilitate the development of new algorithms and applications.

Original languageEnglish (US)
Title of host publicationProceedings of the 29th AAAI Conference on Artificial Intelligence, AAAI 2015 and the 27th Innovative Applications of Artificial Intelligence Conference, IAAI 2015
PublisherAI Access Foundation
Pages3393-3401
Number of pages9
Volume5
ISBN (Electronic)9781577357032
StatePublished - Jun 1 2015
Externally publishedYes
Event29th AAAI Conference on Artificial Intelligence, AAAI 2015 and the 27th Innovative Applications of Artificial Intelligence Conference, IAAI 2015 - Austin, United States
Duration: Jan 25 2015Jan 30 2015

Other

Other29th AAAI Conference on Artificial Intelligence, AAAI 2015 and the 27th Innovative Applications of Artificial Intelligence Conference, IAAI 2015
CountryUnited States
CityAustin
Period1/25/151/30/15

Fingerprint

Laundries
Planning
Observability
Semantics
Robots

ASJC Scopus subject areas

  • Software
  • Artificial Intelligence

Cite this

Srivastava, S., Zilberstein, S., Gupta, A., Abbeel, P., & Russell, S. (2015). Tractability of planning with loops. In Proceedings of the 29th AAAI Conference on Artificial Intelligence, AAAI 2015 and the 27th Innovative Applications of Artificial Intelligence Conference, IAAI 2015 (Vol. 5, pp. 3393-3401). AI Access Foundation.

Tractability of planning with loops. / Srivastava, Siddharth; Zilberstein, Shlomo; Gupta, Abhishek; Abbeel, Pieter; Russell, Stuart.

Proceedings of the 29th AAAI Conference on Artificial Intelligence, AAAI 2015 and the 27th Innovative Applications of Artificial Intelligence Conference, IAAI 2015. Vol. 5 AI Access Foundation, 2015. p. 3393-3401.

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

Srivastava, S, Zilberstein, S, Gupta, A, Abbeel, P & Russell, S 2015, Tractability of planning with loops. in Proceedings of the 29th AAAI Conference on Artificial Intelligence, AAAI 2015 and the 27th Innovative Applications of Artificial Intelligence Conference, IAAI 2015. vol. 5, AI Access Foundation, pp. 3393-3401, 29th AAAI Conference on Artificial Intelligence, AAAI 2015 and the 27th Innovative Applications of Artificial Intelligence Conference, IAAI 2015, Austin, United States, 1/25/15.
Srivastava S, Zilberstein S, Gupta A, Abbeel P, Russell S. Tractability of planning with loops. In Proceedings of the 29th AAAI Conference on Artificial Intelligence, AAAI 2015 and the 27th Innovative Applications of Artificial Intelligence Conference, IAAI 2015. Vol. 5. AI Access Foundation. 2015. p. 3393-3401
Srivastava, Siddharth ; Zilberstein, Shlomo ; Gupta, Abhishek ; Abbeel, Pieter ; Russell, Stuart. / Tractability of planning with loops. Proceedings of the 29th AAAI Conference on Artificial Intelligence, AAAI 2015 and the 27th Innovative Applications of Artificial Intelligence Conference, IAAI 2015. Vol. 5 AI Access Foundation, 2015. pp. 3393-3401
@inproceedings{f261e16e7c0a459f8fa3690dec846727,
title = "Tractability of planning with loops",
abstract = "We create a unified framework for analyzing and synthesizing plans with loops for solving problems with nondeterministic numeric effects and a limited form of partial observability. Three different action models-with deterministic, qualitative non-deterministic and Boolean nondeterministic semantics-are handled using a single abstract representation. We establish the conditions under which the correctness and termination of solutions, represented as abstract policies, can be veri tied. We also examine the feasibility of learning abstract policies from examples. We demonstrate our techniques on several planning problems and show that they apply to challenging real-world tasks such as doing the laundry with a PR2 robot. These results resolve a number of open questions about planning with loops and facilitate the development of new algorithms and applications.",
author = "Siddharth Srivastava and Shlomo Zilberstein and Abhishek Gupta and Pieter Abbeel and Stuart Russell",
year = "2015",
month = "6",
day = "1",
language = "English (US)",
volume = "5",
pages = "3393--3401",
booktitle = "Proceedings of the 29th AAAI Conference on Artificial Intelligence, AAAI 2015 and the 27th Innovative Applications of Artificial Intelligence Conference, IAAI 2015",
publisher = "AI Access Foundation",
address = "United States",

}

TY - GEN

T1 - Tractability of planning with loops

AU - Srivastava, Siddharth

AU - Zilberstein, Shlomo

AU - Gupta, Abhishek

AU - Abbeel, Pieter

AU - Russell, Stuart

PY - 2015/6/1

Y1 - 2015/6/1

N2 - We create a unified framework for analyzing and synthesizing plans with loops for solving problems with nondeterministic numeric effects and a limited form of partial observability. Three different action models-with deterministic, qualitative non-deterministic and Boolean nondeterministic semantics-are handled using a single abstract representation. We establish the conditions under which the correctness and termination of solutions, represented as abstract policies, can be veri tied. We also examine the feasibility of learning abstract policies from examples. We demonstrate our techniques on several planning problems and show that they apply to challenging real-world tasks such as doing the laundry with a PR2 robot. These results resolve a number of open questions about planning with loops and facilitate the development of new algorithms and applications.

AB - We create a unified framework for analyzing and synthesizing plans with loops for solving problems with nondeterministic numeric effects and a limited form of partial observability. Three different action models-with deterministic, qualitative non-deterministic and Boolean nondeterministic semantics-are handled using a single abstract representation. We establish the conditions under which the correctness and termination of solutions, represented as abstract policies, can be veri tied. We also examine the feasibility of learning abstract policies from examples. We demonstrate our techniques on several planning problems and show that they apply to challenging real-world tasks such as doing the laundry with a PR2 robot. These results resolve a number of open questions about planning with loops and facilitate the development of new algorithms and applications.

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

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

M3 - Conference contribution

VL - 5

SP - 3393

EP - 3401

BT - Proceedings of the 29th AAAI Conference on Artificial Intelligence, AAAI 2015 and the 27th Innovative Applications of Artificial Intelligence Conference, IAAI 2015

PB - AI Access Foundation

ER -