Reasoning and Planning with Sensing Actions, Incomplete Information, and Static Causal Laws using Answer Set Programming

Reasoning and Planning with Sensing Actions, Incomplete Information, and Static Causal Laws using Answer Set Programming

We extend the 0-approximation of sensing actions and incomplete information in [Son and Baral 2000] to action theories with static causal laws and prove its soundness with respect to the possible world semantics. We also show that the conditional planning problem with respect to this approximation i...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Tu, Phan Huy, Son, Tran Cao, Baral, Chitta
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Artificial Intelligence
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Tu, Phan Huy
Son, Tran Cao
Baral, Chitta
description We extend the 0-approximation of sensing actions and incomplete information in [Son and Baral 2000] to action theories with static causal laws and prove its soundness with respect to the possible world semantics. We also show that the conditional planning problem with respect to this approximation is NP-complete. We then present an answer set programming based conditional planner, called ASCP, that is capable of generating both conformant plans and conditional plans in the presence of sensing actions, incomplete information about the initial state, and static causal laws. We prove the correctness of our implementation and argue that our planner is sound and complete with respect to the proposed approximation. Finally, we present experimental results comparing ASCP to other planners.
doi_str_mv 10.48550/arxiv.cs/0605017
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_cs_0605017</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>cs_0605017</sourcerecordid><originalsourceid>FETCH-LOGICAL-a677-d8a49c0b9cab78345c6dc0490119878f4376d991c53d13378d69c0dbde30e2093</originalsourceid><addsrcrecordid>eNotkMtuwjAQRb1hUUE_oKv6AwjYdeLHEkV9IEUCFfbRxHZopMRGdmjo3zcEVjPnztwrzSD0QskqlVlG1hCuze9KxzXhJCNUPKHrt4XoXeNOGJzB-xbcBEPT_-CDdfEGG9033sUl3jrtu3Nrezu2tQ8d3AbLyXroR9A4h0uEFhcwRHy5u10cbBjDerwP_hSg60Z5gWY1tNE-P-ocHT_ej_lXUuw-t_mmSIALkRgJqdKkUhoqIVmaaW40SRWhVEkh65QJbpSiOmOGMiak4eO6qYxlxL4Rxebo9R47nV6eQ9NB-Ct1LB8vYP81slhr</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Reasoning and Planning with Sensing Actions, Incomplete Information, and Static Causal Laws using Answer Set Programming</title><source>arXiv.org</source><creator>Tu, Phan Huy ; Son, Tran Cao ; Baral, Chitta</creator><creatorcontrib>Tu, Phan Huy ; Son, Tran Cao ; Baral, Chitta</creatorcontrib><description>We extend the 0-approximation of sensing actions and incomplete information in [Son and Baral 2000] to action theories with static causal laws and prove its soundness with respect to the possible world semantics. We also show that the conditional planning problem with respect to this approximation is NP-complete. We then present an answer set programming based conditional planner, called ASCP, that is capable of generating both conformant plans and conditional plans in the presence of sensing actions, incomplete information about the initial state, and static causal laws. We prove the correctness of our implementation and argue that our planner is sound and complete with respect to the proposed approximation. Finally, we present experimental results comparing ASCP to other planners.</description><identifier>DOI: 10.48550/arxiv.cs/0605017</identifier><language>eng</language><subject>Computer Science - Artificial Intelligence</subject><creationdate>2006-05</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/cs/0605017$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.cs/0605017$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Tu, Phan Huy</creatorcontrib><creatorcontrib>Son, Tran Cao</creatorcontrib><creatorcontrib>Baral, Chitta</creatorcontrib><title>Reasoning and Planning with Sensing Actions, Incomplete Information, and Static Causal Laws using Answer Set Programming</title><description>We extend the 0-approximation of sensing actions and incomplete information in [Son and Baral 2000] to action theories with static causal laws and prove its soundness with respect to the possible world semantics. We also show that the conditional planning problem with respect to this approximation is NP-complete. We then present an answer set programming based conditional planner, called ASCP, that is capable of generating both conformant plans and conditional plans in the presence of sensing actions, incomplete information about the initial state, and static causal laws. We prove the correctness of our implementation and argue that our planner is sound and complete with respect to the proposed approximation. Finally, we present experimental results comparing ASCP to other planners.</description><subject>Computer Science - Artificial Intelligence</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2006</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotkMtuwjAQRb1hUUE_oKv6AwjYdeLHEkV9IEUCFfbRxHZopMRGdmjo3zcEVjPnztwrzSD0QskqlVlG1hCuze9KxzXhJCNUPKHrt4XoXeNOGJzB-xbcBEPT_-CDdfEGG9033sUl3jrtu3Nrezu2tQ8d3AbLyXroR9A4h0uEFhcwRHy5u10cbBjDerwP_hSg60Z5gWY1tNE-P-ocHT_ej_lXUuw-t_mmSIALkRgJqdKkUhoqIVmaaW40SRWhVEkh65QJbpSiOmOGMiak4eO6qYxlxL4Rxebo9R47nV6eQ9NB-Ct1LB8vYP81slhr</recordid><startdate>20060504</startdate><enddate>20060504</enddate><creator>Tu, Phan Huy</creator><creator>Son, Tran Cao</creator><creator>Baral, Chitta</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20060504</creationdate><title>Reasoning and Planning with Sensing Actions, Incomplete Information, and Static Causal Laws using Answer Set Programming</title><author>Tu, Phan Huy ; Son, Tran Cao ; Baral, Chitta</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a677-d8a49c0b9cab78345c6dc0490119878f4376d991c53d13378d69c0dbde30e2093</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Computer Science - Artificial Intelligence</topic><toplevel>online_resources</toplevel><creatorcontrib>Tu, Phan Huy</creatorcontrib><creatorcontrib>Son, Tran Cao</creatorcontrib><creatorcontrib>Baral, Chitta</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Tu, Phan Huy</au><au>Son, Tran Cao</au><au>Baral, Chitta</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Reasoning and Planning with Sensing Actions, Incomplete Information, and Static Causal Laws using Answer Set Programming</atitle><date>2006-05-04</date><risdate>2006</risdate><abstract>We extend the 0-approximation of sensing actions and incomplete information in [Son and Baral 2000] to action theories with static causal laws and prove its soundness with respect to the possible world semantics. We also show that the conditional planning problem with respect to this approximation is NP-complete. We then present an answer set programming based conditional planner, called ASCP, that is capable of generating both conformant plans and conditional plans in the presence of sensing actions, incomplete information about the initial state, and static causal laws. We prove the correctness of our implementation and argue that our planner is sound and complete with respect to the proposed approximation. Finally, we present experimental results comparing ASCP to other planners.</abstract><doi>10.48550/arxiv.cs/0605017</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.cs/0605017
ispartof
issn
language eng
recordid cdi_arxiv_primary_cs_0605017
source arXiv.org
subjects Computer Science - Artificial Intelligence
title Reasoning and Planning with Sensing Actions, Incomplete Information, and Static Causal Laws using Answer Set Programming
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-27T11%3A33%3A26IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Reasoning%20and%20Planning%20with%20Sensing%20Actions,%20Incomplete%20Information,%20and%20Static%20Causal%20Laws%20using%20Answer%20Set%20Programming&rft.au=Tu,%20Phan%20Huy&rft.date=2006-05-04&rft_id=info:doi/10.48550/arxiv.cs/0605017&rft_dat=%3Carxiv_GOX%3Ecs_0605017%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true