Szczegóły publikacji
Opis bibliograficzny
A robust planning algorithm for groups of entities in discrete spaces / Igor WOJNICKI, Sebastian ERNST, Wojciech TUREK // Entropy [Dokument elektroniczny]. — Czasopismo elektroniczne ; ISSN 1099-4300. — 2015 — vol. 17 iss. 8, s. 5422–5436. — Wymagania systemowe: Adobe Reader. — Bibliogr. s. 5435–5436, Abstr. — Publikacja dostępna online od: 2015-07-30
Autorzy (3)
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 91212 |
|---|---|
| Data dodania do BaDAP | 2015-08-07 |
| Tekst źródłowy | URL |
| DOI | 10.3390/e17085422 |
| Rok publikacji | 2015 |
| Typ publikacji | artykuł w czasopiśmie |
| Otwarty dostęp |  |
| Creative Commons | |
| Czasopismo/seria | Entropy |
Abstract
Automated planning is a well-established field of artificial intelligence (AI), with applications in route finding, robotics and operational research, among others. The task of developing a plan is often solved by finding a path in a graph representing the search domain; a robust plan consists of numerous paths that can be chosen if the execution of the best (optimal) one fails. While robust planning for a single entity is rather simple, development of a robust plan for multiple entities in a common environment can lead to combinatorial explosion. This paper proposes a novel hybrid approach, joining heuristic search and the wavefront algorithm to provide a plan featuring robustness in areas where it is needed, while maintaining a low level of computational complexity.