| dc.identifier.uri | http://hdl.handle.net/11401/77270 | |
| dc.description.sponsorship | This work is sponsored by the Stony Brook University Graduate School in compliance with the requirements for completion of degree. | en_US |
| dc.format | Monograph | |
| dc.format.medium | Electronic Resource | en_US |
| dc.language.iso | en_US | |
| dc.publisher | The Graduate School, Stony Brook University: Stony Brook, NY. | |
| dc.type | Dissertation | |
| dcterms.abstract | Automated planning has been the subject of intensive research and is at the core of several areas of AI, including intelligent agents and robotics. In this dissertation, we argue that Transaction Logic is a natural specification, experimentation, prototyping, and potentially implementation language for planning algorithms. This enables one to see further afield and thus discover better and more general solutions than using one-of-a-kind formalisms that have been traditionally dominating this field. Specifically, we take the well-known STRIPS planning strategy and show that Transaction Logic lets one specify this strategy and several of its far-reaching extensions easily and concisely. In addition, we demonstrate the power of our approach by applying it to a fundamentally different (from STRIPS) planning strategy, called GraphPlan. To summarize, this dissertation introduces a novel planning formalism based on Transaction Logic and validates it by applying it to some existing planning strategies and developing new ones as follows: (1) we propose a non-linear extension to STRIPS planning and prove its completeness; (2) we introduce fast-STRIPS- a modification of our non-linear STRIPS extension, which is also complete and yields speedups of orders of magnitude; (3) we extend STRIPS with regression analysis, which is again complete and significantly improves performance; (4) we extend STRIPS to enable it to solve planning problems with negative derived atoms; (5) to illustrate the versatility of our formalism, we applied it to GraphPlan- a planning strategy that bears no resemblance to STRIPS. | |
| dcterms.available | 2017-09-20T16:52:19Z | |
| dcterms.contributor | Kifer, Michael | en_US |
| dcterms.contributor | Stoller, Scott | en_US |
| dcterms.contributor | Warren, David | en_US |
| dcterms.contributor | Liu, Yanhong | en_US |
| dcterms.contributor | Zhou, Neng-Fa. | en_US |
| dcterms.creator | Basseda, Reza | |
| dcterms.dateAccepted | 2017-09-20T16:52:19Z | |
| dcterms.dateSubmitted | 2017-09-20T16:52:19Z | |
| dcterms.description | Department of Computer Science. | en_US |
| dcterms.extent | 101 pg. | en_US |
| dcterms.format | Monograph | |
| dcterms.format | Application/PDF | en_US |
| dcterms.identifier | http://hdl.handle.net/11401/77270 | |
| dcterms.issued | 2015-12-01 | |
| dcterms.language | en_US | |
| dcterms.provenance | Made available in DSpace on 2017-09-20T16:52:19Z (GMT). No. of bitstreams: 1
Basseda_grad.sunysb_0771E_12669.pdf: 911848 bytes, checksum: 731790c0c03d1519345e1a1b1fa80147 (MD5)
Previous issue date: 1 | en |
| dcterms.publisher | The Graduate School, Stony Brook University: Stony Brook, NY. | |
| dcterms.subject | Deductive Planning, Planning, Planning Strategies, State Space Planning, STRIPS, Transaction Logic | |
| dcterms.subject | Computer science | |
| dcterms.title | Planning with Transaction Logic | |
| dcterms.type | Dissertation | |
