ABSTRACT
There are many situations where an agent can perform one of several sets of actions in responses to changes in its environment, and the agent chooses to perform the set of actions that optimizes some objective function. In past work, Eiter et. al. have proposed a rule based framework for programming agents on top of heterogeneous data sources, but they provide no solutions to the above problem. In this paper, we propose a semantics called optimal feasible status set semantics for agents which allows the agent to associate an objective function with feasible status sets and act according to the feasible status set that optimizes this objective function. We provide both an algorithm to compute exact optimal feasible status sets as well as the TierOpt and FastOpt algorithms to find (suboptimal) feasible status set much faster. We report on experiments on a suite of real agent applications showing that the heuristic algorithms works well in practice.
- J. Dix and M. Müller. Implementing Semantics of Disjunctive Logic Programs Using Fringes and Abstract Properties, Proc. LPNMR '93, (eds. L.-M. Pereira and A. Nerode), pp 43--59, 1993. Google ScholarDigital Library
- T. Eiter, G. Gottlob, J. Lu and V. S. Subrahmanian. Computing Non-Ground Representations of Stable Models, Proc. 1997 Intl. Conf. on Logic Programming and Non-Monotonic Reasoning, MIT Press, Lexington, KY, 1997. Google ScholarDigital Library
- Thomas Eiter, V. S. Subrahmanian, and George Pick. Heterogeneous Active Agents, I: Semantics. Artifical Intelligence, 108(1--2):179--255, 1999. Google ScholarDigital Library
- M. Gabbrielli, G. Levi. Modeling Answer Constraints in Constraint Logic Programs, Proc. ICLP, 1991, pp.238--251.Google Scholar
- V.S. Subrahmanian, P. Bonatti, J. Dix, T. Eiter, F. Ozcan and R. Ross. Heterogeneous Agent Systems, MIT Press. Google ScholarDigital Library
- D. Turi. Extending S-Models to Logic Programs with Negation, Proc. Eight Intl. Conf. on Logic Programming (ed. K. Furukawa), pp 397--411, 1991.Google Scholar
Index Terms
- Optimal status sets of heterogeneous agent programs
Recommendations
Verifying heterogeneous multi-agent programs
AAMAS '14: Proceedings of the 2014 international conference on Autonomous agents and multi-agent systemsWe present a new approach to verifying heterogeneous multi-agent programs --- multi-agent systems in which the agents are implemented in different (BDI-based) agent programming languages. Our approach is based on meta-APL, a BDI-based agent programming ...
Optimal admissible composition of abstraction heuristics
Additive ensembles of admissible heuristics constitute the most general form of exploiting the individual strengths of numerous admissible heuristics in optimal planning. However, the same set of heuristics can be additively composed in infinitely many ...
DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic
In this paper we propose and evaluate an evolutionary-based hyper-heuristic approach, called EH-DVRP, for solving hard instances of the dynamic vehicle routing problem. A hyper-heuristic is a high-level algorithm, which generates or chooses a set of low-...
Comments