On Policy Reuse: An Expressive Language for Representing and Executing General Policies that Call Other Policies
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866929287930576896 |
|---|---|
| author | Bonet, Blai Drexler, Dominik Geffner, Hector |
| author_facet | Bonet, Blai Drexler, Dominik Geffner, Hector |
| contents | Recently, a simple but powerful language for expressing and learning general policies and problem decompositions (sketches) has been introduced in terms of rules defined over a set of Boolean and numerical features. In this work, we consider three extensions of this language aimed at making policies and sketches more flexible and reusable: internal memory states, as in finite state controllers; indexical features, whose values are a function of the state and a number of internal registers that can be loaded with objects; and modules that wrap up policies and sketches and allow them to call each other by passing parameters. In addition, unlike general policies that select state transitions rather than ground actions, the new language allows for the selection of such actions. The expressive power of the resulting language for policies and sketches is illustrated through a number of examples. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_16824 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On Policy Reuse: An Expressive Language for Representing and Executing General Policies that Call Other Policies Bonet, Blai Drexler, Dominik Geffner, Hector Artificial Intelligence Recently, a simple but powerful language for expressing and learning general policies and problem decompositions (sketches) has been introduced in terms of rules defined over a set of Boolean and numerical features. In this work, we consider three extensions of this language aimed at making policies and sketches more flexible and reusable: internal memory states, as in finite state controllers; indexical features, whose values are a function of the state and a number of internal registers that can be loaded with objects; and modules that wrap up policies and sketches and allow them to call each other by passing parameters. In addition, unlike general policies that select state transitions rather than ground actions, the new language allows for the selection of such actions. The expressive power of the resulting language for policies and sketches is illustrated through a number of examples. |
| title | On Policy Reuse: An Expressive Language for Representing and Executing General Policies that Call Other Policies |
| topic | Artificial Intelligence |
| url | https://arxiv.org/abs/2403.16824 |