Flexible production systems: Automated generation of operations plans based on ISA-95 and PDDL

B Wally, J Vyskočil, P Novák, C Huemer… - IEEE Robotics and …, 2019 - ieeexplore.ieee.org
Model-driven engineering (MDE) provides tools and methods for the manipulation of formal
models. In this letter, we leverage MDE for the transformation of production system models …

Leveraging iterative plan refinement for reactive smart manufacturing systems

B Wally, J Vyskočil, P Novák, C Huemer… - IEEE Transactions …, 2020 - ieeexplore.ieee.org
Industry 4.0 production systems must support flexibility in various dimensions, such as for
the products to be produced, for the production processes to be applied, and for the …

Scale-Adaptive Balancing of Exploration and Exploitation in Classical Planning

S Wissow, M Asai - ECAI 2024, 2024 - ebooks.iospress.nl
Balancing exploration and exploitation has been an important problem in both adversarial
games and automated planning. While it has been extensively analyzed in the Multi-Armed …

Learning and exploiting progress states in greedy best-first search

P Ferber, L Cohen, J Seipp, T Keller - 2022 - edoc.unibas.ch
Previous work introduced the concept of progress states. After expanding a progress state, a
greedy best-first search (GBFS) will only expand states with lower heuristic values. Current …

Improved Exploration of the Bench Transition System in Parallel Greedy Best First Search

T Shimoda, A Fukunaga - Proceedings of the International Symposium …, 2023 - ojs.aaai.org
While parallelization of A* is fairly well-understood, parallelization of GBFS has been much
less understood. Recent work has proposed PUHF, a parallel GBFS which restricts search to …

Utilizing Admissible Bounds for Heuristic Learning

C Núñez-Molina, M Asai - arXiv preprint arXiv:2308.11905, 2023 - arxiv.org
While learning a heuristic function for forward search algorithms with modern machine
learning techniques has been gaining interest in recent years, there has been little …

Separate Generation and Evaluation for Parallel Greedy Best-First Search

T Shimoda, A Fukunaga - arXiv preprint arXiv:2408.05682, 2024 - arxiv.org
Parallelization of Greedy Best First Search (GBFS) has been difficult because
straightforward parallelization can result in search behavior which differs significantly from …

Machine learning for classical planning: neural network heuristics, online portfolios, and state space topologies

PC Ferber - 2022 - edoc.unibas.ch
State space search solves navigation tasks and many other real world problems. Heuristic
search, especially greedy best-first search, is one of the most successful algorithms for state …

The Bench Transition System and Stochastic Exploration

D Tomasz, R Valenzano - Proceedings of the International Symposium …, 2024 - ojs.aaai.org
Stochastic exploration has been shown to be an effective way to mitigate the negative
impact that heuristic local minima and plateaus can have on Greedy Best First Search …

Revisiting suboptimal search

J Chen, N Sturtevant, W Doyle, W Ruml - Proceedings of the …, 2019 - ojs.aaai.org
Suboptimal search algorithms can often solve much larger problems than optimal search
algorithms, and thus have broad practical use. This paper returns to early algorithms like …