Knowledge granularity spectrum, action pyramid, and the scaling problem (Q2770247)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Knowledge granularity spectrum, action pyramid, and the scaling problem |
scientific article; zbMATH DE number 1702979
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Knowledge granularity spectrum, action pyramid, and the scaling problem |
scientific article; zbMATH DE number 1702979 |
Statements
16 March 2003
0 references
agent engeneering
0 references
0.8325227
0 references
0.8216381
0 references
0.81347287
0 references
0 references
0.80165416
0 references
0.8004777
0 references
Knowledge granularity spectrum, action pyramid, and the scaling problem (English)
0 references
A robotical agent must be designed to perform a task in some environment (e.g.\ finding an object in a room). The knowledge about the environment may be specified more or less finely (in gergon, with finer/coarser knowledge granularity). The finer the granularity, the better the action selected, but the longer the time needed to select it. The paper explores this tade-off. NEWLINENEWLINENEWLINEThe authors conclude that it is not possible to determine an optimal knowledge granularity in general. In the examined cases, a good performance is attained with a hierarchical, multi-layer granularity structure whereby a first set of actions is selected by a coarse layer, and then within that set a finer layer selects the final action.NEWLINENEWLINEFor the entire collection see [Zbl 0966.00020].
0 references
