Refine
Year of publication
- 2024 (3)
- 2023 (18)
- 2022 (12)
- 2021 (24)
- 2020 (20)
- 2019 (30)
- 2018 (35)
- 2017 (25)
- 2016 (26)
- 2015 (28)
- 2014 (24)
- 2013 (27)
- 2012 (17)
- 2011 (29)
- 2010 (24)
- 2009 (25)
- 2008 (26)
- 2007 (28)
- 2006 (17)
- 2005 (15)
- 2004 (19)
- 2003 (12)
- 2002 (20)
- 2001 (20)
- 2000 (19)
- 1999 (23)
- 1998 (16)
- 1997 (13)
- 1996 (10)
- 1995 (11)
- 1994 (15)
- 1993 (9)
- 1992 (8)
- 1991 (4)
- 1990 (6)
- 1989 (5)
- 1988 (5)
- 1987 (2)
- 1986 (1)
- 1985 (6)
- 1984 (1)
- 1982 (2)
- 1981 (1)
- 1980 (4)
- 1979 (2)
- 1978 (3)
- 1976 (1)
- 1975 (1)
- 1974 (1)
Document Type
- Article (401)
- Conference Proceeding (230)
- Part of a Book (35)
- Book (23)
- Patent (2)
- Doctoral Thesis (1)
- Poster (1)
Language
- English (693) (remove)
Keywords
- Enterprise Architecture (5)
- MINLP (5)
- Engineering optimization (4)
- Optimization (3)
- Powertrain (3)
- Technical Operations Research (3)
- Telecommunication (3)
- Competence Developing Games (2)
- Energy efficiency (2)
- Experimental validation (2)
- Gamification (2)
- Hot S-parameter (2)
- Machine Learning (2)
- Optimal Topology (2)
- Process engineering (2)
- Pump System (2)
- Robotic Process Automation (2)
- Serious Game (2)
- Ventilation System (2)
- Water (2)
Institute
- Fachbereich Elektrotechnik und Informationstechnik (693) (remove)
Phase Repeatable Synthesizers as a New Harmonic Phase Standard for Nonlinear Network Analysis
(2018)
In this paper we present an extension of the action language Golog that allows for using fuzzy notions in non-deterministic argument choices and the reward function in decision-theoretic planning. Often, in decision-theoretic planning, it is cumbersome to specify the set of values to pick from in the non-deterministic-choice-of-argument statement. Also, even for domain experts, it is not always easy to specify a reward function. Instead of providing a finite domain for values in the non-deterministic-choice-of-argument statement in Golog, we now allow for stating the argument domain by simply providing a formula over linguistic terms and fuzzy uents. In Golog’s forward-search DT planning algorithm, these formulas are evaluated in order to find the agent’s optimal policy. We illustrate this in the Diner Domain where the agent needs to calculate the optimal serving order.