A Robust Planning Algorithm for Groups of Entities in Discrete Spaces
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 nu...
Main Authors: | Igor Wojnicki, Sebastian Ernst, Wojciech Turek |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2015-07-01
|
Series: | Entropy |
Subjects: | |
Online Access: | http://www.mdpi.com/1099-4300/17/8/5422 |
Similar Items
-
Entity Search Based on the Representation Learning Model With Different Embedding Strategies
by: Shijia E., et al.
Published: (2017-01-01) -
Multi-Source entity-based conflation for local search
by: Dirk Ahlers
Published: (2012-12-01) -
A Purely Entity-Based Semantic Search Approach for Document Retrieval
by: Mohamed Lemine Sidi, et al.
Published: (2023-09-01) -
Entity modeling
by: Tiziana Possemato
Published: (2022-09-01) -
K-Focal Search for Slow Learned Heuristics
by: Matias Greco, et al.
Published: (2024-01-01)