Improving hierarchical task network planning performance by the use of domain-independent heuristic search

Cheng, Kai; Liu, Wu; Yu, Xiaohan; Yin, Chengxiang; Kang, Ruizhi

doi:10.1016/j.knosys.2017.11.031

Cited by 12 publications

(4 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Improving hierarchical task network planning performance by the use of domain-independent heuristic search [11] an extended HTN formalism named HTN-e is built so that heuristics from classical planning can be easily adapted to work in the HTN setting. A modified algorithm called OTDh which combines domain independent heuristics is with ordered task decomposition is proposed.…”

Section: Related Workmentioning

confidence: 99%

An Adaptation Technique to Enhance HTN Planning

Ahmad,

Shams El-Din,

El-Sisi

2023

IJCI. International Journal of Computers and Information

View full text Add to dashboard Cite

There are many and varied areas of the realworld domains that require optimal solutions to their problems. This domains in areas as healthcare, production, public transportation, and driver assistance. Its solutions affect the people involved as well as the organizational efficiency and cost of operations. Recently, research in automated planning optimization has gained importance due to the need for complete automation in such various applications. Hierarchical Task Network (HTN) Planning is hard task even in pure search version and looking for optimal solutions can only be hard. In fact, there are few optimal planners and there are a relatively small number of other planners which usually produce good solutions without guaranteeing the optimality. Therefore, the main objective of this paper is to improve the search technique of HTN planning by adapting Ant system algorithm into refinement planning process by means of plan selection strategy. The proposed search strategy AS-HTN fuses the Ant system to improve to overcome optimal plan challenges. The evaluation of our proposed framework showed an outstanding performance against many plan selection strategies.

show abstract

Section: Related Workmentioning

confidence: 99%

An Adaptation Technique to Enhance HTN Planning

Ahmad,

Shams El-Din,

El-Sisi

2023

IJCI. International Journal of Computers and Information

View full text Add to dashboard Cite

show abstract

“…Such additional information takes the form of heuristics, preferences, and advice. There is also a branch of approaches that order HTN methods using a heuristic function that defines the distance between the goal state of the given planning problem and the goal states of methods [81,82,83]. The latter approaches usually aim at improving the planning performance regardless of the resulting plan quality and agent attitudes, and are, therefore, out of scope here.…”

Section: Informed Decision-making In Htn Planningmentioning

confidence: 99%

Risk Awareness in HTN Planning

Alnazer¹,

Georgievski²,

Aiello³

2022

Preprint

View full text Add to dashboard Cite

Actual real-world domains are characterised by uncertain situations in which acting and use of resources require embracing risk. Performing actions in such domains always entails costs of consuming some resource, such as time, money, or energy, where the knowledge about these costs can range from totally known to totally unknown and even unknowable probabilities of costs. Think of robotic and marine domains, where actions and their costs are nondeterministic due to the uncertainty of factors, such as obstacles and weather conditions. Choosing which action to perform considering its cost on the available resource requires taking a stance on risk. Thus, these domains call for not only planning under uncertainty but also planning while embracing risk. Taking Hierarchical Task Network (HTN) planning as a widely used planning technique in real-world applications, one can observe that existing approaches do not account for risk. That is, computing most probable or optimal plans using actions with single-valued costs is only enough to express risk neutrality. In this work, we postulate that HTN planning can become risk aware by considering expected utility theory, a representative concept of decision theory that enables choosing actions considering a probability distribution of their costs and a given risk attitude expressed using a utility function. In particular, we introduce a general framework for HTN planning that allows modelling risk and uncertainty using a probability distribution of action costs upon which we define risk-aware HTN planning as an approach that accounts for the different risk attitudes and allows computing plans that * Corresponding author.

show abstract

“…where K(v i ) is the node v i criticality before quantization; K(v i ) is the node v i criticality before quantization; K(M) is the node matching criticality of the S and B networks; v i is the node criticality before quantization [38]; v i is the node criticality before node quantization;…”

Section: Mathematical Model Of Node Matching and Evolutionary Solutionsmentioning

confidence: 99%

Research on Task-Service Network Node Matching Method Based on Multi-Objective Optimization Model in Dynamic Hyper-Network Environment

Zhang

et al. 2021

Micromachines

View full text Add to dashboard Cite

In order to reduce the cost of manufacturing and service for the Cloud 3D printing (C3DP) manufacturing grid, to solve the problem of resources optimization deployment for no-need preference under circumstance of cloud manufacturing, consider the interests of enterprises which need Cloud 3D printing resources and cloud platform operators, together with QoS and flexibility of both sides in the process of Cloud 3D printing resources configuration service, a task-service network node matching method based on Multi-Objective optimization model in dynamic hyper-network environment is built for resource allocation. This model represents interests of the above-mentioned two parties. In addition, the model examples are solved by modifying Mathematical algorithm of Node Matching and Evolutionary Solutions. Results prove that the model and the algorithm are feasible, effective and stable.

show abstract

Improving hierarchical task network planning performance by the use of domain-independent heuristic search

Cited by 12 publications

References 8 publications

An Adaptation Technique to Enhance HTN Planning

An Adaptation Technique to Enhance HTN Planning

Risk Awareness in HTN Planning

Research on Task-Service Network Node Matching Method Based on Multi-Objective Optimization Model in Dynamic Hyper-Network Environment

Contact Info

Product

Resources

About