What to Do When You Can’t Do It All: Temporal Logic Planning with Soft Temporal Logic Constraints
Hazhar Rahmani,Jason M. O’Kane,Hazhar Rahmani,Jason M. O’Kane
In this paper, we consider a temporal logic planning problem in which the objective is to find an infinite trajectory that satisfies an optimal selection from a set of soft specifications expressed in linear temporal logic (LTL) while nevertheless satisfying a hard specification expressed in LTL. Our previous work considered a similar problem in which linear dynamic logic for finite traces (LDLf),...
