Zobrazeno 1 - 10
of 39
pro vyhledávání: '"Patrik Haslum"'
Publikováno v:
Proceedings of the International Conference on Automated Planning and Scheduling. 32:100-109
Planning problems of practical relevance commonly include multiple objectives that are difficult to weight a priori. Several heuristic search algorithms computing the Pareto front of non-dominated solutions have been proposed to handle these multi-ob
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4c1b87794481a207f95cf7c72a7eea98
https://doi.org/10.1609/icaps.v32i1.19790
https://doi.org/10.1609/icaps.v32i1.19790
Publikováno v:
Proceedings of the International Conference on Automated Planning and Scheduling. 29:232-236
Planning with global state constraints is an extension of classical planning in which some properties of each state are derived via a set of equations, rules or constraints. This extension enables more elegant modelling of networked physical systems
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::730b44c434f287e6d2549d3126d0054e
https://doi.org/10.1609/icaps.v29i1.3481
https://doi.org/10.1609/icaps.v29i1.3481
Publikováno v:
KR
Detecting, characterizing and adapting to novelty, whether in the form of previously unseen objects or phenomena, or unexpected changes in the behavior of known elements, is essential for Artificial Intelligence agents to operate reliably in unconstr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::09d31459acf70b3e23ee5afd1c20cdfa
https://doi.org/10.24963/kr.2021/43
https://doi.org/10.24963/kr.2021/43
Publikováno v:
Synthesis Lectures on Artificial Intelligence and Machine Learning. 13:1-187
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::255372b542eda9ddcdf5ce2035133b96
https://doi.org/10.2200/s00900ed2v01y201902aim042
https://doi.org/10.2200/s00900ed2v01y201902aim042
This paper studies novel subgoaling relaxations for automated planning with propositional and numeric state variables. Subgoaling relaxations address one source of complexity of the planning problem: the requirement to satisfy conditions simultaneous
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8d58fe05d5a335085cc3a8b35ce41530
http://hdl.handle.net/11379/534095
http://hdl.handle.net/11379/534095
Autor:
Dana S. Nau, Patrik Haslum, Franc Ivankovic, Sylvie Thiébaux, Daniel Gordon, Miquel Ramirez, Vikas Shivashankar
Publikováno v:
Journal of Artificial Intelligence Research. 62:373-431
We present a principled way of extending a classical AI planning formalism with systems of state constraints, which relate - sometimes determine - the values of variables in each state traversed by the plan. This extension occupies an attractive midd
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7d39d588bde625d07955ba2354ad4a64
https://doi.org/10.1613/jair.1.11213
https://doi.org/10.1613/jair.1.11213
Publikováno v:
Journal of Artificial Intelligence Research. 60:425-490
Over-subscription, that is, being assigned too many things to do, is commonly encountered in temporal scheduling problems. As human beings, we often want to do more than we can actually do, and underestimate how long it takes to perform each task. De
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a182b6b9c555c3b28409d75d0bdc56e2
https://doi.org/10.1613/jair.5431
https://doi.org/10.1613/jair.5431
Publikováno v:
Proceedings of the International Conference on Automated Planning and Scheduling. 27:306-315
For the past 25 years, heuristic search has been used to solve domain-independent probabilistic planning problems, but with heuristics that determinise the problem and ignore precious probabilistic information. To remedy this situation, we explore th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4a083f3a9acbdecb57ee82538b8dcf1e
https://doi.org/10.1609/icaps.v27i1.13840
https://doi.org/10.1609/icaps.v27i1.13840
Publikováno v:
An Introduction to the Planning Domain Definition Language ISBN: 9783031004568
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6d589c08c2398df7d8655b7367a0beef
https://doi.org/10.1007/978-3-031-01584-7_3
https://doi.org/10.1007/978-3-031-01584-7_3
Publikováno v:
An Introduction to the Planning Domain Definition Language ISBN: 9783031004568
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4f8e035b0edf78d3a8598fc0be34718d
https://doi.org/10.1007/978-3-031-01584-7_1
https://doi.org/10.1007/978-3-031-01584-7_1