Temporal Planning via Interval Logic Satisfiability for Autonomous Systems
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913390827405312 |
|---|---|
| author | Ramirez, Miquel Singh, Anubhav Stuckey, Peter Manzie, Chris |
| author_facet | Ramirez, Miquel Singh, Anubhav Stuckey, Peter Manzie, Chris |
| contents | Many automated planning methods and formulations rely on suitably designed abstractions or simplifications of the constrained dynamics associated with agents to attain computational scalability. We consider formulations of temporal planning where intervals are associated with both action and fluent atoms, and relations between these are given as sentences in Allen's Interval Logic. We propose a notion of planning graphs that can account for complex concurrency relations between actions and fluents as a Constraint Programming (CP) model. We test an implementation of our algorithm on a state-of-the-art framework for CP and compare it with PDDL 2.1 planners that capture plans requiring complex concurrent interactions between agents. We demonstrate our algorithm outperforms existing PDDL 2.1 planners in the case studies. Still, scalability remains challenging when plans must comply with intricate concurrent interactions and the sequencing of actions. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_09661 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Temporal Planning via Interval Logic Satisfiability for Autonomous Systems Ramirez, Miquel Singh, Anubhav Stuckey, Peter Manzie, Chris Logic in Computer Science Artificial Intelligence Systems and Control Many automated planning methods and formulations rely on suitably designed abstractions or simplifications of the constrained dynamics associated with agents to attain computational scalability. We consider formulations of temporal planning where intervals are associated with both action and fluent atoms, and relations between these are given as sentences in Allen's Interval Logic. We propose a notion of planning graphs that can account for complex concurrency relations between actions and fluents as a Constraint Programming (CP) model. We test an implementation of our algorithm on a state-of-the-art framework for CP and compare it with PDDL 2.1 planners that capture plans requiring complex concurrent interactions between agents. We demonstrate our algorithm outperforms existing PDDL 2.1 planners in the case studies. Still, scalability remains challenging when plans must comply with intricate concurrent interactions and the sequencing of actions. |
| title | Temporal Planning via Interval Logic Satisfiability for Autonomous Systems |
| topic | Logic in Computer Science Artificial Intelligence Systems and Control |
| url | https://arxiv.org/abs/2406.09661 |