A Robust Planning Algorithm for Groups of Entities in Discrete Spaces
AbstractAutomated 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. View Full-Text
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Wojnicki, I.; Ernst, S.; Turek, W. A Robust Planning Algorithm for Groups of Entities in Discrete Spaces. Entropy 2015, 17, 5422-5436.
Wojnicki I, Ernst S, Turek W. A Robust Planning Algorithm for Groups of Entities in Discrete Spaces. Entropy. 2015; 17(8):5422-5436.Chicago/Turabian Style
Wojnicki, Igor; Ernst, Sebastian; Turek, Wojciech. 2015. "A Robust Planning Algorithm for Groups of Entities in Discrete Spaces." Entropy 17, no. 8: 5422-5436.