Back to Search
Start Over
A Robust Planning Algorithm for Groups of Entities in Discrete Spaces.
- Source :
- Entropy; 2015, Vol. 17 Issue 8, p5422-5436, 15p
- Publication Year :
- 2015
-
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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 10994300
- Volume :
- 17
- Issue :
- 8
- Database :
- Complementary Index
- Journal :
- Entropy
- Publication Type :
- Academic Journal
- Accession number :
- 109146176
- Full Text :
- https://doi.org/10.3390/e17085422