首页|Declarative Logic-Based Pareto-Optimal Agent Decision Making

Declarative Logic-Based Pareto-Optimal Agent Decision Making

扫码查看
原文链接
  • NETL
  • NSTL
  • IEEE
There are many applications where an autonomous agent can perform many sets of actions。 It must choose one set of actions based on some behavioral constraints on the agent。 Past work has used deontic logic to declaratively express such constraints in logic， and developed the concept of a feasible status set (FSS)， a set of actions that satisfy these constraints。 However， multiple FSSs may exist and an agent needs to choose one in order to act。 As there may be many different objective functions to evaluate status sets， we propose the novel concept of Pareto-optimal FSSs or POSS。 We show that checking if a status set is a POSS is co-NP-hard。 We develop an algorithm to find a POSS and in special cases when the objective functions are monotonic (or anti-monotonic)， we further develop more efficient algorithms。 Finally， we conduct experiments to show the efficacy of our approach and we discuss possible ways to handle multiple Pareto-optimal Status Sets。

Linear programmingAutomobilesOptimizationCoolantsUncertaintySafetyAutonomous agentsIntelligent agentsPareto optimization

Tonmoay Deb、Mingi Jeong、Cristian Molinaro、Andrea Pugliese、Alberto Quattrini Li、Eugene Santos、V. S. Subrahmanian、Youzhi Zhang

展开 >

Department of Computer Science, Northwestern University, Evanston, IL, USA

Department of Computer Science, Dartmouth College, Hanover, NH, USA

DIMES, University of Calabria, Arcavacata, Italy

Thayer School of Engineering, Dartmouth College, Hanover, NH, USA

Centre for Artificial Intelligence and Robotics and Hong Kong Institute of Science and Innovation, Chinese Academy of Science, Hong Kong, China

展开 >

2024

10.1109/TCYB.2024.3394316

IEEE transactions on cybernetics

IEEE transactions on cybernetics

SCI
ISSN：
年,卷(期)：2024.54(12)
  • 92