Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Marie de Roquemaurel"'
Autor:
Alexandre Albore, Silvano Dal Zilio, Marie de Roquemaurel, Christel Seguin, Pierre Virelizier
Publikováno v:
9th European Congress on Embedded Real Time Software and Systems (ERTS 2018)
9th European Congress on Embedded Real Time Software and Systems (ERTS 2018), Jan 2018, Toulouse, France. 10p
9th European Congress on Embedded Real Time Software and Systems (ERTS 2018), Jan 2018, Toulouse, France. 10p., 2018, 〈http://www.erts2018.org/〉
HAL
9th European Congress on Embedded Real Time Software and Systems (ERTS 2018), Jan 2018, Toulouse, France. 10p
9th European Congress on Embedded Real Time Software and Systems (ERTS 2018), Jan 2018, Toulouse, France. 10p., 2018, 〈http://www.erts2018.org/〉
HAL
International audience; Regular Paper Abstract 1 In a previous work, we proposed an extension of the AltaRica language and tools to deal with the modelling and analysis of failures propagation in presence of timed and temporal constraints. This need
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::139dd2b934813e1aca2efd1b94f01ebf
https://hal.archives-ouvertes.fr/hal-01709008/document
https://hal.archives-ouvertes.fr/hal-01709008/document
Publikováno v:
AI Communications. 24:1-29
For planning to come of age, plans must be judged by a measure of quality, such as the total cost of actions. This paper describes an optimal-cost planner which guarantees global optimality whenever the planning problem has a solution. We code the ex
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5b5a048f62e7adbdf7158bf7fde348fa
https://doi.org/10.3233/aic-2010-0473
https://doi.org/10.3233/aic-2010-0473
Publikováno v:
Journal of Experimental & Theoretical Artificial Intelligence. 23:181-199
Cost-optimal planning, in which the aim is to minimise the sum of costs of actions, is a challenging problem due to its computational complexity. A linear program derived from a relaxation which ignores the constraints on the ordering of actions can
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c89fbd2c06b760681e5703273b59e011
https://doi.org/10.1080/0952813x.2010.490961
https://doi.org/10.1080/0952813x.2010.490961
Publikováno v:
Revue d'intelligence artificielle. 24:465-484
Cost-optimal planning, in which the aim is to minimize the sum of costs of actions, is a challenging problem due to its computational complexity. A linear program derived from a relaxation which ignores the constraints on the ordering of actions can
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ab1fa9201b8f42144daac04122f7ec54
https://doi.org/10.3166/ria.24.465-484
https://doi.org/10.3166/ria.24.465-484
Publikováno v:
Principles and Practice of Constraint Programming-CP 2006 ISBN: 9783540462675
CP
CP
We show in this article how the Weighted CSP framework can be used to solve an optimisation version of numerical planning. The WCSP finds an optimal plan in the planning graph containing all solution plans of minimum length. Experimental trials were
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fd88daf4131c4dff4669152db1fffe34
https://doi.org/10.1007/11889205_50
https://doi.org/10.1007/11889205_50