Filters








17,494 Hits in 7.4 sec

Incorporating Domain-Independent Planning Heuristics in Hierarchical Planning

Vikas Shivashankar, Ron Alford, David Aha
2017 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
Heuristics serve as a powerful tool in modern domain-independent planning (DIP) systems by providing critical guidance during the search for high-quality solutions.  ...  We demonstrate the feasibility of this approach by using the LMCut heuristic to guide an optimal HGN planner.  ...  This work is sponsored in part by OSD ASD (R&E). The information in this paper does not necessarily reflect the position or policy of the sponsors, and no official endorsement should be inferred.  ... 
doi:10.1609/aaai.v31i1.11034 fatcat:qphastyoerg23hfjpductetepi

An Admissible HTN Planning Heuristic

Pascal Bercher, Gregor Behnke, Daniel Höller, Susanne Biundo
2017 Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence  
Hierarchical task network (HTN) planning is well-known for being an efficient planning approach. This is mainly due to the success of the HTN planning system SHOP2.  ...  At the time being, there are only very few domain-independent heuristics, which are designed for differing hierarchical planning formalisms.  ...  This work was done within the Transregional Collaborative Research Centre SFB/TRR 62 "Companion-Technology for Cognitive Technical Systems" funded by the German Research Foundation (DFG).  ... 
doi:10.24963/ijcai.2017/68 dblp:conf/ijcai/BercherBHB17 fatcat:hnzgdtwwbnbellzhzmfaj5hzai

HTN Planning as Heuristic Progression Search

Daniel Höller, Pascal Bercher, Gregor Behnke, Susanne Biundo
2020 The Journal of Artificial Intelligence Research  
So far, all HTN planners that guide the search by using heuristic functions are based on plan space search.  ...  The majority of search-based HTN planning systems can be divided into those searching a space of partial plans (a plan space) and those performing progression search, i.e., that build the solution in a  ...  Acknowledgements The authors want to thank the anonymous reviewers of ICAPS 2018, IJCAI 2019, and JAIR for their valuable suggestions that helped to improve our work.  ... 
doi:10.1613/jair.1.11282 fatcat:5pw3r3ciwjhqtefm6lo4huyrd4

Hybrid algorithms for independent batch scheduling in grids

Fatos Xhafa, Joanna Kolodziej, Leonard Barolli, Vladi Kolici, Rozeta Miho, Makoto Takizawa
2012 International Journal of Web and Grid Services  
Given the hardness of the problem, heuristics are used to find high quality solutions for practical purposes of designing efficient Grid schedulers.  ...  Computing efficiently a planning of incoming jobs to available machines in the Grid system is a main requirement for optimized system performance.  ...  of the original heuristic method by using procedures of other heuristic methods.  ... 
doi:10.1504/ijwgs.2012.048402 fatcat:2qwbxg6hvnedpaqeyrih72i23i

Improving Hierarchical Planning Performance by the Use of Landmarks

