Explaining Unsolvability of Planning Problems in Hybrid Systems with Model Reconciliation
A recent problem of interest in Explainable AI Planning is that of explaining the unsolvability of planning problems. Though there has been a lot of research on generating explanations of solutions to planning problems, explaining the absence of solutions remains a largely open and understudied prob...
Uloženo v:
| Vydáno v: | Proceedings (ACM and IEEE International Conference on Formal Methods and Models for Co-Design) s. 47 - 58 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
ACM
21.09.2023
|
| Témata: | |
| ISSN: | 2832-6520 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | A recent problem of interest in Explainable AI Planning is that of explaining the unsolvability of planning problems. Though there has been a lot of research on generating explanations of solutions to planning problems, explaining the absence of solutions remains a largely open and understudied problem. Model reconciliation has been a popular approach for generating explanations for such problems in recent literature, which involves an AI agent and a human planner, who have different models of the planning domain and each explains to the other the differences they have in their domain representations and attempt to arrive at a consensus. More often than not, it is assumed that the AI agent has a correct and complete view of the domain, of which the human only has a partial view. Through reconciliation, the human domain is updated to be consistent with what the AI agent has. Most of the works in this direction are targeted toward classical planning problems on domains represented typically as discrete state transition systems or variants. In this paper, we provide an approach towards model reconciliation for planning problems in hybrid systems represented as a mix of discrete and continuous domains. We assume that the agent has a complete model of the environment, while the human has a partial or erroneous model and expects a plan for the planning problem when there is none. The explanation problem is presented as a process of continuous reconciliation between these two entities (agent and human) to make the human domain consistent with that of the agent. To this effect, we use a mix of graph traversal and path analysis, along with Linear programming to carry out the reconciliation process. In particular, we use the concept of Irreducible Infeasible Sets (IIS) to generate explanations. Experimental results on 2 representative hybrid domains show the efficacy of our approach.CCS Concepts:* Computing methodologies → Artificial intelligence; * Human-centered computing → Interactive systems and tools; * Theory of computation → Timed and hybrid models. |
|---|---|
| AbstractList | A recent problem of interest in Explainable AI Planning is that of explaining the unsolvability of planning problems. Though there has been a lot of research on generating explanations of solutions to planning problems, explaining the absence of solutions remains a largely open and understudied problem. Model reconciliation has been a popular approach for generating explanations for such problems in recent literature, which involves an AI agent and a human planner, who have different models of the planning domain and each explains to the other the differences they have in their domain representations and attempt to arrive at a consensus. More often than not, it is assumed that the AI agent has a correct and complete view of the domain, of which the human only has a partial view. Through reconciliation, the human domain is updated to be consistent with what the AI agent has. Most of the works in this direction are targeted toward classical planning problems on domains represented typically as discrete state transition systems or variants. In this paper, we provide an approach towards model reconciliation for planning problems in hybrid systems represented as a mix of discrete and continuous domains. We assume that the agent has a complete model of the environment, while the human has a partial or erroneous model and expects a plan for the planning problem when there is none. The explanation problem is presented as a process of continuous reconciliation between these two entities (agent and human) to make the human domain consistent with that of the agent. To this effect, we use a mix of graph traversal and path analysis, along with Linear programming to carry out the reconciliation process. In particular, we use the concept of Irreducible Infeasible Sets (IIS) to generate explanations. Experimental results on 2 representative hybrid domains show the efficacy of our approach.CCS Concepts:* Computing methodologies → Artificial intelligence; * Human-centered computing → Interactive systems and tools; * Theory of computation → Timed and hybrid models. |
| Author | Sarwar, Mir Md Sajid Ray, Rajarshi Banerjee, Ansuman |
| Author_xml | – sequence: 1 givenname: Mir Md Sajid surname: Sarwar fullname: Sarwar, Mir Md Sajid email: mcsss2275@iacs.res.in organization: Indian Association for the Cultivation of Science,Kolkata,India – sequence: 2 givenname: Rajarshi surname: Ray fullname: Ray, Rajarshi email: rajarshi.ray@iacs.res.in organization: Indian Association for the Cultivation of Science,Kolkata,India – sequence: 3 givenname: Ansuman surname: Banerjee fullname: Banerjee, Ansuman email: ansuman@isical.ac.in organization: Indian Statistical Institute,Kolkata,India |
| BookMark | eNotj0tLAzEYRaMo2Nau3bjIH5j65Z0spVQrVCxqF65KJpNoJE3KzKDOv7c-Vgfu5Vy4Y3SSS_YIXRCYEcLFFZMEhDKzAwloeoSmRhnNARQwovUxGlHNaCUFhTM07rp3AGHAsBF6WXztk4055le8yV1JH7aOKfYDLgGvk82_zbotdfK7DseMl0PdxgY_DV3_k3zG_g3fl8Yn_Ohdye5g2z6WfI5Og02dn_5zgjY3i-f5slo93N7Nr1eVpdr0leNEKmsNAamkhFBzxb0NWrvAtBYBSGiUpo4G3jjqayWIcJQJ47zVOhA2QZd_u9F7v923cWfbYUsOxyWlnH0DpNtUaw |
| CODEN | IEEPAD |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1145/3610579.3611082 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Xplore POP ALL IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISBN | 9798400703188 |
| EISSN | 2832-6520 |
| EndPage | 58 |
| ExternalDocumentID | 10316224 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IF 6IK 6IL 6IN AAWTH ABLEC ADZIZ ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK CHZPO IEGSK OCL RIE RIL |
| ID | FETCH-LOGICAL-a289t-c4167aa91067660fb474eaf88cf3885f01fd782c2f4dc2eb7515c2359cea88f13 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 2 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001118067100005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Wed Aug 27 02:24:11 EDT 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a289t-c4167aa91067660fb474eaf88cf3885f01fd782c2f4dc2eb7515c2359cea88f13 |
| OpenAccessLink | https://dl.acm.org/doi/pdf/10.1145/3610579.3611082 |
| PageCount | 12 |
| ParticipantIDs | ieee_primary_10316224 |
| PublicationCentury | 2000 |
| PublicationDate | 2023-Sept.-21 |
| PublicationDateYYYYMMDD | 2023-09-21 |
| PublicationDate_xml | – month: 09 year: 2023 text: 2023-Sept.-21 day: 21 |
| PublicationDecade | 2020 |
| PublicationTitle | Proceedings (ACM and IEEE International Conference on Formal Methods and Models for Co-Design) |
| PublicationTitleAbbrev | MEMOCODE |
| PublicationYear | 2023 |
| Publisher | ACM |
| Publisher_xml | – name: ACM |
| SSID | ssj0059093 ssib053578244 |
| Score | 1.8600742 |
| Snippet | A recent problem of interest in Explainable AI Planning is that of explaining the unsolvability of planning problems. Though there has been a lot of research... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 47 |
| SubjectTerms | Bounded Reachability Explainable AI Planning Hybrid Systems Model Reconciliation Unsolvability |
| Title | Explaining Unsolvability of Planning Problems in Hybrid Systems with Model Reconciliation |
| URI | https://ieeexplore.ieee.org/document/10316224 |
| WOSCitedRecordID | wos001118067100005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ07a8MwEMePJnTolD5c-kZDVyeWredcGjKFDA2kU5BlCQLFKXlBvn11st1MHTrZGGzMSdbdyXf_H8BriAiUcjxPjaU-ZaXXaRn8Rsh5LK2MzQpvbIRNyOlULRZ61jarx14Y51wsPnNDPI3_8qu13eNW2QiRBCL4nB70pBRNs1Y3eTjKtkRf1SzDXIdcvdXyoYyPCoFEWz0MR5pF2b0TTCX6kvHgn29xCcmpK4_Mfv3NFZy5-hoGHZaBtF_pDXxiXV0DfiDzOsytQ6PFfSRrTzpIET4JSTJbsqrJ5Ih9W6RVLye4N0sQkvZFMDutbbg7DmAC8_H7x9skbQkKqQmJ1C61IdySxmjUiRMi8yWTzBmvlPWFUtxn1FfBajb3rLK5K2WIbmxecG2dUcrT4hb69bp2d0BMiNNMlYk8444pLTSSAJlBWVsZVoHqHhI01fK7EclYdlZ6-OP6I1wguR1LL3L6BP3dZu-e4dwedqvt5iUO7Q-yoKQq |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ3PS8MwFMcfOgU9zR8Tf5uD125Nm7TJWRwT59hhg3kaaZrAQDrZusH-e_PS1p08eGoptJSXNO-99L3vB-DZRQRCGB4FSlMbsMzKIHN-w-U8muZKh7FV2sMm0tFIzGZyXDer-14YY4wvPjNdPPX_8vOl3uBWWQ-RBInzOYdwhOgsXrVrNdOHo3CL91bVQsyly9ZrNR_KeC9OkGkru-5IQy-8t8epeG_Sb__zPc6gs-_LI-Nfj3MOB6a4gHYDZiD1d3oJn1hZV6EfyLRws2tbqXHvyNKSBlOET0KWzJosCjLYYecWqfXLCe7OEsSkfRHMTwvt7vZD2IFp_3XyMghqhkKgXCpVBtoFXKlSEpXikiS0GUuZUVYIbWMhuA2pzZ3VdGRZriOTpS6-0VHMpTZKCEvjK2gVy8JcA1EuUlN5mEQhN0zIRCILkCkUtk3dOpDfQAdNNf-uZDLmjZVu_7j-BCeDycdwPnwbvd_BKXLcsRAjovfQKlcb8wDHelsu1qtHP8w_dEmndQ |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+%28ACM+and+IEEE+International+Conference+on+Formal+Methods+and+Models+for+Co-Design%29&rft.atitle=Explaining+Unsolvability+of+Planning+Problems+in+Hybrid+Systems+with+Model+Reconciliation&rft.au=Sarwar%2C+Mir+Md+Sajid&rft.au=Ray%2C+Rajarshi&rft.au=Banerjee%2C+Ansuman&rft.date=2023-09-21&rft.pub=ACM&rft.eissn=2832-6520&rft.spage=47&rft.epage=58&rft_id=info:doi/10.1145%2F3610579.3611082&rft.externalDocID=10316224 |