2013 IEEE 25th International Conference on Tools With Artificial Intelligence 2013
DOI: 10.1109/ictai.2013.123
|View full text |Cite
|
Sign up to set email alerts
|

Learning Useful Macro-actions for Planning with N-Grams

Abstract: Abstract-Automated planning has achieved significant breakthroughs in recent years. Nonetheless, attempts to improve search algorithm efficiency remain the primary focus of most research. However, it is also possible to build on previous searches and learn from previously found solutions. Our approach consists in learning macro-actions and adding them into the planner's domain. A macro-action is an action sequence selected for application at search time and applied as a single indivisible action. Carefully cho… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
13
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 12 publications
(13 citation statements)
references
References 6 publications
0
13
0
Order By: Relevance
“…The other method is to extract effective macro-operations through learning methods based on existing planning solutions. Dulac et al [18] used the N-grams analysis method to extract macro-operations from existing planning solutions to improve planning efficiency. With the help of a helpful action filter, only the macro-operations that are beneficial to the planning process can be selected into the enhance domain.…”
Section: Related Workmentioning
confidence: 99%
“…The other method is to extract effective macro-operations through learning methods based on existing planning solutions. Dulac et al [18] used the N-grams analysis method to extract macro-operations from existing planning solutions to improve planning efficiency. With the help of a helpful action filter, only the macro-operations that are beneficial to the planning process can be selected into the enhance domain.…”
Section: Related Workmentioning
confidence: 99%
“…Alhossaini and Beck (2013) selects problem-specific macros from a given pool of macros (hand-coded or generated by another technique). Dulac et al (2013) exploits n-gram algorithm to analyze training plans to learn macros. DBMP/S (Hofmann, Niemueller, and Lakemeyer 2017) applies Map Reduce for learning macros from a larger set of training plans.…”
Section: Related Workmentioning
confidence: 99%
“…Although Wizard achieved promising results, it is outperformed by recent techniques (Chrpa et al, 2014). Dulac et al (2013) propose techniques to estimate the length of the macro-operators, and offline techniques to select from a library of possibilities the macro-actions to be used online for a specific planning problem.…”
Section: Related Workmentioning
confidence: 99%