Next Article in Journal
Reaction Kinetic Parameters and Surface Thermodynamic Properties of Cu2O Nanocubes
Previous Article in Journal
Fractional State Space Analysis of Economic Systems
Open AccessArticle

A Robust Planning Algorithm for Groups of Entities in Discrete Spaces

AGH University of Science and Technology, Al. Mickiewicza 30, Kraków, 30-059, Poland
*
Author to whom correspondence should be addressed.
Academic Editor: J. A. Tenreiro Machado
Entropy 2015, 17(8), 5422-5436; https://doi.org/10.3390/e17085422
Received: 24 April 2015 / Revised: 23 July 2015 / Accepted: 24 July 2015 / Published: 30 July 2015
(This article belongs to the Section Complexity)
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. View Full-Text
Keywords: artificial intelligence; heuristic search; automated planning; robotics; multi-entity coordination artificial intelligence; heuristic search; automated planning; robotics; multi-entity coordination
Show Figures

Figure 1

MDPI and ACS Style

Wojnicki, I.; Ernst, S.; Turek, W. A Robust Planning Algorithm for Groups of Entities in Discrete Spaces. Entropy 2015, 17, 5422-5436.

Show more citation formats Show less citations formats

Article Access Map by Country/Region

1
Only visits after 24 November 2015 are recorded.
Back to TopTop