Finding and Exploiting LTL Trajectory Constraints in Heuristic Search

Simon, Salomé and Röger, Gabriele. (2015) Finding and Exploiting LTL Trajectory Constraints in Heuristic Search. In: Proceedings of the 8th Annual Symposium on Combinatorial Search (SoCS 2015). pp. 113-121.

[img] PDF - Published Version

Official URL: http://edoc.unibas.ch/43155/

Downloads: Statistics Overview


We suggest the use of linear temporal logic (LTL) for expressing declarative information about optimal solutions of search problems. We describe a general framework that associates LTLf formulas with search nodes in a heuristic search algorithm. Compared to previous approaches that integrate specific kinds of path information like landmarks into heuristic search, the approach is general, easy to prove correct and easy to integrate with other kinds of path information.
Faculties and Departments:05 Faculty of Science > Departement Mathematik und Informatik > Informatik > Artificial Intelligence (Helmert)
UniBasel Contributors:Röger, Gabriele and Eriksson, Salomé
Item Type:Conference or Workshop Item, refereed
Conference or workshop item Subtype:Conference Paper
Publisher:AAAI Press
Note:Publication type according to Uni Basel Research Database: Conference paper
Related URLs:
edoc DOI:
Last Modified:05 Apr 2017 13:52
Deposited On:05 Apr 2017 13:50

Repository Staff Only: item control page