Mohamed Elkawkagy, Pascal Bercher, Bernd Schattenberg, Susanne Biundo
2021 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
In hierarchical planning, landmarks are tasks that occur on any search path leading from the initial plan to a solution.  ...  In this work, we present novel domain-independent planning strategies based on such hierarchical landmarks.  ...  Acknowledgements This work is done within the Transregional Collaborative Research Centre SFB/TRR 62 "Companion-Technology for Cognitive Technical Systems" funded by the German Research Foundation (DFG  ... 
doi:10.1609/aaai.v26i1.8366 fatcat:32af4q3e7bek5pwkpd5qe5uamy

Cost-Optimal Algorithms for Planning with Procedural Control Knowledge [article]

Vikas Shivashankar, Ron Alford, Mark Roberts, David W. Aha
2016 arXiv   pre-print
, and a blind-search version of HOpGDP due to the search guidance provided by h_HL.  ...  We address this gap by extending recent work on a new hierarchical goal-based planning formalism called Hierarchical Goal Network (HGN) Planning to develop the Hierarchically-Optimal Goal Decomposition  ...  We would also like to thank the reviewers at HSDIP 2016 for useful feedback on a preliminary version of this paper.  ... 
arXiv:1607.01729v2 fatcat:yykg2u3ugnd2bgta6nd4r4ochq

Preference-Based Web Service Composition: A Middle Ground between Execution and Search [chapter]

Shirin Sohrabi, Sheila A. McIlraith
2010 Lecture Notes in Computer Science  
Our investigation is performed in the context of the semantic web employing an existing preference-based Hierarchical Task Network WSC system.  ...  Our experiments illustrate the potential improvement in both the quality and speed of composition generation afforded by our approach.  ...  We gratefully acknowledge funding from the Natural Sciences and Engineering Research Council of Canada (NSERC) and the Ontario Ministry of Innovations Early Researcher Award (ERA).  ... 
doi:10.1007/978-3-642-17746-0_45 fatcat:zh2fi53eavch3e354vdvcodc44

A GA(TS) Hybrid Algorithm for Scheduling in Computational Grids [chapter]

Fatos Xhafa, Juan A. Gonzalez, Keshav P. Dahal, Ajith Abraham
2009 Lecture Notes in Computer Science  
The purpose in hybridizing these heuristics is to benefit the exploration of the solution space by a population of individuals with the exploitation of solutions through a smart search of the TS.  ...  We evaluated the proposed hybrid algorithm using different Grid scenarios generated by a Grid simulator.  ...  This suggests that one can use existing algorithms as components for designing new efficient search algorithms and expect improved performance of the newly obtained algorithm for some cost functions.  ... 
doi:10.1007/978-3-642-02319-4_34 fatcat:4dznmcb76jhmhpogqy7evskyyu

Reduce Artificial Intelligence Planning Effort by using Map-Reduce Paradigm

Mohamed Elkawkagy*, Elbeh Heba
2021 VOLUME-8 ISSUE-10, AUGUST 2019, REGULAR ISSUE  
Preprocessing phase helps the planner cut off the hierarchical planning search space for each sub-problem by removing the compulsory literal elements that help the hierarchical planner seek a solution.  ...  To find a solution plan, the hierarchical planner produces a huge search space that may be infinite.  ...  Hence, the task network TE of the plan P init in the planning problem, Π is updated by removing the tasks te i (line 6).  ... 
doi:10.35940/ijitee.g8902.0510721 fatcat:uer4axvqdbc57fcsj4uexa5kq4

Quality Metrics to Evaluate Flexible Timeline-Based Plans

Alessandro Umbrico, Andrea Orlandini, Marta Cialdea Mayer
2015 International Conference of the Italian Association for Artificial Intelligence  
In this regard, it is useful to define quality metrics to evaluate the robustness of flexible timeline-based plans.  ...  Indeed, it can be exploited by an executive system for robust on-line execution of flexible plans in order to absorb possible delays during the execution.  ...  Andrea Orlandini is partially supported by the Italian Ministry for University and Research (MIUR) and CNR under the GECKO Project (Progetto Bandiera "La Fabbrica del Futuro").  ... 
dblp:conf/aiia/UmbricoOM15a fatcat:kgfz4zbgifaexes2riybecsyle

Integrating Acting, Planning and Learning in Hierarchical Operational Models [article]

Sunandita Patra, James Mason, Amit Kumar, Malik Ghallab, Paolo Traverso, Dana Nau
2020 arXiv   pre-print
Our planning procedure, UPOM, does a UCT-like search in the space of operational models in order to find a near-optimal method to use for the task and context at hand.  ...  We present new planning and learning algorithms for RAE, the Refinement Acting Engine. RAE uses hierarchical operational models to perform tasks in dynamically changing environments.  ...  The information in this paper does not necessarily reflect the position or policy of the funders, and no official endorsement should be inferred.  ... 
arXiv:2003.03932v1 fatcat:y537bk7ihvfjhewry3oittxemq

Priority-Based Meta-control within Hierarchical Task Network Planning

David J. Musliner, Robert P. Goldman
2010 2010 Fourth IEEE International Conference on Self-Adaptive and Self-Organizing Systems Workshop  
In this paper we show how unique features of the SHOP2 hierarchical task network planner permit an elegant implementation of this priority queue behavior.  ...  If the operator requests more tasks than can be immediately addressed by the available UAVs, our planning system must choose which goals to try to achieve, and which to postpone for later effort.  ...  Any opinions, findings, conclusions, or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the U.S. Government.  ... 
doi:10.1109/sasow.2010.58 dblp:conf/saso/MuslinerG10 fatcat:bhkpppixevgd3efyqctstalh3i

FAPE: a Constraint-based Planner for Generative and Hierarchical Temporal Planning [article]

Arthur Bit-Monnot, Malik Ghallab, Félix Ingrand, David E. Smith
2020 arXiv   pre-print
A novel reachability analysis technique is proposed and used to develop causal networks to constrain the search space.  ...  It is employed for the design of informed heuristics, inference methods and efficient search strategies.  ...  This is explained by the wealth of search techniques, heuristics, and test domains that have been developed for state-space planning, resulting in significant performance improvements.  ... 
arXiv:2010.13121v1 fatcat:dvixqibzmfd3lju2c2g32ynxjm

Hierarchical Task Planning for Multiarm Robot with Multiconstraint

Yifan Wang, Hanxu Sun, Gang Chen, Qingxuan Jia, Boyang Yu
2016 Mathematical Problems in Engineering  
Then, a complex task can be decomposed into a sequence of primitive tasks by using hierarchical task network (HTN) with those primitive tasks and operators.  ...  In task node planning,A⁎algorithm is improved to adapt the continuous motion of manipulator.  ...  This study was supported by the National Basic Research Program of China [2013CB733000] and the National Natural Science Foundation of China [61403038, 61573058, 61573066].  ... 
doi:10.1155/2016/2508304 fatcat:j5d723xchre3dmbypbrhlfruvq

MACHINE LEARNING IN HYBRID HIERARCHICAL AND PARTIAL-ORDER PLANNERS FOR MANUFACTURING DOMAINS

Susana Fernández, Ricardo Aler, Daniel Borrajo
2005 Applied Artificial Intelligence  
This document describes a work whose aim is to improve the efficiency of solving problems with Hybis by using machine learning techniques.  ...  The application of AI planning techniques to manufacturing systems is being widely deployed for all the tasks involved in the process, from product design to production planning and control.  ...  The authors would also like to thank Luis Castillo and Juan Fernández-Olivares for their help on using Hybis.  ... 
doi:10.1080/08839510490964491 fatcat:g3dpxeg6nfextmsrufuoict3lq
« Previous Showing results 1 — 15 out of 17,494 results