Complexity of planning for connected agents in a partially known environment (Q2680862)
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: Complexity of planning for connected agents in a partially known environment |
scientific article; zbMATH DE number 7638360
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of planning for connected agents in a partially known environment |
scientific article; zbMATH DE number 7638360 |
Statements
Complexity of planning for connected agents in a partially known environment (English)
0 references
4 January 2023
0 references
multi-agent path finding
0 references
multi-agent planning
0 references
connectivity
0 references
imperfect knowledge
0 references
decentralized planning
0 references
0.7479124665260315
0 references
0.7343607544898987
0 references
0.7338917255401611
0 references
0.7337601780891418
0 references
0.7332695126533508
0 references
