Article
Refine
Year of publication
- 2016 (116) (remove)
Document Type
- Article (116) (remove)
Keywords
- Additive Manufacturing (1)
- Annulus Fibrosus (1)
- Asymptotic efficiency (1)
- Bacillus atrophaeus (1)
- Balance (1)
- Balanced hypergraph (1)
- Brandfall (1)
- Cardiac myocytes (1)
- Cardiac tissue (1)
- CellDrum (1)
- Censored data (1)
- Co-managed care (1)
- Computational biomechanics (1)
- DNA biosensor (1)
- Designpraxis (1)
- Disc Degeneration (1)
- Drug simulation (1)
- Duality (1)
- EN 1993-1-2 (1)
- Einbetten in das Internet der Dinge (1)
Institute
- Fachbereich Medizintechnik und Technomathematik (32)
- Fachbereich Chemie und Biotechnologie (19)
- IfB - Institut für Bioengineering (18)
- Fachbereich Wirtschaftswissenschaften (17)
- Fachbereich Elektrotechnik und Informationstechnik (14)
- INB - Institut für Nano- und Biotechnologien (12)
- Fachbereich Luft- und Raumfahrttechnik (11)
- Fachbereich Maschinenbau und Mechatronik (10)
- Fachbereich Bauingenieurwesen (8)
- MASKOR Institut für Mobile Autonome Systeme und Kognitive Robotik (6)
- Fachbereich Energietechnik (5)
- Institut fuer Angewandte Polymerchemie (5)
- ZHQ - Bereich Hochschuldidaktik und Evaluation (2)
- ECSM European Center for Sustainable Mobility (1)
- Fachbereich Gestaltung (1)
- IBB - Institut für Baustoffe und Baukonstruktionen (1)
- Nowum-Energy (1)
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.