186 resultados para Decision traps
Resumo:
In this paper, an automatic Smart Irrigation Decision Support System, SIDSS, is proposed to manage irrigation in agriculture. Our system estimates the weekly irrigations needs of a plantation, on the basis of both soil measurements and climatic variables gathered by several autonomous nodes deployed in field. This enables a closed loop control scheme to adapt the decision support system to local perturbations and estimation errors. Two machine learning techniques, PLSR and ANFIS, are proposed as reasoning engine of our SIDSS. Our approach is validated on three commercial plantations of citrus trees located in the South-East of Spain. Performance is tested against decisions taken by a human expert.
Resumo:
The purpose of this paper is to explore the current design decision making process of selected foreign international non governmental organisations (INGO’s) operating in the field of housing and post disaster housing design and delivery in developing countries. The study forms part of a wider on-going study relation to a decision making in relation to affordable and sustainable housing in developing
countries. The paper highlights the main challenges and opportunities in relation to the design and delivery of low cost sustainable housing in developing countries as identified in current literature on the subject. Interviews and case studies with INGO’s highlight any specific challenges faced by foreign INGO’s operating in a developing country. The preliminary results of this research study provide a concise insight into the design decision making process of leading foreign INGO’s operating in developing countries and will be beneficial to policy makers, NGOs, government bodies and community organisations in practice as it offers unique evidence based insights into international bodies housing design decision making process.
Resumo:
Markov Decision Processes (MDPs) are extensively used to encode sequences of decisions with probabilistic effects. Markov Decision Processes with Imprecise Probabilities (MDPIPs) encode sequences of decisions whose effects are modeled using sets of probability distributions. In this paper we examine the computation of Γ-maximin policies for MDPIPs using multilinear and integer programming. We discuss the application of our algorithms to “factored” models and to a recent proposal, Markov Decision Processes with Set-valued Transitions (MDPSTs), that unifies the fields of probabilistic and “nondeterministic” planning in artificial intelligence research.
Resumo:
Partially ordered preferences generally lead to choices that do not abide by standard expected utility guidelines; often such preferences are revealed by imprecision in probability values. We investigate five criteria for strategy selection in decision trees with imprecision in probabilities: “extensive” Γ-maximin and Γ-maximax, interval dominance, maximality and E-admissibility. We present algorithms that generate strategies for all these criteria; our main contribution is an algorithm for Eadmissibility that runs over admissible strategies rather than over sets of probability distributions.