Petri Net Relaxation for Infeasibility Explanation and Sequential Task Planning
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866911468547473408 |
|---|---|
| author | Le, Nguyen Cong Nhat Rogers, John G. Bonial, Claire N. Dantam, Neil T. |
| author_facet | Le, Nguyen Cong Nhat Rogers, John G. Bonial, Claire N. Dantam, Neil T. |
| contents | Plans often change due to changes in the situation or our understanding of the situation. Sometimes, a feasible plan may not even exist, and identifying such infeasibilities is useful to determine when requirements need adjustment. Common planning approaches focus on efficient one-shot planning in feasible cases rather than updating domains or detecting infeasibility. We propose a Petri net reachability relaxation to enable robust invariant synthesis, efficient goal-unreachability detection, and helpful infeasibility explanations. We further leverage incremental constraint solvers to support goal and constraint updates. Empirically, compared to baselines, our system produces a comparable number of invariants, detects up to 2 times more infeasibilities, performs competitively in one-shot planning, and outperforms in sequential plan updates in the tested domains. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_22094 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Petri Net Relaxation for Infeasibility Explanation and Sequential Task Planning Le, Nguyen Cong Nhat Rogers, John G. Bonial, Claire N. Dantam, Neil T. Artificial Intelligence I.2.8 Plans often change due to changes in the situation or our understanding of the situation. Sometimes, a feasible plan may not even exist, and identifying such infeasibilities is useful to determine when requirements need adjustment. Common planning approaches focus on efficient one-shot planning in feasible cases rather than updating domains or detecting infeasibility. We propose a Petri net reachability relaxation to enable robust invariant synthesis, efficient goal-unreachability detection, and helpful infeasibility explanations. We further leverage incremental constraint solvers to support goal and constraint updates. Empirically, compared to baselines, our system produces a comparable number of invariants, detects up to 2 times more infeasibilities, performs competitively in one-shot planning, and outperforms in sequential plan updates in the tested domains. |
| title | Petri Net Relaxation for Infeasibility Explanation and Sequential Task Planning |
| topic | Artificial Intelligence I.2.8 |
| url | https://arxiv.org/abs/2602.22094 |